Striated Metropolis–Hastings sampler for high-dimensional models
面向高维模型的分层 Metropolis–Hastings 采样器AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要聚焦通用贝叶斯后验采样,未明确对应所列微观、宏观或金融细分领域。
面向高维模型的分层 Metropolis–Hastings 采样器AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Having efficient and accurate samplers for simulating the posterior distribution is crucial for Bayesian analysis. We develop a generic posterior simulator called the “dynamic striated Metropolis–Hastings (DSMH)” sampler. Grounded in the Metropolis–Hastings algorithm, it pools the strengths from the equi-energy and sequential Monte Carlo samplers while avoiding the weaknesses of the standard Metropolis–Hastings algorithm and those of importance sampling. In particular, the DSMH sampler possesses the capacity to cope with extremely irregular distributions that contain winding ridges and multiple peaks; and it is robust to how the sampling procedure progresses across stages. The high-dimensional application studied in this paper provides a natural platform for testing any generic sampler.
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…
凸正则化的谱依赖:右旋转不变设计下的基本极限
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…
大规模需求估计的贝叶斯机器学习方法
This work studies how Bayesian machine learning methods can be used for large-scale demand estimation with many product categories. I compare two model classes, a latent factorization model and a mixed logit model and two Bayesian estimation approaches, Markov Chain Monte Carlo (MCMC) and Variational Inference (VI). The analysis combines a simulation study with an application to supermarket scanner data. The results show that the latent factorization model benefits from…
逐元素独立同分布重尾数据下经验风险最小化的渐近分析
Many real-world datasets exhibit unusually large values far more frequently than predicted by Gaussian models. Heavy-tailed distributions capture this behavior, yet evaluating learning performance under them remains challenging because rare, large feature entries retain non-vanishing effects even in high dimensions. Even in the canonical setting of empirical risk minimization for linear regression with entry-wise i.i.d. symmetric $α$-stable data, a precise asymptotic…
分数岭回归
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…