Bernstein-von Mises theorem for sparse generalized linear models
稀疏广义线性模型的 Bernstein–von Mises 定理AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于通用高维贝叶斯回归理论,出现 logistic 回归不足以确认离散选择或其他经济金融细分应用。
稀疏广义线性模型的 Bernstein–von Mises 定理AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We establish an oracle Bernstein-von Mises theorem for high-dimensional sparse generalized linear models under an outcome-independent spike-and-slab prior. The posterior consistently recovers the true active set and converges in total variation to the Gaussian law that would arise if this set were known in advance, even when the active dimension grows. The result holds for both ordinary and fractional posteriors, the latter with the expected variance inflation under tempering. In fixed-design logistic regression, a sufficient lower bound on the squared minimum signal is proportional to the logarithm of the ambient dimension divided by sample size. Separate likelihood controls for model selection and oracle approximation allow the Gaussian approximation to use a weaker curvature condition. We verify the conditions for six canonical and noncanonical models under fixed and random designs, including Poisson regression with potentially unbounded Fisher weights. The results also yield oracle-rate contraction, credible regions on the recovered support and pointwise frequentist coverage.
Bayesian additive regression trees (BART) is a popular Bayesian ensemble model used in regression and classification analysis. Under this modeling framework, the regression function is approximated by an ensemble of decision trees, interpreted as weak learners. In this work, we propose a generalization of the BART model that has two main features: first, it automatically selects the number of decision trees using the given data; second, the model allows clusters of…
凸正则化的谱依赖:右旋转不变设计下的基本极限
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…
公平变量选择
Algorithms are increasingly being used to help automate and improve data-driven decisions, but care must be taken to prevent such algorithms from learning discriminatory patterns from historical data and perpetuating their biases. Statistical notions of fairness aim to mitigate either a model's disparate impact on disadvantaged groups (thus ensuring group fairness) or the resulting disparate treatment of individuals with similar features (thus ensuring individual fairness).…
采用图拉普拉斯基准约束先验的正则化小区域估计
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…
RBF 核高斯过程最大似然估计的精确渐近理论
Gaussian processes (GPs) are widely used across machine learning, spatial statistics, time-series analysis, optimization, Bayesian statistics, and scientific applications. A central component of a GP model is its kernel, which is typically specified through a parametric family. Among the most widely used choices is the radial basis function (RBF), also known as the squared exponential or Gaussian kernel, owing to its simple form, smoothness, and flexibility. In practice, the…