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,742 papers · 148 categories

Trend · papers per month

59118177236 · Jun 202019922001200920172026
48 results for Power posterior

Improved Bayesian inference using power priors with historical data.

problem Improving Bayesian inference with historical data.
method Generalized power priors that adapt to the α\alpha parameter of Amari's α\alpha-divergence.
result Improved performance through appropriate choices of the α\alpha parameter.

The paper argues for interpreting neural networks as approximating the true posterior, enhancing in-context learning.

problem The limitations of traditional MLE interpretation in large-scale, single-epoch training setups.
method Demonstrates the power of interpreting neural networks as approximations of the true posterior, using experiments to predict generalizations.
result Models become robust in-context learners by effectively composing knowledge from their training data, revealing surprising generalizations.

Deep latent variable models (LVM) such as variational auto-encoder (VAE) have recently played an important role in text generation. One key factor is the exploitation of smooth latent structures to guide the generation. However, the representation power of VAEs is limited due to two reasons: (1) the Gaussian assumption…

2019-08-30abs ↗pdf ↗

How can one perform Bayesian inference on stochastic simulators with intractable likelihoods? A recent approach is to learn the posterior from adaptively proposed simulations using neural network-based conditional density estimators. However, existing methods are limited to a narrow range of proposal distributions or r…

2019-05-17abs ↗pdf ↗

We use neural networks to estimate complex model posteriors efficiently.

problem Intractable likelihood functions in complex models.
method Train a neural network to map data to posterior distributions of model parameters.
result Our method converges to true posteriors in Kullback-Leibler divergence.

We study the problem of sampling from the power posterior distribution in Bayesian Gaussian mixture models, a robust version of the classical posterior. This power posterior is known to be non-log-concave and multi-modal, which leads to exponential mixing times for some standard MCMC algorithms. We introduce and study …

2019-12-11abs ↗pdf ↗

CNR uses convex optimization to estimate conditional distributions.

problem Estimating uncertainty in predictions and posterior conditional distributions.
method Convex optimization of a posterior defined via non-linear transformations on Gaussians.
result CNR can fit arbitrary conditional distributions, including multimodal and non-symmetric ones.

Variational auto-encoders (VAE) are scalable and powerful generative models. However, the choice of the variational posterior determines tractability and flexibility of the VAE. Commonly, latent variables are modeled using the normal distribution with a diagonal covariance matrix. This results in computational efficien…

2016-11-29abs ↗pdf ↗

A multi-layer deep Gaussian process (DGP) model is a hierarchical composition of GP models with a greater expressive power. Exact DGP inference is intractable, which has motivated the recent development of deterministic and stochastic approximation methods. Unfortunately, the deterministic approximation methods yield a…

2019-10-26abs ↗pdf ↗

Markov chain Monte Carlo (MCMC) algorithms have become powerful tools for Bayesian inference. However, they do not scale well to large-data problems. Divide-and-conquer strategies, which split the data into batches and, for each batch, run independent MCMC algorithms targeting the corresponding subposterior, can spread…

2016-05-27abs ↗pdf ↗

Proposes a new method for posterior sampling using MMD with negative distance kernel.

problem Posterior sampling and conditional generative modeling.
method Approximates joint distribution using discrete Wasserstein gradient flows of MMD with negative distance kernel.
result Establishes an error bound for posterior distributions and proves the method is a Wasserstein gradient flow.

Bayesian framework for sphere regression using Gaussian fields.

problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.

New method uses neural networks to efficiently approximate Bayesian inference for complex models.

problem Efficiently approximating Bayesian inference for complex models with varying temperatures.
method Fully amortized neural posterior estimator trained on a single forward pass.
result Achieves competitive posterior approximations across various temperatures and benchmarks.

Variational autoencoder is a powerful deep generative model with variational inference. The practice of modeling latent variables in the VAE's original formulation as normal distributions with a diagonal covariance matrix limits the flexibility to match the true posterior distribution. We propose a new transformation, …

2019-01-30abs ↗pdf ↗

Loss-calibrated EP improves Bayesian decision-making by focusing on utility-sensitive posterior approximations.

problem Bayesian decision-making under asymmetric utility functions.
method Loss-calibrated expectation propagation (Loss-EP) that tilts the posterior towards higher utility decisions.
result Loss-EP can capture useful information for decision-making under asymmetric penalties.

