Hierarchical Besov-Laplace priors for spatially inhomogeneous binary classification

Abstract We study nonparametric Bayesian binary classification, in the case where the unknown probability response function is possibly spatially inhomogeneous, for example, being generally flat across the domain but presenting localized sharp variations. We consider a hierarchical procedure based on the Besov-Laplace priors from the inverse problems and imaging literature, with a carefully tuned hyper-prior on the regularity parameter. We show that the resulting posterior distribution concentrates towards the ground truth at optimal rate, automatically adapting to the unknown regularity. To implement posterior inference in practice, we devise an efficient Markov chain Monte Carlo (MCMC) algorithm based on recent ad-hoc dimension-robust methods for Besov-Laplace priors. We then test the considered approach in extensive numerical simulations, where we obtain a solid corroboration of the theoretical results.

Authors

Institutions

Publication Details

Journal
Advances in Data Analysis and Classification
Published
2026-06-25
DOI
https://doi.org/10.1007/s11634-026-00697-2
Primary Topic
Markov Chains and Monte Carlo Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hierarchical Besov-Laplace priors for spatially inhomogeneous binary classification

Patric Dolmeta, Matteo Giordano
Advances in Data Analysis and Classification
Markov Chains and Monte Carlo Methods
article

Hierarchical Besov-Laplace priors for spatially inhomogeneous binary classification

Patric Dolmeta, Matteo Giordano
article en

Abstract

Abstract We study nonparametric Bayesian binary classification, in the case where the unknown probability response function is possibly spatially inhomogeneous, for example, being generally flat across the domain but presenting localized sharp variations. We consider a hierarchical procedure based on the Besov-Laplace priors from the inverse problems and imaging literature, with a carefully tuned hyper-prior on the regularity parameter. We show that the resulting posterior distribution concentrates towards the ground truth at optimal rate, automatically adapting to the unknown regularity. To implement posterior inference in practice, we devise an efficient Markov chain Monte Carlo (MCMC) algorithm based on recent ad-hoc dimension-robust methods for Besov-Laplace priors. We then test the considered approach in extensive numerical simulations, where we obtain a solid corroboration of the theoretical results.

Advances in Data Analysis and Classification
University of Turin (IT)
Università degli Studi di Torino
Openalex Percentile: Top 98%
Markov Chains and Monte Carlo Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Hierarchical Besov-Laplace priors for spatially inhomogeneous binary classification — Patric Dolmeta, Matteo Giordano · Advances in Data Analysis and Classification (2026) | TGRS Research Map | TGRS