var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fccanonne.github.io%2Fcv%2Fpublications-conf.bib&jsonp=1&theme=dividers&hidemenu=true&sort=title&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fccanonne.github.io%2Fcv%2Fpublications-conf.bib&jsonp=1&theme=dividers&hidemenu=true&sort=title\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fccanonne.github.io%2Fcv%2Fpublications-conf.bib&jsonp=1&theme=dividers&hidemenu=true&sort=title\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Learning bounded-degree polytrees with known skeleton.\n \n \n \n\n\n \n Choo, D.; Yang, J. Q.; Bhattacharyya, A.; and Canonne, C. L.\n\n\n \n\n\n\n In 35th International Conference on Algorithmic Learning Theory (ALT), 2024. \n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CYBC:24,\n  author       = {Davin Choo and Joy Qiping Yang and Arnab Bhattacharyya and Cl{\\'{e}}ment L. Canonne},\n  title        = {Learning bounded-degree polytrees with known skeleton},\n  booktitle  = {35th International Conference on Algorithmic Learning Theory (ALT)},\n  year         = {2024},\n  note\t    = {To appear}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine.\n \n \n \n\n\n \n Canonne, C. L.; and Sun, Y.\n\n\n \n\n\n\n In ITCS, volume 287, of LIPIcs, pages 23:1–23:24, 2024. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CS:24,\n  author       = {Cl{\\'{e}}ment L. Canonne and\n                  Yucheng Sun},\n  title        = {Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine},\n  booktitle    = {{ITCS}},\n  series       = {LIPIcs},\n  volume       = {287},\n  pages        = {23:1--23:24},\n  year         = {2024}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Simpler Distribution Testing with Little Memory.\n \n \n \n\n\n \n Canonne, C. L.; and Yang, J. Q.\n\n\n \n\n\n\n In 2024 Symposium on Simplicity in Algorithms (SOSA), 2024. \n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CY:24,\n  author       = {Cl{\\'{e}}ment L. Canonne and\n                  Joy Qiping Yang},\n  title        = {Simpler Distribution Testing with Little Memory},\n  booktitle      = {2024 Symposium on Simplicity in Algorithms (SOSA)},\n  year         = {2024},\n  note\t    = {To appear}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Concentration Bounds for Discrete Distribution Estimation in KL Divergence.\n \n \n \n\n\n \n Canonne, C. L.; Sun, Z.; and Suresh, A. T.\n\n\n \n\n\n\n In IEEE International Symposium on Information Theory, ISIT 2023, pages 2093–2098, 2023. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CSS:23,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Ziteng Sun and\n               Ananda Theertha Suresh},\n  title     = {Concentration Bounds for Discrete Distribution Estimation in {KL} Divergence},\n  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2023},\n  pages        = {2093--2098},\n  publisher    = {{IEEE}},\n  year         = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Near-Optimal Degree Testing for Bayes Nets.\n \n \n \n\n\n \n Arora, V.; Bhattacharyya, A.; Canonne, C. L.; and Yang, J. Q.\n\n\n \n\n\n\n In IEEE International Symposium on Information Theory, ISIT 2023, pages 2093–2098, 2023. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BCQ:23,\n  author    = {Vipul Arora and\n  \t       Arnab Bhattacharyya and\n               Cl{\\'{e}}ment L. Canonne and\n               Joy Qiping Yang},\n  title     = {Near-Optimal Degree Testing for Bayes Nets},\n  booktitle    = {{IEEE} International Symposium on Information Theory, {ISIT} 2023},\n  pages        = {2093--2098},\n  publisher    = {{IEEE}},\n  year         = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Private Distribution Learning with Public Data: The View from Sample Compression.\n \n \n \n\n\n \n Ben-David, S.; Bie, A.; Canonne, C. L.; Kamath, G.; and Singhal, V.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 36 (NeurIPS), 2023. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BBCKS:23,\n  author    = {Shai Ben-David and\n               Alex Bie and \n               Cl{\\'{e}}ment L. Canonne and\n               Gautam Kamath and\n               Vikrant Singhal},\n  title     = {Private Distribution Learning with Public Data: The View from Sample Compression},\n  booktitle = {Advances in Neural Information Processing Systems 36 (NeurIPS)},\n  year      = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination.\n \n \n \n\n\n \n Canonne, C. L.; Hopkins, S. B.; Li, J.; Liu, A.; and Narayanan, S.\n\n\n \n\n\n\n In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pages 36–45, 2023. IEEE\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CHLLN:23,\n  author       = {Cl{\\'{e}}ment L. Canonne and\n                  Samuel B. Hopkins and\n                  Jerry Li and\n                  Allen Liu and\n                  Shyam Narayanan},\n  title        = {The Full Landscape of Robust Mean Testing: Sharp Separations between\n                  Oblivious and Adaptive Contamination},\n  booktitle    = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}},\n  pages        = {36--45},\n  publisher    = {{IEEE}},\n  year      = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Unified lower bounds for interactive high-dimensional estimation under information constraints.\n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Sun, Z.; and Tyagi, H.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 36 (NeurIPS), 2023. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACST:23,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Ziteng Sun and\n               Himanshu Tyagi},\n  title     = {Unified lower bounds for interactive high-dimensional estimation under information constraints},\n  booktitle = {Advances in Neural Information Processing Systems 36 (NeurIPS)},\n  year      = {2023}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Independence Testing for Bounded Degree Bayesian Networks.\n \n \n \n\n\n \n Bhattacharyya, A.; Canonne, C. L.; and Yang, J. Q.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 35 (NeurIPS), 2022. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BCQ:22,\n  author    = {Arnab Bhattacharyya and\n               Cl{\\'{e}}ment L. Canonne and\n               Joy Qiping Yang},\n  title     = {Independence Testing for Bounded Degree Bayesian Networks},\n  booktitle = {Advances in Neural Information Processing Systems 35 (NeurIPS)},\n  year      = {2022}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Nearly-Tight Bounds for Testing Histogram Distributions.\n \n \n \n\n\n \n Canonne, C. L.; Diakonikolas, I.; Kane, D.; and Liu, S.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 35 (NeurIPS), 2022. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CDKL:22,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Ilias Diakonikolas and\n               Daniel Kane and\n               Sihan Liu},\n  title     = {Nearly-Tight Bounds for Testing Histogram Distributions},\n  booktitle = {Advances in Neural Information Processing Systems 35 (NeurIPS)},\n  year      = {2022}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Robust Testing in High-Dimensional Sparse Models.\n \n \n \n\n\n \n George, A. J.; and Canonne, C. L.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 35 (NeurIPS), 2022. \n (Contribution order).\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{GC:22,\n  author    = {Anand Jerry George and\n               Cl{\\'{e}}ment L. Canonne},\n  title     = {Robust Testing in High-Dimensional Sparse Models},\n  booktitle = {Advances in Neural Information Processing Systems 35 (NeurIPS)},\n  year      = {2022},\n  note\t    = {(Contribution order).}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Price of Tolerance in Distribution Testing.\n \n \n \n \n\n\n \n Canonne, C. L.; Jain, A.; Kamath, G.; and Li, J.\n\n\n \n\n\n\n In 35th Conference on Learning Theory (COLT), volume 178, of Proceedings of Machine Learning Research, pages 573–624, 2022. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 143 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CJKL:22,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Ayush Jain and\n               Gautam Kamath and\n               Jerry Li},\n  title     = {The Price of Tolerance in Distribution Testing},\n  booktitle = {35th Conference on Learning Theory (COLT)},\n  series    = {Proceedings of Machine Learning Research},\n  year      = {2022},\n  url       = {https://arxiv.org/abs/2106.13414},\n  volume    = {178},\n  pages     = {573--624},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Role of Interactivity in Structured Estimation.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Sun, Z.; and Tyagi, H.\n\n\n \n\n\n\n In 35th Conference on Learning Theory (COLT), volume 178, of Proceedings of Machine Learning Research, pages 1328–1355, 2022. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACST:22,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Ziteng Sun and\n               Himanshu Tyagi},\n  title     = {The Role of Interactivity in Structured Estimation},\n  booktitle = {35th Conference on Learning Theory (COLT)},\n  series    = {Proceedings of Machine Learning Research},\n  year      = {2022},\n  url       = {https://arxiv.org/abs/2203.06870},\n  volume    = {178},\n  pages     = {1328--1355},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Uniformity Testing in the Shuffle Model: Simpler, Better, Faster.\n \n \n \n \n\n\n \n Canonne, C. L.; and Lyu, H.\n\n\n \n\n\n\n In SIAM Symposium on Simplicity in Algorithms (SOSA), pages 182–202, 2022. SIAM\n \n\n\n\n
\n\n\n\n \n \n \"UniformityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 16 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CL:22,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Hongyi Lyu},\n  title     = {Uniformity Testing in the Shuffle Model: Simpler, Better, Faster},\n  booktitle = {SIAM Symposium on Simplicity in Algorithms (SOSA)},\n  year      = {2022},\n  pages     = {182--202},\n  publisher = {{SIAM}},\n  url\t    = {https://arxiv.org/abs/2108.08987}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Distributed Estimation with Multiple Samples per User: Sharp Rates and Phase Transition.\n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Liu, Y.; Sun, Z.; and Tyagi, H.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 34 (NeurIPS), 2021. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACLST:21b,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Yuhan Liu and\n               Ziteng Sun and\n               Himanshu Tyagi},\n  title     = {Distributed Estimation with Multiple Samples per User: Sharp Rates and Phase Transition},\n  booktitle = {Advances in Neural Information Processing Systems 34 (NeurIPS)},\n  year      = {2021}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Identity testing under label mismatch.\n \n \n \n \n\n\n \n Canonne, C. L.; and Wimmer, K.\n\n\n \n\n\n\n In International Symposium on Algorithms and Computation (ISAAC), 2021. \n \n\n\n\n
\n\n\n\n \n \n \"IdentityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CW:21,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Karl Wimmer},\n  title     = {Identity testing under label mismatch},\n  booktitle = {International Symposium on Algorithms and Computation (ISAAC)},\n  year      = {2021},\n  url       = {https://arxiv.org/abs/2105.01856}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Information-constrained optimization: can adaptive processing of gradients help?.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Mayekar, P.; and Tyagi, H.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 34 (NeurIPS), 2021. \n \n\n\n\n
\n\n\n\n \n \n \"Information-constrainedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACMT:21,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Prathamesh Mayekar and\n               Himanshu Tyagi},\n  title     = {Information-constrained optimization: can adaptive processing of gradients help?},\n  booktitle = {Advances in Neural Information Processing Systems 34 (NeurIPS)},\n  year      = {2021},\n  url       = {https://arxiv.org/abs/2104.00979}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Interactive Inference under Information Constraints.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Liu, Y.; Sun, Z.; and Tyagi, H.\n\n\n \n\n\n\n In IEEE International Symposium on Information Theory (ISIT), 2021. \n \n\n\n\n
\n\n\n\n \n \n \"InteractivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 18 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACLST:21,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Yuhan Liu and\n               Ziteng Sun and\n               Himanshu Tyagi},\n  title     = {Interactive Inference under Information Constraints},\n  booktitle = {{IEEE} International Symposium on Information Theory (ISIT)},\n   year     = {2021},\n   url = {https://arxiv.org/abs/2007.10976}\n   \n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Optimal Rates for Nonparametric Density Estimation under Communication Constraints.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Singh, A. V.; and Tyagi, H.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 34 (NeurIPS), 2021. \n \n\n\n\n
\n\n\n\n \n \n \"OptimalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 104 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACST:21b,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Aditya Vikram Singh and\n               Himanshu Tyagi},\n  title     = {Optimal Rates for Nonparametric Density Estimation under Communication Constraints},\n  booktitle = {Advances in Neural Information Processing Systems 34 (NeurIPS)},\n  year      = {2021},\n  url       = {https://arxiv.org/abs/2107.10078}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning.\n \n \n \n \n\n\n \n Canonne, C. L.; Chen, X.; Kamath, G.; Levi, A.; and Waingarten, E.\n\n\n \n\n\n\n In ACM–SIAM Symposium on Discrete Algorithms (SODA), 2021. \n \n\n\n\n
\n\n\n\n \n \n \"RandomPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 141 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CKLWX:19,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n  \t     Xi Chen and\n               Gautam Kamath and\n               Amit Levi and\n               Erik Waingarten},\n  title     = {Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning},\n  booktitle = {ACM--SIAM Symposium on Discrete Algorithms (SODA)},\n  year      = {2021},\n  url       = {https://arxiv.org/abs/1911.07357}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Distributed Signal Detection under Communication Constraints.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Tyagi, H.\n\n\n \n\n\n\n In 33rd Conference on Learning Theory (COLT), volume 125, of Proceedings of Machine Learning Research, pages 41–63, 2020. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"DistributedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 21 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACT:20,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Himanshu Tyagi},\n  title     = {Distributed Signal Detection under Communication Constraints},\n  booktitle = {33rd Conference on Learning Theory (COLT)},\n  series    = {Proceedings of Machine Learning Research},\n  volume    = {125},\n  pages     = {41--63},\n  publisher = {{PMLR}},\n  year      = {2020},\n  url       = {http://proceedings.mlr.press/v125/acharya20b.html}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Han, Y.; Sun, Z.; and Tyagi, H.\n\n\n \n\n\n\n In 33rd Conference on Learning Theory (COLT), volume 125, of Proceedings of Machine Learning Research, pages 3–40, 2020. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"DomainPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 62 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACHST:19,\n  author    = {Jayadev Acharya and\n               Cl{\\'{e}}ment L. Canonne and\n               Yanjun Han and\n               Ziteng Sun and\n               Himanshu Tyagi},\n  title     = {Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit},\n  booktitle = {33rd Conference on Learning Theory (COLT)},\n  series    = {Proceedings of Machine Learning Research},\n  volume    = {125},\n  pages     = {3--40},\n  publisher = {{PMLR}},\n  year      = {2020},\n  url       = {https://arxiv.org/abs/1907.08743}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learning from satisfying assignments under continuous distributions.\n \n \n \n \n\n\n \n Canonne, C. L.; De, A.; and Servedio, R. A.\n\n\n \n\n\n\n In ACM–SIAM Symposium on Discrete Algorithms (SODA), pages 82–101, 2020. SIAM\n \n\n\n\n
\n\n\n\n \n \n \"LearningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CDS:20,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Anindya De and\n               Rocco A. Servedio},\n  title     = {Learning from satisfying assignments under continuous distributions},\n  booktitle = {ACM--SIAM Symposium on Discrete Algorithms (SODA)},\n  pages     = {82--101},\n  publisher = {{SIAM}},\n  year      = {2020},\n  url       = {https://arxiv.org/abs/1907.01619}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Private Identity Testing for High-Dimensional Distributions.\n \n \n \n \n\n\n \n Canonne, C. L.; Kamath, G.; McMillan, A.; Ullman, J.; and Zakynthinou, L.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 33 (NeurIPS), 2020. \n Spotlight Presentation\n\n\n\n
\n\n\n\n \n \n \"PrivatePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 96 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CKMUZ:19,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Gautam Kamath and\n               Audra McMillan and\n               Jonathan Ullman and\n               Lydia Zakynthinou},\n  title     = {Private Identity Testing for High-Dimensional Distributions},\n  booktitle = {Advances in Neural Information Processing Systems 33 (NeurIPS)},\n  year      = {2020},\n  note      = {Spotlight Presentation},\n  url       = {https://arxiv.org/abs/1905.11947}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing Data Binnings.\n \n \n \n \n\n\n \n Canonne, C. L.; and Wimmer, K.\n\n\n \n\n\n\n In APPROX/RANDOM, volume 176, of LIPIcs, pages 24:1–24:13, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CW:20,\n  author    = {Cl{\\'{e}}ment L. Canonne and Karl Wimmer},\n  title     = {Testing Data Binnings},\n  booktitle = {{APPROX/RANDOM}},\n  series    = {LIPIcs},\n  volume    = {176},\n  pages     = {24:1--24:13},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year      = {2020},\n  url       = {https://drops.dagstuhl.de/opus/volltexte/2020/12627/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Discrete Gaussian for Differential Privacy.\n \n \n \n \n\n\n \n Canonne, C. L.; Kamath, G.; and Steinke, T.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 33 (NeurIPS), 2020. \n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 103 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{C0S:20,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Gautam Kamath and\n               Thomas Steinke},\n  title     = {The Discrete Gaussian for Differential Privacy},\n  booktitle = {Advances in Neural Information Processing Systems 33 (NeurIPS)},\n  year      = {2020},\n  url       = {https://arxiv.org/abs/2004.00010}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Communication-Constrained Inference and the Role of Shared Randomness.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Tyagi, H.\n\n\n \n\n\n\n In 36th International Conference on Machine Learning (ICML), volume 97, of Proceedings of Machine Learning Research, pages 30–39, 2019. PMLR\n Long oral\n\n\n\n
\n\n\n\n \n \n \"Communication-ConstrainedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 65 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACT:19:UB,\n  title       = \t {Communication-Constrained Inference and the Role of Shared Randomness},\n  author      = \t {Acharya, Jayadev and Canonne, Cl{\\'{e}}ment L. and Tyagi, Himanshu},\n  booktitle   = \t {36th International Conference on Machine Learning (ICML)},\n  pages       = \t {30--39},\n  year        = \t {2019},\n  volume      = \t {97},\n  series      = \t {Proceedings of Machine Learning Research},\n  publisher   = \t {PMLR},\n  note        = {Long oral},\n  url       = {http://proceedings.mlr.press/v97/acharya19a.html}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Finding monotone patterns in sublinear time.\n \n \n \n \n\n\n \n Ben-Eliezer, O.; Canonne, C. L.; Letzter, S.; and Waingarten, E.\n\n\n \n\n\n\n In 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 1469–1494, 2019. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"FindingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 17 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BCLW:19,\n  title = \t {Finding monotone patterns in sublinear time},\n  author = \t {Ben-Eliezer, Omri and Canonne, Cl{\\'{e}}ment L. and Letzter, Shoham and Waingarten, Erik},\n  booktitle = \t {60th Annual Symposium on Foundations of Computer Science (FOCS)},\n  pages     = {1469--1494},\n  publisher = {{IEEE} Computer Society},\n  year      = {2019},\n  url       = {https://arxiv.org/abs/1910.01749}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Inference under Information Constraints: Lower Bounds from Chi-Square Contraction.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Tyagi, H.\n\n\n \n\n\n\n In 32nd Conference on Learning Theory (COLT), volume 99, of Proceedings of Machine Learning Research, pages 3–17, 2019. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"InferencePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACT:19:LB,\n  title = \t {Inference under Information Constraints: Lower Bounds from Chi-Square Contraction},\n  author = \t {Acharya, Jayadev and Canonne, Cl{\\'{e}}ment L. and Tyagi, Himanshu},\n  booktitle = \t {32nd Conference on Learning Theory (COLT)},\n  pages = \t {3--17},\n  year = \t {2019},\n  volume = \t {99},\n  series = \t {Proceedings of Machine Learning Research},\n  publisher = \t {PMLR},\n  url       = {http://proceedings.mlr.press/v99/acharya19a.html}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Test without Trust: Optimal Locally Private Distribution Testing.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; Freitag, C.; and Tyagi, H.\n\n\n \n\n\n\n In The 22nd International Conference on Artificial Intelligence and Statistics (AISTATS), volume 89, of Proceedings of Machine Learning Research, pages 2067–2076, 2019. PMLR\n \n\n\n\n
\n\n\n\n \n \n \"TestPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACFT:19,\n  author    = {Acharya, Jayadev and\n               Canonne, Cl{\\'{e}}ment L. and\n               Freitag, Cody and\n               Tyagi, Himanshu},\n  title     = {Test without Trust: Optimal Locally Private Distribution Testing},\n  booktitle = {The 22nd International Conference on Artificial Intelligence and Statistics (AISTATS)},\n  year = 2019,\n  series    = {Proceedings of Machine Learning Research},\n  volume    = {89},\n  pages     = {2067--2076},\n  publisher = {{PMLR}},\n  url       = {https://arxiv.org/abs/1808.02174}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The structure of optimal private tests for simple hypotheses.\n \n \n \n \n\n\n \n Canonne, C. L.; Kamath, G.; McMillan, A.; Smith, A. D.; and Ullman, J.\n\n\n \n\n\n\n In 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 310–321, 2019. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 55 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CKMSU:19,\n  author    = {Cl{\\'{e}}ment L. Canonne and\n               Gautam Kamath and\n               Audra McMillan and\n               Adam D. Smith and\n               Jonathan Ullman},\n  title     = {The structure of optimal private tests for simple hypotheses},\n  booktitle = {51st Annual {ACM} {SIGACT} Symposium on Theory of Computing (STOC)},\n  pages     = {310--321},\n  publisher = {{ACM}},\n  year      = {2019},\n  url       = {https://arxiv.org/abs/1811.11148}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improved Bounds for Testing Forbidden Order Patterns.\n \n \n \n \n\n\n \n Ben-Eliezer, O.; and Canonne, C. L.\n\n\n \n\n\n\n In ACM–SIAM Symposium on Discrete Algorithms (SODA), pages 2093–2112, 2018. SIAM\n \n\n\n\n
\n\n\n\n \n \n \"ImprovedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BC:18,\n  author    = {Ben-Eliezer, Omri and\n               Canonne, Cl{\\'{e}}ment L.},\n  title     = {Improved Bounds for Testing Forbidden Order Patterns},\n  booktitle = {ACM--SIAM Symposium on Discrete Algorithms (SODA)},\n  pages     = {2093--2112},\n  publisher = {{SIAM}},\n  year      = {2018},\n  url       = {https://arxiv.org/abs/1710.10660}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing Conditional Independence of Discrete Distributions.\n \n \n \n \n\n\n \n Canonne, C. L.; Diakonikolas, I.; Kane, D. M.; and Stewart, A.\n\n\n \n\n\n\n In 50th ACM Symposium on Theory of Computing (STOC), pages 735–748, 2018. ACM\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 71 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CDKS:18,\n  author = {Canonne, Cl{\\'{e}}ment L. and\n            Diakonikolas, Ilias and\n            Kane, Daniel M. and\n            Stewart, Alistair},\n  title     = {Testing Conditional Independence of Discrete Distributions},\n  booktitle   = {50th ACM Symposium on Theory of Computing (STOC)},\n  pages     = {735--748},\n  publisher = {{ACM}},\n  year      = {2018},\n  url       = {https://arxiv.org/abs/1711.11560}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing for Families of Distributions via the Fourier Transform.\n \n \n \n \n\n\n \n Canonne, C. L.; Diakonikolas, I.; and Stewart, A.\n\n\n \n\n\n\n In Advances in Neural Information Processing Systems 31 (NeurIPS), pages 10063–10074, 2018. Curran Associates, Inc.\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 64 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CDS:18,\n  author = {Canonne, Cl{\\'{e}}ment L. and\n            Diakonikolas, Ilias and\n            Stewart, Alistair},\n  title     = {Testing for Families of Distributions via the {Fourier} Transform},\n  booktitle   = {Advances in Neural Information Processing Systems 31 (NeurIPS)},\n  pages = {10063--10074},\n  year = {2018},\n  publisher = {Curran Associates, Inc.},\n  url       = {https://arxiv.org/abs/1706.05738}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism.\n \n \n \n \n\n\n \n Blais, E.; Canonne, C. L.; Eden, T.; Levi, A.; and Ron, D.\n\n\n \n\n\n\n In ACM–SIAM Symposium on Discrete Algorithms (SODA), pages 2113–2132, 2018. SIAM\n \n\n\n\n
\n\n\n\n \n \n \"TolerantPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BCELR:18,\n  author    = {Blais, Eric and\n               Canonne, Cl{\\'{e}}ment L. and\n               Eden, Talya and\n               Levi, Amit and\n               Ron, Dana},\n  title     = {Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism},\n  booktitle = {ACM--SIAM Symposium on Discrete Algorithms (SODA)},\n  pages     = {2113--2132},\n  publisher = {{SIAM}},\n  year      = {2018},\n  doi       = {10.1145/3337789},\n  url       = {https://arxiv.org/abs/1607.03938}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Adaptivity Hierarchy Theorem for Property Testing.\n \n \n \n \n\n\n \n Canonne, C. L.; and Gur, T.\n\n\n \n\n\n\n In Computational Complexity Conference (CCC), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CG:17,\n  author    = {Canonne, Cl{\\'{e}}ment L. and\n               Gur, Tom},\n  title     = {An Adaptivity Hierarchy Theorem for Property Testing},\n  booktitle = {Computational Complexity Conference (CCC)},\n  year      = {2017},\n  url       = {https://drops.dagstuhl.de/opus/volltexte/2017/7516/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Distribution Testing Lower Bounds via Reductions from Communication Complexity.\n \n \n \n \n\n\n \n Blais, E.; Canonne, C. L.; and Gur, T.\n\n\n \n\n\n\n In Computational Complexity Conference (CCC), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"DistributionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BCG:17,\n  author    = {Blais, Eric and\n               Canonne, Cl{\\'{e}}ment L. and\n               Gur, Tom},\n  title     = {Distribution Testing Lower Bounds via Reductions from Communication Complexity},\n  booktitle = {Computational Complexity Conference (CCC)},\n  year      = {2017},\n  url       = {https://drops.dagstuhl.de/opus/volltexte/2017/7536/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Generalized Uniformity Testing.\n \n \n \n \n\n\n \n Batu, T.; and Canonne, C. L.\n\n\n \n\n\n\n In IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 880–889, 2017. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"GeneralizedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 16 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BC:17,\n  author    = {Batu, Tu\\u{g}kan and\n               Canonne, Cl{\\'{e}}ment L.},\n  title     = {Generalized Uniformity Testing},\n  booktitle = {{IEEE} 58th Annual Symposium on Foundations of Computer Science (FOCS)},\n  pages     = {880--889},\n  publisher = {{IEEE} Computer Society},\n  year      = {2017},\n  url       = {https://arxiv.org/abs/1708.04696v1}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing $k$-Monotonicity.\n \n \n \n \n\n\n \n Canonne, C. L.; Grigorescu, E.; Guo, S.; Kumar, A.; and Wimmer, K.\n\n\n \n\n\n\n In 8th Innovations in Theoretical Computer Science (ITCS), 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CGGKW:16,\n  author    = {Canonne, Cl{\\'{e}}ment L. and\n               Grigorescu, Elena and\n               Guo, Siyao and\n               Kumar, Akash and\n               Wimmer, Karl},\n  title     = {Testing $k$-Monotonicity},\n  booktitle  = {8th Innovations in Theoretical Computer Science (ITCS)},\n  publisher = {{ACM}},\n  year      = {2017},\n  url       = {https://drops.dagstuhl.de/opus/volltexte/2017/8158/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing Bayesian Networks.\n \n \n \n \n\n\n \n Canonne, C. L.; Diakonikolas, I.; Kane, D. M.; and Stewart, A.\n\n\n \n\n\n\n In 30th Annual Conference on Learning Theory (COLT), 2017. \n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 14 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CDKS:17,\n  author = {Canonne, Cl{\\'{e}}ment L. and\n            Diakonikolas, Ilias and\n            Kane, Daniel M. and\n            Stewart, Alistair},\n  title     = {Testing {B}ayesian Networks},\n  booktitle = {30th Annual Conference on Learning Theory (COLT)},\n  year      = 2017,\n  url       = {http://proceedings.mlr.press/v65/canonne17a.html}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Are Few Bins Enough: Testing Histogram Distributions.\n \n \n \n \n\n\n \n Canonne, C. L.\n\n\n \n\n\n\n In 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS), 2016. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ArePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 18 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Canonne:16,\n\tauthor = {Cl\\'ement L. Canonne},\n\ttitle = {Are Few Bins Enough: Testing Histogram Distributions},\n\tbooktitle = {35th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles of Database Systems (PODS)},\n  publisher = {{ACM}},\n  year      = {2016},\n  url       = {https://eccc.weizmann.ac.il/report/2015/160/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sampling Correctors.\n \n \n \n \n\n\n \n Canonne, C. L.; Gouleakis, T.; and Rubinfeld, R.\n\n\n \n\n\n\n In 7th Innovations in Theoretical Computer Science (ITCS), 2016. ACM\n \n\n\n\n
\n\n\n\n \n \n \"SamplingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CGR:16,\n  author    = {Canonne, Cl\\'ement L. and\n               Gouleakis, Themis and\n               Rubinfeld, Ronitt},\n  title     = {Sampling Correctors},\n  booktitle  = {7th Innovations in Theoretical Computer Science (ITCS)},\n  publisher = {{ACM}},\n  year      = {2016},\n  url       = {https://arxiv.org/abs/1504.06544}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing Shape Restrictions of Discrete Distributions.\n \n \n \n \n\n\n \n Canonne, C. L.; Diakonikolas, I.; Gouleakis, T.; and Rubinfeld, R.\n\n\n \n\n\n\n In 33rd International Symposium on Theoretical Aspects of Computer Science (STACS), 2016. \n Invited to the \\emphTheory of Computing Systems Special Issue.\n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CDGR:16,\n  author    = {Canonne, Cl\\'ement L. and Diakonikolas, Ilias and Gouleakis, Themis and Rubinfeld, Ronitt},\n  title     = {Testing Shape Restrictions of Discrete Distributions},\n  booktitle = {33rd International Symposium on Theoretical Aspects of Computer Science (STACS)},\n  year      = {2016},\n  note      = {Invited to the \\emph{Theory of Computing Systems} Special Issue.},\n  url       = {https://arxiv.org/abs/1507.03558}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Chasm Between Identity and Equivalence Testing with Conditional Queries.\n \n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Kamath, G.\n\n\n \n\n\n\n In APPROX-RANDOM, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACK:15,\n  author    = {Acharya, Jayadev and\n                Canonne, Cl\\'ement L. and\n                Kamath, Gautam},\n  title     = {A Chasm Between Identity and Equivalence Testing with Conditional Queries},\n  booktitle = {{APPROX-RANDOM}},\n  year      = {2015},\n  url       = {https://drops.dagstuhl.de/opus/volltexte/2015/5317/}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Adaptive Estimation in Weighted Group Testing.\n \n \n \n\n\n \n Acharya, J.; Canonne, C. L.; and Kamath, G.\n\n\n \n\n\n\n In IEEE International Symposium on Information Theory (ISIT), 2015. \n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{ACK:15:ISIT,\n  author    = {Acharya, Jayadev and\n               Canonne, Cl\\'ement L. and\n               Kamath, Gautam},\n  title     = {Adaptive Estimation in Weighted Group Testing},\n  booktitle = {{IEEE} International Symposium on Information Theory (ISIT)},\n   year     = {2015},\n   doi      = {https://doi.org/10.1109/ISIT.2015.7282829}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Big Data on the Rise: Testing monotonicity of distributions.\n \n \n \n \n\n\n \n Canonne, C. L.\n\n\n \n\n\n\n In 42nd International Conference on Automata, Languages and Programming (ICALP), 2015. \n \n\n\n\n
\n\n\n\n \n \n \"BigPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{Canonne:15,\n   author              = {Canonne, Cl\\'ement L.},\n   title               = {{B}ig {D}ata on the Rise: {T}esting monotonicity of distributions},\n   booktitle           = {42nd International Conference on Automata, Languages and Programming (ICALP)},\n   year                = {2015},\n   url                 = {https://arxiv.org/abs/1501.06783}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Communication with Imperfectly Shared Randomness.\n \n \n \n \n\n\n \n Canonne, C. L.; Guruswami, V.; Meka, R.; and Sudan, M.\n\n\n \n\n\n\n In 6th Innovations in Theoretical Computer Science (ITCS), 2015. \n \n\n\n\n
\n\n\n\n \n \n \"CommunicationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CGMM:14,\n   author    = {Canonne, Cl\\'ement L. and Guruswami, Venkatesan and Meka, Raghu and Sudan, Madhu},\n   title     = {Communication with Imperfectly Shared Randomness},\n  booktitle  = {6th Innovations in Theoretical Computer Science (ITCS)},\n  year       = {2015},\n  url        = {https://arxiv.org/abs/1411.3603}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Learning Circuits with few Negations.\n \n \n \n \n\n\n \n Blais, E.; Canonne, C. L.; Oliveira, I. C.; Servedio, R. A.; and Tan, L.\n\n\n \n\n\n\n In APPROX-RANDOM, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"LearningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{BCOST:15,\n  author    = {Blais, Eric and Canonne, Cl\\'ement L. and Oliveira, Igor C. and Servedio,Rocco A. and Tan, Li-Yang },\n  title     = {Learning Circuits with few Negations},\n  booktitle = {{APPROX-RANDOM}},\n  year      = {2015},\n  url       = {https://arxiv.org/abs/1410.8420}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Testing Probability Distributions Underlying Aggregated Data.\n \n \n \n \n\n\n \n Canonne, C. L.; and Rubinfeld, R.\n\n\n \n\n\n\n In 41st International Conference on Automata, Languages and Programming (ICALP), 2014. \n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 10 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CR:14,\n   author              = {Canonne, Cl\\'ement L. and Rubinfeld, Ronitt},\n   title               = {Testing Probability Distributions Underlying Aggregated Data},\n   booktitle           = {41st International Conference on Automata, Languages and Programming (ICALP)},\n   year                = {2014},\n   url                 = {https://arxiv.org/abs/1402.3835}\n}\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Testing equivalence between distributions using conditional samples.\n \n \n \n \n\n\n \n Canonne, C. L.; Ron, D.; and Servedio, R. A.\n\n\n \n\n\n\n In ACM–SIAM Symposium on Discrete Algorithms (SODA), 2014. \n \n\n\n\n
\n\n\n\n \n \n \"TestingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 19 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{CRS:14,\n  author =       {Canonne, Cl\\'ement L. and Ron, Dana and Servedio, Rocco A.},\n  title     = {Testing equivalence between distributions using conditional samples},\n  booktitle = {ACM--SIAM Symposium on Discrete Algorithms (SODA)},\n  year      = {2014},\n  doi        = {http://dx.doi.org/10.1137/1.9781611973402.87},\n  url       = {http://www.cs.columbia.edu/~rocco/papers/soda14cond.html}\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);