Prasad Raghavendra
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
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| The Power of Hierarchies for Detecting Hidden Structures | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Proves that degree-D sum-of-squares power to distinguish planted vs. null instances reduces to a concrete spectral test: build a low-degree matrix polynomial… | ||
| Extended Formulations 1 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Quick tutorial that proves the core claims: extended formulations let some polytopes shrink from exponentially many inequalities to n×B network flow LP for… | ||
| Extended Formulations 2 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Shows a concrete lower bound for the correlation polytope by extracting a submatrix of its slack matrix with entries 1 for disjoint 0/1 vectors and 0 for pairs… | ||
| Extended Formulations 3 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Extension complexity equals non-negative rank of the slack matrix, and for the correlation polytope LP/SDP relaxations correspond to families or vector spaces… | ||
| Extended Formulations 4 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Shows how any bounded density F on {0,1}^n that tests indistinguishably against a family of functions D1 … Dm is approximated by a normalized exponential of a… | ||
| Sum of Squares SDP Relaxations on Random Tensors | Random Instances and Phase Transitions (Simons Institute, 2016) | 2016-05-02 |
Proves a concrete runtime vs. guarantee tradeoff: a degree-d Sum-of-Squares proof (computed in time n^{O(d)}) certifies strictly better upper bounds on the… | ||
| On Graph Spectra and Small Set Expansion | Functional Inequalities in Discrete Spaces with Applications 2013 | 2013-09-30 |
Gives concrete algorithms and constructions: shows you can distinguish small‑set expansion up to a barrier of sqrt(ε log(1/δ)) and proves a higher‑order… | ||
| nothing matches | ||