Aditi Laddha

Generating author description...

All published works

Action	Title	Year	Authors
+	Fast Algorithms for Maximizing the Minimum Eigenvalue in Fixed Dimension	2024	Adam Brown Aditi Laddha Mohit Singh
+ PDF Chat	Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs	2024	Adam J. Brown Aditi Laddha Madhusudhan Reddy Pittu Mohit Singh
+	Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs	2024	Adam J. Brown Aditi Laddha Madhusudhan Reddy Pittu Mohit Singh
+	Maximizing the Minimum Eigenvalue in Constant Dimension	2024	Adam Brown Aditi Laddha Mohit Singh
+ PDF Chat	Convergence of Gibbs Sampling: Coordinate Hit-and-Run Mixes Fast	2023	Aditi Laddha Santosh Vempala
+ PDF Chat	Determinant Maximization via Matroid Intersection Algorithms	2022	Adam Brown Aditi Laddha Madhusudhan Pittu Mohit Singh Prasad Tetali
+	A Unified Approach to Discrepancy Minimization	2022	Nikhil Bansal Aditi Laddha Santosh Vempala
+	Determinant Maximization via Matroid Intersection Algorithms	2022	Adam Brown Aditi Laddha Madhusudhan Pittu Mohit Singh Prasad Tetali
+	Efficient Determinant Maximization for All Matroids	2022	Adam Brown Aditi Laddha Madhusudhan Pittu Mohit Singh
+	Reducing isotropy and volume to KLS: an <i>o</i> *( <i>n</i> <sup>3</sup> <i>ψ</i> <sup>2</sup> ) volume algorithm	2021	Jia He Aditi Laddha Yin Tat Lee Santosh Vempala
+	Convergence of Gibbs Sampling: Coordinate Hit-and-Run Mixes Fast	2021	Aditi Laddha Santosh Vempala
+ PDF Chat	Strong self-concordance and sampling	2020	Aditi Laddha Yin Tat Lee Santosh Vempala
+	Reducing Isotropy and Volume to KLS: An $O(n^3ψ^2)$ Volume Algorithm	2020	Jia He Aditi Laddha Yin Tat Lee Santosh Vempala
+	Convergence of Gibbs Sampling: Coordinate Hit-and-Run Mixes Fast	2020	Aditi Laddha Santosh Vempala
+	Strong Self-Concordance and Sampling	2019	Aditi Laddha Yin Tat Lee Santosh Vempala
+	Strong Self-Concordance and Sampling	2019	Aditi Laddha Yin Tat Lee Santosh Vempala

Common Coauthors

