Aaron Sidford

From MaRDI portal
Person:2205971

Available identifiers

zbMath Open sidford.aaronMaRDI QIDQ2205971

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61472822024-01-15Paper
Sparsifying generalized linear models2023-11-29Paper
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes2023-10-25Paper
Sparsifying sums of norms2023-05-15Paper
https://portal.mardi4nfdi.de/entity/Q58754982023-02-03Paper
Dynamic Maxflow via Dynamic Interior Point Methods2022-12-12Paper
Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification2022-09-21Paper
Derandomization beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space2022-08-17Paper
https://portal.mardi4nfdi.de/entity/Q51584982021-10-25Paper
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness2021-06-15Paper
Fast and Space Efficient Spectral Sparsification in Dynamic Streams2021-02-02Paper
Lower bounds for finding stationary points II: first-order methods2021-01-25Paper
Solving tall dense linear programs in nearly linear time2021-01-19Paper
A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)2020-11-25Paper
Lower bounds for finding stationary points I2020-10-21Paper
Efficient Convex Optimization with Oracles2020-07-08Paper
Solving Tall Dense Linear Programs in Nearly Linear Time2020-02-06Paper
Efficient profile maximum likelihood for universal symmetric property estimation2020-01-30Paper
Memory-sample tradeoffs for linear regression with small error2020-01-30Paper
Faster Energy Maximization for Faster Maximum Flow2019-10-31Paper
Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications2019-10-15Paper
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations2019-06-20Paper
Near-optimal method for highly smooth convex optimization2018-12-19Paper
https://portal.mardi4nfdi.de/entity/Q45585622018-11-22Paper
Accelerated Methods for NonConvex Optimization2018-07-03Paper
Near-Optimal Time and Sample Complexities for Solving Discounted Markov Decision Process with a Generative Model2018-06-05Paper
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes2018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q46079792018-03-15Paper
Stability of the Lanczos Method for Matrix Function Approximation2018-03-15Paper
Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse2018-03-15Paper
Geometric median in nearly linear time2017-09-29Paper
Routing under balance2017-09-29Paper
Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs2017-08-17Paper
Subquadratic submodular function minimization2017-08-17Paper
Arboral satisfaction: recognition and LP approximation2017-08-16Paper
Uniform Sampling for Matrix Approximation2017-05-19Paper
"Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions2017-05-08Paper
Single Pass Spectral Sparsification in Dynamic Streams2017-03-10Paper
Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing2015-10-30Paper
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time2014-08-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Aaron Sidford