Bayesian Compressed Regression
贝叶斯压缩回归AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论一般高维回归与预测密度,没有宏观预测或金融收益预测的直接背景。
贝叶斯压缩回归AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
As an alternative to variable selection or shrinkage in high-dimensional regression, we propose to randomly compress the predictors prior to analysis. This dramatically reduces storage and computational bottlenecks, performing well when the predictors can be projected to a low-dimensional linear subspace with minimal loss of information about the response. As opposed to existing Bayesian dimensionality reduction approaches, the exact posterior distribution conditional on the compressed data is available analytically, speeding up computation by many orders of magnitude while also bypassing robustness issues due to convergence and mixing problems with MCMC. Model averaging is used to reduce sensitivity to the random projection matrix, while accommodating uncertainty in the subspace dimension. Strong theoretical support is provided for the approach by showing near parametric convergence rates for the predictive density in the large p small n asymptotic paradigm. Practical performance relative to competitors is illustrated in simulations and real data applications.
凸正则化的谱依赖:右旋转不变设计下的基本极限
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…
分数岭回归
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…
用于贝叶斯推断的正则化指数倾斜经验似然
Bayesian inference with empirical likelihood faces a challenge as the posterior domain is a proper subset of the original parameter space due to the convex hull constraint. We propose a regularized exponentially tilted empirical likelihood to address this issue. Our method removes the convex hull constraint using a novel regularization technique, incorporating a continuous exponential family distribution to satisfy a Kullback--Leibler divergence criterion. The regularization…
面向超高维数据的贝叶斯单变量引导稀疏回归
Ultra-high-dimensional genomic studies require simultaneous identification of sparse signals, control of spurious discoveries, and computationally feasible inference when the number of predictors can reach hundreds of thousands or more. We propose Bayesian Univariate-Guided Sparse Regression (BUGS), a global--local shrinkage framework that incorporates marginal association information directly into the prior through continuous modulation of shrinkage. By embedding univariate…