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

96192287383 · Jun 202019922001200920172026
48 results for weak approximation

Study approximates weak error for specific stochastic models with rough and Gaussian mean-reverting volatility.

problem Approximating weak error for specific stochastic models with rough and Gaussian mean-reverting volatility.
method Used Euler type scheme with integrated kernels to study weak convergence rate.
result Obtained weak convergence rate of min(3α1,1)\min(3α-1,1) for discretised rough Ornstein-Uhlenbeck process and stochastic rough volatility model.

Efficiently plans large MDPs with weak function approximations.

problem Planning in large MDPs with limited function approximation capabilities.
method Uses linear value function approximation with weak requirements and a generative oracle.
result Produces almost-optimal actions for any state with polynomial computation time.

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 ↗

Smooth flows with surgery approximate weak mean curvature flows with spherical and neck-pinch singularities.

problem Approximating weak mean curvature flows with singularities using smooth flows.
method Combining Choi-Haslhofer-Hershkovits and Choi-Haslhofer-Hershkovits-White work on canonical neighbourhoods and barriers to flows with surgery.
result Smooth flows with surgery can approximate weak mean curvature flows with spherical and neck-pinch singularities.

Efficient simulation scheme for rough Heston model reduces computational cost.

problem Accurate and efficient simulation of the rough Heston model for option pricing.
method Weak simulation scheme based on Markovian approximations of the rough Heston process.
result The new scheme exhibits second order weak convergence with linear computational cost.

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.

New method improves Euler approximation for local stochastic volatility models.

problem Well-posedness of Euler approximation for local stochastic volatility models.
method Start with a well-defined Euler approximation to the formal McKean-Vlasov equation, followed by a half-step scheme.
result Showed weak order one for the Euler discretization, plus error terms.

Develops weak PINNs for efficient manifold solutions of hyperbolic equations.

problem Challenges in approximating weak solutions of nonlinear hyperbolic equations on manifolds.
method Introduces a novel weak PINN (wPINN) formulation on manifolds leveraging well-posedness theory.
result Demonstrates efficient approximation of entropy solutions on manifolds with a complexity independent of ambient space dimension.

We study the evolution of hypersurfaces in spacetime initial data sets by their null mean curvature. A theory of weak solutions is developed using the level-set approach. Starting from an arbitrary mean convex, outer untapped hypersurface Ω0\partialΩ_0, we show that there exists a weak solution to the null mean curvatu…

2015-03-13abs ↗pdf ↗

The study examines conditions for weak nearly cosymplectic manifolds to split into products.

problem Understanding the curvature and topology of weak nearly cosymplectic manifolds.
method Analyzes the conditions for splitting and characterizes specific manifolds.
result Conditions for weak nearly cosymplectic manifolds to become Riemannian products are identified.

One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact propagation of marginals for prediction. This paper addresses two questions left open by t…

2012-06-27abs ↗pdf ↗

We show that the existence of a computationally efficient calibration algorithm, with a low weak calibration rate, would imply the existence of an efficient algorithm for computing approximate Nash equilibria - thus implying the unlikely conclusion that every problem in PPAD is solvable in polynomial time.

2012-02-20abs ↗pdf ↗

Paper proposes a weak approximation of reflection coupling for non-convex optimization.

problem Non-convex optimization problems with different drift terms.
method Proposes an approximate reflection coupling (ARC) for stochastic differential equations (SDEs).
result ARC converges weakly to the reflection coupling and can be applied to non-convex optimization.

We provide approximations for VIX futures and options in forward variance models.

problem Modeling VIX futures and options in forward variance models.
method Weak approximations and explicit formula derivation for VIX futures and options.
result Explicit combinations of Black-Scholes prices and greeks for option price approximations.

We study sparse approximation by greedy algorithms. We prove the Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA), a generalization of the Weak Orthogonal Matching Pursuit to the case of a Banach space. The main novelty of these results is a Banach space setting instead of a Hilbert space setti…

2013-03-27abs ↗pdf ↗

Study on error rates for approximating rough volatility models.

