惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

酷 壳 – CoolShell
酷 壳 – CoolShell
aimingoo的专栏
aimingoo的专栏
P
Proofpoint News Feed
宝玉的分享
宝玉的分享
MyScale Blog
MyScale Blog
The GitHub Blog
The GitHub Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
月光博客
月光博客
量子位
博客园 - 司徒正美
V
V2EX
I
InfoQ
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Vercel News
Vercel News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
美团技术团队
N
Netflix TechBlog - Medium
L
LangChain Blog
IT之家
IT之家
Blog — PlanetScale
Blog — PlanetScale
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Stack Overflow Blog
Stack Overflow Blog
A
About on SuperTechFans
Microsoft Azure Blog
Microsoft Azure Blog

stat updates on arXiv.org

A Refined Generalization Analysis for Extreme Multi-class Supervised Contrastive Representation Learning Ensemble Distributionally Robust Bayesian Optimisation The Proxy Presumption: From Semantic Embeddings to Valid Social Measures Modulated learning for private and distributed regression with just a single sample per client device Query-efficient model evaluation using cached responses Functional-prior-based approaches to Bayesian PDE-constrained inversion using physics-informed neural networks Optimal Experiments for Partial Causal Effect Identification Order-Agnostic Autoregressive Modelling with Missing Data Grokking or Glitching? How Low-Precision Drives Slingshot Loss Spikes Tuning Derivatives for Causal Fairness in Machine Learning Spherical Flows for Sampling Categorical Data Bayesian Rain Field Reconstruction using Commercial Microwave Links and Diffusion Model Priors GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Unified Framework of Distributional Regret in Multi-Armed Bandits and Reinforcement Learning Jacobian-Velocity Bounds for Deployment Risk Under Covariate Drift Self-Attention as Transport: Limits of Symmetric Spectral Diagnostics Perturbation is All You Need for Extrapolating Language Models Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization Realizable Bayes-Consistency for General Metric Losses Graph Convolutional Support Vector Regression for Robust Spatiotemporal Forecasting of Urban Air Pollution Segmenting Human-LLM Co-authored Text via Change Point Detection Stochastic Schrödinger Diffusion Models for Pure-State Ensemble Generation Understanding Self-Supervised Learning via Latent Distribution Matching The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence Imbalanced Classification under Capacity Constraints On the Spectral Structure and Objective Equivalence of Orthogonal Multilabel Fisher Discriminants Partially Observed Structural Causal Models First-Order Efficiency for Probabilistic Value Estimation via A Statistical Viewpoint Robust and Fast Training via Per-Sample Clipping
Posterior Mode-Guided Dimension Reduction for Bayesian Mo...
[Submitted on 24 Feb 2026 (v1), last revised 23 Jun 2026 (this v · 2026-06-25 · via stat updates on arXiv.org

View PDF HTML (experimental)

Abstract:For large model spaces in linear regression with spike-and-slab priors, the potential entrapment of Markov chain Monte Carlo (MCMC)-based methods poses significant challenges in posterior computation. Existing maximum a posteriori (MAP)-based methods provide more computationally viable alternatives, but fail to perform tail heaviness estimation and uncertainty quantification. To address these problems, we propose a method that blends MAP estimation with MCMC-based stochastic search algorithms within an error framework comprising a combination of the hyperbolic and Student-t distributions. The hyperbolic distribution has the light-tailed normal and heavy-tailed Laplace distributions as limiting cases, but is thinner-tailed than the Student-t family. Including the Student-t distribution in the error density enables better adaptation to heavier tails. Amalgamating the two error densities thus ensures a model with more flexible tail behavior when faced with unknown tail thickness in the data, compared to MAP estimators with fixed levels of tail heaviness that assume the errors have a normal or Laplace distribution. Under this proposed error model, the current work develops a two-step expectation conditional maximization (ECM)-guided MCMC algorithm. First, we conduct an ECM-based posterior maximization to guide variable selection. We then execute a Gibbs sampler on the resulting ECM-guided model space for tail heaviness estimation and uncertainty quantification. Through simulation studies and benchmark real datasets, our proposed method is shown to exhibit several advantages in variable selection and uncertainty quantification over state-of-the-art MAP-based methods.

Submission history

From: Joyee Ghosh [view email]
[v1] Tue, 24 Feb 2026 01:18:12 UTC (68 KB)
[v2] Tue, 23 Jun 2026 19:55:34 UTC (78 KB)