Gregory Valiant
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Mingda Qiaoonce
who talks about the same things
- Toniann Pitassi5 talks
- Pasin Manurangsi8 talks
- Greg Bodwin3 talks
- Jelani Nelson10 talks
- Varun Gupta7 talks
- Oded Goldreich4 talks
| title | conference | date |
|---|---|---|
| Online Pen Testing | ITCS 2023 | 2023-01-10 |
Defines an online “pen testing” model where testing reduces an option’s value by threshold theta and passing reveals only residual value; proves a universal… | ||
| Estimation Beyond the IID Setting (Two Vignettes) | Algorithmic Advances for Statistical Inference with Combinatorial Structure | 2021-10-11 |
Two vignettes show concrete claims and tools: the worst‑case squared‑error estimator for a coin with one flip predicts quarter/three-quarters rule and for k… | ||
| Charting the Landscape of Memory/Data Tradeoffs in Continuous Optimization: ... | Rigorous Evidence for Information-Computation Trade-offs | 2021-09-13 |
Constrained-memory algorithms either store a basis or pay huge sample costs: over F2, algorithms with <~d^2/4 bits of memory require exponentially many samples… | ||
| Statistical Property Testing and Estimation Beyond the i.i.d. Setting | Information Theory, Learning and Big Data (Simons Institute, 2015) | 2015-03-16 |
Provides a tight, instance-optimal sample complexity for identity testing to a known distribution p: samples = Theta(max(1/epsilon, ||p after trimming epsilon… | ||
| Lucky Talk: An Algorithmic Characterization of a Class of Inequalities | Information Theory, Learning and Big Data (Simons Institute, 2015) | 2015-03-16 |
Main theorem: given finite sequences a_i, b_i, c_i the multiplicative inequality over all positive x_j,y_j holds exactly when the target expression decomposes… | ||
| nothing matches | ||