Yin Tat Lee
Yin Tat Lee
Paul G. Allen School of Computer Science & Engineering, University of Washington
Verified email at uw.edu - Homepage
Title
Cited by
Cited by
Year
Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow
YT Lee, A Sidford
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 424-433, 2014
254*2014
Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems
YT Lee, A Sidford
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 147-156, 2013
2302013
An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations
JA Kelner, YT Lee, L Orecchia, A Sidford
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
2142014
A faster cutting plane method and its implications for combinatorial and convex optimization
YT Lee, A Sidford, SC Wong
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1049-1065, 2015
1812015
Optimal algorithms for smooth and strongly convex distributed optimization in networks
K Scaman, F Bach, S Bubeck, YT Lee, L Massoulié
international conference on machine learning, 3027-3036, 2017
1782017
Uniform sampling for matrix approximation
MB Cohen, YT Lee, C Musco, C Musco, R Peng, A Sidford
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
1562015
A geometric alternative to Nesterov's accelerated gradient descent
S Bubeck, YT Lee, M Singh
arXiv preprint arXiv:1506.08187, 2015
1252015
Single pass spectral sparsification in dynamic streams
M Kapralov, YT Lee, CN Musco, CP Musco, A Sidford
SIAM Journal on Computing 46 (1), 456-477, 2017
1212017
Adversarial examples from computational constraints
S Bubeck, YT Lee, E Price, I Razenshteyn
International Conference on Machine Learning, 831-840, 2019
1202019
Sparsified cholesky and multigrid solvers for connection laplacians
R Kyng, YT Lee, R Peng, S Sachdeva, DA Spielman
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
108*2016
Solving linear programs in the current matrix multiplication time
MB Cohen, YT Lee, Z Song
Journal of the ACM (JACM) 68 (1), 1-39, 2021
1012021
Optimal algorithms for non-smooth distributed optimization in networks
K Scaman, F Bach, S Bubeck, YT Lee, L Massoulié
arXiv preprint arXiv:1806.00291, 2018
1012018
Kernel-based methods for bandit convex optimization
S Bubeck, YT Lee, R Eldan
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
932017
Efficient Inverse Maintenance and Faster Algorithms for Linear Programming
YT Lee, A Sidford
arXiv preprint arXiv:1503.01752, 2015
932015
A new approach to computing maximum flows using electrical flows
YT Lee, S Rao, N Srivastava
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
912013
Geometric median in nearly linear time
MB Cohen, YT Lee, G Miller, J Pachocki, A Sidford
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
822016
Constructing linear-sized spectral sparsification in almost-linear time
YT Lee, H Sun
SIAM Journal on Computing 47 (6), 2315-2336, 2018
732018
Eldan's Stochastic Localization and the KLS Hyperplane Conjecture: An Improved Lower Bound for Expansion
YT Lee, S Vempala
arXiv preprint arXiv:1612.01507, 2016
602016
An sdp-based algorithm for linear-sized spectral sparsification
YT Lee, H Sun
Proceedings of the 49th annual acm sigact symposium on theory of computing …, 2017
592017
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
YT Lee, SS Vempala
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
522018
The system can't perform the operation now. Try again later.
Articles 1–20