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

51101152202 · Jun 202019922001200920172026
48 results for High-dimensional posterior

Estimates high-dimensional posterior densities by marginal distributions and neural networks.

problem High-dimensional probability density estimation for inference is difficult.
method Direct estimation of lower-dimensional marginal distributions, using Moment Networks for fast computation of moments.
result Demonstrates estimation of gravitational wave time series and applications in cosmology.

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}).

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.

GATSBI uses GANs for SBI, improving posterior estimation in high dimensions.

problem Statistical inference on stochastic models without likelihoods.
method Adversarial approach to variational objective, amortized inference, implicit priors.
result GATSBI returns well-calibrated posterior estimates in high dimensions.

The paper analyzes sparse high-dimensional linear regression with random design and unknown error variance, providing adaptiveness and concentration rates.

problem Sparse high-dimensional linear regression with random design and unknown error variance.
method Analysis of posterior concentration rates, employing techniques to address model misspecification.
result Adaptiveness and concentration rates of the posterior for sparse high-dimensional linear regression.

High-dimensional VAEs inevitably collapse to prior, requiring large datasets for good performance.

problem Posterior collapse in VAEs leads to poor representation learning quality.
method Analyzed a minimal VAE in a high-dimensional limit, evaluating conditions for posterior collapse with respect to beta and dataset size.
result VAEs face 'inevitable posterior collapse' beyond a certain beta threshold, regardless of dataset size.

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.

MsIGN tackles high-dimensional Bayesian inference using multiscale structure.

problem High-dimensional Bayesian inference challenges due to the curse of dimensionality.
method MsIGN generates samples from coarse to fine scale, minimizing Jeffreys divergence.
result MsIGN outperforms previous approaches in posterior approximation and mode capture.

New framework improves variational inference for high-dimensional posteriors.

problem Challenges in choosing variational objectives and approximating families for high-dimensional posteriors.
method Conceptual framework and experimental tools to understand and optimize variational objectives and families.
result For moderate-to-high-dimensional posteriors, exclusive KL divergence is recommended due to optimization ease; for low-dimensional, heavy-tailed variational families are effective.

A new framework for clustering high-dimensional data using vertical shards.

problem Clustering high-dimensional data with the curse of dimensionality.
method Vertical Consensus Inference (VCI) that splits data into vertical shards for posterior inference.
result VCI can approximate inference on random partitions for high-dimensional data.

A new ensemble filter uses transport maps and MMD optimization for high-dimensional data assimilation.

problem High-dimensional data assimilation challenges in ensemble filtering.
method Optimized Maximum Mean Discrepancy (MMD) for transport map construction.
result Significant improvement in robustness and posterior approximation.

Study shows TAP free energy minimization provides better posterior inference in high-dimensional linear models.

problem Deviation from true posterior mean and underestimation of posterior uncertainty in variational inference.
method Minimization of TAP free energy in a high-dimensional asymptotic framework, showing geometric and statistical properties.
result Local minimizer of TAP free energy provides consistent estimate of posterior marginals and correctly calibrated posterior inference.

Study high-dimensional Bayesian linear regression using variational inference.

problem High-dimensional Bayesian linear regression with product priors.
method Non-linear large deviations theory and variational inference.
result Unique optimizer in variational problem governs posterior distribution under separation condition.

This paper introduces NPR, a technique to improve Bayesian inference for multi-modal, high-dimensional simulations.

problem Challenges in Bayesian inference for multi-modal, high-dimensional simulations.
method Introduces Neural Posterior Regularization (NPR) to enforce exploration of input parameter space.
result Empirically validated that NPR significantly improves performance on various simulation tasks.

DiBO uses diffusion models to optimize high-dimensional black-box functions efficiently.

problem Optimizing high-dimensional and complex black-box functions efficiently.
method DiBO iterates two stages: training a diffusion model and casting candidate selection as posterior inference.
result DiBO outperforms state-of-the-art baselines across synthetic and real-world tasks.

Stable training of deep normalizing flows for high-dimensional variational inference.

problem Training deep normalizing flows for high-dimensional posterior distributions is infeasible due to high stochastic gradient variance.
method Proposed a combination of soft-thresholding of scale and bijective soft log transformation to stabilize training.
result Stable training of Real NVPs for posterior distributions with thousands of dimensions is possible.

This work introduces a method for visualizing high-dimensional posteriors using hierarchical tree-valued predictions.

problem Visualizing high-dimensional posterior distributions for complex problems like image restoration.
method A neural network predicts a tree-valued hierarchical summarization of the posterior distribution in a single forward pass.
result The method efficiently summarizes and visualizes posteriors, achieving comparable results to hierarchical clustering but at a much faster speed.

High-dimensional unimodal distributions can cause MCMC methods to fail.

problem Failure of MCMC methods in high-dimensional unimodal distributions.
method Examples and theoretical analysis of MCMC methods, including Metropolis-Hastings adjusted methods.
result MCMC methods can take an exponential run-time for high-dimensional unimodal distributions.

