Bayesian Operator Learning: Posterior Existence and Convergence of Point Estimates for Gaussian Priors
贝叶斯算子学习:高斯先验下后验存在性与点估计收敛AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论一般无限维算子学习及偏微分方程应用,没有所列经济或金融细分方向的直接依据。
贝叶斯算子学习:高斯先验下后验存在性与点估计收敛AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We develop a Bayesian framework for learning nonlinear operators between infinite-dimensional spaces. Given a map $g_0:\mathcal{X}\to\mathcal{Y}$ between separable Hilbert spaces, we study the recovery of $g_0$ from $n\in\mathbb{N}$ noisy input-output pairs $(\boldsymbol{X},\boldsymbol{Z})=(X_i,Z_i)_{i=1}^n$ with $Z_i= g_0 (X_i ) + E_i$. Here the $X_i\in\mathcal{X}$ are randomly drawn 'design' points in a compact subset of $\mathcal X$, and the $E_i$ are assumed to be i.i.d. draws from a Gaussian white noise process indexed by $\mathcal{Y}$. For any 'operator-valued' prior $\mathbb{P}_G$ supported on the space of continuous operators, we show existence of the posterior $\mathbb P_{G|(\boldsymbol{X},\boldsymbol{Z})}$ as a regular conditional distribution, and provide a characterization of its Radon-Nikodym derivative. For Gaussian priors, we establish algebraic (in the sample size $n$) convergence rates for the posterior mean towards the ground truth; this corresponds to a ridge regularized kernel estimator. Moreover, we show that the posterior mean is minimax optimal (up to logarithmic factors) over hyperrectangles when the smoothness of the prior matches that of the ground truth. To illustrate the applicability of our analysis, we derive explicit learning rates for the Darcy flow solution operator.
目标函数平衡:利用策略性不平衡估计因果效应
When estimating the average treatment effect of a binary intervention with weights, investigators are often burdened with how best to leave imbalance in the distributions of observed covariates. This requires that investigators proceed cautiously, as imbalance in key (nonlinear transformations of) covariates potentially introduces bias into the ultimate estimated effect. This paper introduces Targeted Function Balancing (TFB), a flexible covariate balancing weights approach…
正则化似然反卷积与后验密度重构
Density deconvolution is an ill-posed inverse problem because recovering the latent density amplifies high-frequency variation in the observed data. We propose a two-stage likelihood procedure. The first estimator maximizes the convolution likelihood over a regularized Gaussian-mixture sieve; the second treats this fit as an empirical prior and averages the fitted conditional latent densities. Under fixed-model misspecification, the estimators generally have different…
见树亦见林:BART 的高斯过程极限
Bayesian Additive Regression Trees (BART) have shown state-of-the-art performance in both prediction and causal inference problems. Previous theoretical work has attempted to explain BART's superior performance by establishing posterior contraction rates for standard BART models, but these rates depend strongly on the number of covariates. Here, we take a different approach and study the behavior of BART as the number of trees grows towards infinity. We show that in this…
空间相关函数数据的小波贝叶斯层级模型与正则化马蹄先验
Environmental monitoring networks increasingly record pollutant levels as curves observed over time at fixed stations. Yet, exposure and risk assessment often require predicting these curves, with their uncertainty, at unmonitored locations. Conventional smooth-basis methods for such spatially correlated functional data, including spline-based kriging, tend to over-smooth acute, high-frequency episodes such as pollution peaks. We propose a parsimonious wavelet-based Bayesian…
惰性高维训练下扩散模型的泛化、记忆与过拟合
Modern score-based generative models have achieved remarkable empirical success in high-dimensional tasks such as image, audio, and video synthesis. These models reduce distribution learning to a sequence of regression problems that, if solved exactly on finite data, would ultimately reproduce the training samples. Their ability to generalize must therefore arise from the implicit or explicit regularization during training. In this work, we develop a generative counterpart…
一般平滑模型中选择平滑参数的结构化割线方法
General smooth models replace parameters of a regular likelihood with additive models. The models can include parametric terms, Gaussian random effects, and smooth functions of covariates. The latter are parameterized via a reduced-rank spline basis and regularized via weighted quadratic penalties placed on the basis coefficients. Estimates for these weights (i.e., smoothing parameters) can be obtained by optimizing the Laplace-approximate Bayesian marginal likelihood.…