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

4794140187 · Jun 202019922001200920172026
48 results for variational QMC

Many machine learning problems involve Monte Carlo gradient estimators. As a prominent example, we focus on Monte Carlo variational inference (MCVI) in this paper. The performance of MCVI crucially depends on the variance of its stochastic gradients. We propose variance reduction by means of Quasi-Monte Carlo (QMC) sam…

2018-07-04abs ↗pdf ↗

QMC and GSA improve option pricing and risk measures efficiency.

problem Efficiently pricing and hedging complex financial instruments.
method Application of QMC and GSA techniques for financial instrument pricing and hedging, comparing MC vs QMC and analyzing greeks computation.
result QMC outperforms MC in most cases, especially in high-dimensional simulations, leading to faster and more stable convergence.

Variational autoencoders (VAEs) are powerful generative models with the salient ability to perform inference. Here, we introduce a quantum variational autoencoder (QVAE): a VAE whose latent generative process is implemented as a quantum Boltzmann machine (QBM). We show that our model can be trained end-to-end by maximi…

2018-02-15abs ↗pdf ↗

This study compares MC and QMC methods for likelihood functions.

problem Approximating the normalizing constant of posterior distributions and marginal likelihoods.
method Characterizes the integration error of MC and QMC methods for likelihood functions.
result QMC outperforms MC under certain conditions, especially in high dimensions.

One of the main practical applications of quasi-Monte Carlo (QMC) methods is the valuation of financial derivatives. We aim to give a short introduction into option pricing and show how it is facilitated using QMC. We give some practical examples for illustration.

2017-07-13abs ↗pdf ↗

This study compares MC and QMC methods for derivative pricing, showing QMC's superior convergence rates.

problem Improving derivative pricing accuracy and efficiency in high-dimensional settings.
method Compared Monte Carlo and quasi-Monte Carlo techniques, focusing on convergence rates and low-discrepancy sequences.
result Quasi-Monte Carlo methods achieve superior convergence rates and reduce root mean square error in derivative pricing.

Study compares MC and QMC methods for pricing and risk analysis in a hyperbolic local volatility model.

problem Derivative pricing and risk analysis in a hyperbolic local volatility model.
method Application of Monte Carlo and Quasi Monte Carlo methods for pricing and risk analysis.
result Quasi Monte Carlo methods show superior performance in high-dimensional integration for derivative pricing and risk analysis.

This thesis advances algorithms and software for QMC, GP, and sciML.

problem Efficient high-dimensional integration, interpolation, and PDE modeling.
method Developed new algorithms and software for QMC, GP, and sciML.
result Efficient and accurate methods for high-dimensional problems.

We consider the problem of improving the efficiency of randomized Fourier feature maps to accelerate training and testing speed of kernel methods on large datasets. These approximate feature maps arise as Monte Carlo approximations to integral representations of shift-invariant kernel functions (e.g., Gaussian kernel).…

2014-12-29abs ↗pdf ↗

Many large scale problems in computational fluid dynamics such as uncertainty quantification, Bayesian inversion, data assimilation and PDE constrained optimization are considered very challenging computationally as they require a large number of expensive (forward) numerical solutions of the corresponding PDEs. We pro…

2019-03-07abs ↗pdf ↗

New method smooths integrands for efficient option pricing.

problem Improving numerical performance of option pricing methods.
method Combining hierarchical adaptive sparse grids, quasi-Monte Carlo, and numerical smoothing.
result Improved efficiency of ASGQ and QMC methods for high-dimensional problems.

RQMC improves kernel-based learning by reducing deterministic error and offering computational advantages.

problem Improving kernel-based learning methods to reduce deterministic error and computational complexity.
method Randomized quasi-Monte Carlo (RQMC) methods applied to random feature approximations.
result RQMC methods improve deterministic approximation error bound from OP(1/M)O_P(1/\sqrt{M}) to O(1/M)O(1/M), matching QMC methods.

Data compression speeds up machine learning loss calculations.

