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

推荐订阅源

aimingoo的专栏
aimingoo的专栏
Engineering at Meta
Engineering at Meta
有赞技术团队
有赞技术团队
博客园_首页
Apple Machine Learning Research
Apple Machine Learning Research
Vercel News
Vercel News
G
Google Developers Blog
Blog — PlanetScale
Blog — PlanetScale
IT之家
IT之家
MongoDB | Blog
MongoDB | Blog
Y
Y Combinator Blog
B
Blog
The GitHub Blog
The GitHub Blog
M
MIT News - Artificial intelligence
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Stack Overflow Blog
Stack Overflow Blog
C
Check Point Blog
Microsoft Azure Blog
Microsoft Azure Blog
D
DataBreaches.Net
I
InfoQ
Recent Announcements
Recent Announcements
阮一峰的网络日志
阮一峰的网络日志
腾讯CDC
H
Help Net Security

stat updates on arXiv.org

Simultaneous Monitoring of Shape and Surface Color via 4D Point Clouds: A Registration-free Approach A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Functional-prior-based approaches to Bayesian PDE-constrained inversion using physics-informed neural networks Optimal Experiments for Partial Causal Effect Identification Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Perturbation is All You Need for Extrapolating Language Models Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization Realizable Bayes-Consistency for General Metric Losses Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Segmenting Human-LLM Co-authored Text via Change Point Detection Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models First-Order Efficiency for Probabilistic Value Estimation via A Statistical Viewpoint
Quasi-Bayesian sequential deconvolution
[Submitted on 26 Aug 2024 (v1), last revised 7 Aug 2026 (this ve · 2024-08-27 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:Density deconvolution is the inverse problem of estimating a probability density from observations contaminated by additive noise. Traditionally studied in static or batch settings, it increasingly arises with streaming data, where existing frequentist and Bayesian procedures face substantial computational bottlenecks. We develop a quasi-Bayesian nonparametric method for sequential density deconvolution based on Newton's recursive algorithm. The resulting estimate is straightforward to evaluate and scalable to massive datasets, as its per-observation computational cost remains constant as new data arrive. The quasi-Bayesian interpretation enables uncertainty quantification: local and uniform central limit theorems yield asymptotic credible intervals and bands, respectively. Under a frequentist data-generating model, we establish $L^1$-consistency for the proposed estimate and show that it asymptotically agrees with the estimate that would be obtained if the uncontaminated variables were directly observed. Further, under additional regularity conditions, we derive an $L^1$-Wasserstein convergence rate and establish merging, at an explicit rate, with the Bayesian nonparametric posterior mean estimate under a Dirichlet process mixture model. Synthetic-data experiments, together with an acquisition-ordered flow-cytometry application, demonstrate accuracy comparable to Bayesian nonparametric and Fourier deconvolution methods, while offering a substantial computational advantage.

Submission history

From: Stefano Favaro [view email]
[v1] Mon, 26 Aug 2024 16:40:04 UTC (1,905 KB)
[v2] Fri, 13 Dec 2024 06:08:51 UTC (1,982 KB)
[v3] Fri, 7 Aug 2026 14:50:16 UTC (7,424 KB)