Coauthor	Papers Together
Santosh Vempala	8
Yin Tat Lee	5
Adam Brown	5
Mohit Singh	4
Madhusudhan Pittu	3
Mohit Singh	3
Jia He	2
Prasad Tetali	2
Madhusudhan Reddy Pittu	2
Adam J. Brown	2
Santosh Vempala	1
Nikhil Bansal	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Simulated annealing in convex bodies and an <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msup><mml:mrow><mml:mi>O</mml:mi></mml:mrow><mml:mrow><mml:mo>*</mml:mo></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math> volume algorithm	2005	László Lovász Santosh Vempala	5
+	Eldan's Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion	2017	Yin Tat Lee Santosh Vempala	5
+	Random walks and anO*(n5) volume algorithm for convex bodies	1997	Ravi Kannan L�szl� Lov�sz Mikl�s Simonovits	4
+ PDF Chat	Thin Shell Implies Spectral Gap Up to Polylog via a Stochastic Localization Scheme	2013	Ronen Eldan	4
+ PDF Chat	Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk	2019	Oren Mangoubi Nisheeth K. Vishnoi	4
+	Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation	2018	Yin Tat Lee Santosh Vempala	4
+	Random walks in a convex body and an improved volume algorithm	1993	László Lovász Miklós Simonovits	4
+	None	2007	Remco van der Hofstad Gerard Hooghiemstra Piet Van Mieghem	3
+	Bypassing KLS	2015	Benjamin Cousins Santosh Vempala	3
+ PDF Chat	Isoperimetric problems for convex bodies and a localization lemma	1995	Ravi Kannan László Lovász Miklós Simonovits	3
+	Hit-and-Run from a Corner	2006	László Lovász Santosh Vempala	3
+	Hit-and-run mixes fast	1999	László Lovász	3
+	The geometry of logconcave functions and sampling algorithms	2006	László Lovász Santosh Vempala	3
+ PDF Chat	Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor	2018	François Le Gall Florent Urrutia	2
+ PDF Chat	Geodesic walks in polytopes	2017	Yin Tat Lee Santosh Vempala	2
+	Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids	2018	Nima Anari Shayan Oveis Gharan Cynthia Vinzant	2
+ PDF Chat	Randomized Rounding for the Largest Simplex Problem	2015	Aleksandar Nikolov	2
+ PDF Chat	Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds	2019	Jan van den Brand Danupon Nanongkai Thatchaphol Saranurak	2
+ PDF Chat	Powers of tensors and fast matrix multiplication	2014	François Le Gall	2
+ PDF Chat	Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming	2012	Ravindran Kannan Hariharan Narayanan	2
+ PDF Chat	Near-optimal discrete optimization for experimental design: a regret minimization approach	2020	Zeyuan Allen-Zhu Yuanzhi Li Aarti Singh Yining Wang	2
+ PDF Chat	Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back	2013	Aleksander Mądry	2
+ PDF Chat	A Local Search Framework for Experimental Design	2021	Lap Chi Lau Hong Zhou	2
+ PDF Chat	Efficient Inverse Maintenance and Faster Algorithms for Linear Programming	2015	Yin Tat Lee Aaron Sidford	2
+	Covariance estimation for distributions with ${2+\varepsilon}$ moments	2013	Nikhil Srivastava Roman Vershynin	2
+ PDF Chat	Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles	2009	Radosław Adamczak Alexander E. Litvak Alain Pajor Nicole Tomczak-Jaegermann	2
+ PDF Chat	Maximizing Determinants under Matroid Constraints	2020	Vivek Madan Aleksandar Nikolov Mohit Singh Uthaipon Tantipongpipat	2
+ PDF Chat	Interlacing families II: Mixed characteristic polynomials and the Kadison--Singer problem	2015	Adam W. Marcus Daniel A. Spielman Nikhil Srivastava	2
+	A random polynomial time algorithm for approximating the volume of convex bodies	1989	Martin Dyer Alan Frieze	2
+	Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs	2011	Paul F. Christiano Jonathan A. Kelner Aleksander Mądry Daniel A. Spielman Shang‐Hua Teng	2
+ PDF Chat	Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs	2010	Aleksander Mądry	2
+	A polynomial-time algorithm, based on Newton's method, for linear programming	1988	James Renegar	2
+ PDF Chat	Determinant Maximization via Matroid Intersection Algorithms	2022	Adam Brown Aditi Laddha Madhusudhan Pittu Mohit Singh Prasad Tetali	2
+	Maximizing determinants under partition constraints	2016	Aleksandar Nikolov Mohit Singh	2
+ PDF Chat	The mixing time of the Dikin walk in a polytope—A simple proof	2016	Sushant Sachdeva Nisheeth K. Vishnoi	2
+ PDF Chat	Concentration of mass on convex bodies	2006	Grigoris Paouris	2
+	A new algorithm for minimizing convex functions over convex sets	1996	Pravin M. Vaidya	2
+	Path Finding Methods for Linear Programming: Solving Linear Programs in &#x00D5;(vrank) Iterations and Faster Algorithms for Maximum Flow	2014	Yin Tat Lee Aaron Sidford	2
+	Canonical Barriers on Convex Cones	2014	Roland Hildebrand	2
+	Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization	2006	László Lovász Santosh Vempala	2
+ PDF Chat	On largest volume simplices and sub-determinants	2014	Marco Di Summa Friedrich Eisenbrand Yuri Faenza Carsten Moldenhauer	2
+	The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume	2002	László Lovász Miklós Simonovits	2
+ PDF Chat	Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume	2018	Ben Cousins Santosh Vempala	2
+	Solving convex programs by random walks	2004	Dimitris Bertsimas Santosh Vempala	2
+ PDF Chat	Nearly Maximum Flows in Nearly Linear Time	2013	Jonah Sherman	2
+	Pipage Rounding, Pessimistic Estimators and Matrix Concentration	2013	Nicholas J. A. Harvey Neil Olver	1
+	Interior-Point Polynomial Algorithms in Convex Programming	1994	Yurii Nesterov Arkadi Nemirovski	1
+	Geometric Random Walks: a Survey	2007	Santosh Vempala	1
+	The entropic barrier: a simple and optimal universal self-concordant barrier	2014	Sébastien Bubeck Ronen Eldan	1
+	Gibbs sampling, conjugate priors and coupling	2010	Persi Diaconis Kshitij Khare Laurent Saloff‐Coste	1