Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

53106158211 · Jun 202019922001200920172026
48 results for conjugate prior

We derive and approximate the conjugate prior of Dirichlet and beta distributions.

problem Intractability of conjugate prior for Dirichlet and beta distributions.
method Derive conjugate prior, define closed-form approximation, and provide algorithm.
result Closed-form approximation enables fully tractable Bayesian treatment.

Making inferences from data streams is a pervasive problem in many modern data analysis applications. But it requires to address the problem of continuous model updating and adapt to changes or drifts in the underlying data generating distribution. In this paper, we approach these problems from a Bayesian perspective c…

2017-07-07abs ↗pdf ↗

The paper deals with learning probability distributions of observed data by artificial neural networks. We suggest a so-called gradient conjugate prior (GCP) update appropriate for neural networks, which is a modification of the classical Bayesian update for conjugate priors. We establish a connection between the gradi…

2018-02-07abs ↗pdf ↗

New method uses KL-divergence to create non-informative priors for multivariate Gaussian.

problem Handling hyperparameters for non-informative limits in multivariate Gaussian conjugate priors.
method Using scaled KL-divergence between multivariate Gaussians to construct Wishart and normal-Wishart conjugate priors.
result Forming non-informative priors without violating Wishart shape parameter restrictions.

Develops a fast variational approximation for high-dimensional empirical Bayes posteriors.

problem Optimal posterior computation in high-dimensional settings with prior tails effect.
method Variational approximation of empirical Bayes posterior with data-driven centers and thin-tailed conjugate priors.
result Retains optimal concentration rate properties and superior performance compared to existing methods.

New conjugate priors improve Bayesian inference for multinomial probit models.

problem Lack of tractable conjugate priors for efficient Bayesian inference in multinomial probit models.
method Unified skew-normal (SUN) distributions as conjugate priors, leading to improved posterior inference and classification.
result Improved computational methods for posterior inference and classification, especially in high dimensions.

Low-rank matrix estimation from incomplete measurements recently received increased attention due to the emergence of several challenging applications, such as recommender systems; see in particular the famous Netflix challenge. While the behaviour of algorithms based on nuclear norm minimization is now well understood…

2014-06-05abs ↗pdf ↗

We characterize conjugate nonparametric Bayesian models as projective limits of conjugate, finite-dimensional Bayesian models. In particular, we identify a large class of nonparametric models representable as infinite-dimensional analogues of exponential family distributions and their canonical conjugate priors. This c…

2010-12-02abs ↗pdf ↗

We would like to congratulate the authors of "A Bayesian Conjugate Gradient Method" on their insightful paper, and welcome this publication which we firmly believe will become a fundamental contribution to the growing field of probabilistic numerical methods and in particular the sub-field of Bayesian numerical methods…

2019-08-08abs ↗pdf ↗

This report works out the details of a closed-form, fully Bayesian, multiclass, openset, generative pattern classifier using multivariate Gaussian likelihoods, with conjugate priors. The generative model has a common within-class covariance, which is proportional to the between-class covariance in the conjugate prior. …

2013-07-23abs ↗pdf ↗

Proposes a non-conjugate model selection method for chain event graphs.

problem Existing model selection algorithms for chain event graphs rely on conjugate priors, which is unrealistic for many real-world applications.
method Proposes a mixture modelling approach to model selection in chain event graphs that does not rely on conjugacy.
result The proposed method is more scalable and robust than existing algorithms.

A conjugate Bayesian method detects change points in Hawkes processes efficiently.

problem Non-conjugacy between Hawkes process likelihood and prior causes inefficiency in change point detection.
method Data augmentation to propose a conjugate Bayesian two-step change point detection method.
result The conjugate method is more accurate and efficient than non-conjugate methods.

Bayesian model uses simple functions to forecast macroeconomic data.

problem Forecasting large datasets in macroeconomics with complex nonlinear relationships.
method Sum of simple two-component location mixtures, logistic function threshold, conjugate priors.
result Accurate point and density forecasts in US macroeconomic aggregates.

Latent Gaussian models (LGMs) are widely used in statistics and machine learning. Bayesian inference in non-conjugate LGMs is difficult due to intractable integrals involving the Gaussian prior and non-conjugate likelihoods. Algorithms based on variational Gaussian (VG) approximations are widely employed since they str…

