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

Trend · papers per month

9182736 · Jun 202019922001200920172026
48 results for Concave Envelope

Study optimal portfolio choice with risk control for log-returns.

problem Optimal portfolio choice with risk management in continuous-time markets.
method Characterized optimal terminal wealth using concave envelope, derived analytical expressions for optimal wealth and policy, found efficient frontier.
result Efficient frontier is concave curve connecting minimum-risk to growth-optimal portfolios, not a vertical line.

New algorithm solves complex non-convex problems efficiently.

problem Non-smooth non-convex problems with weakly convex and strongly concave components.
method Stochastic Moreau envelope approximate gradient method (SMAG).
result First single-loop algorithm with state-of-the-art convergence rate.

Study optimal consumption for loss-averse agents considering past spending peaks.

problem Optimal consumption for loss-averse agents with reference to past spending maximum.
method Adopted S-shaped utility, concave envelope, HJB variational inequality, dual transform, and smooth-fit conditions.
result Obtained piecewise closed-form solutions for optimal consumption and investment control.

We study the problem of super-replication for game options under proportional transaction costs. We consider a multidimensional continuous time model, in which the discounted stock price process satisfies the conditional full support property. We show that the super-replication price is the cheapest cost of a trivial s…

2011-03-06abs ↗pdf ↗

We study martingale inequalities from an analytic point of view and show that a general martingale inequality can be reduced to a pair of deterministic inequalities in a small number of variables. More precisely, the optimal bound in the martingale inequality is determined by a fixed point of a simple nonlinear operato…

2014-01-19abs ↗pdf ↗

Investigates portfolio selection with transaction costs and stochastic volatility, using deep learning for computation.

problem Optimal portfolio selection with transaction costs and stochastic volatility.
method Two-factor stochastic volatility model, option-implied utility function, deep learning policy iteration.
result Deep learning method effectively computes optimal investment decisions under transaction costs and stochastic volatility.

We solve S-shaped utility portfolio selection with SD constraints using algorithms and neural networks.

problem Optimizing portfolios with S-shaped utility functions under SD constraints.
method First-order SD constraint solution, numerical algorithm for SSD, neural network approach.
result Effective numerical and neural network solutions for SSD constrained problems.

We consider a broker who has to place a large order which consumes a sizable part of average daily trading volume. The broker's aim is thus to minimize execution costs he incurs from the adverse impact of his trades on market prices. By contrast to the previous literature, see, e.g., Obizhaeva and Wang (2005), Predoiu,…

2013-10-11abs ↗pdf ↗

This paper demonstrates a practical method for computing the solution of an expectation-constrained robust maximization problem with immediate applications to model-free no-arbitrage bounds and super-replication values for many financial derivatives. While the previous literature has connected super-replication values …

2016-10-04abs ↗pdf ↗

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.

New method for operating envelope identifies key performance indicators without arbitrary binning.

problem Accurate identification of operating envelope for optimal KPIs.
method Regularized GA algorithm with interpretability and implementability constraints.
result Validated through simulations and real-world application in mining.

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 ↗

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.

Enhances neural network robustness with polyhedral envelope regularization.

problem Improving neural network robustness against adversarial attacks.
method Introduces polyhedral envelope regularization to bound the robustness region.
result Demonstrates improved robustness guarantees with minimal computational overhead.

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 ↗

We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be approximated using linear programming (LP) problems which result from a discretisa…

2017-10-22abs ↗pdf ↗

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.

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.

For a pair of points in a smooth closed convex planar curve γγ, its mid-line is the line containing its mid-point and the intersection point of the corresponding pair of tangent lines. It is well known that the envelope of the mid-lines (EMLEML) is formed by the union of three affine invariants sets: Affine Envelope Sy…

2019-11-29abs ↗pdf ↗

Enhances LLM quantization with MDBF, improving perplexity and accuracy.

problem Limited performance of Double Binary Factorization in extreme quantization.
method Introduces Multi-envelope DBF, retaining sign matrices and replacing single envelope with rank-ll envelope.
result Improves perplexity and zero-shot accuracy over previous binary formats.