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

35810 · May 202619922001200920172026
48 results for Snell envelopes

The dynamical analysis of American options has motivated the development of robust versions of the classical Snell envelopes. The cost of superhedging an American option is characterized by the upper Snell envelope. The infimum of the arbitrage free prices is characterized by the lower Snell envelope. In this paper we …

2009-02-24abs ↗pdf ↗

Paper develops a new probabilistic method for American options using entropy regularization.

problem Finding optimal stopping times for American options with entropy regularization.
method Entropy-regularized penalization scheme based on Doob-Meyer-Mertens decomposition and reflected backward stochastic differential equations.
result Explicit convergence rates and policy improvement algorithm for American options.

Inspired by recent work of P.-L. Lions on conditional optimal control, we introduce a problem of optimal stopping under bounded rationality: the objective is the expected payoff at the time of stopping, conditioned on another event. For instance, an agent may care only about states where she is still alive at the time …

2019-01-17abs ↗pdf ↗

We consider the optimal stopping problem with non-linear ff-expectation (induced by a BSDE) without making any regularity assumptions on the reward process ξξ. and with general filtration. We show that the value family can be aggregated by an optional process YY. We characterize the process YY as the $\mathcal{E}^f…

2016-11-28abs ↗pdf ↗

We study the existence of optimal actions in a zero-sum game infτsupPEP[Xτ]\inf_τ\sup_PE^P[X_τ] between a stopper and a controller choosing a probability measure. This includes the optimal stopping problem infτE(Xτ)\inf_τ\mathcal{E}(X_τ) for a class of sublinear expectations E()\mathcal{E}(\cdot) such as the GG-expectation. We show that …

2012-12-10abs ↗pdf ↗

We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the stopping strategy. Namely, we introduce adaptive generation of the stochastic grids an…

2013-09-16abs ↗pdf ↗

Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze GCCs like their European and American counterparts by solving option holder's an…

2017-07-28abs ↗pdf ↗

We study a robust optimal stopping problem with respect to a set $\cP$ of mutually singular probabilities. This can be interpreted as a zero-sum controller-stopper game in which the stopper is trying to maximize its pay-off while an adverse player wants to minimize this payoff by choosing an evaluation criteria from $\…

2013-01-01abs ↗pdf ↗

DeepMartingale uses deep learning to solve complex optimal stopping problems efficiently.

problem Optimal stopping problems in high-dimensional continuous-time models.
method Leverages martingale representation and deep learning to directly optimize over parameterized martingales.
result DeepMartingale can approximate the true value function to any desired accuracy with neural networks of manageable size.

Improves regression efficiency by separating material and immaterial parts of responses.

problem Improving estimation efficiency in nonlinear multivariate regressions.
method Kernel envelope (KENV) estimator for nonparametric response envelopes in reproducing kernel Hilbert space.
result KENV achieves lower in-sample prediction risk than kernel ridge regression in non-trivial immaterial components.

This paper explores geometric insights into discrete R-congruences and their envelopes.

problem Understanding the ambiguity in discrete R-congruences and their envelopes.
method Analyzes discrete R-congruences that are enveloped by specific types of surfaces and maps.
result Discovers a 2-parameter family of discrete enveloping surfaces for discrete R-congruences.

Study on Laplacian determinant in isosceles triangles, finding equilateral triangle minimizes determinant.

problem Finding the minimum of the spectral determinant on isosceles triangles.
method Analyzing the determinant of the Laplacian on Euclidean isosceles triangle envelopes of fixed area.
result Equilateral triangle envelope minimizes the determinant of the Laplacian.

This work uses Lasry-Lions envelopes to solve nonconvex optimization problems.

problem Nonconvex and nonsmooth terms in optimization problems.
method Develops a homotopy approach using Lasry-Lions envelopes to approximate and solve the original problem.
result The method can solve composite minimization problems and is more effective than classical alternatives in certain domains.

We make a systematic study of (quasi-)plurisubharmonic envelopes on compact Kähler manifolds, as well as on domains of Cn\mathbb{C}^n, by using and extending an approximation process due to Berman [Ber13]. We show that the quasi-psh envelope of a viscosity super-solution is a pluripotential super-solution of a given co…

2017-03-15abs ↗pdf ↗

Generalizes Fermat's principle for wave propagation in cone structures.

