Tengyuan Liang
12 papers · 2015–2024 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
π Interdisciplinary Bridge π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (11) π Conference Polyglot (4) π Academic Marathon (9)
π
Cross-Pollinator
(7)
π
Interdisciplinary Bridge
π
Century Club
(12)
ποΈ
Keyword Collector
(66)
π
Trend Setter
π₯
Unstoppable
(8)
Conferences
COLT (5)
JMLR (4)
AISTATS (2)
ICML (1)
Top co-authors
Keywords
statistical learning
(3)
generative adversarial network
(2)
generalization bound
(2)
empirical risk minimization
(2)
non-convex optimization
(2)
online learning
(2)
convex optimization
(1)
nash equilibrium
(1)
stochastic optimization
(1)
equilibrium learning
(1)
excess risk
(1)
community detection
(1)
covariate shift
(1)
reproducing kernel hilbert space
(1)
rademacher complexity
(1)
optimal transport
(1)
generalization error
(1)
mean-field approximation
(1)
simulated annealing
(1)
feature selection
(1)
Papers
Blessings and Curses of Covariate Shifts: Adversarial Learning Dynamics, Directional Convergence, and Equilibria
JMLR 2024
Interpolating Classifiers Make Few Mistakes
JMLR 2023
Online Learning to Transport via the Minimal Selection Principle
COLT 2022
How Well Generative Adversarial Networks Learn Distributions
JMLR 2021
On the Multiple Descent of Minimum-Norm Interpolants and Restricted Lower Isometry of Kernels
COLT 2020
Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information
JMLR 2020
Fisher-Rao Metric, Geometry, and Complexity of Neural Networks
AISTATS 2019
Interaction Matters: A Note on Non-asymptotic Local Convergence of Generative Adversarial Networks
AISTATS 2019
Local Optimality and Generalization Guarantees for the Langevin Algorithm via Empirical Metastability
COLT 2018
Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP
ICML 2017
Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functions
COLT 2015
Learning with Square Loss: Localization through Offset Rademacher Complexity
COLT 2015