problem Simulation of rough volatility models with fractional Brownian motion.
method Analysis of weak error rates for numerical schemes, focusing on fBm and cubic test functions.
result Convergence rates for approximations are (3H+12)1(3H+ \frac{1}{2}) \wedge 1 for exact left-point discretization and H+12H+\frac{1}{2} for hybrid schemes.

Study on fourth order Lamm-Riviere system for biharmonic mappings in 4D.

problem Higher order regularity and sharp Holder continuity of weak solutions.
method Optimal higher order regularity and sharp Holder continuity through analysis of the Lamm-Riviere system.
result Derive weak compactness for sequences of weak solutions with uniformly bounded energy.

A general method to construct recombinant tree approximations for stochastic volatility models is developed and applied to the Heston model for stock price dynamics. In this application, the resulting approximation is a four tuple Markov process. The first two components are related to the stock and volatility processe…

2012-05-16abs ↗pdf ↗

We provide sharp empirical estimates of expectation, variance and normal approximation for a class of statistics whose variation in any argument does not change too much when another argument is modified. Examples of such weak interactions are furnished by U- and V-statistics, Lipschitz L-statistics and various error f…

2018-03-11abs ↗pdf ↗

This paper is a follow up to the previous author's paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there three the most popular in nonlinear approximation in Banach…

2012-06-02abs ↗pdf ↗

The space of Sobolev connections, as it has been introduced for studying the variation of Yang-Mills Lagrangian in the critical dimension 44, happens not to be weakly sequentially complete in dimension larger than 44. This is a major obstruction for studying the variations of this important Lagrangian in high dimensi…

2018-12-11abs ↗pdf ↗

The paper bounds the excess risk of deep neural networks for weakly dependent processes.

problem Learning with weakly dependent data using deep neural networks.
method Approximation of smooth functions by deep neural networks and a bound on excess risk.
result The excess risk bound for deep learning under weak dependence is close to O(n1/2)\mathcal{O}(n^{-1/2}) for sufficiently smooth functions.

We study the quantization of coupled Kähler-Einstein (CKE) metrics, namely we approximate CKE metrics by means of the canonical Bergman metrics, so called the ``balanced metrics''. We prove the existence and weak convergence of balanced metrics for the negative first Chern class, while for the positive first Chern clas…

2019-04-29abs ↗pdf ↗

The problem of prescribing conformally the scalar curvature of a closed Riemannian manifold as a given Morse function reduces to solving an elliptic partial differential equation with critical Sobolev exponent. Two ways of attacking this problem consist in subcritical approximations or negative pseudo gradient flows. W…

2019-01-18abs ↗pdf ↗

In this paper we find tight sufficient conditions for the continuity of the value of the utility maximization problem from terminal wealth with respect to the convergence in distribution of the underlying processes. We also establish a weak convergence result for the terminal wealths of the optimal portfolios. Finally,…

2018-11-04abs ↗pdf ↗

Learning new tasks with few samples using related task evaluations.

problem Learning a new task with limited data and related task evaluations.
method Modeling task relatedness through weak monotonicity and leveraging it in transfer learning and model selection aggregation.
result Pruning the model class based on monotonicity and hedging on the task frontier.

Deep networks can learn functions approximated by shallow networks, but not all functions.

problem The learnability of functions by deep neural networks and the approximation capacity of simpler classes.
method Study the connection between learnability and approximation capacity of functions by deep neural networks and simpler classes.
result A necessary condition for a function to be learnable by deep neural networks is to be approximable by shallow networks.

Stein variational gradient descent (SVGD) is a deterministic sampling algorithm that iteratively transports a set of particles to approximate given distributions, based on an efficient gradient-based update that guarantees to optimally decrease the KL divergence within a function space. This paper develops the first th…

2017-04-25abs ↗pdf ↗

Defines weak normals for irregular curves in high-dimensional spaces.

problem Dealing with irregular curves in high-dimensional Euclidean spaces.
method Using sequences of inscribed polygonals and Gram-Schmidt procedure, introduces a relaxed notion of weak normals.
result Weak normals for irregular curves are the strong limit of approximating polygonals and agree with relaxed energy.