Bayesian neural networks achieve optimal posterior contraction rates in Besov spaces with intrinsic dimensionality.

problem High-dimensional structured estimation problems with unknown smoothness levels.
method Sparse Bayesian neural networks with either sparse or continuous shrinkage priors.
result Optimal posterior contraction rates are achieved, adapting to the unknown smoothness level of the true function.

New method improves high-dimensional Bayesian optimization efficiency using MCMC.

problem High-dimensional optimization challenges and computational complexity.
method Markov Chain Monte Carlo (MCMC) to efficiently sample from approximated posterior.
result Metropolis-Hastings and Langevin Dynamics versions outperform state-of-the-art methods.

Characterizes uncertainty in high-dimensional linear classification models.

problem Assessing uncertainty in high-dimensional linear classification models.
method Approximate message passing algorithm for posterior marginals, closed-form formula for joint statistics.
result Closed-form formula for joint statistics between logistic classifier, Bayesian uncertainty, and ground-truth probit uncertainty.

ABI bypasses likelihood intractability with nonparametric distribution matching.

problem Approximate Bayesian computation's inefficiency in high-dimensional settings and under diffuse priors.
method Adaptive Bayesian Inference (ABI) compares posterior distributions directly using nonparametric distribution matching and MSW distance.
result ABI significantly outperforms other methods in high-dimensional or dependent observation regimes.

We present a Communication-efficient Surrogate Likelihood (CSL) framework for solving distributed statistical inference problems. CSL provides a communication-efficient surrogate to the global likelihood that can be used for low-dimensional estimation, high-dimensional regularized estimation and Bayesian inference. For…

2016-05-25abs ↗pdf ↗

EP method speeds up Bayesian probit regression in high dimensions.

problem Computational challenges in high-dimensional Bayesian probit regression.
method Adapting EP approximation to multivariate Gaussian prior and skew-normal distribution.
result EP routine is computationally feasible in high-dimensional settings.

A new particle filter avoids resampling to improve state estimation in high dimensions.

problem Particle deprivation in high-dimensional state spaces.
method A resampling-free particle filter designed to mitigate particle deprivation.
result The filter offers a near-accurate representation of the posterior distribution in high-dimensional contexts.

New method uses EKI for efficient Bayesian inference in high-dimensional problems.

problem Efficient inference for high-dimensional posterior distributions in physics-informed neural networks.
method Ensemble Kalman Inversion (EKI) for high-dimensional posterior inference.
result EKI-based inference provides comparable uncertainty estimates to HMC-based methods but with reduced computational cost.

New method speeds up Bayesian inference for complex simulators.

problem Challenges in Bayesian inference for complex stochastic simulators with intractable likelihood functions.
method Optimization Monte Carlo framework reformulated as deterministic optimization problems with gradient-based methods.
result Accurate posterior inference with reduced runtimes compared to existing methods.

Method generates joint posterior samples of source and foreground mass distributions for gravitational lensing.

problem Challenging inference problem for high-resolution, high signal-to-noise ratio gravitational lensing.
method Combines diffusion-based generative modeling and recurrent inference machines.
result Can model realistic gravitational lensing simulations down to the noise level.

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.

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 ↗

AP-CDE uses NF to estimate high-dimensional conditional densities, improving interpretability.

problem Estimating conditional densities for high-dimensional responses like images.
method Extends NF neural networks to handle high-dimensional yy with a latent zz.
result Improves interpretation of latent components, especially zPz_P.

A new method maps high-dimensional Bayesian inverse problems to lower dimensions.

problem High-dimensional Bayesian inverse problems with complex prior information.
method Data-driven VAE prior and KRnet map for posterior approximation in latent space.
result Efficiently reduces computational cost and approximates posterior distributions.

Variational language models seek to estimate the posterior of latent variables with an approximated variational posterior. The model often assumes the variational posterior to be factorized even when the true posterior is not. The learned variational posterior under this assumption does not capture the dependency relat…

2019-09-09abs ↗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.

Bayesian Tobit model tackles high-dimensional censored data with Horseshoe prior.

problem High-dimensional censored data with unknown bounds.
method Horseshoe prior for shrinkage, data augmentation for Gibbs sampling.
result Established posterior consistency and concentration rates for Bayesian Tobit models.

GPNs use unlabeled data to estimate uncertainty in Bayesian problems.

problem Limited training data in high-dimensional problems.
method Generative Posterior Networks (GPNs) that approximate the posterior distribution using unlabeled data.
result GPNs improve epistemic uncertainty estimation and scalability.

The paper decouples shrinkage and selection in Bayesian Quantile Regression.

problem Improving prediction accuracy in high-dimensional Bayesian Quantile Regression.
method Two-step procedure: shrinkage through continuous priors, sparsification through SAVS.
result The method reduces bias and provides interpretable variable selection.

Randomized value functions offer a promising approach towards the challenge of efficient exploration in complex environments with high dimensional state and action spaces. Unlike traditional point estimate methods, randomized value functions maintain a posterior distribution over action-space values. This prevents the …

2018-06-06abs ↗pdf ↗