Cover Image

Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghaderi, Susan, Kabgani, Alireza, Moreau, Yves, Ahookhosh, Masoud
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
by: Kabgani, Alireza, et al.
Published: (2026)

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
by: Ahookhosh, Masoud, et al.
Published: (2025)

On fundamental properties of high-order forward-backward envelope
by: Kabgani, Alireza, et al.
Published: (2025)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Asymptotic Convergence Analysis of High-Order Proximal-Point Methods Beyond Sublinear Rates
by: Ahookhosh, Masoud, et al.
Published: (2025)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, et al.
Published: (2025)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
by: Ahookhosh, Masoud, et al.
Published: (2026)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
by: Jiang, Bo, et al.
Published: (2025)

The Performance Of The Unadjusted Langevin Algorithm Without Smoothness Assumptions
by: Johnston, Tim, et al.
Published: (2025)

Inexact Levenberg-Marquardt methods under Hölder metric subregularity
by: Symoens, Bas, et al.
Published: (2025)

Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks
by: Lim, Dong-Young, et al.
Published: (2021)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)

Inexact Zeroth-Order Nonsmooth and Nonconvex Stochastic Composite Optimization and Applications
by: Pougkakiotis, Spyridon, et al.
Published: (2025)

A Unified Inexact Stochastic ADMM for Composite Nonconvex and Nonsmooth Optimization
by: Zeng, Yuxuan, et al.
Published: (2024)

Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
by: Le, Ba Khiet, et al.
Published: (2026)

A New Inexact Manifold Proximal Linear Algorithm with Adaptive Stopping Criteria
by: Zheng, Zhong, et al.
Published: (2025)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

A Gradient Sampling Algorithm for Noisy Nonsmooth Optimization
by: Berahas, Albert S., et al.
Published: (2026)

Proximal Interacting Particle Langevin Algorithms
by: Encinar, Paula Cordero, et al.
Published: (2024)

The Stochastic Multi-Proximal Method for Nonsmooth Optimization
by: Condat, Laurent, et al.
Published: (2025)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)

An Inexact Variable Metric Proximal Gradient-subgradient Algorithm for a Class of Fractional Optimization Problems
by: Yang, Lei, et al.
Published: (2025)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
by: Xu, Meng, et al.
Published: (2024)

A Monte Carlo Approach for Nonsmooth Convex Optimization via Proximal Splitting Algorithms
by: Di, Nicholas, et al.
Published: (2025)

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
by: Bello-Cruz, Yunier, et al.
Published: (2024)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
by: Liu, Shanglin, et al.
Published: (2024)

Inexact Accelerated Proximal Gradient Method Revisit: An Economical Variant via Shadow Points
by: Yang, Lei, et al.
Published: (2025)

An Inexact Weighted Proximal Trust-Region Method
by: Maia, Leandro Farias, et al.
Published: (2026)

OFF (Proximal) Newton-type Methods with Inexact Derivatives for Unconstrained Optimization
by: Zhu, Hong
Published: (2025)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

Smoothing Accelerated Proximal Gradient Method with Backtracking for Nonsmooth Multiobjective Optimization
by: Chengzhi, Huang
Published: (2025)

An Adaptive Proximal Point Method for Nonsmooth and Nonconvex Optimization on Hadamard Manifolds
by: Amaral, Vitaliano S., et al.
Published: (2025)

Continuation Method for Nonsmooth Model Predictive Control Using Proximal Technique
by: Shima, Ryotaro, et al.
Published: (2024)

Improved Analysis of Restarted Accelerated Gradient and Augmented Lagrangian Methods via Inexact Proximal Point Frameworks
by: Burns, Matthew X., et al.
Published: (2026)