Search Results - "Sidford, Aaron"

Lower bounds for finding stationary points I by Carmon, Yair, Duchi, John C., Hinder, Oliver, Sidford, Aaron

“…We prove lower bounds on the complexity of finding ϵ -stationary points (points x such that ‖ ∇ f ( x ) ‖ ≤ ϵ ) of smooth, high-dimensional, and potentially…”
Get full text

Lower bounds for finding stationary points II: first-order methods by Carmon, Yair, Duchi, John C., Hinder, Oliver, Sidford, Aaron

“…We establish lower bounds on the complexity of finding ϵ -stationary points of smooth, non-convex high-dimensional functions using first-order methods. We…”
Get full text

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization by Yin Tat Lee, Sidford, Aaron, Sam Chiu-Wai Wong

“…In this paper we improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a…”
Get full text

Coordinate Methods for Accelerating ℓ∞ Regression and Faster Approximate Maximum Flow by Sidford, Aaron, Tian, Kevin

“…In this paper we provide faster algorithms for approximately solving ℓ_∞ regression, a fundamental problem prevalent in both combinatorial and continuous…”
Get full text

Towards optimal running times for optimal transport by Blanchet, Jose, Jambulapati, Arun, Kent, Carson, Sidford, Aaron

“…We provide faster algorithms for approximating the optimal transport distance, e.g. earth mover's distance, between two discrete probability distributions on n…”
Get full text

Variance reduced value iteration and faster algorithms for solving Markov decision processes by Sidford, Aaron, Wang, Mengdi, Wu, Xian, Ye, Yinyu

“…In this paper we provide faster algorithms for approximately solving discounted Markov decision processes in multiple parameter regimes. Given a discounted…”
Get full text

Sparse Submodular Function Minimization by Graur, Andrei, Jiang, Haotian, Sidford, Aaron

“…In this paper we study the problem of minimizing a submodular function f: 2^{V} \rightarrow \mathbb{R} that is guaranteed to have a k-sparse minimizer. We give…”
Get full text

Coordinate Methods for Matrix Games by Carmon, Yair, Jin, Yujia, Sidford, Aaron, Tian, Kevin

“…We develop primal-dual coordinate methods for solving bilinear saddle-point problems of the form \min\nolimits_{x\in \mathcal{X}}\max\nolimits_{y\in…”
Get full text

Unit Capacity Maxflow in Almost O(m^) Time by Kathuria, Tarun, Liu, Yang P., Sidford, Aaron

“…We present an algorithm, which given any m -edge n -vertex directed graph with positive integer capacities at most U computes a maximum s-t flow for any…”
Get full text

Parallel Reachability in Almost Linear Work and Square Root Depth by Jambulapati, Arun, Liu, Yang P., Sidford, Aaron

“…In this paper we provide a parallel algorithm that given any n-node m-edge directed graph and source vertex s computes all vertices reachable from s with Õ(m)…”
Get full text

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs by van den Brand, Jan, Lee, Yin-Tat, Nanongkai, Danupon, Peng, Richard, Saranurak, Thatchaphol, Sidford, Aaron, Song, Zhao, Wang, Di

“…We present an \tilde{O}(m+n^{1.5}) -time randomized algorithm for maximum cardinality bipartite matching and related problems (e.g. transshipment,…”
Get full text

Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow by Yin Tat Lee, Sidford, Aaron

“…In this paper, we present a new algorithm for '/ solving linear programs that requires only Õ(√rank(A)L) iterations where A is the constraint matrix of a…”
Get full text

Singular Value Approximation and Sparsifying Random Walks on Directed Graphs by Ahmadinejad, AmirMahdi, Peebles, John, Pyne, Edward, Sidford, Aaron, Vadhan, Salil

“…In this paper, we introduce a new, spectral notion of approximation between directed graphs, which we call singular value (SV) approximation. SV-approximation…”
Get full text

Improved Lower Bounds for Submodular Function Minimization by Chakrabarty, Deeparnab, Graur, Andrei, Jiang, Haotian, Sidford, Aaron

“…We provide a generic technique for constructing families of submodular functions to obtain lower bounds for submodular function minimization (SFM). Applying…”
Get full text

High-precision Estimation of Random Walks in Small Space by Ahmadinejad, AmirMahdi, Kelner, Jonathan, Murtagh, Jack, Peebles, John, Sidford, Aaron, Vadhan, Salil

“…In this paper, we provide a deterministic \tilde{O}(\log N) -space algorithm for estimating random walk probabilities on undirected graphs, and more generally…”
Get full text

Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations by Cohen, Michael B., Kelner, Jonathan, Kyng, Rasmus, Peebles, John, Peng, Richard, Rao, Anup B., Sidford, Aaron

“…In this paper, we show how to solve directed Laplacian systems in nearly-linear time. Given a linear system in an n × n Eulerian directed Laplacian with m…”
Get full text

ReSQueing Parallel and Private Stochastic Convex Optimization by Carmon, Yair, Jambulapati, Arun, Jin, Yujia, Lee, Yin Tat, Liu, Daogao, Sidford, Aaron, Tian, Kevin

“…We introduce a new tool for stochastic convex optimization (SCO): a Reweighted Stochastic Query (ReSQue) estimator for the gradient of a function convolved…”
Get full text

Sparsifying Sums of Norms by Jambulapati, Arun, Lee, James R., Liu, Yang P., Sidford, Aaron

“…Abstract-For any norms N_{1}, \ldots, N_{m} on \mathbb{R}^{n} and N(x):= N_{1}(x)+\cdots+N_{m}(x), we show there is a sparsified norm \tilde{N}(x)= w_{1}…”
Get full text

Matrix Completion in Almost-Verification Time by Kelner, Jonathan A., Li, Jerry, Liu, Allen, Sidford, Aaron, Tian, Kevin

“…We give a new framework for solving the fundamental problem of low-rank matrix completion, i.e., approximating a rank- r matrix \mathbf{M} \in \mathbb{R}^{m…”
Get full text

Faster Matroid Intersection by Chakrabarty, Deeparnab, Tat Lee, Yin, Sidford, Aaron, Singla, Sahil, Chiu-wai Wong, Sam

“…In this paper we consider the classic matroid intersection problem: given two matroids M 1 = (V, I 1 ) and M 2 = (V, I 2 ) defined over a common ground set V ,…”
Get full text