Luo Luo
34 papers · 2015–2026 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
π Interdisciplinary Bridge π Conference Polyglot (7) π§ Keyword Pioneer π£ Hot Topic Early Bird π Academic Marathon (10)
πΊοΈ
Taxonomy Completionist
(31)
π£
Hot Topic Early Bird
π
Interdisciplinary Bridge
π§¬
Topic Evolution
π¬
Deep Specialist
(20)
π
Keyword Champion
(2)
π€
Dynamic Duo
(10)
ποΈ
Keyword Collector
(116)
π
Trend Setter
π
Century Club
(32)
π₯
Unstoppable
(7)
β‘
Prolific Year
(10)
Conferences
NIPS (10)
ICML (8)
AAAI (6)
JMLR (6)
IJCAI (2)
AISTATS (1)
COLT (1)
Top co-authors
Keywords
stochastic optimization
(9)
minimax optimization
(7)
decentralized optimization
(5)
variance reduction
(5)
nonconvex optimization
(5)
superlinear convergence
(4)
convex optimization
(3)
quasi-newton method
(3)
distributed learning
(3)
stochastic gradient
(3)
gradient-free method
(3)
communication complexity
(3)
iteration complexity
(2)
complexity bound
(2)
matrix sketching
(2)
regret bound
(2)
gradient descent
(2)
online learning
(2)
distributed optimization
(2)
hessian approximation
(2)
Papers
Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance
AAAI 2026
Privacy Leaks by Adversaries: Adversarial Iterations for Membership Inference Attack
AAAI 2026
Solving Convex-Concave Problems with $\mathcal{O}(\epsilon^{-4/7})$ Second-Order Oracle Complexity
COLT 2025
An Enhanced Levenberg--Marquardt Method via Gram Reduction
AAAI 2025
A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
ICML 2025
Zeroth-Order Methods for Constrained Nonconvex Nonsmooth Stochastic Optimization
ICML 2024
Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
JMLR 2024
Optimizing over Multiple Distributions under Generalized Quasar-Convexity Condition
NIPS 2024
Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity
NIPS 2024
Gradient-Free Methods for Nonconvex Nonsmooth Stochastic Compositional Optimization
NIPS 2024
Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
AAAI 2024
Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization
AAAI 2024
An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
AISTATS 2024
On the Complexity of Finite-Sum Smooth Optimization under the PolyakβΕojasiewicz Condition
ICML 2024
Decentralized Convex Finite-Sum Optimization with Better Dependence on Condition Numbers
ICML 2024
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
ICML 2023
Block Broyden's Methods for Solving Nonlinear Equations
NIPS 2023
Multi-Consensus Decentralized Accelerated Gradient Descent
JMLR 2023
Faster Stochastic Algorithms for Minimax Optimization under Polyak-{\L}ojasiewicz Condition
NIPS 2022
Quasi-Newton Methods for Saddle Point Problems
NIPS 2022
Finding Second-Order Stationary Points in Nonconvex-Strongly-Concave Minimax Optimization
NIPS 2022
Approximate Newton Methods
JMLR 2021
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices
AAAI 2021
Efficient Projection-free Algorithms for Saddle Point Problems
NIPS 2020
Decentralized Accelerated Proximal Gradient Descent
NIPS 2020
Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems
NIPS 2020
Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems
ICML 2020
Efficient and Robust High-Dimensional Linear Contextual Bandits
IJCAI 2020
Nesterov's Acceleration for Approximate Newton
JMLR 2020
Robust Frequent Directions with Application in Online Learning
JMLR 2019
Approximate Newton Methods and Their Local Convergence
ICML 2017
SPSD Matrix Approximation vis Column Selection: Theories, Algorithms, and Extensions
JMLR 2016
Frequent Direction Algorithms for Approximate Matrix Multiplication with Applications in CCA
IJCAI 2016
Support Matrix Machines
ICML 2015