problem Computational demand in calculating mean squared error for large datasets.
method Use rank-1 lattices to compress data, assigning weights based on original data and responses.
result Our QMC data compression algorithms can lead to arbitrary high convergence rates for smooth functions.

Exciton diffusion plays a vital role in the function of many organic semiconducting opto-electronic devices, where an accurate description requires precise control of heterojunctions. This poses a challenging problem because the parameterization of heterojunctions in high-dimensional random space is far beyond the capa…

2019-10-31abs ↗pdf ↗

Large-scale kernel approximation is an important problem in machine learning research. Approaches using random Fourier features have become increasingly popular [Rahimi and Recht, 2007], where kernel approximation is treated as empirical mean estimation via Monte Carlo (MC) or Quasi-Monte Carlo (QMC) integration [Yang …

2017-05-23abs ↗pdf ↗

Effective dimensionality reduction improves accuracy and reduces costs in estimating option Greeks.

problem Estimating Greeks for barrier and arithmetic average Asian options.
method Global sensitivity analysis, Chebyshev interpolation, conditional pathwise method, randomized Quasi Monte Carlo, Brownian bridge discretization, importance sampling.
result Reduced effective dimensionality enhances convergence rate and accuracy of randomized Quasi Monte Carlo integration.

Quantum MC simulations generate financial risk distributions efficiently.

problem High computational cost in traditional Monte Carlo simulations.
method Integrates quantum amplitude estimation with stochastic models for equity, rate, and credit risk factors.
result Quantum advantage in scenario generation for financial risk analytics.

New variational principle found for non-variational differential equations.

problem Non-variational differential equations without variational multipliers.
method Connecting functional forms with antiexact differential forms to identify obstructions.
result Formulation of variational problem for non-variational equations.

Improved Bayesian uncertainty quantification using variational bagging.

problem Inefficient and underestimating uncertainty in mean-field variational Bayes.
method Integrates bagging with variational Bayes for improved inference.
result Bagged variational posterior provides proper uncertainty quantification.

Adaptive variational Bayes framework improves inference adaptively.

problem Lack of general and computationally tractable variational Bayes method for adaptive inference.
method Proposes a novel adaptive variational Bayes framework combining variational posteriors over individual models.
result Adaptive variational Bayes achieves optimal contraction rates adaptively under general conditions.

A new EVI framework improves ParVI methods by maintaining variational structure and reducing KL-divergence.

problem Improving variational inference methods for better approximation of target distributions.
method EVI framework that minimizes the VI objective function based on an energy-dissipation law, including a new 'Approximation-then-Variation' scheme.
result The new scheme significantly decreases KL-divergence and outperforms existing ParVI methods in fidelity.

We propose a family of variational approximations to Bayesian posterior distributions, called αα-VB, with provable statistical guarantees. The standard variational approximation is a special case of αα-VB with α=1α=1. When α(0,1]α\in(0,1], a novel class of variational inequalities are developed for linking the Bayes risk …

2017-10-09abs ↗pdf ↗

Variational Prediction simplifies Bayesian inference without test time costs.

problem Bayesian inference's computational costs and posterior predictive distribution marginalization.
method Variational Prediction learns a variational approximation to the posterior predictive distribution using a variational bound.
result Directly learns a variational approximation to the posterior predictive distribution without test time marginalization costs.

In the paper "On Truncated Variation of Brownian Motion with Drift" (Bull. Pol. Acad. Sci. Math. 56 (2008), no.4, 267 - 281) we defined truncated variation of Brownian motion with drift, Wt=Bt+μt,t0,W_t = B_t + μt, t\geq 0, where (Bt)(B_t) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…

2009-12-23abs ↗pdf ↗

Semi-Implicit Variational Inference (SIVI) is improved with SIVI-SM using score matching.

problem Intractable densities in variational distributions hinder SIVI training.
method SIVI-SM uses score matching to handle intractable densities in a minimax formulation.
result SIVI-SM outperforms ELBO-based SIVI methods in Bayesian inference tasks.