Raghu Meka
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
- Haotian Jiangonce
- Ian Mertzonce
- Jiapeng Zhangonce
all 8 in the filters
who talks about the same things
- Makrand Sinha5 talks
- Shachar Lovett9 talks
- Toniann Pitassi5 talks
- Jiapeng Zhang3 talks
- Tushant Mittal2 talks
- Anindya De3 talks
| title | conference | date |
|---|---|---|
| Learning Ill-Conditioned Gaussian Graphical Models | Algorithmic Aspects of Causal Inference 2022 | 2022-03-18 |
Claims first fixed polynomial-time algorithms that learn attractive GGMs and walk-summable GGMs using logarithmic samples without condition-number assumptions… | ||
| Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing | ITCS 2022 | 2022-01-31 |
Shows that in a smoothed model (noise whose covariance has nontrivial projection in every direction) the Banaszczyk bound improves to sqrt(log d)+sqrt(log log… | ||
| Lifting With Sunflowers | ITCS 2022 | 2022-01-31 |
Proves that many lifting theorems (tree‑like, DAG‑like, depth‑dependent) follow from a single sunflower‑based lemma, replacing lengthy casework with a short… | ||
| Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs | Hierarchies, Extended Formulations and Matrix-Analytic Techniques (2017) | 2017-11-06 |
Proves a lifting theorem: for the inner-product gadget with B ≳ c log n the non-negative rank of a pattern matrix Mf is at least exp(Ω(B · degree-plus(f)))… | ||
| Anti-Concentration for Polynomials of Independent Random Variables | Connections Between Algorithm Design and Complexity Theory | 2015-09-28 |
Gives an explicit anti‑concentration bound: for a degree‑d real polynomial whose rank = number of disjoint degree‑d monomials equals r, the mass on any single… | ||
| nothing matches | ||