Yang, Tianbao
155 publications
TMLR
2026
Single-Loop Algorithms for Stochastic Non-Convex Optimization with Weakly-Convex Constraints
TMLR
2025
AutoTrust: Benchmarking Trustworthiness in Large Vision Language Models for Autonomous Driving
ICML
2025
Model Steering: Learning with a Reference Model Improves Generalization Bounds and Scaling Laws
NeurIPS
2025
Stochastic Momentum Methods for Non-Smooth Non-Convex Finite-Sum Coupled Compositional Optimization
NeurIPSW
2024
Model Developmental Safety: A Safety-Centric Method and Applications in Vision-Language Models
NeurIPS
2024
Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
NeurIPS
2023
Maximization of Average Precision for Deep Learning with Adversarial Ranking Robustness
ICML
2022
Large-Scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergence
NeurIPS
2022
Multi-Block Min-Max Bilevel Optimization with Applications in Multi-Task Deep AUC Maximization
NeurIPS
2022
Multi-Block-Single-Probe Variance Reduced Estimator for Coupled Compositional Optimization
ICML
2022
When AUC Meets DRO: Optimizing Partial AUC for Deep Learning with Non-Convex Convergence Guarantee
NeurIPS
2021
An Online Method for a Class of Distributionally Robust Optimization with Non-Convex Objectives
ICML
2021
Federated Deep AUC Maximization for Hetergeneous Data with a Constant Communication Complexity
NeurIPS
2021
Stochastic Optimization of Areas Under Precision-Recall Curves with Provable Convergence
ICLR
2020
Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets
NeurIPS
2019
Non-Asymptotic Analysis of Stochastic Methods for Non-Smooth Non-Convex Regularized Problems
IJCAI
2019
On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Minimization
ICLR
2019
Universal Stagewise Learning for Non-Convex Problems with Convergence on Averaged Solutions
AISTATS
2018
A Simple Analysis for Exp-Concave Empirical Minimization with Arbitrary Convex Regularizer
NeurIPS
2018
First-Order Stochastic Algorithms for Escaping from Saddle Points in Almost Linear Time
ICML
2017
A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates
NeurIPS
2017
ADMM Without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization
NeurIPS
2017
Adaptive Accelerated Gradient Converging Method Under H\"olderian Error Bound Condition
JMLR
2017
Distributed Stochastic Variance Reduced Gradient Methods by Sampling Extra Data with Replacement
AISTATS
2014
Efficient Low-Rank Stochastic Gradient Descent Methods for Solving Semidefinite Programs
NeurIPS
2014
Extracting Certainty from Uncertainty: Transductive Pairwise Classification from Pairwise Similarities
NeurIPS
2012
Semi-Crowdsourced Clustering: Generalizing Crowd Labeling by Robust Distance Metric Learning