Variational inference is a powerful tool for approximate inference, and it has been recently applied for representation learning with deep generative models. We develop the variational Gaussian process (VGP), a Bayesian nonparametric variational family, which adapts its shape to match complex posterior distributions. T…

2015-11-20abs ↗pdf ↗

A scalable method for efficient inference in Gaussian process regression networks.

problem Intractable inference in Gaussian process regression networks (GPRN).
method Tensorization of output space, tensor/matrix-normal variational posteriors, joint optimization, and exploiting Kronecker product structure.
result Captures posterior dependencies and improves inference quality for large number of outputs.

Improved NPE with conditional diffusions and summary networks.

problem Approximating complex posterior distributions efficiently and accurately.
method Conditional diffusions coupled with high-capacity summary networks.
result Conditional diffusions offer improved stability, accuracy, and faster training times.

Transformers can approximate posterior predictive distributions through in-context learning.

problem Bayesian prediction tasks, especially beyond point predictions.
method Gradient descent algorithm targeting posterior predictive mean and variance, followed by nonlinear mappings.
result Transformers can implement algorithms to approximate posterior predictive distributions.

The PAC-Bayesian approach is a powerful set of techniques to derive non- asymptotic risk bounds for random estimators. The corresponding optimal distribution of estimators, usually called the Gibbs posterior, is unfortunately intractable. One may sample from it using Markov chain Monte Carlo, but this is often too slow…

2015-06-12abs ↗pdf ↗

Gaussian Processes (GPs) are powerful non-parametric Bayesian regression models that allow exact posterior inference, but exhibit high computational and memory costs. In order to improve scalability of GPs, approximate posterior inference is frequently employed, where a prominent class of approximation techniques is ba…

2019-10-10abs ↗pdf ↗

C-DPS improves diffusion posterior sampling for inverse problems without projection or likelihood approximation.

problem Inaccurate and unstable solutions in inverse problems due to complex or high-noise conditions.
method C-DPS introduces a forward stochastic process in measurement space evolving in parallel with data-space diffusion, leading to a closed-form posterior.
result C-DPS consistently outperforms existing methods across multiple inverse problem benchmarks.

Paper introduces RVNP to improve SBI in misspecified models.

problem Misspecification in simulation-based inference leads to unreliable posterior estimation.
method RVNP uses variational inference and error modeling to bridge the simulation-to-reality gap.
result RVNP can recover robust posterior inference without hyperparameters or priors.

JANA trains networks to approximate Bayesian models efficiently.

problem Intractable likelihood functions and posterior densities in Bayesian models.
method End-to-end training of three networks: summary, posterior, and likelihood networks.
result JANA provides accurate amortized marginal likelihood and posterior predictive estimation.

Meta-learning framework improves model performance on few-shot classification tasks.

problem Improving model performance on few-shot classification tasks.
method Empirical Bayes formulation with synthetic gradients for transductive meta-learning.
result Meta-learning framework outperforms previous state-of-the-art methods on benchmarks.

The variational autoencoder (VAE) is a powerful generative model that can estimate the probability of a data point by using latent variables. In the VAE, the posterior of the latent variable given the data point is regularized by the prior of the latent variable using Kullback Leibler (KL) divergence. Although the stan…

2018-09-14abs ↗pdf ↗

Computable Stein discrepancies have been deployed for a variety of applications, ranging from sampler selection in posterior inference to approximate Bayesian inference to goodness-of-fit testing. Existing convergence-determining Stein discrepancies admit strong theoretical guarantees but suffer from a computational co…

2018-06-20abs ↗pdf ↗

Unified approach for selecting summary statistics in ABC.

problem Efficient inference from large datasets in likelihood-free methods.
method Characterizing and unifying three classes of summary statistics, minimizing expected posterior entropy.
result EPE-minimizing summaries lead to competitive posterior inference.

SGLDiff approximates Bayesian posterior distributions with subsampling error.

problem Approximating Bayesian posterior distributions in large-scale data settings.
method Stochastic Gradient Langevin Diffusion (SGLDiff) with subsampling.
result The Wasserstein distance between the posterior and SGLDiff's limiting distribution is bounded by a fractional power of the mean waiting time.

Due to the phenomenon of "posterior collapse," current latent variable generative models pose a challenging design choice that either weakens the capacity of the decoder or requires augmenting the objective so it does not only maximize the likelihood of the data. In this paper, we propose an alternative that utilizes t…

2019-01-10abs ↗pdf ↗