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

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for multilevel method

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.

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 ↗

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 ↗

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

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 ↗

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 ↗

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.

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

New estimator reduces nested expectation estimation costs.

problem Estimating repeatedly nested expectations is computationally expensive.
method Recursive Estimator for Arbitrary Depth (READ) using randomized multilevel Monte Carlo.
result Optimal computational cost of O(ε^(-2)) for every fixed D.

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 ↗

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.

Option valuation problems are often solved using standard Monte Carlo (MC) methods. These techniques can often be enhanced using several strategies especially when one discretizes the dynamics of the underlying asset, of which we assume follows a diffusion process. We consider the combination of two methodologies in th…

2018-06-05abs ↗pdf ↗

Automates kernel discovery for longitudinal data analysis.

problem Handling irregularly sampled, sparse longitudinal data with multilevel correlation.
method Combines deep neural networks and non-parametric kernel methods to discover complex multilevel correlation structure.
result Significantly outperforms state-of-the-art methods on benchmark data sets.

Novel weak MLMC scheme for Lévy-driven SDEs, applied to financial derivatives pricing.

problem Approximating solutions to Lévy-driven SDEs for financial derivatives pricing.
method Weak multilevel Monte-Carlo scheme with state space discretization of Lévy processes.
result Efficient approximation of financial derivatives pricing models.

This paper tackles fitting multilevel low rank matrices by addressing three problems.

problem Fitting a given matrix by an MLR matrix in the Frobenius norm.
method Factor fitting, rank allocation, and hierarchical partitioning.
result The proposed methods can fit a given matrix by an MLR matrix in the Frobenius norm.

Adaptive Multilevel Splitting improves rare event pricing for financial derivatives.

problem Efficient pricing of binary options in rare event regimes with discontinuous payoffs.
method Adaptive Multilevel Splitting (AMS) reformulates rare-event problem as conditional events.
result AMS achieves up to 200-fold improvements over standard Monte Carlo, preserving unbiasedness.

Proposes a method to reduce parallel complexity of MLMC in SGD.

problem Poor scalability of MLMC in SGD on parallel platforms.
method Proposes a delayed MLMC gradient estimator to reduce parallel complexity.
result Proves reduction in average parallel complexity per iteration at the cost of slightly worse convergence rate.

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 ↗

A new weighted MLMC method improves efficiency in Monte Carlo simulations.

problem Improving efficiency in Monte Carlo simulations with correlated coarse level approximations.
method Generalization of MLMC to any number of levels with control variates and weights.
result Significant efficiency improvements possible, especially when coarse level approximations are poorly correlated.

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.

In this paper we discuss the possibility of using multilevel Monte Carlo (MLMC) methods for weak approximation schemes. It turns out that by means of a simple coupling between consecutive time discretisation levels, one can achieve the same complexity gain as under the presence of a strong convergence. We exemplify thi…

2014-06-10abs ↗pdf ↗