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

62124186248 · Jun 202019922001200920172026
48 results for continuity argument

This paper studies the concept of instantaneous arbitrage in continuous time and its relation to the instantaneous CAPM. Absence of instantaneous arbitrage is equivalent to the existence of a trading strategy which satisfies the CAPM beta pricing relation in place of the market. Thus the difference between the arbitrag…

2019-01-16abs ↗pdf ↗

Unique solutions found for Plateau problems in smooth and continuous calibrations.

problem Finding unique solutions to the Plateau problem for specific types of currents.
method Boundary regularity theory for area-minimizing currents and unique continuation argument.
result Every compactly supported smoothly or continuously calibrated integral current is the unique solution to the Plateau problem for its boundary data.

This paper formulates a model of utility for a continuous time framework that captures the decision-maker's concern with ambiguity about both volatility and drift. Corresponding extensions of some basic results in asset pricing theory are presented. First, we derive arbitrage-free pricing rules based on hedging argumen…

2013-01-20abs ↗pdf ↗

Constructs finite element spaces for (p,q)(p,q)-forms, excluding one subspace.

problem Constructing finite element spaces for (p,q)(p,q)-forms.
method Piecewise polynomial finite element spaces for all natural subspaces of (p,q)(p,q)-forms, excluding one subspace.
result Recovers known finite element spaces and introduces new ones.

The paper provides approximation guarantees for neural networks trained with gradient flow.

problem Approximating neural networks trained with gradient flow in continuous L2(Sd1)L_2(\mathbb{S}^{d-1})-norm.
method NTK argument for non-convex second but last layer, under-parametrized regime.
result Gradient flow convergence guarantees for neural networks under Sobolev smoothness assumptions.

New algorithm improves online learning with reduced discretization.

problem Improving adaptive online learning with refined discretization.
method Continuous time approach to online learning, followed by a new discretization argument.
result Optimal regret bound with O(VT)O(\sqrt{V_T}) dependence on gradient variance.

In this paper, we prove the Lipschitz regularity of continuous harmonic maps from an finite dimensional Alexandrov space to a compact smooth Riemannian manifold. This solves a conjecture of F. H. Lin in \cite{lin97}. The proof extends the argument of Huang-Wang \cite {hua-w10}.

2019-07-23abs ↗pdf ↗

Regulated curves on Banach manifolds with continuous projections and regulated derivatives are studied.

problem Regulated curves on Banach manifolds with continuous projections and regulated derivatives.
method Building a Banach manifold structure on the set of such curves.
result Existence of a 'local addition' on such a manifold for any Banach manifold.

Researchers find the optimal exercise time for American options using a specific type of diffusion process.

problem Finding the optimal time to exercise American options with a time-dependent Ornstein-Uhlenbeck process.
method Optimal stopping problem, probabilistic arguments, non-linear Volterra-type integral equation, Picard iteration algorithm.
result They derive a non-linear Volterra-type integral equation and prove the exercise boundary's Lipschitz continuity and differentiability almost everywhere.

Study optimal stopping problems with finite-time horizon and proves continuity and strict monotonicity of the boundary.

problem Optimal stopping problems with finite-time horizon and state-dependent discounting.
method Linear diffusion process, time-homogeneous gain function, fine regularity properties, continuity and strict monotonicity proof.
result Proves continuity and strict monotonicity of the optimal stopping boundary under mild assumptions.

We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin--Tits group of dihedral type, but it fails to extend to braids with 4 strands and more. The proof uses a partition of the Cayley graph …

2003-11-19abs ↗pdf ↗

Under mean curvature flow, a closed, embedded hypersurface M(t)M(t) becomes singular in finite time. For certain classes of mean-convex mean curvature flows, we show the continuity of the first singular time TT and the limit set "M(T)M(T)", with respect to initial data. We employ an Angenent-like neck-pinching argument to…

2017-03-07abs ↗pdf ↗

