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,657 papers · 148 categories

Trend · papers per month

59119178237 · Jun 202019922001200920172026
48 results for Weighted MLMC

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.

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.

Improved MLMC method for robust and efficient probability and density estimation.

problem Stability and poor complexity of MLMC for low-regularity functionals.
method Numerical smoothing combined with MLMC for deterministic quadrature methods.
result Significant improvement in strong convergence and robustness of MLMC method.

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 ↗

Paper proposes nested MLMC for SNPE with intractable likelihoods.

problem Estimating posterior distributions from intractable likelihoods.
method Nested MLMC for loss function and gradients, with convergence results.
result Effective methods for approximating complex multimodal posteriors.

Improved MLMC method for barrier options with non-Lipschitz coefficients.

problem Efficiency improvement for barrier option pricing with non-Lipschitz diffusion.
method Interpolated Drift Implicit Euler MLMC method, Lamperti transformation, Brownian bridge technique.
result Improved efficiency of MLMC for barrier options with non-Lipschitz coefficients.

The paper improves Monte Carlo methods for optimization problems.

problem Efficiently solving optimization problems with biased Monte Carlo estimators.
method Introduces Multilevel Monte Carlo (MLMC) within Sample Average Approximation (SAA).
result Establishes uniform convergence and sample complexity for MLMC in SAA.

Review of MLMC in financial engineering, focusing on option pricing and risk management.

problem Efficient estimation of financial risks and option prices using Monte Carlo methods.
method Incorporation of importance sampling and adaptive sampling algorithms in MLMC framework.
result Hybrid algorithms reduce overall variance in estimating financial risks and option prices.

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.

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.

We investigate the problem of computing a nested expectation of the form P[E[XY] ⁣ ⁣0] ⁣= ⁣E[H(E[XY])]\mathbb{P}[\mathbb{E}[X|Y] \!\geq\!0]\!=\!\mathbb{E}[\textrm{H}(\mathbb{E}[X|Y])] where H\textrm{H} is the Heaviside function. This nested expectation appears, for example, when estimating the probability of a large loss from a financial portfo…

2018-02-14abs ↗pdf ↗

New algorithms reduce complexity for learning in MDPs with entropy regularization.

problem Efficient learning for MDPs with large or continuous state and action spaces.
method Multilevel Monte Carlo (MLMC) algorithms integrating fixed-point iteration and stochastic approximation of the Bellman operator.
result MLMC with unbiased approximation of the Bellman operator achieves polynomial sample complexity.

Develops a multilevel Monte Carlo framework with dropout for efficient uncertainty quantification.

problem Efficiently quantify uncertainty in complex models using dropout.
method Integrates multilevel Monte Carlo with Monte Carlo dropout, creating coupled estimators to reduce variance.
result Demonstrates significant variance reduction and efficiency gains over single-level Monte Carlo dropout.

A new sampler tackles critical phenomena by leveraging scale invariance.

problem Scale invariance at criticality causes sampling difficulties in Monte Carlo simulations.
method RiGCS combines MLMC-HB with generative models to improve sampling efficiency.
result RiGCS achieves significantly higher effective sample size than existing methods.

New method reduces sample complexity for robust reinforcement learning.

problem Finite sample analysis in robust reinforcement learning.
method Stochastic approximation framework with controlled bias, using MLMC techniques and geometric truncation.
result Order-optimal sample complexity of ildeO(ε2) ilde{\mathcal{O}}(ε^{-2}) for robust policy evaluation.

This work overcomes bias in concave multi-objective reinforcement learning.

problem Gradient bias in policy gradient methods for concave scalarized multi-objective reinforcement learning.
method Developed a Natural Policy Gradient (NPG) algorithm with a multi-level Monte Carlo (MLMC) estimator.
result Achieved optimal O~(ε2)\widetilde{\mathcal{O}}(ε^{-2}) sample complexity for computing an εε-optimal policy.

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 ↗

We propose a variance reduction framework for variational inference using the Multilevel Monte Carlo (MLMC) method. Our framework is built on reparameterized gradient estimators and "recycles" parameters obtained from past update history in optimization. In addition, our framework provides a new optimization algorithm …

2019-02-01abs ↗pdf ↗

New method improves training-free guidance for diffusion models, achieving state-of-the-art results.

problem Accurate, training-free guidance for conditional generation in diffusion models.
method Sequential Monte Carlo (SMC) framework with Multi-Level Monte Carlo (MLMC) variance reduction.
result Achieves state-of-the-art results on CIFAR-10 and ImageNet datasets with significant cost reduction.

DynBRO learns robustly from dynamic Byzantine workers.

problem Fault-tolerant distributed learning with dynamic Byzantine workers.
method Multi-level Monte Carlo (MLMC) gradient estimation and adaptive learning rate.
result DynaBRO nearly matches static setting's convergence rate with O(T)\mathcal{O}(\sqrt{T}) Byzantine worker changes.

Adaptive Multilevel Monte Carlo improves probability estimation for complex random variables.

problem Estimating probabilities of complex random variables with multiple approximations.
method Adaptive Multilevel Monte Carlo framework for discontinuous functionals.
result Achieves optimal computational complexities for both smooth and discontinuous functionals.

New model-free DR-RL algorithm with finite sample complexity.

problem Limited model-free DR-RL methods with convergence guarantees or sample complexities.
method Integrates Multi-level Monte Carlo (MLMC) technique with threshold mechanism.
result First model-free DR-RL approach with finite sample complexity for total variation and Chi-square divergence.

Generative model for Lévy area improves SDE simulation accuracy.

problem Simulating Lévy areas for high-order SDEs is challenging due to non-Gaussian nature and lack of fast sampling algorithms.
method LévyGAN, a deep-learning model with a GNN-inspired architecture, generates approximate samples of Lévy area.
result LévyGAN matches all joint and conditional odd moments exactly and achieves state-of-the-art performance in 4D Brownian motion.

A new weighted MCC measure improves classifier performance evaluation.

problem Lack of measures sensitive to observation weights in multiclass classification.
method Proposes weighted versions of Pearson-Matthews Correlation Coefficient (MCC) for binary and multiclass classification.
result Weighted MCC values are higher for classifiers that perform better on highly weighted observations.

Develops theory of weightings for Lie groupoids and algebroids.

problem Understanding differential geometry of weightings for Lie groupoids and algebroids.
method Extending work on weighted manifolds, defining weighted submanifolds, and developing theories of linear weightings and multiplicative weightings.
result Characterizes infinitesimally multiplicative weightings for Lie algebroids and classifies multiplicative weightings of Lie groupoids.

The paper extends spin geometry to weighted manifolds and defines a new mass for Ricci flow.

problem Generalizing spin geometry to weighted manifolds and defining a new mass.
method Investigates spectral properties of the weighted Dirac operator and defines a new mass.
result Defines a new mass for weighted asymptotically Euclidean manifolds and shows its monotonicity under Ricci flow.

The study explores weightings on submanifolds and their geometric properties.

problem Understanding weightings on submanifolds and their geometric implications.
method Detailed exploration of weighted normal bundles, weighted deformation spaces, and weighted blow-ups.
result A description of weightings in terms of subbundles of higher tangent bundles, leading to new concepts for Lie algebroids and groupoids.

Defines and proves properties of weighted renormalized volume coefficients.

problem None explicitly stated; focuses on mathematical definitions and proofs.
method Defines weighted renormalized volume coefficients and proves their variational nature and polynomial representation.
result Weighted renormalized volume coefficients are variational and can be expressed as polynomials of specific tensors.