Tianyi Lin
20 papers · 2019–2025 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
🗺️ Taxonomy Completionist (33) 🏃 Academic Marathon · Sprint 🌍 Conference Polyglot · Silver 🌉 Interdisciplinary Bridge · Bronze 🐣 Hot Topic Early Bird
🔬
Deep Specialist
(15)
🤝
Dynamic Duo
(10)
🧬
Topic Evolution
🏆
Keyword Champion
(3)
⚡
Prolific Year · Productive
🔥
Unstoppable · Bronze
💎
Century Club · Bronze
🗃️
Keyword Collector
(100)
Top co-authors
Research topics
Mathematics & Optimization
(17)
Optimization
(17)
Machine Learning
(16)
Optimization & Theory · Machine Learning
(15)
Mathematics
(6)
Deep Learning
(4)
Artificial Intelligence
(3)
Core AI
(3)
Application Areas
(2)
Learning Types
(2)
Optimization & Theory · Deep Learning
(2)
Natural Language Processing
(1)
Applications
(1)
Architectures
(1)
Core Methods
(1)
Keywords
optimal transport
(7)
non-convex optimization
(4)
first-order algorithm
(3)
wasserstein distance
(3)
convex optimization
(3)
gradient descent ascent
(3)
nash equilibrium
(3)
minimax optimization
(3)
entropic regularization
(3)
sinkhorn algorithm
(3)
probability measure
(3)
stochastic optimization
(2)
min-max optimization
(2)
interior point method
(2)
iteration complexity
(2)
game theory
(2)
nonsmooth optimization
(2)
complexity bound
(2)
stationary point
(2)
computational complexity
(1)
Papers
Positional Bias in Long-Document Ranking: Impact, Assessment, and Mitigation
IJCNLP 2025
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
JMLR 2025
A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport
AISTATS 2024
Deterministic Nonsmooth Nonconvex Optimization
COLT 2023
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems
JMLR 2023
Accelerating Adaptive Cubic Regularization of Newton's Method via Random Sampling
JMLR 2022
Fast Distributionally Robust Learning with Variance-Reduced Min-Max Optimization
AISTATS 2022
First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces
NeurIPS 2022
Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization
NeurIPS 2022
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
ICML 2022
On Structured Filtering-Clustering: Global Error Bound and Optimal First-Order Algorithms
AISTATS 2022
On the Complexity of Approximating Multimarginal Optimal Transport
JMLR 2022
On the Efficiency of Entropic Regularized Algorithms for Optimal Transport
JMLR 2022
On Projection Robust Optimal Transport: Sample Complexity and Model Misspecification
AISTATS 2021
Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games
ICML 2020
Fixed-Support Wasserstein Barycenters: Computational Hardness and Fast Algorithm
NeurIPS 2020
Near-Optimal Algorithms for Minimax Optimization
COLT 2020
On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
ICML 2020
Projection Robust Wasserstein Distance and Riemannian Optimization
NeurIPS 2020
On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms
ICML 2019