We show that the shortfall risk of binomial approximations of game (Israeli) options converges to the shortfall risk in the corresponding Black--Scholes market considering Lipschitz continuous path-dependent payoffs for both discrete- and continuous-time cases. These results are new also for usual American style option…

2008-11-12abs ↗pdf ↗

In this paper, we continue to study the generalized Ricci flow. We give a criterion on steady gradient Ricci soliton on complete and noncompact Riemannian manifolds that is Ricci-flat, and then introduce a natural flow whose stable points are Ricci-flat metrics. Modifying the argument used by Shi and List, we prove the…

2013-09-30abs ↗pdf ↗

Generalization bounds derived for neural ODEs and deep residual networks.

problem Understanding the generalization capability of neural ODEs and deep residual networks.
method Lipschitz-based argument and analogy with deep residual networks.
result A generalization bound involving the magnitude of weight matrix differences.

When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and continuous with a continuous inverse. Using topological arguments, we show that wh…

2018-12-27abs ↗pdf ↗

We detail the theory of Discrete Riemann Surfaces. It takes place on a cellular decomposition of a surface, together with its Poincaré dual, equipped with a discrete conformal structure. A lot of theorems of the continuous theory follow through to the discrete case, we define the discrete analogs of period matrices, Ri…

2008-02-12abs ↗pdf ↗

The paper explores continuous limits of pentagram maps and their relation to KdV equations.

problem Understanding the continuous limits of pentagram maps and their associated KdV equations.
method Quantum calculus and geometric constructions to derive continuous limits and Lax representations.
result Continuous limits of pentagram maps yield specific KdV equations, providing a geometric interpretation.

We present arguments for the formulation of unified approach to different standard continuous inference methods from partial information. It is claimed that an explicit partition of information into a priori (prior knowledge) and a posteriori information (data) is an important way of standardizing inference approaches …

2012-12-05abs ↗pdf ↗

The paper proves continuity of Morse index for Ricci shrinkers.

problem Lower and upper semi-continuity of the Morse index for gradient Ricci shrinkers.
method Adapting and refining recent arguments on CMC hypersurfaces and polynomially weighted Sobolev spaces, with techniques for non-compact shrinkers.
result Identifies a condition ensuring the Morse index of asymptotically conical shrinkers is bounded below by the f-index of their asymptotic cone.

Study on optimal portfolio selection with varying borrowing and saving rates in continuous-time markets.

problem Optimal portfolio selection in markets with different borrowing and saving rates.
method Hamilton-Jacobi-Bellman equation, partial differential equation, verification argument.
result Existence and smoothness of the value function, identification of trading regions and strategies.

In this work we address the problem of argument search. The purpose of argument search is the distillation of pro and contra arguments for requested topics from large text corpora. In previous works, the usual approach is to use a standard search engine to extract text parts which are relevant to the given topic and su…

2019-05-26abs ↗pdf ↗

We show the local wellposedness of biharmonic wave maps with initial data of sufficiently high Sobolev regularity and a blow-up criterion in the sup-norm of the gradient of the solutions. In contrast to the wave maps equation we use a vanishing viscosity argument and an appropriate parabolic regularization in order to …

2019-03-05abs ↗pdf ↗

We determine the sample complexity of pure exploration bandit problems with multiple good answers. We derive a lower bound using a new game equilibrium argument. We show how continuity and convexity properties of single-answer problems ensures that the Track-and-Stop algorithm has asymptotically optimal sample complexi…

2019-02-09abs ↗pdf ↗

New research suggests continual learning should focus on both optimization objective and optimization trajectory.

problem Even with perfect joint loss approximation, continual learning still suffers from forgetting when starting a new task.
method Proposes focusing on both optimization objective and optimization trajectory, combining replay-approximated joint objectives with gradient projection-based optimization routines.
result Combining replay-approximated joint objectives with gradient projection-based optimization routines did not show clear benefits in initial experiments.