Skip to main content

Statistics & ML

Bibliographic References tagged with Statistics & ML

Not finding what you're looking for? Try using Advanced Search.
Not finding what you're looking for? Try using Advanced Search.
Casacuberta, Sílvia, Cynthia Dwork, and Salil Vadhan. “Complexity-Theoretic Implications of Multicalibration”, 2023.
Casacuberta, Sílvia, Cynthia Dwork, and Salil Vadhan. “Complexity-Theoretic Implications of Multicalibration”, 2023.
Olagoke, Lukman, Salil Vadhan, and Seth Neel. “Black-Box Training Data Identification in GANs via Detector Networks.” October (2023).
Olagoke, Lukman, Salil Vadhan, and Seth Neel. “Black-Box Training Data Identification in GANs via Detector Networks.” October (2023).
Vadhan, Salil. “The Complexity of Differential Privacy”. In Tutorials on the Foundations of Cryptography, 347-450. Springer, Yehuda Lindell, ed., 2017.
Vadhan, Salil. “The Complexity of Differential Privacy”. In Tutorials on the Foundations of Cryptography, 347-450. Springer, Yehuda Lindell, ed., 2017.
Ron, Dana, Amir Rosenfeld, and Salil Vadhan. “The Hardness of the Expected Decision Depth Problem”. Information Processing Letters 101, no. 3 (2007): 112-18.
Ron, Dana, Amir Rosenfeld, and Salil Vadhan. “The Hardness of the Expected Decision Depth Problem”. Information Processing Letters 101, no. 3 (2007): 112-18.
Bogdanov, Andrej, Elchanan Mossel, and Salil Vadhan. “The Complexity of Distinguishing Markov Random Fields”. In Proceedings of the 12th International Workshop on Randomization and Computation (RANDOM ‘08), Lecture Notes in Computer Science, 5171:331-42. Springer-Verlag, 2008.
Bogdanov, Andrej, Elchanan Mossel, and Salil Vadhan. “The Complexity of Distinguishing Markov Random Fields”. In Proceedings of the 12th International Workshop on Randomization and Computation (RANDOM ‘08), Lecture Notes in Computer Science, 5171:331-42. Springer-Verlag, 2008.
Trevisan, Luca, Madhur Tulsiani, and Salil Vadhan. “Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution”. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC ‘09), 126-36. IEEE, 2009.
Trevisan, Luca, Madhur Tulsiani, and Salil Vadhan. “Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution”. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC ‘09), 126-36. IEEE, 2009.
Dwork, Cynthia, Guy Rothblum, and Salil Vadhan. “Boosting and Differential Privacy”. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘10), 51-60. IEEE, 2010.
Dwork, Cynthia, Guy Rothblum, and Salil Vadhan. “Boosting and Differential Privacy”. In Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘10), 51-60. IEEE, 2010.
Thaler, Justin, Jonathan Ullman, and Salil Vadhan. “Faster Algorithms for Privately Releasing Marginals”. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, and Roger Wattenhofer, Editors, Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP ‘12), Lecture Notes on Computer Science, 7391:810-21. Springer-Verlag, 2012.
Thaler, Justin, Jonathan Ullman, and Salil Vadhan. “Faster Algorithms for Privately Releasing Marginals”. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, and Roger Wattenhofer, Editors, Proceedings of the 39th International Colloquium on Automata, Languages, and Programming (ICALP ‘12), Lecture Notes on Computer Science, 7391:810-21. Springer-Verlag, 2012.
Bun, Mark, Jonathan Ullman, and Salil Vadhan. “Fingerprinting Codes and the Price of Approximate Differential Privacy”. SIAM Journal on Computing, Special Issue on STOC ’14 47, no. 5 (2018): 1888-1938.
Bun, Mark, Jonathan Ullman, and Salil Vadhan. “Fingerprinting Codes and the Price of Approximate Differential Privacy”. SIAM Journal on Computing, Special Issue on STOC ’14 47, no. 5 (2018): 1888-1938.
Bun, Mark, Kobbi Nissim, Uri Stemmer, and Salil Vadhan. “Differentially Private Release and Learning of Threshold Functions”. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘15). IEEE, 2015.
Bun, Mark, Kobbi Nissim, Uri Stemmer, and Salil Vadhan. “Differentially Private Release and Learning of Threshold Functions”. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS ‘15). IEEE, 2015.