{"list":"other","total":53,"rows":[{"id":"1405.4980","title":"Convex Optimization: Algorithms and Complexity","created":"2014-05-20","cited_by_count":575},{"id":"1411.4357","title":"Sketching as a Tool for Numerical Linear Algebra","created":"2014-11-17","cited_by_count":288},{"id":"1903.08568","title":"Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices","created":"2019-03-20","cited_by_count":227},{"id":"1412.7392","title":"Theoretical guarantees for approximate sampling from smooth and log-concave densities","created":"2014-12-23","cited_by_count":208},{"id":"1507.05021","title":"Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm","created":"2015-07-17","cited_by_count":197},{"id":"1707.03663","title":"Underdamped Langevin MCMC: A non-asymptotic analysis","created":"2017-07-12","cited_by_count":133},{"id":"1802.09188","title":"Analysis of Langevin Monte Carlo via convex optimization","created":"2018-02-26","cited_by_count":127},{"id":"1802.08089","title":"Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problem","created":"2018-02-22","cited_by_count":123},{"id":"1801.02309","title":"Log-concave sampling: Metropolis-Hastings algorithms are fast","created":"2018-01-08","cited_by_count":118},{"id":"1710.00095","title":"User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient","created":"2017-09-29","cited_by_count":116},{"id":"2010.03106","title":"Structured Logconcave Sampling with a Restricted Gaussian Oracle","created":"2020-10-07","cited_by_count":86},{"id":"1909.05503","title":"The Randomized Midpoint Method for Log-Concave Sampling","created":"2019-09-12","cited_by_count":78},{"id":"2202.06386","title":"Improved analysis for a proximal algorithm for sampling","created":"2022-02-13","cited_by_count":73},{"id":"1504.05477","title":"Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition","created":"2015-04-21","cited_by_count":64},{"id":"2010.09649","title":"Hutch++: Optimal Stochastic Trace Estimation","created":"2020-10-19","cited_by_count":63},{"id":"2202.05214","title":"Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlo","created":"2022-02-10","cited_by_count":63},{"id":"1807.09382","title":"On sampling from a log-concave density using kinetic Langevin diffusions","created":"2018-07-24","cited_by_count":62},{"id":"2012.12810","title":"Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm","created":"2020-12-23","cited_by_count":57},{"id":"2002.04363","title":"Wasserstein Control of Mirror Langevin Monte Carlo","created":"2020-02-11","cited_by_count":55},{"id":"2010.16212","title":"Efficient constrained sampling via the mirror-Langevin algorithm","created":"2020-10-30","cited_by_count":55},{"id":"1905.12247","title":"Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients","created":"2019-05-29","cited_by_count":51},{"id":"2203.00263","title":"Private Convex Optimization via Exponential Mechanism","created":"2022-03-01","cited_by_count":49},{"id":"2302.10249","title":"Faster high-accuracy log-concave sampling via algorithmic warm starts","created":"2023-02-20","cited_by_count":45},{"id":"2109.13055","title":"Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling","created":"2021-09-27","cited_by_count":44},{"id":"2005.09669","title":"Exponential ergodicity of mirror-Langevin diffusions","created":"2020-05-19","cited_by_count":37},{"id":"2109.12077","title":"The Mirror Langevin Algorithm Converges with Vanishing Bias","created":"2021-09-24","cited_by_count":37},{"id":"2006.09270","title":"Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithm","created":"2020-06-16","cited_by_count":35},{"id":"1911.01469","title":"Proximal Langevin Algorithm: Rapid Convergence Under Isoperimetry","created":"2019-11-04","cited_by_count":34},{"id":"2302.10081","title":"Improved dimension dependence of a proximal algorithm for sampling","created":"2023-02-20","cited_by_count":30},{"id":"1411.5713","title":"Testing for high-dimensional geometry in random graphs","created":"2014-11-20","cited_by_count":25},{"id":"2204.10818","title":"Convergence of the Riemannian Langevin Algorithm","created":"2022-04-22","cited_by_count":25},{"id":"2002.04121","title":"Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlo","created":"2020-02-10","cited_by_count":22},{"id":"2210.08448","title":"Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling","created":"2022-10-16","cited_by_count":22},{"id":"2106.05480","title":"Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions","created":"2021-06-10","cited_by_count":19},{"id":"2105.14163","title":"The query complexity of sampling from strongly log-concave distributions in one dimension","created":"2021-05-29","cited_by_count":18},{"id":"1911.03043","title":"Estimating Normalizing Constants for Log-Concave Distributions: Algorithms and Lower Bounds","created":"2019-11-08","cited_by_count":16},{"id":"2203.04163","title":"Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains","created":"2022-03-08","cited_by_count":16},{"id":"2210.02482","title":"Fisher information lower bounds for sampling","created":"2022-10-05","cited_by_count":12},{"id":"1804.01221","title":"Tight Query Complexity Lower Bounds for PCA via Finite Sample Deformed Wigner Law","created":"2018-04-04","cited_by_count":11},{"id":"1709.03594","title":"Lower Bound for Randomized First Order Convex Optimization","created":"2017-09-11","cited_by_count":9},{"id":"1911.02212","title":"The gradient complexity of linear regression","created":"2019-11-06","cited_by_count":9},{"id":"2104.03461","title":"Sublinear Time Spectral Density Estimation","created":"2021-04-08","cited_by_count":9},{"id":"1906.05736","title":"Querying a Matrix through Matrix-Vector Products","created":"2019-06-13","cited_by_count":8},{"id":"2002.00291","title":"Oracle Lower Bounds for Stochastic Gradient Sampling Algorithms","created":"2020-02-01","cited_by_count":8},{"id":"2006.14015","title":"Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems","created":"2020-06-24","cited_by_count":8},{"id":"1712.01725","title":"Approximating the Spectrum of a Graph","created":"2017-12-05","cited_by_count":7},{"id":"1911.02074","title":"Computational Separations between Sampling and Optimization","created":"2019-11-05","cited_by_count":7},{"id":"2010.01405","title":"Random Coordinate Langevin Monte Carlo","created":"2020-10-03","cited_by_count":7},{"id":"2202.05120","title":"Low-Rank Approximation with $1/\\epsilon^{1/3}$ Matrix-Vector Products","created":"2022-02-10","cited_by_count":7},{"id":"1405.7112","title":"Optimal query complexity for estimating the trace of a matrix","created":"2014-05-28","cited_by_count":6},{"id":"1810.12437","title":"Prior-preconditioned conjugate gradient method for accelerated Gibbs sampling in \"large $n$ & large $p$\" Bayesian sparse regression","created":"2018-10-29","cited_by_count":6},{"id":"2110.13752","title":"Dynamic Trace Estimation","created":"2021-10-26","cited_by_count":6},{"id":"1702.06081","title":"Learning Non-Discriminatory Predictors","created":"2017-02-20","cited_by_count":3}],"next_cursor":null}