#Random2026
Now accepted at #RANDOM2026: congratulations, Nimitt! @nimittnim.com
New preprint online: on multiple trade-offs b/w communication, sample, and randomness complexities for the fundamental task of Gaussian mean testing in a distributed setting.

Led by the brilliant Nimitt (undergrad at IIT Gandhinagar) during a remote internship last year!

📝 arxiv.org/abs/2605.29426
Distributed Gaussian Mean Testing under Communication Constraints: messages, samples, and coins
We revisit the problem of Gaussian mean testing in a distributed, communication constrained setting, where each of $n$ users independently observes samples from an unknown $d$-dimensional spherical Ga...
arxiv.org
June 25, 2026 at 8:33 AM
Our paper on Entropy Equivalence Testing was just accepted to #RANDOM2026. Congratulations to Joy (Qiping) Yang and Yash Pote, who led the charge! arxiv.org/abs/2605.23225
Entropy Equivalence Testing
We introduce the problem of \emph{entropy equivalence testing} for probability distributions, a relaxation of the well-studied closeness testing problem, where the distribution testing algorithm is no...
arxiv.org
June 25, 2026 at 8:32 AM
June 24, 2026 at 9:01 PM
🎉 Clément Canonne and Joy Qiping Yang's paper "Entropy Equivalence Testing" has been accepted at #RANDOM2026!

🔗 RANDOM'26: randomconference.com/random-2026-...
📝 Paper: arxiv.org/abs/2605.23225

Joint work with Yash Pote and Jonathan Scarlett (NUS)

#algorithms #sublinearalgorithms
June 30, 2026 at 8:30 AM
🎉 Clément Canonne and Nimitt (IIT Gandhinagar)'s paper "Distributed Gaussian Mean Testing under Communication Constraints: messages, samples, and coins" has been accepted at #RANDOM2026!

🔗 RANDOM'26: randomconference.com/random-2026-...
📝 Paper: arxiv.org/abs/2605.29426
June 30, 2026 at 8:50 AM