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

Trend · papers per month

128257385513 · Jun 202019922001200920172026
48 results for posterior complexity

Unified framework for model-based RL with sample complexity guarantees.

problem Designing efficient posterior sampling methods for model-based RL.
method Optimistic posterior sampling, Hellinger distance reduction, data likelihood measurement.
result Unified algorithms with state-of-the-art sample complexity guarantees.

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.

ConDiSim uses diffusion models to approximate complex system posteriors efficiently.

problem Simulation-based inference of systems with intractable likelihoods.
method Conditional diffusion model with forward and reverse processes.
result Effective posterior approximation across various benchmark and real-world problems.

The choice of approximate posterior distribution is one of the core problems in variational inference. Most applications of variational inference employ simple families of posterior approximations in order to allow for efficient inference, focusing on mean-field or other simple structured approximations. This restricti…

2015-05-21abs ↗pdf ↗

This paper introduces a spline-based method for nonparametric ADVI that handles complex posterior distributions.

problem Learning complex posterior distributions with skewness, multimodality, and bounded support.
method Develops a spline-based nonparametric approximation approach for ADVI.
result Establishes the asymptotic consistency of the derived lower bound for importance weighted autoencoder.

TM-VI uses flexible transformation models to approximate complex posteriors in Bayesian models.

problem Approximating complex posteriors in Bayesian models with limited flexibility.
method Transformation models for variational inference (TM-VI).
result TM-VI allows accurate approximation of complex posteriors in models with one parameter and works in a mean-field fashion for multi-parameter models.

Markov networks are extensively used to model complex sequential, spatial, and relational interactions in a wide range of fields. By learning the structure of independences of a domain, more accurate joint probability distributions can be obtained for inference tasks or, more directly, for interpreting the most signifi…

2016-08-08abs ↗pdf ↗

PAC-Bayes bounds for Gibbs posteriors derived via singular learning theory.

problem Generalization bounds for overparameterized models with data-dependent priors.
method Explicit non-asymptotic PAC-Bayes bounds using singular learning theory.
result Explicit posterior-averaged risk bounds for overparameterized models.

Improved SBI with neural networks for complex models.

problem Accurate inference for complex models with intractable likelihood.
method Structured mixtures of probability distributions for likelihood and posterior approximation.
result Accurate posterior inference with smaller computational footprint.

A new method improves posterior approximation for complex distributions.

problem Difficulty in capturing multimodal and heavy-tailed posteriors with standard normalizing flows.
method StiCTAF: stick-breaking mixture base with component-wise tail adaptation.
result Improved tail recovery and better mode coverage compared to benchmarks.

New methods for tuning alpha in Gibbs posteriors improve speed and accuracy.

problem Inconsistency in Bayesian inference and lack of fast tuning methods for alpha.
method Proposed two data-driven methods: sample-splitting and bootstrapping. Formulated alpha-posteriors for three models.
result Sample-splitting outperforms SafeBayes in speed and accuracy, especially in complex models.

Sparse matrices simplify computation of GP variances and likelihoods.

problem Efficient computation of posterior variance and log-likelihood for additive Matérn GPs.
method Represented posterior mean, variance, log-likelihood, and gradient using sparse matrices.
result Efficient computation of posterior mean, variance, log-likelihood, and gradient in O(nlogn)O(n \log n) time.

S-VBMC improves VBMC's exploration of complex posterior distributions.

problem Efficient inference for computationally expensive models with complex posterior distributions.
method Stacking multiple independent VBMC runs to create a robust global posterior approximation.
result Significant improvements in posterior approximation quality across various applications.

Variational inference methods often focus on the problem of efficient model optimization, with little emphasis on the choice of the approximating posterior. In this paper, we review and implement the various methods that enable us to develop a rich family of approximating posteriors. We show that one particular method …

2017-07-09abs ↗pdf ↗

New method improves sample-efficiency in neural posterior estimation using simulator gradients.

problem High-fidelity posterior estimation with complex physical simulations is time-consuming.
method Neural Posterior Estimation (NPE) with differentiable simulators and gradient information.
result Improves sample-efficiency in posterior density estimation.

Thompson sampling (TS) is a class of algorithms for sequential decision-making, which requires maintaining a posterior distribution over a model. However, calculating exact posterior distributions is intractable for all but the simplest models. Consequently, efficient computation of an approximate posterior distributio…

2019-02-19abs ↗pdf ↗

We propose a novel approach to approximate complex high-dimensional posteriors using neural samplers.

problem Accurately capturing complex, multimodal, and correlated posteriors in high-dimensional spaces.
method Implicit variational inference with neural samplers and local linearisation bounds.
result Our method enables implicit distributions over tens of millions of latent variables, recovering correlations across layers in large Bayesian neural networks.

