Andrew Lamperski
6 papers · 2018–2026 · 5 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 ↓+1 more ↓ Show less ↑
π Conference Polyglot Β· Silver π Academic Marathon Β· Sprint π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (11) π£ Hot Topic Early Bird
π₯
Unstoppable Β· Bronze
Venues
Top co-authors
Research topics
Keywords
non-convex optimization
(3)
stochastic optimization
(2)
markov chain monte carlo
(2)
online learning
(2)
langevin algorithm
(2)
regret bound
(2)
stochastic gradient descent
(2)
forgetting factor
(1)
constrained sampling
(1)
sublinear regret
(1)
strongly convex function
(1)
variance minimization
(1)
stochastic method
(1)
constraint violation
(1)
high probability bound
(1)
adaptive regret
(1)
convex objective
(1)
cumulative constraint violation
(1)
goldstein subdifferential
(1)
constrained langevin algorithm
(1)
Papers
Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential
ALT 2026
Constrained Langevin Algorithms with L-mixing External Random Variables
NeurIPS 2022
Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learning
COLT 2021
Trading-Off Static and Dynamic Regret in Online Least-Squares and Beyond
AAAI 2020
Online Adaptive Principal Component Analysis and Its extensions
ICML 2019
Online convex optimization for cumulative constraints
NeurIPS 2018