Discrete to continuum limits in Bayesian inverse problems
贝叶斯反问题中的离散到连续极限AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论贝叶斯反问题的离散到连续极限与后验渐近理论,属于计量理论与统计渐近方向,与所列微观、宏观、金融各细分领域均无直接文本依据,故不选择。
贝叶斯反问题中的离散到连续极限AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We develop a posterior-level discrete-to-continuum theory for Bayesian inverse problems whose finite-dimensional priors arise from local finite-difference regularization and whose likelihoods are of a general convex GLM-type form. In contrast to continuum-first approaches, the continuum prior and posterior are not assumed at the outset but are constructed as limits of the finite-dimensional probability measures used in numerical computation. First, with the total information parameter $τ$ and the regularization strength $κ$ fixed, we prove weak convergence on $L^2$ of the reconstructed discrete Gaussian priors and posterior measures to well-defined continuum laws. We then consider a coupled grid-refinement and small-noise limit in which $N\to\infty$ and $τ_N,κ_N\to\infty$, while $κ_N/τ_N$ remains fixed. Under explicit growth conditions relating $N$ and $τ_N$, we prove that the reconstructed discrete MAP estimates converge to the unique minimizer $u_*$ of the limiting continuum cost functional, that the reconstructed posterior measures concentrate at $u_*$, and that their centered and rescaled fluctuations converge to $\mathcal N(\vec 0,Q^{-1})$, where $Q$ is the Hessian of the continuum cost functional at $u_*$. Finally, we show that the same deterministic limit and Gaussian fluctuation law are obtained by first constructing the continuum posterior and then taking its small-noise, high-regularization limit.
凸正则化的谱依赖:右旋转不变设计下的基本极限
We study the fundamental limits of convex-regularized estimation in high-dimensional linear regression with right-rotationally invariant design matrices. We show that the asymptotic risks of convex-penalized least squares estimators are lower bounded by the risk of an approximate message passing algorithm known as Bayes VAMP, and we further characterize when the lower bound is attainable. As a technical ingredient in the proof of our lower bound theorem, we characterize the…
基于相容性的贝叶斯推断:渐近极限、变分原理与 Wasserstein 几何
Approximate Bayesian Computation (ABC) replaces intractable likelihood evaluations with comparisons between observed and simulated data. We develop a measure-theoretic formulation of discrepancy-based Bayesian inference in which compatibility is encoded through nonnegative weights. For vanishing thresholds, we establish convergence of the corresponding posterior distributions in total variation. In the large-sample regime, we identify conditions under which the posterior…
采用图拉普拉斯基准约束先验的正则化小区域估计
Small area estimation (SAE) often requires both borrowing information across areas and benchmarking estimates to reliable aggregates. We develop a Bayesian framework that addresses these two objectives jointly through a new family of Benchmarking priors. The priors are induced by a benchmark-constrained regularization problem. The resulting family includes a Benchmarking Prior that incorporates the benchmarking restrictions without additional regularization across areas, and…
相关任务间的经验贝叶斯谱部分汇聚
Spectral methods are central to high-dimensional statistics and machine learning, underlying procedures for covariance estimation, matrix denoising, representation learning, clustering, and latent variable modeling. In this work, we focus primarily on spectral estimators for high-dimensional factor models, where leading singular vectors of the data matrix are used to estimate latent structure and covariance parameters. In many modern applications, however, data are collected…
分数岭回归
Regularization methods such as the Lasso combine shrinkage and variable selection, but strong penalization drives their solutions toward the null model. We introduce Fractional Ridge (Fridge) regression, a penalized regression method that instead shrinks toward models of a prespecified target size. Its penalty vanishes whenever the number of nonzero coefficients does not exceed that target. This behavior connects continuous shrinkage with best subset selection. We develop an…
Google Play 用户评论情绪指数的统计基础:信号融合、收缩、分布验证与动态平滑
The decision problem is whether valence among the users who write reviews of an app has changed enough to warrant investigation of a release, outage, or support issue. We propose a statistical specification for that decision, applied to written Google Play reviews collected under a declared locale, language, sort order, retrieval cap, and window rule. That endpoint returns a selected collection rather than a random sample, so the index describes review writers under the…