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

3627241,0851,447 · Jun 202019922001200920172026
48 results for Bayesian multilevel models

Improved Bayesian regression for large datasets using multilevel Gibbs sampling.

problem Efficiently handling large-scale Bayesian regression with complex posterior distributions.
method Developed a multilevel Gibbs sampler for linear mixed models, incorporating data clustering and correlated samples for variance reduction.
result Significant speed-up achieved for Bayesian regression without sacrificing predictive performance.

Accelerates MCMC sampling for large-scale problems using machine learning.

problem Efficiently sampling large-scale Bayesian inference problems with high computational cost.
method Integrates low-fidelity machine learning models into a multilevel MCMC framework.
result Significantly accelerates multilevel sampling by a factor of two with similar accuracy.

We present a Bayesian nonparametric framework for multilevel clustering which utilizes group-level context information to simultaneously discover low-dimensional structures of the group contents and partitions groups into clusters. Using the Dirichlet process as the building block, our model constructs a product base-m…

2014-01-09abs ↗pdf ↗

A new training method uses multilevel minimization for machine learning.

problem Training machine learning models with high variance and low efficiency.
method Constructs a multilevel hierarchy by reducing sample size and internally trains surrogate models with fewer samples.
result The multilevel method enhances model training efficiency compared to subsampled Newton's and variance reduction methods.

Unbiased method for Bayesian posterior means using kinetic Langevin dynamics.

problem Estimating Bayesian posterior means efficiently and accurately.
method Combines advanced splitting methods with enhanced gradient approximations in a multilevel Monte Carlo approach.
result The method achieves unbiased estimates with finite variance and central limit theorem properties.

We investigate the extension of the multilevel Monte Carlo path simulation method to jump-diffusion SDEs. We consider models with finite rate activity, using a jump-adapted discretisation in which the jump times are computed and added to the standard uniform dis- cretisation times. The key component in multilevel analy…

2011-06-23abs ↗pdf ↗

Efficiently price VIX options using multilevel Monte Carlo in rough Bergomi model.

problem Pricing VIX options in a rough Bergomi model with high computational complexity.
method Combining rectangle discretization, Cholesky sampling, and multilevel Monte Carlo.
result Reduced computational complexity to O(ε2log2(ε))\mathcal{O}(\varepsilon^{-2} \log^2(\varepsilon)) and asymptotically optimal O(ε2)\mathcal{O}(\varepsilon^{-2}).

Improved multilevel scheme for value-at-risk computation.

problem Discontinuity in Heaviside function affects value-at-risk computation.
method Adaptive multilevel stochastic approximation to mitigate discontinuity.
result Best complexity improved to O(ε2lnε52\varepsilon^{-2}|\ln{\varepsilon}|^\frac52).

We develop a multilevel approach to compute approximate solutions to backward differential equations (BSDEs). The fully implementable algorithm of our multilevel scheme constructs sequential martingale control variates along a sequence of refining time-grids to reduce statistical approximation errors in an adaptive and…

2014-12-09abs ↗pdf ↗

Model trains passing events on a bridge using multilevel Gaussian process.

problem Represent aggregate train-passing events from a bridge monitoring system.
method Formulate a combined model with low-rank approximation hierarchical Gaussian process, incorporating domain expertise as constraints.
result Allow for simulation of previously unobserved train types.

Since Giles introduced the multilevel Monte Carlo path simulation method [18], there has been rapid development of the technique for a variety of applications in computational finance. This paper surveys the progress so far, highlights the key features in achieving a high rate of multilevel variance convergence, and su…

2012-12-06abs ↗pdf ↗

Markov chain Monte Carlo (MCMC) algorithms are ubiquitous in Bayesian computations. However, they need to access the full data set in order to evaluate the posterior density at every step of the algorithm. This results in a great computational burden in big data applications. In contrast to MCMC methods, Stochastic Gra…

2016-09-15abs ↗pdf ↗

We apply multilevel Monte Carlo for option pricing problems using exponential Lévy models with a uniform timestep discretisation to monitor the running maximum required for lookback and barrier options. The numerical results demonstrate the computational efficiency of this approach. We derive estimates of the convergen…

2014-03-20abs ↗pdf ↗

Paper tackles scalable VFL with data augmentation and amortized inference.

problem Collaborative model estimation across multiple clients with distinct covariates.
method Data augmentation, amortized variational approximation, factorized likelihoods.
result Scalable Bayesian VFL framework for various models.

A method learns to solve multilevel combinatorial problems with two players.

problem Multilevel combinatorial optimization problems with multiple players.
method Value-based multi-agent reinforcement learning in a graph neural network framework.
result Close to optimal solutions on graphs up to 100 nodes, with a significant speedup.

In medical domain, data features often contain missing values. This can create serious bias in the predictive modeling. Typical standard data mining methods often produce poor performance measures. In this paper, we propose a new method to simultaneously classify large datasets and reduce the effects of missing values.…

2015-03-21abs ↗pdf ↗

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.

Solving different types of optimization models (including parameters fitting) for support vector machines on large-scale training data is often an expensive computational task. This paper proposes a multilevel algorithmic framework that scales efficiently to very large data sets. Instead of solving the whole training s…

2014-10-13abs ↗pdf ↗

The time complexity of support vector machines (SVMs) prohibits training on huge data sets with millions of data points. Recently, multilevel approaches to train SVMs have been developed to allow for time-efficient training on huge data sets. While regular SVMs perform the entire training in one -- time consuming -- op…

2018-08-20abs ↗pdf ↗

Paper proposes an unbiased optimization method for Bayesian experimental design.

problem Maximizing expected information gain in Bayesian experimental design.
method Randomized multilevel Monte Carlo (MLMC) method combined with stochastic gradient descent.
result An unbiased estimator for the gradient of expected information gain.

Monte Carlo is a simple and flexible tool that is widely used in computational finance. In this context, it is common for the quantity of interest to be the expected value of a random variable defined via a stochastic differential equation. In 2008, Giles proposed a remarkable improvement to the approach of discretizin…

2015-05-05abs ↗pdf ↗

Infinite-dimensional SBDMs improve image generation across multiple resolutions.

problem Efficient image generation at high resolutions and across different levels.
method Developed SBDMs in infinite-dimensional setting, using trace class operators and operator networks.
result Improved efficiency and generalization across resolution levels.

We study the use of the multilevel Monte Carlo technique in the context of the calculation of Greeks. The pathwise sensitivity analysis differentiates the path evolution and reduces the payoff's smoothness. This leads to new challenges: the inapplicability of pathwise sensitivities to non-Lipschitz payoffs often makes …

2011-02-07abs ↗pdf ↗