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

推荐订阅源

小众软件
小众软件
博客园 - Franky
罗磊的独立博客
G
Google Developers Blog
The GitHub Blog
The GitHub Blog
P
Proofpoint News Feed
Recent Announcements
Recent Announcements
V
V2EX
F
Fortinet All Blogs
阮一峰的网络日志
阮一峰的网络日志
Blog — PlanetScale
Blog — PlanetScale
月光博客
月光博客
U
Unit 42
GbyAI
GbyAI
A
About on SuperTechFans
WordPress大学
WordPress大学
Engineering at Meta
Engineering at Meta
雷峰网
雷峰网
Microsoft Azure Blog
Microsoft Azure Blog
Martin Fowler
Martin Fowler
D
DataBreaches.Net
The Cloudflare Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
MongoDB | Blog
MongoDB | 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
Weak Moment Methods for Statistical Inference: with an Ap...
R. Labouriau · 2026-04-26 · via math.ST updates on arXiv.org

A companion paper develops a framework in which probability measures are represented by distribution-kernel pairs (T,phi) with T a tempered distribution and phi a Schwartz kernel, so that weak moments of all orders exist unconditionally. The present paper turns this into a methodology for statistical inference: estimation via weak moment matching, weak characteristic functions, weak cumulants, and regularised density reconstruction via Tikhonov inversion. A key feature is that parametric inference proceeds directly from weak expectations without reconstructing the underlying density; reconstruction is an additional route, useful when density-level inference is the goal. The central result is that weak moment estimators are automatically locally robust in the sense of Hampel: their score is bounded and redescending, their influence function has a closed form, and their gross error sensitivity is finite in every identifiable parametric model -- all inherited from the kernel's decay, with no ad hoc truncation. The kernel plays the role of Huber's tuning constant, but as a structural component of the model rather than a post-hoc modification. The framework is worked out for the Cauchy location model (where no classical moment estimator exists), a Student t_3 location-scale model, a bivariate Cauchy location model, and a bivariate t_3 location-scale model. Monte Carlo comparisons show that weak moment estimators match or outperform classical robust benchmarks under contamination; in the bivariate t_3 case the MLE scale estimate breaks down while the weak moment estimator converges at the parametric rate. Although the paper focuses on parametric models, the reconstruction route is inherently non-parametric and opens a path to weak density estimation without parametric assumptions.