Yin Tat Lee

University of Michigan–Ann Arbor — United States

Computer Science · Physical Sciences

28h-index3.3kcitations175works17.22yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(63), Stochastic Gradient Optimization Techniques(56), Sparse and Compressive Sensing Techniques(44), Advanced Optimization Algorithms Research(37), Markov Chains and Monte Carlo Methods(31)

Publications175 total

Early science acceleration experiments with GPT-5
arXiv (Cornell University)·2025Open Access
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
TheoretiCS·2025Open Access
Pseudo-Asynchronous Local SGD: Robust and Efficient Data-Parallel Training
arXiv (Cornell University)·2025Open Access
Finding Small Dijoins in Transitive Closure Time
arXiv (Cornell University)·2025Open Access
Improving the Bit Complexity of Communication for Distributed Convex Optimization
2024· 1 citedOpen Access
Eldan's stochastic localization and the KLS conjecture: Isoperimetry, concentration and mixing
Annals of Mathematics·2024· 6 cited
Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phone
arXiv (Cornell University)·2024· 143 citedOpen Access
Improving the Bit Complexity of Communication for Distributed Convex Optimization
arXiv (Cornell University)·2024Open Access
Numerical Composition of Differential Privacy
Journal of Privacy and Confidentiality·2024· 32 citedOpen Access
Private Convex Optimization via Exponential Mechanism
Journal of Privacy and Confidentiality·2024· 5 citedOpen Access
Convex Minimization with Integer Minima in <i>Õ</i>(<i>n</i><sup>4</sup>) Time
Society for Industrial and Applied Mathematics eBooks·2024· 2 cited
ReSQueing Parallel and Private Stochastic Convex Optimization
2023
Short-step methods are not strongly polynomial-time
Mathematical Programming·2023· 3 cited
MathChat: Converse to Tackle Challenging Math Problems with LLM Agents
arXiv (Cornell University)·2023· 15 citedOpen Access
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
2023· 7 cited
Convex Minimization with Integer Minima in $\widetilde O(n^4)$ Time
arXiv (Cornell University)·2023Open Access
$k$NN-Adapter: Efficient Domain Adaptation for Black-Box Language Models
arXiv (Cornell University)·2023· 4 citedOpen Access
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
arXiv (Cornell University)·2023· 1 citedOpen Access
Competitively Chasing Convex Bodies
SIAM Journal on Computing·2023· 2 cited
Private Convex Optimization in General Norms
Society for Industrial and Applied Mathematics eBooks·2023· 3 cited
page 1 of 9Next →

Frequent Co-authors

Sébastien Bubeck(12), Aaron Sidford(11), Zhao Song(9), Michael B. Cohen(5), Yuanzhi Li(5), Aaron Sidford(4), Santosh Vempala(4), Laurent Massoulié(3), Lorenzo Orecchia(3), Ronen Eldan(3), Richard Peng(3), He Sun(3), Jan van den Brand(3), Sam Chiu-wai Wong(3), Francis Bach(2), Jonathan A. Kelner(2), Daniel A. Spielman(2), Kevin Scaman(2), Nikhil Srivastava(2), Haotian Jiang(2)