problem Wave propagation in complex media with discontinuities and anisotropy.
method Generalizes Fermat's principle to smooth interfaces separating two cone structures representing wave propagation in various media.
result Conditions for critical points of arrival time functional, generalizing Snell's law and reflection.

New methods help escape strict saddle points in nonsmooth optimization.

problem Escaping strict saddle points in nonsmooth optimization.
method An inexact stochastically perturbed gradient method applied to the Moreau envelope.
result A variety of algorithms for nonsmooth optimization can efficiently escape strict saddle points of the Moreau envelope.

We prove that the forgetful functor from groupoids to pregroupoids has a left adjoint, with the front adjunction injective. Thus we get an enveloping groupoid for any pregroupoid. We prove that the category of torsors is equivalent to that of pregroupoids. Hence we also get enveloping groupoids for torsors, and for pri…

2005-02-03abs ↗pdf ↗

We give a global description of envelopes of geodesic tangents of regular curves in (not necessarily convex) Riemannian surfaces. We prove that such an envelope is the union of the curve itself, its inflectional geodesics and its tangential caustics (formed by the conjugate points to those of the initial curve along th…

2004-11-19abs ↗pdf ↗

By using the support function on the xyxy-plane, we show the necessary and sufficient conditions for the existence of envelopes of horizontal lines in the 3D-Heisenberg group. A method to construct horizontal envelopes from the given ones is also derived, and we classify the solutions satisfying the construction.

2018-01-13abs ↗pdf ↗

We view conformal surfaces in the 4--sphere as quaternionic holomorphic curves in quaternionic projective space. By constructing enveloping and osculating curves, we obtain new holomorphic curves in quaternionic projective space and thus new conformal surfaces. Applying these constructions to Willmore surfaces, we show…

2003-06-09abs ↗pdf ↗

Smooth convergence to an enveloping cylinder proved for mean curvature flow of complete graphical hypersurfaces.

problem Proving smooth convergence of mean curvature flow to an enveloping cylinder.
method Analyzing mean curvature flow of complete graphical hypersurfaces over domains ΩtΩ_{t}, proving convergence under certain circumstances.
result Smooth convergence of Mthen+1M_{t}-h\,e_{n+1} to the enveloping cylinder under specific conditions.

We study the geometry of Outer Space CVnCV_n in regard of the asymmetric Lipschitz metric via envelopes, that is the set of all geodesics between two points. In the simplicial structure of CVnCV_n the envelopes are polytopes. We construct a piecewise unique geodesic between any two points in CVnCV_n by concatenating edges…

2019-07-15abs ↗pdf ↗

Defines a calculus for integrating Moreau envelopes in differentiable programming.

problem Lack of a mathematical framework for applying Moreau envelopes to deep networks and machine learning systems.
method Develops a compositional calculus adapted to Moreau envelopes and integrates it into differentiable programming.
result Integrates Moreau envelopes into differentiable programming, enabling new gradient back-propagation methods.

We consider smooth 1-parameter families of plane curves tangent to a semicubic parabola, when the curvature radius of their curves at the tangency point vanishes at the cusp point. We find the $\A$-normal form of these families, their envelopes and local patterns near the cusp. We obtain a new codimension 2 singularity…

2005-11-21abs ↗pdf ↗

A spacetime can be embedded in an enveloping space with all its extensions.

problem Existence and uniqueness of C0-maximal extensions in globally hyperbolic conformally flat spacetimes.
method Proving conformal embedding into an enveloping space containing all extensions.
result Existence and uniqueness of C0-maximal extensions proven.

Training certifiable neural networks enables one to obtain models with robustness guarantees against adversarial attacks. In this work, we introduce a framework to bound the adversary-free region in the neighborhood of the input data by a polyhedral envelope, which yields finer-grained certified robustness. We further …

2019-12-10abs ↗pdf ↗

The envelope of straight lines affine normal to a plane curve C is its affine evolute; the envelope of the affine lines tangent to C is the original curve, together with the entire affine tangent line at each inflexion of C. In this paper, we consider plane curves without inflexions. We use some techniques of singulari…

2017-05-04abs ↗pdf ↗

The paper extends a theorem to Lie-Rinehart algebras and provides new decompositions of universal enveloping algebras.

problem Understanding universal enveloping algebras of Lie-Rinehart algebras.
method Extending a theorem to left Hopf algebroids and applying it to universal enveloping algebras of Lie-Rinehart algebras.
result Provides a crossed product decomposition of universal enveloping algebras for curved and flat connections.