惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
腾讯CDC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Jina AI
Jina AI
N
Netflix TechBlog - Medium
有赞技术团队
有赞技术团队
博客园 - 【当耐特】
MongoDB | Blog
MongoDB | Blog
P
Proofpoint News Feed
L
LangChain Blog
aimingoo的专栏
aimingoo的专栏
GbyAI
GbyAI
B
Blog
F
Fortinet All Blogs
T
Tailwind CSS Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
G
Google Developers Blog
A
About on SuperTechFans
C
Check Point Blog
Microsoft Security Blog
Microsoft Security Blog
MyScale Blog
MyScale Blog
B
Blog RSS Feed

JMLR

Transformers Can Overcome the Curse of Dimensionality: A Theoretical Study from an Approximation Perspective Online Bernstein-von Mises theorem Covariate-dependent Hierarchical Dirichlet Processes DCatalyst: A Unified Accelerated Framework for Decentralized Optimization Boosted Control Functions: Distribution Generalization and Invariance in Confounded Models Contrasting Local and Global Modeling with Machine Learning and Satellite Data: A Case Study Estimating Tree Canopy Height in African Savannas A Symplectic Analysis of Alternating Mirror Descent Two-way Node Popularity Model for Directed and Bipartite Networks Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization Bayesian Inference of Contextual Bandit Policies via Empirical Likelihood A causal fused lasso for interpretable heterogeneous treatment effects estimation Unsupervised Feature Selection via Nonnegative Orthogonal Constrained Regularized Minimization Reparameterized Complex-valued Neurons Can Efficiently Learn More than Real-valued Neurons via Gradient Descent Hierarchical Causal Models Optimizing Attention with Mirror Descent: Generalized Max-Margin Token Selection Adaptive Forward Stepwise: A Method for High Sparsity Regression Optimization and Generalization of Gradient Descent for Shallow ReLU Networks with Minimal Width Finite Neural Networks as Mixtures of Gaussian Processes: From Provable Error Bounds to Prior Selection CHANI: Correlation-based Hawkes Aggregation of Neurons with bio-Inspiration Persistence Diagrams Estimation of Multivariate Piecewise Hölder-continuous Signals Exploring Novel Uncertainty Quantification through Forward Intensity Function Modeling Generative Bayesian Inference with GANs Communication-efficient Distributed Statistical Inference for Massive Data with Heterogeneous Auxiliary Information Decorrelated Local Linear Estimator: Inference for Non-linear Effects in High-dimensional Additive Models Refined Risk Bounds for Unbounded Losses via Transductive Priors A Common Interface for Automatic Differentiation LazyDINO: Fast, Scalable, and Efficiently Amortized Bayesian Inversion via Structure-Exploiting and Surrogate-Driven Measure Transport The Distribution of Ridgeless Least Squares Interpolators Nonparametric Estimation of a Factorizable Density using Diffusion Models Learning Bayesian Network Classifiers to Minimize Class Variable Parameters
The surrogate Gibbs-posterior of a corrected stochastic M...
Sebastian Bi · 2026-01-01 · via JMLR

Sebastian Bieringer, Gregor Kasieczka, Maximilian F. Steffen, Mathias Trabs; 27(1):1−50, 2026.

Abstract

MALA is a popular gradient-based Markov chain Monte Carlo method to access the Gibbs-posterior distribution. Stochastic MALA (sMALA) scales to large data sets, but changes the target distribution from the Gibbs-posterior to a surrogate posterior which only exploits a reduced sample size. We introduce a corrected stochastic MALA (csMALA) with a simple correction term for which distance between the resulting surrogate posterior and the original Gibbs-posterior decreases in the full sample size while retaining scalability. In a nonparametric regression model, we prove a PAC-Bayes oracle inequality for the surrogate posterior. Uncertainties can be quantified by sampling from the surrogate posterior. Focusing on Bayesian neural networks, we analyze the diameter and coverage of credible balls for shallow neural networks and we show optimal contraction rates for deep neural networks. Our credibility result is independent of the correction and can also be applied to the standard Gibbs-posterior. A simulation study in a high-dimensional parameter space demonstrates that an estimator drawn from csMALA based on its surrogate Gibbs-posterior indeed exhibits these advantages in practice.

[abs][pdf][bib]        [code]