Tianyi Lin

Orcid: 0000-0002-5323-1852

According to our database1, Tianyi Lin authored at least 54 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems.
J. Mach. Learn. Res., 2023

A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport.
CoRR, 2023

Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback.
CoRR, 2023

Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds.
CoRR, 2023

PPO-Based Energy-Efficient Power Control and Spectrum Allocation in In-Vehicle HetNets.
Proceedings of the IEEE Global Communications Conference, 2023

Deterministic Nonsmooth Nonconvex Optimization.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
A control-theoretic perspective on optimal high-order optimization.
Math. Program., 2022

On the Efficiency of Entropic Regularized Algorithms for Optimal Transport.
J. Mach. Learn. Res., 2022

On the Complexity of Approximating Multimarginal Optimal Transport.
J. Mach. Learn. Res., 2022

Accelerating Adaptive Cubic Regularization of Newton's Method via Random Sampling.
J. Mach. Learn. Res., 2022

Explicit Second-Order Min-Max Optimization Methods with Optimal Convergence Guarantee.
CoRR, 2022

On the Complexity of Deterministic Nonsmooth and Nonconvex Optimization.
CoRR, 2022

Understanding Performance of Long-Document Ranking Models through Comprehensive Evaluation and Leaderboarding.
CoRR, 2022

A Continuous-Time Perspective on Monotone Equation Problems.
CoRR, 2022

Perseus: A Simple High-Order Regularization Method for Variational Inequalities.
CoRR, 2022

Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback.
Proceedings of the International Conference on Machine Learning, 2022

Fast Distributionally Robust Learning with Variance-Reduced Min-Max Optimization.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

On Structured Filtering-Clustering: Global Error Bound and Optimal First-Order Algorithms.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
An ADMM-based interior-point method for large-scale linear programming.
Optim. Methods Softw., 2021

Optimal No-Regret Learning in Strongly Monotone Games with Bandit Feedback.
CoRR, 2021

On Monotone Inclusions, Acceleration and Closed-Loop Control.
CoRR, 2021

Relaxed Wasserstein with Applications to GANs.
Proceedings of the IEEE International Conference on Acoustics, 2021

A Variational Inequality Approach to Bayesian Regression Games.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

On Projection Robust Optimal Transport: Sample Complexity and Model Misspecification.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
A Unified Adaptive Tensor Approximation Scheme to Accelerate Composite Convex Optimization.
SIAM J. Optim., 2020

Revisiting Fixed Support Wasserstein Barycenter: Computational Hardness and Efficient Algorithms.
CoRR, 2020

Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Projection Robust Wasserstein Distance and Riemannian Optimization.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games.
Proceedings of the 37th International Conference on Machine Learning, 2020

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems.
Proceedings of the 37th International Conference on Machine Learning, 2020

Near-Optimal Algorithms for Minimax Optimization.
Proceedings of the Conference on Learning Theory, 2020

New Proximal Newton-Type Methods for Convex Optimization.
Proceedings of the 59th IEEE Conference on Decision and Control, 2020

Improved Sample Complexity for Stochastic Compositional Variance Reduced Gradient.
Proceedings of the 2020 American Control Conference, 2020

2019
On the Acceleration of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport.
CoRR, 2019

Global Error Bounds and Linear Convergence for Gradient-Based Algorithms for Trend Filtering and 𝓁<sub>1</sub>-Convex Clustering.
CoRR, 2019

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis.
Comput. Optim. Appl., 2019

Sparsemax and Relaxed Wasserstein for Topic Sparsity.
Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, 2019

On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization.
IEEE Trans. Autom. Control., 2018

Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems.
J. Sci. Comput., 2018

On the iteration complexity analysis of Stochastic Primal-Dual Hybrid Gradient approach with high probability.
Neurocomputing, 2018

Stochastic Primal-Dual Proximal ExtraGradient descent for compositely regularized optimization.
Neurocomputing, 2018

Improved Oracle Complexity for Stochastic Compositional Variance Reduced Gradient.
CoRR, 2018

2017
Exploiting interactions of review text, hidden user communities and item groups, and time for collaborative filtering.
Knowl. Inf. Syst., 2017

An Extragradient-Based Alternating Direction Method for Convex Minimization.
Found. Comput. Math., 2017

2016
Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity.
J. Sci. Comput., 2016

On Stochastic Primal-Dual Hybrid Gradient Approach for Compositely Regularized Minimization.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Understanding Sparse Topical Structure of Short Text via Stochastic Variational-Gibbs Inference.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
On the Global Linear Convergence of the ADMM with MultiBlock Variables.
SIAM J. Optim., 2015

2014
The dual-sparse topic model: mining focused topics and focused terms in short text.
Proceedings of the 23rd International World Wide Web Conference, 2014

Latent Aspect Mining via Exploring Sparsity and Intrinsic Information.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

Collaborative Filtering Incorporating Review Text and Co-clusters of Hidden User Communities and Item Groups.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014


  Loading...