Seguir
Tianyi Lin
Título
Citado por
Citado por
Año
On gradient descent ascent for nonconvex-concave minimax problems
T Lin, C Jin, M Jordan
International Conference on Machine Learning, 6083-6093, 2020
2142020
On the global linear convergence of the ADMM with multiblock variables
T Lin, S Ma, S Zhang
SIAM Journal on Optimization 25 (3), 1478-1497, 2015
1582015
The dual-sparse topic model: mining focused topics and focused terms in short text
T Lin, W Tian, Q Mei, H Cheng
Proceedings of the 23rd International Conference on World Wide Web, 539-550, 2014
1202014
Near-optimal algorithms for minimax optimization
T Lin, C Jin, MI Jordan
Conference on Learning Theory, 2738-2779, 2020
1172020
On the sublinear convergence rate of multi-block ADMM
TY Lin, SQ Ma, SZ Zhang
Journal of the Operations Research Society of China 3 (3), 251-274, 2015
111*2015
Distributed linearized alternating direction method of multipliers for composite convex consensus optimization
NS Aybat, Z Wang, T Lin, S Ma
IEEE Transactions on Automatic Control 63 (1), 5-20, 2017
1032017
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
B Jiang, T Lin, S Ma, S Zhang
Computational Optimization and Applications 72 (1), 115-157, 2019
1012019
On efficient optimal transport: An analysis of greedy and accelerated mirror descent algorithms
T Lin, N Ho, MI Jordan
Proceedings of the 36th International Conference on Machine Learning, 3982-3991, 2019
872019
Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
T Lin, S Ma, S Zhang
Journal of Scientific Computing 69 (1), 52-81, 2016
642016
Collaborative filtering incorporating review text and co-clusters of hidden user communities and item groups
Y Xu, W Lam, T Lin
Proceedings of the 23rd ACM International Conference on Conference on …, 2014
472014
An extragradient-based alternating direction method for convex minimization
T Lin, S Ma, S Zhang
Foundations of Computational Mathematics 17 (1), 35-59, 2017
452017
Fixed-support Wasserstein barycenters: Computational hardness and fast algorithm
T Lin, N Ho, X Chen, M Cuturi, M Jordan
Advances in Neural Information Processing Systems 33, 2020
40*2020
Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
T Lin, S Ma, S Zhang
Journal of Scientific Computing 76 (1), 69-88, 2018
372018
On the complexity of approximating multimarginal optimal transport
T Lin, N Ho, M Cuturi, MI Jordan
Journal of Machine Learning Research 23 (65), 1-43, 2022
322022
Relaxed Wasserstein with applications to GANs
X Guo, J Hong, T Lin, N Yang
ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and …, 2021
302021
On the efficiency of entropic regularized algorithms for optimal transport
T Lin, N Ho, MI Jordan
arXiv preprint arXiv:1906.01437, 2019
28*2019
A unified adaptive tensor approximation scheme to accelerate composite convex optimization
B Jiang, T Lin, S Zhang
SIAM Journal on Optimization 30 (4), 2897-2926, 2020
27*2020
Projection robust Wasserstein distance and Riemannian optimization
T Lin, C Fan, N Ho, M Cuturi, M Jordan
Advances in Neural Information Processing Systems 33, 2020
242020
On projection robust optimal transport: Sample complexity and model misspecification
T Lin, Z Zheng, E Chen, M Cuturi, M Jordan
International Conference on Artificial Intelligence and Statistics, 262-270, 2021
232021
Finite-time last-iterate convergence for multi-agent learning in games
T Lin, Z Zhou, P Mertikopoulos, MI Jordan
International Conference on Machine Learning, 6161-6171, 2020
232020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20