Stratis Skoulakis
20 papers · 2016–2025 · 6 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π Academic Marathon (9) π Interdisciplinary Bridge π§ Keyword Pioneer π Conference Polyglot (6) π Cross-Pollinator (8)
π
Renaissance Researcher
(5)
πΊοΈ
Taxonomy Completionist
(27)
π
Interdisciplinary Bridge
π
Grand Slam
π€
Dynamic Duo
(11)
β‘
Prolific Year
(6)
ποΈ
Keyword Collector
(73)
π₯
Unstoppable
(7)
π
Century Club
(20)
Conferences
NIPS (8)
ICML (6)
AAAI (2)
IJCAI (2)
COLT (1)
ICLR (1)
Top co-authors
Keywords
regret bound
(4)
nash equilibrium
(3)
online learning
(3)
online algorithm
(2)
game theory
(2)
zero-sum game
(2)
facility location
(2)
online clustering
(2)
gradient descent
(2)
non-convex optimization
(1)
network analysis
(1)
stochastic gradient descent
(1)
dynamic programming
(1)
graph theory
(1)
online linear optimization
(1)
nonconvex optimization
(1)
dynamic clustering
(1)
graph optimization
(1)
oracle complexity
(1)
linear programming
(1)
Papers
Best of Both Worlds: Regret Minimization versus Minimax Play
ICML 2025
Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games
ICML 2025
Efficient Continual Finite-Sum Minimization
ICLR 2024
Learning to Remove Cuts in Integer Linear Programming
ICML 2024
Imitation Learning in Discounted Linear MDPs without exploration assumptions
ICML 2024
Efficient Online Clustering with Moving Costs
NIPS 2023
Exponential Lower Bounds for Fictitious Play in Potential Games
NIPS 2023
Maximum Independent Set: Self-Training through Dynamic Programming
NIPS 2023
STay-ON-the-Ridge: Guaranteed Convergence to Local Minimax Equilibrium in Nonconvex-Nonconcave Games
COLT 2023
Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees.
ICML 2023
Alternation makes the adversary weaker in two-player games
NIPS 2023
Adaptive Stochastic Variance Reduction for Non-convex Finite-Sum Minimization
NIPS 2022
Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update
NIPS 2022
Online Learning in Periodic Zero-Sum Games
NIPS 2021
Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries
AAAI 2021
Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games
AAAI 2021
Efficient Online Learning for Dynamic k-Clustering
ICML 2021
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent
NIPS 2020
Reallocating Multiple Facilities on the Line
IJCAI 2019
Opinion Dynamics with Local Interactions
IJCAI 2016