no code implementations • 13 May 2024 • Vasilis Kontonis, Mingchen Ma, Christos Tzamos
We measure the complexity of the region queries via the VC dimension of the family of regions.
no code implementations • 6 Jun 2023 • Mingchen Ma, Christos Tzamos
In this paper, we study how to buy information for stochastic optimization and formulate this question as an online learning problem.
no code implementations • 9 Jun 2022 • Alberto Del Pia, Mingchen Ma, Christos Tzamos
Our main result is a computationally efficient algorithm that can identify large clusters with $O\left(\frac{nk \log n} {(1-2p)^2}\right) + \text{poly}\left(\log n, k, \frac{1}{1-2p} \right)$ queries, matching the guarantees of the best known algorithms in the fully-random model.