Approximate Bayesian inference for cumulative probit regression models

• URL: http://arxiv.org/abs/2511.06967v1
• Date: Mon, 10 Nov 2025 11:15:42 GMT
• Title: Approximate Bayesian inference for cumulative probit regression models
• Authors: Emanuele Aliverti,
• Abstract summary: Ordinal categorical data are routinely encountered in a wide range of practical applications.<n>We propose three scalable algorithms for approximating the posterior distribution of the regression coefficients in cumulative probit models.<n>We illustrate the utility of the proposed algorithms on a challenging case study to investigate the structure of a criminal network.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ordinal categorical data are routinely encountered in a wide range of practical applications. When the primary goal is to construct a regression model for ordinal outcomes, cumulative link models represent one of the most popular choices to link the cumulative probabilities of the response with a set of covariates through a parsimonious linear predictor, shared across response categories. When the number of observations grows, standard sampling algorithms for Bayesian inference scale poorly, making posterior computation increasingly challenging in large datasets. In this article, we propose three scalable algorithms for approximating the posterior distribution of the regression coefficients in cumulative probit models relying on Variational Bayes and Expectation Propagation. We compare the proposed approaches with inference based on Markov Chain Monte Carlo, demonstrating superior computational performance and remarkable accuracy; finally, we illustrate the utility of the proposed algorithms on a challenging case study to investigate the structure of a criminal network.

Related papers

• Efficient Covariance Estimation for Sparsified Functional Data [51.69796254617083]
  proposed Random-knots (Random-knots-Spatial) and B-spline (Bspline-Spatial) estimators of the covariance function are computationally efficient.<n>Asymptotic pointwise of the covariance are obtained for sparsified individual trajectories under some regularity conditions.
  arXiv  Detail & Related papers  (2025-11-23T00:50:33Z)
• Self-Boost via Optimal Retraining: An Analysis via Approximate Message Passing [58.52119063742121]
  Retraining a model using its own predictions together with the original, potentially noisy labels is a well-known strategy for improving the model performance.<n>This paper addresses the question of how to optimally combine the model's predictions and the provided labels.<n>Our main contribution is the derivation of the Bayes optimal aggregator function to combine the current model's predictions and the given labels.
  arXiv  Detail & Related papers  (2025-05-21T07:16:44Z)
• In-Context Parametric Inference: Point or Distribution Estimators? [66.22308335324239]
  We show that amortized point estimators generally outperform posterior inference, though the latter remain competitive in some low-dimensional problems.<n>Our experiments indicate that amortized point estimators generally outperform posterior inference, though the latter remain competitive in some low-dimensional problems.
  arXiv  Detail & Related papers  (2025-02-17T10:00:24Z)
• Variational Autoencoders for Efficient Simulation-Based Inference [2.0034235495967736]
  We present a generative modeling approach based on the variational inference framework for likelihood-free simulation-based inference.<n>We demonstrate the ability of the proposed approach to approximate complex posteriors while maintaining computational efficiency on well-established problems.
  arXiv  Detail & Related papers  (2024-11-21T12:24:13Z)
• Efficient Incremental Belief Updates Using Weighted Virtual Observations [2.7195102129095003]
  We present an algorithmic solution to the problem of incremental belief updating in the context of Monte Carlo inference. We implement and apply the solution to a number of didactic examples and case studies, showing efficiency and robustness of our approach.
  arXiv  Detail & Related papers  (2024-02-10T12:48:49Z)
• Structured Radial Basis Function Network: Modelling Diversity for Multiple Hypotheses Prediction [51.82628081279621]
  Multi-modal regression is important in forecasting nonstationary processes or with a complex mixture of distributions. A Structured Radial Basis Function Network is presented as an ensemble of multiple hypotheses predictors for regression problems. It is proved that this structured model can efficiently interpolate this tessellation and approximate the multiple hypotheses target distribution.
  arXiv  Detail & Related papers  (2023-09-02T01:27:53Z)
• Variational Laplace Autoencoders [53.08170674326728]
  Variational autoencoders employ an amortized inference model to approximate the posterior of latent variables. We present a novel approach that addresses the limited posterior expressiveness of fully-factorized Gaussian assumption. We also present a general framework named Variational Laplace Autoencoders (VLAEs) for training deep generative models.
  arXiv  Detail & Related papers  (2022-11-30T18:59:27Z)
• Approximate Gibbs Sampler for Efficient Inference of Hierarchical Bayesian Models for Grouped Count Data [0.0]
  This research develops an approximate Gibbs sampler (AGS) to efficiently learn the HBPRMs while maintaining the inference accuracy. Numerical experiments using real and synthetic datasets with small and large counts demonstrate the superior performance of AGS.
  arXiv  Detail & Related papers  (2022-11-28T21:00:55Z)
• Sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm [62.997667081978825]
  We propose a computationally efficient and powerful Bayesian approach for sparse high-dimensional linear regression. Minimal prior assumptions on the parameters are used through the use of plug-in empirical Bayes estimates. The proposed approach is implemented in the R package probe.
  arXiv  Detail & Related papers  (2022-09-16T19:15:50Z)
• Generalised Bayesian Inference for Discrete Intractable Likelihood [9.331721990371769]
  This paper develops a novel generalised Bayesian inference procedure suitable for discrete intractable likelihood. Inspired by recent methodological advances for continuous data, the main idea is to update beliefs about model parameters using a discrete Fisher divergence. The result is a generalised posterior that can be sampled from using standard computational tools, such as Markov Monte Carlo.
  arXiv  Detail & Related papers  (2022-06-16T19:36:17Z)
• A Class of Conjugate Priors for Multinomial Probit Models which Includes the Multivariate Normal One [0.3553493344868413]
  We show that the entire class of unified skew-normal (SUN) distributions is conjugate to several multinomial probit models. We improve upon state-of-the-art solutions for posterior inference and classification.
  arXiv  Detail & Related papers  (2020-07-14T10:08:23Z)
• Slice Sampling for General Completely Random Measures [74.24975039689893]
  We present a novel Markov chain Monte Carlo algorithm for posterior inference that adaptively sets the truncation level using auxiliary slice variables. The efficacy of the proposed algorithm is evaluated on several popular nonparametric models.
  arXiv  Detail & Related papers  (2020-06-24T17:53:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.