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

推荐订阅源

月光博客
月光博客
D
Docker
腾讯CDC
J
Java Code Geeks
大猫的无限游戏
大猫的无限游戏
The Cloudflare Blog
Martin Fowler
Martin Fowler
MongoDB | Blog
MongoDB | Blog
博客园 - Franky
博客园 - 三生石上(FineUI控件)
Recent Announcements
Recent Announcements
F
Fortinet All Blogs
IT之家
IT之家
WordPress大学
WordPress大学
M
MIT News - Artificial intelligence
爱范儿
爱范儿
Microsoft Azure Blog
Microsoft Azure Blog
Vercel News
Vercel News
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
小众软件
小众软件
N
Netflix TechBlog - Medium
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
博客园 - 【当耐特】

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Hyperparameter Selection via Early Stopping for Bayesian ...
[Submitted on 21 Oct 2025 (v1), last revised 7 Sep 2026 (this ve · 2025-10-21 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:We provide a data-driven method for choosing the scale of a Gaussian prior for non-linear Bayesian inverse problems arising from semilinear PDEs. Following \cite{koers2024}, the non-linear model for the parameter $f$ is reparametrized as a linear model for $v = \mathbb{L}u_f$, in which the prior scale can be selected by early stopping at the discrepancy principle \cite{tienstra2025}. We extend the transfer of frequentist guarantees from the linearised problem to the original one beyond Lipschitz solution maps, to maps admitting an arbitrary modulus of continuity, and we provide a general condition on the non-linearity under which such a map exists and is Lipschitz near the truth. The resulting posterior for $f$ contracts adaptively over a range of Sobolev smoothness, and its credible sets have asymptotic frequentist coverage one. We demonstrate our theory in detail for the stationary Schrödinger equation, for which we also provide numerical experiments. We further show how the results apply to the stationary Allen-Cahn equation and to a parabolic Allen-Cahn equation, and we discuss Darcy flow as an edge case outside the semilinear setting. The proposed method thus provides a data-driven way to tune Gaussian priors via early stopping, which is computationally efficient and statistically near-optimal for non-linear problems.

Submission history

From: Maia Tienstra [view email]
[v1] Tue, 21 Oct 2025 11:53:35 UTC (252 KB)
[v2] Mon, 7 Sep 2026 11:13:48 UTC (269 KB)