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

推荐订阅源

月光博客
月光博客
MyScale Blog
MyScale Blog
博客园 - Franky
The Cloudflare Blog
IT之家
IT之家
Blog — PlanetScale
Blog — PlanetScale
博客园 - 聂微东
WordPress大学
WordPress大学
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
T
The Blog of Author Tim Ferriss
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
罗磊的独立博客
Google DeepMind News
Google DeepMind News
P
Proofpoint News Feed
Martin Fowler
Martin Fowler
aimingoo的专栏
aimingoo的专栏
J
Java Code Geeks
腾讯CDC
雷峰网
雷峰网
Microsoft Azure Blog
Microsoft Azure Blog
G
Google Developers Blog
博客园 - 【当耐特】
美团技术团队
云风的 BLOG
云风的 BLOG

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
Robust Semiparametric Inference for Bayesian Additive Reg...
[Submitted on 29 Sep 2025 (v1), last revised 17 Aug 2026 (this v · 2025-09-29 · via math.ST updates on arXiv.org

View PDF HTML (experimental)

Abstract:We develop a corrected posterior distribution for semiparametric inference on the population mean under missing-at-random (MAR). The procedure combines Bayesian Additive Regression Trees (BART) with Bayesian-bootstrap reweighting. We derive a new Bernstein-von Mises (BvM) theorem and show that even the one-step posterior contains a bias term in the non-Donsker regime. To remove this term, we introduce RoBART, a posterior correction based on pilot estimators of the outcome regression and propensity score. We establish a BvM theorem for the corrected posterior and develop a cross-fitted version based on fold-specific BART posteriors. The average of fold-specific posterior means of RoBART coincides exactly with the corresponding cross-fitted augmented inverse-probability-weighted estimator, equivalently the double machine learning estimator. RoBART therefore provides a corrected posterior distribution for uncertainty quantification around the same point estimator. In simulations and an empirical illustration, RoBART demonstrates competitive finite-sample performance relative to existing methods.

Submission history

From: Christoph Breunig [view email]
[v1] Mon, 29 Sep 2025 11:42:06 UTC (62 KB)
[v2] Mon, 20 Oct 2025 09:00:10 UTC (36 KB)
[v3] Mon, 17 Aug 2026 20:35:31 UTC (67 KB)