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

111223334445 · May 202619922001200920172026
48 results for conditional posterior

The paper introduces a new Wasserstein distance for approximating posteriors in inverse problems.

problem Approximating posterior measures in inverse problems using conditional Wasserstein distances.
method Introduces a conditional Wasserstein distance with restricted couplings and derives its dual.
result Shows that conditional Wasserstein GANs can yield favorable properties for posterior sampling.

New method improves generative model performance by fully conditioning variational posteriors.

problem Inaccurate inference due to partial conditioning of variational posteriors in sequential LVMs.
method Introduces fully-conditioned approximate posteriors to improve generative model performance.
result Improves generative modelling and multi-step prediction performance.

This work tackles posterior collapse in conditional and hierarchical VAEs.

problem Posterior collapse in VAEs leads to poor latent variable representations.
method Theoretical analysis of linear conditional and hierarchical VAEs, empirical validation.
result Theoretical and empirical evidence of posterior collapse causes in conditional and hierarchical VAEs.

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.

CoLT assesses neural posterior estimates by detecting discrepancies across conditioning inputs.

problem Validating neural posterior estimates from limited data.
method Conditional Localization Test (CoLT) learns a localization function to detect strong deviations.
result CoLT provides rigorous guarantees and practical scalability for comparing true and neural posterior distributions.

Study improves posterior inference in neural processes with limited data.

problem Improving posterior predictive inference in probabilistic models with scarce conditioning data.
method Examined effects of pooling operators and variational families on posterior quality in neural processes.
result Novel neural process architectures lead to superior posterior predictive samples in image completion/in-painting tasks.

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.

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.

A new method combines scores of individual observations to efficiently approximate posterior distributions.

problem Handling posterior distributions conditioned on multiple observations with neural methods.
method Conditional score modeling to combine learned scores from individual observations.
result Sample-efficient method that can aggregate multiple observations at inference time.

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.

We study convergence rates of variational posterior distributions for nonparametric and high-dimensional inference. We formulate general conditions on prior, likelihood, and variational class that characterize the convergence rates. Under similar "prior mass and testing" conditions considered in the literature, the rat…

2017-12-07abs ↗pdf ↗

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.

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 extend diffusion models to function spaces and introduce a new method for sampling from posterior distributions.

problem Sampling from posterior distributions in infinite-dimensional function spaces using diffusion models.
method Infinite-dimensional extension of Doob's hh-transform, Supervised Guidance Training for efficient sampling.
result We prove that diffusion models can be conditioned to sample from posterior distributions and introduce a simulation-free score matching objective.

Improved Thompson Sampling using fractional posteriors achieves better regret bounds.

problem Optimizing regret in stochastic multi-armed bandit problems.
method Using α\alpha-posterior distributions, derived frequentist regret bounds.
result Instance-dependent and instance-independent regret bounds established.

We consider the problem of sequential learning from categorical observations bounded in [0,1]. We establish an ordering between the Dirichlet posterior over categorical outcomes and a Gaussian posterior under observations with N(0,1) noise. We establish that, conditioned upon identical data with at least two observatio…

2017-02-14abs ↗pdf ↗

Bayesian PINNs learn elliptic PDEs with near-minimax posterior contraction rate.

problem Learning elliptic PDEs with noisy data and non-homogeneous boundary conditions.
method Bayesian approach with a Hölder space prior on neural network weights.
result Posterior contracts at near-minimax rate without prior knowledge of solution smoothness.

The semantic map calibrates uncertainty from language model probabilities.

problem Uncertainty in language model probabilities for professional decisions.
method Prespecified semantic map linking probabilities of verbal responses to probabilities of declared states.
result Language-derived probabilities outperform printed numerical probabilities and recover valid uncertainty coverage.

NQE uses quantile regression for fast SBI with cubic Hermite splines.

problem Efficient Bayesian inference for complex models with limited data.
method Neural Quantile Estimation (NQE) learns quantiles autoregressively and interpolates them using cubic Hermite splines.
result NQE achieves state-of-the-art performance on various benchmark problems.

MD-CGAN models forecast time series with probabilistic posterior distributions.

problem Limited applications of GANs in time series forecasting, especially with probabilistic predictions.
method Mixture Density Conditional Generative Adversarial Model (MD-CGAN) using Gaussian mixture output.
result MD-CGAN outperforms benchmarks, especially in noisy time series.

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.

Bayesian nonparametric models get better posterior estimates via SPDE methods.

problem Estimating posterior distributions in nonparametric Bayesian models.
method Extending diffusion methods to SPDEs on Hilbert spaces for posterior contraction and Laplace approximation.
result Derivation of posterior contraction rates and finite-sample Bernstein von Mises results.

Efficiently designs experiments without integrating posterior distributions.

problem Computational inefficiency in Bayesian experimental design for PDE-based models.
method Likelihood-free approach using ANN to approximate conditional expectation.
result Significant reduction in observation model evaluations.

Theoretical framework for M-posteriors connects Bayesian and frequentist statistics.

problem Connecting Bayesian and frequentist approaches in statistical inference.
method Developed a theoretical framework for M-posteriors, showing asymptotic normality and frequentist consistency.
result M-posteriors are robust and contract around M-estimators under mild conditions.

New method uses fractional posteriors for semiparametric inference with improved uncertainty quantification.

problem Semiparametric inference with nonparametric priors and fractional posteriors.
method Established a general Bernstein--von Mises theorem for fractional posterior distributions, proposed shifted-and-rescaled credible sets.
result Fractional posterior credible sets provide reliable uncertainty quantification but have inflated size; shifted-and-rescaled set is an efficient confidence set.

We quantify predictive uncertainty using the posterior predictive variance.

problem Quantifying uncertainty in predictive models.
method Using the law of total variance, we generate expansions for the posterior predictive variance.
result Identify the main contributors to prediction intervals and quantify term-wise uncertainty.

A new sampler for FLMs improves token-level decoding controls.

problem Sampling from FLMs using standard methods collapses marginals and produces invalid sequences.
method Samples clean one-hot endpoints from FLM token marginals and uses Ornstein-Uhlenbeck bridges conditioned on these endpoints.
result The method preserves token-wise posterior-predictive marginals and improves quality-diversity tradeoff.

This work extends balancing to various simulation-based inference algorithms for more conservative posterior approximations.

problem Overconfident posterior approximations in simulation-based inference.
method Introduces a balanced version of neural posterior estimation and contrastive neural ratio estimation.
result Balanced versions tend to produce conservative posterior approximations on various benchmarks.

New decision-theoretic characterization separates belief and decision posteriors.

problem Understanding the conditions under which loss-based updating coincides with Bayesian updating.
method Decision-theoretic approach to distinguish belief and decision posteriors.
result Generalized Bayes coincides with ordinary Bayesian updating only if the loss is proportional to negative log-likelihood.

We study Bayesian discriminative inference given a model family $p(c,\x, θ)$ that is assumed to contain all our prior information but still known to be incorrect. This falls in between "standard" Bayesian generative modeling and Bayesian regression, where the margin $p(\x,θ)$ is known to be uninformative about $p(c|\x,…

2008-07-22abs ↗pdf ↗

Label switching is a phenomenon arising in mixture model posterior inference that prevents one from meaningfully assessing posterior statistics using standard Monte Carlo procedures. This issue arises due to invariance of the posterior under actions of a group; for example, permuting the ordering of mixture components …

2019-11-05abs ↗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 ↗