Bayesian Learning via Q-Exponential Process
Shuyi Li, Michael O'Connor, and Shiwei Lan

TL;DR
This paper introduces the Q-exponential process, a new stochastic process for Bayesian regularization that generalizes existing models like Gaussian and Besov processes, enabling better modeling of functions with sparsity and sharp features.
Contribution
The work defines the Q-exponential process as a probabilistic model for $L_q$ regularization, providing explicit control over correlation length and extending the Besov process with a flexible prior for functions.
Findings
Q-EP outperforms Gaussian processes in image reconstruction.
Q-EP provides sharper penalties for $q<2$, capturing sparsity.
Demonstrated advantages in inverse problems and functional data modeling.
Abstract
Regularization is one of the most fundamental topics in optimization, statistics and machine learning. To get sparsity in estimating a parameter , an penalty term, , is usually added to the objective function. What is the probabilistic distribution corresponding to such penalty? What is the correct stochastic process corresponding to when we model functions ? This is important for statistically modeling large dimensional objects, e.g. images, with penalty to preserve certainty properties, e.g. edges in the image. In this work, we generalize the -exponential distribution (with density proportional to) to a stochastic process named -exponential (Q-EP) process that corresponds to the regularization of functions. The key step is to specify consistent multivariate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsStatistical Methods and Inference · Advanced Statistical Methods and Models · Advanced Statistical Process Monitoring