Brain uses synaptic failure to sample from posterior distributions.

problem Bayesian inference in the brain's probabilistic computations.
method Adapting synaptic failure to sample posterior predictive distributions.
result Synaptic failure enables sampling of complete posterior predictive distributions.

Bayesian KANs achieve near-minimax posterior contraction rates in anisotropic Besov spaces.

problem Statistical foundation for Bayesian Kolmogorov-Arnold networks in anisotropic Besov spaces.
method Sparse Bayesian KANs with spike-and-slab priors, hyperprior on model size, and approximation complexity bounds.
result Posterior contraction rates depend on intrinsic anisotropic smoothness and effective dimension of the compositional structure.

Paper establishes statistical validity for variational Bayes in neural networks.

problem Lack of theoretical validity for Variational Bayes in Bayesian Neural Networks.
method Establishes posterior consistency for mean-field variational posterior in feed-forward neural networks.
result Proves VP concentrates around Hellinger neighborhoods of true density function under certain conditions.

Sparse variational approximations allow for principled and scalable inference in Gaussian Process (GP) models. In settings where several GPs are part of the generative model, theses GPs are a posteriori coupled. For many applications such as regression where predictive accuracy is the quantity of interest, this couplin…

2017-11-03abs ↗pdf ↗

This paper explores Bayesian Neural Network posteriors, uncovering symmetries and their impact.

problem Understanding the complex posterior distribution of deep Bayesian Neural Networks.
method Investigates optimal approaches for approximating posteriors, analyzes modes, and explores visualizations.
result Uncovered weight-space symmetries and their impact on the posterior, particularly scaling symmetries.

One of the core problems in variational inference is a choice of approximate posterior distribution. It is crucial to trade-off between efficient inference with simple families as mean-field models and accuracy of inference. We propose a variant of a greedy approximation of the posterior distribution with tractable bas…

2019-05-20abs ↗pdf ↗

Develops variational Bayesian neural network for complex biomedical applications.

problem High computational cost of Markov Chain Monte Carlo in BNN.
method Variational Bayes inference for posterior consistency and classification accuracy.
result Developed statistical theory for posterior consistency and prediction accuracy.

Bayesian neural networks struggle with accuracy and uncertainty quantification in complex models.

problem Challenges in achieving high predictive performance and reliable uncertainty estimates in Bayesian neural networks.
method Investigates computational costs, accuracy, and uncertainty quantification in Bayesian neural networks with different inference techniques.
result Variational inference provides better uncertainty quantification than Markov chain Monte Carlo, and stacking/ensembling variational approximations can achieve similar accuracy at reduced cost.

Improved sampling for high-dimensional posteriors with underdamped Langevin.

problem Scalability issues in high-dimensional problems with approximate Thompson sampling.
method Underdamped Langevin Monte Carlo for accelerated posterior concentration.
result Logarithmic regret improvement from ildeO(d)\mathcal{ ilde O}(d) to ildeO(d)\mathcal{ ilde O}(\sqrt{d}).

A novel diffusion method for Bayesian posterior sampling with theoretical guarantees.

problem Efficiently sampling from complex posterior distributions in Bayesian inversion.
method Diffusion-based posterior sampling using Langevin dynamics and PnP framework.
result The method converges even for multi-modal posterior distributions with theoretical error bounds.

Bayesian DDR models complex multivariate distributions.

problem Modeling relationships between multivariate distributions with differing dimensions.
method Generalized Bayesian framework using sliced Wasserstein distance and MALA for inference.
result Posterior consistency and robust fits demonstrated in simulations and real data.

New method reduces GP bandit complexity while maintaining good performance.

problem Computational burden in Bayesian optimization with Gaussian processes.
method Information thresholding to compress GP posterior and reduce complexity.
result Sublinear regret bounds with sublinear posterior complexity.

Generative sampler learns velocity fields for efficient posterior inference.

problem Sampling from complex posterior distributions in high dimensions.
method Generative multivariate posterior sampler via flow matching, learning a velocity field for a deterministic transport map.
result Conditional Brenier map enables fast generation of credible sets with theoretical consistency guarantees.

Posterior sampling estimator achieves near-optimal recovery guarantees for signals from any prior distribution.

problem Characterizing measurement complexity for signals from any prior distribution, including the entire space.
method Characterization of measurement complexity using posterior sampling estimator for Gaussian measurements and any prior distribution.
result Posterior sampling estimator achieves near-optimal recovery guarantees for signals from any prior distribution, robust to model mismatch.