Подписаться
Arun Jambulapati
Arun Jambulapati
Postdoc, Simons Institute
Подтвержден адрес электронной почты в домене alumni.stanford.edu
Название
Процитировано
Процитировано
Год
Towards optimal running times for optimal transport
J Blanchet, A Jambulapati, C Kent, A Sidford
arXiv preprint arXiv:1810.07717, 2018
712018
A direct tilde {O}(1/epsilon) iteration parallel algorithm for optimal transport
A Jambulapati, A Sidford, K Tian
Advances in Neural Information Processing Systems 32, 2019
662019
Acceleration with a ball optimization oracle
Y Carmon, A Jambulapati, Q Jiang, Y Jin, YT Lee, A Sidford, K Tian
Advances in Neural Information Processing Systems 33, 19052-19063, 2020
422020
Parallel reachability in almost linear work and square root depth
A Jambulapati, YP Liu, A Sidford
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
422019
Robust sub-gaussian principal component analysis and width-independent schatten packing
A Jambulapati, J Li, K Tian
Advances in Neural Information Processing Systems 33, 15689-15701, 2020
392020
Ultrasparse ultrasparsifiers and faster laplacian system solvers
A Jambulapati, A Sidford
ACM Transactions on Algorithms, 2021
352021
Efficient Õ(n/) Spectral Sketches for the Laplacian and its Pseudoinverse
A Jambulapati, A Sidford
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
352018
Faster maxflow via improved dynamic spectral vertex sparsifiers
J van den Brand, Y Gao, A Jambulapati, YT Lee, YP Liu, R Peng, ...
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
292022
Stochastic bias-reduced gradient methods
H Asi, Y Carmon, A Jambulapati, Y Jin, A Sidford
Advances in Neural Information Processing Systems 34, 10810-10822, 2021
282021
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space∗
S Assadi, A Jambulapati, Y Jin, A Sidford, K Tian
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
262022
A slightly improved bound for the KLS constant
A Jambulapati, YT Lee, SS Vempala
arXiv preprint arXiv:2208.11644, 2022
242022
Optimal and adaptive monteiro-svaiter acceleration
Y Carmon, D Hausler, A Jambulapati, Y Jin, A Sidford
Advances in Neural Information Processing Systems 35, 20338-20350, 2022
222022
Thinking inside the ball: Near-optimal minimization of the maximal loss
Y Carmon, A Jambulapati, Y Jin, A Sidford
Conference on Learning Theory, 866-882, 2021
222021
Positive semidefinite programming: Mixed, parallel, and width-independent
A Jambulapati, YT Lee, J Li, S Padmanabhan, K Tian
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
192020
Robust regression revisited: Acceleration and improved estimation rates
A Jambulapati, J Li, T Schramm, K Tian
Advances in Neural Information Processing Systems 34, 4475-4488, 2021
182021
Perron-frobenius theory in nearly linear time: Positive eigenvectors, m-matrices, graph kernels, and other applications
AM Ahmadinejad, A Jambulapati, A Saberi, A Sidford
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
162019
Improved iteration complexities for overconstrained p-norm regression
A Jambulapati, YP Liu, A Sidford
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
152022
Optimal methods for higher-order smooth monotone variational inequalities
D Adil, B Bullins, A Jambulapati, S Sachdeva
arXiv preprint arXiv:2205.06167, 2022
152022
Regularized box-simplex games and dynamic decremental bipartite matching
A Jambulapati, Y Jin, A Sidford, K Tian
arXiv preprint arXiv:2204.12721, 2022
142022
Chaining, group leverage score overestimates, and fast spectral hypergraph sparsification
A Jambulapati, YP Liu, A Sidford
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 196-206, 2023
102023
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20