4 citations · 4 across the 7 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
stat.ML2026
Anchored Stein Variational Gradient Descent Algorithm for Non-smooth Sampling
Thanh Dang, Matthew X. Burns, Jiaming Liang
We introduce a Stein variational framework for sampling from a target density when the target potential is possibly non-smooth. The key idea is to introduce a…
math.OC2026
Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging
Matthew X. Burns, Jiaming Liang
Many works in convex optimization provide rates for achieving a small primal gap. However, this quantity is typically unavailable in practice. In this work, we show that solving a…
math.OC2026
Improved Analysis of Restarted Accelerated Gradient and Augmented Lagrangian Methods via Inexact Proximal Point Frameworks
Matthew X. Burns, Jiaming Liang
This paper studies a class of double-loop (inner-outer) algorithms for convex composite optimization. For unconstrained problems, we develop a restarted accelerated composite gradi…