Kevin Tian
24 papers · 2017–2025 · 3 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π Interdisciplinary Bridge π Cross-Pollinator (11) π Conference Polyglot (3) π Academic Marathon (8) πΊοΈ Taxonomy Completionist (40)
π§
Keyword Pioneer
π
Cross-Pollinator
(11)
π¬
Deep Specialist
(10)
π§¬
Topic Evolution
π
Century Club
(24)
β‘
Prolific Year
(5)
π₯
Unstoppable
(9)
ποΈ
Keyword Collector
(124)
π
Trend Setter
Conferences
NIPS (14)
COLT (8)
ICML (2)
Top co-authors
Research topics
Keywords
mixing time
(4)
markov chain monte carlo
(3)
convex optimization
(2)
stochastic method
(2)
differential privacy
(2)
gradient descent
(2)
earth mover distance
(2)
generalized linear model
(2)
hamiltonian monte carlo
(2)
sparse recovery
(1)
logistic regression
(1)
principal component analysis
(1)
parameter estimation
(1)
optimal transport
(1)
stochastic gradient
(1)
wasserstein distance
(1)
distributed learning
(1)
semidefinite programming
(1)
dimensionality reduction
(1)
pac learning
(1)
Papers
Spike-and-Slab Posterior Sampling in High Dimensions
COLT 2025
Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
COLT 2024
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
NIPS 2024
Semi-Random Matrix Completion via Flow-Based Adaptive Reweighting
NIPS 2024
Testing Calibration in Nearly-Linear Time
NIPS 2024
Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple Reductions
NIPS 2024
Black-Box k-to-1-PCA Reductions: Theory and Applications
COLT 2024
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling
ICML 2023
Structured Semidefinite Programming for Recovering Structured Preconditioners
NIPS 2023
Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations
NIPS 2023
Semi-Random Sparse Recovery in Nearly-Linear Time
COLT 2023
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler
COLT 2023
Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods
COLT 2022
Robust Regression Revisited: Acceleration and Improved Estimation Rates
NIPS 2021
Structured Logconcave Sampling with a Restricted Gaussian Oracle
COLT 2021
Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions
NIPS 2021
List-Decodable Mean Estimation in Nearly-PCA Time
NIPS 2021
Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlo
COLT 2020
Acceleration with a Ball Optimization Oracle
NIPS 2020
Robust Sub-Gaussian Principal Component Analysis and Width-Independent Schatten Packing
NIPS 2020
Variance Reduction for Matrix Games
NIPS 2019
A Direct tilde{O}(1/epsilon) Iteration Parallel Algorithm for Optimal Transport
NIPS 2019
CoVeR: Learning Covariate-Specific Vector Representations with Tensor Decompositions
ICML 2018
Learning Populations of Parameters
NIPS 2017