AI & ML
Random tree Besov priors: Data-driven regularisation parameter selection
arXiv stat.TH0 views
arXiv:2601.12957v2 Announce Type: replace Abstract: We develop a data-driven algorithm for automatically selecting the wavelet density parameters in Bayesian inversion under random tree Besov priors. One of the key challenges in Bayesian inversion is the construction of priors that are both expressive and computationally feasible. Random tree Besov priors, introduced in \cite{Kekkonen2023}, provide a flexible framework for capturing local regularity properties and sparsity patterns in a wavelet basis. In this paper, we extend this approach by introducing a hierarchical model that enables data-driven selection of the wavelet density parameter, allowing the regularisation strength to adapt across scales while retaining computational efficiency. We focus on nonparametric regression and also present preliminary plug-and-play results for a deconvolution problem.
Source:https://arxiv.org/abs/2601.12957PreviousDo we really need the Rademacher complexities?NextMinimax Optimal Estimation of Transport-Growth Pairs in Unbalanced Optimal Transport
Related posts
I wanted one screen that said whether a kids' app was worth installing
0dev.to

Before I Could Build GPT, I Had to Teach a Machine to Learn
0dev.to
Cogent and OpenAI build cyber defense factories for enterprises
0OpenAI Blog
ChatGPT Plus for veterans and servicemembers
0OpenAI Blog
Hitting 200 Strokes: What the Signature Maker Does at Its Stroke Limit
0dev.to
A Lightweight, Open-Source Network Digital Twin Blueprint for IoT-Edge Environments
0arXiv cs.NI