Xiao-Tong Yuan
16 papers · 2013–2024 · 9 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
🌍 Conference Polyglot (9) 🏃 Academic Marathon (11) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🐣 Hot Topic Early Bird
🌍
Conference Polyglot
(9)
🏃
Academic Marathon
(11)
🐝
Cross-Pollinator
(10)
🏆
Keyword Champion
(2)
🗃️
Keyword Collector
(79)
💎
Century Club
(16)
🔥
Unstoppable
(5)
📈
Trend Setter
⚡
Prolific Year
(5)
Conferences
JMLR (5)
AISTATS (2)
CVPR (2)
ICML (2)
AAAI (1)
COLT (1)
ECCV (1)
ICCV (1)
UAI (1)
Top co-authors
Keywords
convex optimization
(4)
sparse recovery
(4)
compressed sensing
(3)
gradient descent
(2)
sparsity-constrained optimization
(2)
cardinality constraint
(2)
iterative hard thresholding
(2)
dual optimization
(2)
hard thresholding
(2)
non-convex optimization
(2)
newton method
(2)
minibatch optimization
(2)
greedy algorithm
(2)
duality theory
(2)
logistic regression
(1)
compressive sensing
(1)
contrastive learning
(1)
principal component analysis
(1)
stochastic optimization
(1)
convergence analysis
(1)
Papers
Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery
AAAI 2024
Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviation
JMLR 2023
Task similarity aware meta learning: theory-inspired improvement on MAML
UAI 2021
DeepACG: Co-Saliency Detection via Semantic-Aware Contrast Gromov-Wasserstein Distance
CVPR 2021
On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond
JMLR 2020
Meta-Learning with Network Pruning
ECCV 2020
Hybrid Stochastic-Deterministic Minibatch Proximal Gradient: Less-Than-Single-Pass Optimization with Nearly Optimal Generalization
ICML 2020
Nearly Non-Expansive Bounds for Mahalanobis Hard Thresholding
COLT 2020
Dual Iterative Hard Thresholding
JMLR 2020
Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds
AISTATS 2019
Distributed Inexact Newton-type Pursuit for Non-convex Sparse Learning
AISTATS 2019
Gradient Hard Thresholding Pursuit
JMLR 2018
Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization
ICML 2017
Additive Nearest Neighbor Feature Maps
ICCV 2015
Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization
CVPR 2014
Truncated Power Method for Sparse Eigenvalue Problems
JMLR 2013