| Publication | Date of Publication | Type |
|---|
Near-optimal discrete optimization for experimental design: a regret minimization approach
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
Flow-based algorithms for local graph clustering
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence
Mathematical Programming. Series A. Series B | 2019-05-17 | Paper |
Knightian analysis of the Vickrey mechanism
Econometrica | 2019-01-30 | Paper |
| Katyusha: the first direct acceleration of stochastic gradient methods | 2018-11-22 | Paper |
Expanders via local edge flips
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Using optimization to obtain a width-independent, parallel, simpler, and faster positive SDP solver
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Linear coupling: an ultimate unification of gradient and mirror descent
(available as arXiv preprint) | 2018-05-03 | Paper |
Optimization algorithms for faster computational geometry
(available as arXiv preprint) | 2017-12-19 | Paper |
| Restricted isometry property for general \(p\)-norms | 2017-10-10 | Paper |
Using optimization to break the epsilon barrier: a faster and simpler width-independent algorithm for solving positive linear programs in parallel
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Finding approximate local minima faster than gradient descent
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Katyusha: the first direct acceleration of stochastic gradient methods
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Restricted Isometry Property for General p-Norms
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Mechanism design with approximate valuations
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Reconstructing Markov processes from independent and anonymous experiments
Discrete Applied Mathematics | 2016-01-21 | Paper |
Shorter arithmetization of nondeterministic computations
Theoretical Computer Science | 2015-09-16 | Paper |
Randomized accuracy-aware program transformations for efficient approximate computations
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
Nearly-linear time positive LP solver with faster convergence rate
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Spectral sparsification and regret minimization beyond matrix multiplicative updates
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints | 2014-11-19 | Paper |
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Using Optimization to Solve Positive LPs Faster in Parallel
(available as arXiv preprint) | 2014-07-07 | Paper |
