Kevin T. Tian

From MaRDI portal
(Redirected from Kevin T. Tian)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
(available as arXiv preprint)
N/APaper
Eulerian graph sparsification by effective resistance decomposition2026-07-03Paper
Relative Lipschitzness in extragradient methods and a direct recipe for acceleration2026-04-15Paper
Perspectives on Stochastic Localization
(available as arXiv preprint)
2026-01-01Paper
Functional Stochastic Localization
(available as arXiv preprint)
2026-01-01Paper
High-Magnetization Sampling at Low Temperatures: Ising Models and Bayesian Sparse Linear Regression
(available as arXiv preprint)
2026-01-01Paper
Matrix completion in almost-verification time2025-08-15Paper
Resqueing parallel and private stochastic convex optimization2025-08-15Paper
Coordinate methods for matrix games2025-08-12Paper
Coordinate methods for accelerating regression and faster approximate maximum flow2025-08-12Paper
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
(available as arXiv preprint)
2025-01-01Paper
Linear-sized sparsifiers via near-linear time discrepancy theory2024-11-28Paper
Semi-streaming bipartite matching in fewer passes and optimal space2024-07-19Paper
Regularized box-simplex games and dynamic decremental bipartite matching2024-06-24Paper
A CS guide to the quantum singular value transformation2024-05-29Paper
Clustering mixture models in almost-linear time via list-decodable mean estimation
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations2023-03-27Paper
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler2023-02-12Paper
The search for leakage-free entangling Fibonacci braiding gates
Journal of Physics A: Mathematical and Theoretical
2023-01-04Paper
Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations
(available as arXiv preprint)
2023-01-01Paper
Private Convex Optimization in General Norms2022-07-17Paper
Positive semidefinite programming: mixed, parallel, and width-independent
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
2021-01-19Paper
Haah codes on general three-manifolds
Annals of Physics
2020-03-16Paper
Haah codes on general three-manifolds
Annals of Physics
2020-03-16Paper
Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent
(available as arXiv preprint)
2020-02-12Paper
Locating errors in faulty formulas
ACM Transactions on Algorithms
2019-11-25Paper
On the complexity of shortest path problems on discounted cost graphs
Language and Automata Theory and Applications
2013-03-18Paper


Research outcomes over time


This page was built for person: Kevin T. Tian