Learning-to-optimize with PAC-Bayesian guarantees: theoretical considerations and practical implementation

MaRDI QIDQ7308316zbMATH OpenFDO

Authors Michael Sucker, Jalal Fadili, Peter Ochs

Publication date 4 August 2026

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://jmlr.org/papers/v26/24-0486.html

Mathematics Subject Classification ID

Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• 10.1162/153244302760200704
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A strongly quasiconvex PAC-Bayesian bound
• Asymptotic evaluation of certain markov process expectations for large time, I
• Concentration inequalities. A nonasymptotic theory of independence
• Convergence of constant step stochastic gradient descent for non-smooth non-convex functions
• Defining the curvature of a statistical problem (with applications to second order efficiency)
• Foundations of modern probability. In 2 volumes
• Generalization bounds: perspectives from information theory and PAC-Bayes
• Graphical convergence of subgradients in nonconvex optimization and learning
• scientific article; zbMATH DE number 5544465 (Why is no real title available?)
• scientific article; zbMATH DE number 3930109 (Why is no real title available?)
• scientific article; zbMATH DE number 2117879 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 7626742 (Why is no real title available?)
• scientific article; zbMATH DE number 6781368 (Why is no real title available?)
• Image Restoration by Iterative Denoising and Backward Projections
• Information and exponential families in statistical theory
• Learnability, stability and uniform convergence
• Lectures on convex optimization
• On the properties of variational approximations of Gibbs posteriors
• Optimal Transport
• Optimization methods for large-scale machine learning
• PAC-Bayes bounds with data dependent priors
• PAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
• PAC-Bayesian stochastic model selection
• Plug-and-Play Unplugged: Optimization-Free Reconstruction Using Consensus Equilibrium
• Regularization by denoising via fixed-point projection (RED-PRO)
• Simpler PAC-Bayesian bounds for hostile data
• Simplified PAC-Bayesian margin bounds.
• Some methods of speeding up the convergence of iteration methods
• Speeding Up MCMC by Efficient Data Subsampling
• Statistical decision theory and Bayesian analysis. 2nd ed
• Statistical learning theory and stochastic optimization. Ecole d'Eté de Probabilitiés de Saint-Flour XXXI -- 2001.
• Stochastic model-based minimization of weakly convex functions
• The Elements of Statistical Learning
• Tighter PAC-Bayes bounds through distribution-dependent priors
• User-friendly Introduction to PAC-Bayes Bounds

This page was built for publication: Learning-to-optimize with PAC-Bayesian guarantees: theoretical considerations and practical implementation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308316)