2013-06-05abs ↗pdf ↗

The class of chain event graph models is a generalisation of the class of discrete Bayesian networks, retaining most of the structural advantages of the Bayesian network for model interrogation, propagation and learning, while more naturally encoding asymmetric state spaces and the order in which events happen. In this…

2009-04-06abs ↗pdf ↗

New method estimates covariance in multi-view data with better accuracy and uncertainty.

problem Estimating covariance in multi-view data with shared and view-specific latent factors.
method Spectral decompositions and conditional conjugate priors for factor loadings and residual variances.
result Proves favorable asymptotic properties and excellent performance in simulations and real data.

New method improves calibration of BayesCG for better uncertainty quantification.

problem Bayesian conjugate gradient method's poor calibration limits its utility.
method Randomized postiteration strategy to enhance posterior calibration.
result The method improves the distribution of posterior errors and enhances uncertainty quantification.

Proves FR-NGD optimally approximates evolutionary dynamics and continuous Bayesian inference.

problem Optimizing continuous time replicator equations and continuous Bayesian inference.
method Fisher-Rao natural gradient descent (FR-NGD) and its correspondence with evolutionary dynamics.
result FR-NGD optimally approximates continuous time replicator equations and continuous Bayesian inference.

This paper analyzes M-estimators under infinite-variance noise in high dimensions.

problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.

The stochastic variational inference (SVI) paradigm, which combines variational inference, natural gradients, and stochastic updates, was recently proposed for large-scale data analysis in conjugate Bayesian models and demonstrated to be effective in several problems. This paper studies a family of Bayesian latent vari…

2016-12-12abs ↗pdf ↗

Paper develops Bayesian inference for discrete-choice mnp models with Gaussian priors.

problem Estimating parameters of discrete-choice multinomial probit models with Gaussian priors.
method Adapts Fasano and Durante's results to a specific mnp model with zero mean and independent Gaussian priors, simplifying posterior distribution parameters and providing a new variational algorithm.
result Simplified expressions for posterior distribution parameters and a novel variational algorithm.

This paper introduces a novel theoretically sound approach for the celebrated CMA-ES algorithm. Assuming the parameters of the multi variate normal distribution for the minimum follow a conjugate prior distribution, we derive their optimal update at each iteration step. Not only provides this Bayesian framework a justi…

2019-04-02abs ↗pdf ↗

Paper proposes a method to break symmetries in Bayesian matrix factorization.

problem Symmetries in posterior distribution reduce MCMC sampling efficiency.
method Modification to Gaussian prior mean and covariance to break symmetries.
result Breaking symmetries leads to lower autocorrelation and reconstruction errors.

We consider reinforcement learning in parameterized Markov Decision Processes (MDPs), where the parameterization may induce correlation across transition probabilities or rewards. Consequently, observing a particular state transition might yield useful information about other, unobserved, parts of the MDP. We present a…

2014-06-29abs ↗pdf ↗

Exploratory cancer drug studies test multiple tumor cell lines against multiple candidate drugs. The goal in each paired (cell line, drug) experiment is to map out the dose-response curve of the cell line as the dose level of the drug increases. We propose Bayesian Tensor Filtering (BTF), a hierarchical Bayesian model …

2019-06-10abs ↗pdf ↗

In a modern observational study based on healthcare databases, the number of observations and of predictors typically range in the order of 10510^5 ~ 10610^6 and of 10410^4 ~ 10510^5. Despite the large sample size, data rarely provide sufficient information to reliably estimate such a large number of parameters. Sparse reg…

2018-10-29abs ↗pdf ↗

Bayesian tree ensemble model for estimating treatment effects in high-dimensional survival data.

problem Estimating heterogeneous treatment effects in censored survival data with many covariates.
method Developed a Bayesian tree ensemble model with a horseshoe prior for adaptive shrinkage.
result Accurately estimates treatment effects in high-dimensional covariate spaces and non-linear functions.

The paper tackles efficient computation of optimal transport by approximating conjugates with amortized optimization.

problem Efficient computation of convex conjugates in optimal transport is challenging and limits the quality of transport maps.
method The approach combines amortized approximations of conjugates with a fine-tuning solver to improve transport map quality.
result The method significantly improves the quality of transport maps for the Wasserstein-2 benchmark and models many 2D couplings and flows.