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.

169,291 papers · 148 categories

Trend · papers per month

101201302402 · May 202619922001200920182026
48 results for Mild conditions

Extends XVA valuation under stochastic volatility, characterizing value processes via mild solutions.

problem Valuation of contingent claims in presence of default, collateral, and funding under stochastic volatility.
method Characterizes pre-default value processes via mild solutions to parabolic semilinear PDEs under stochastic volatility.
result Characterizes pre-default value processes via mild solutions to parabolic semilinear PDEs under stochastic volatility, providing sufficient conditions for existence and uniqueness.

New criterion ensures recovery of latent factors in NMF with mild conditions.

problem Identifying latent factors in nonnegative matrix factorization (NMF) under mild conditions.
method Proposed a new identification criterion based on the scatteredness of one factor's rows in the nonnegative orthant.
result Latent factors can be provably identified from the NMF model with minimal structural assumptions.

The study examines different types of equilibria for stopping problems in one-dimensional diffusion processes.

problem Characterizing and comparing different types of equilibria for time-inconsistent stopping problems.
method Analyzes log sub-additive discount functions and one-dimensional diffusion processes to derive necessary and sufficient conditions for weak equilibria and other types of equilibria.
result Conditions for weak equilibria and their implications for other types of equilibria are provided.

The paper ensures positivity of solutions to stochastic equations with positive initial data.

problem Ensuring positivity of solutions to stochastic equations with positive initial data.
method Providing sufficient conditions on coefficients for positivity of mild solutions.
result Sufficient conditions for positivity of solutions to stochastic equations.

Paper proposes an algorithm to recover non-negative matrix factorization with mild conditions.

problem Understanding and guaranteeing recovery of non-negative matrix factorization.
method Alternates between updating features and decoding weights using ReLU.
result Proves recovery of ground-truth under mild conditions, including linear independence of features.

Maximum principle proves positivity of forward rates in stochastic models.

problem Proving positivity of forward rates in stochastic models.
method Maximum principle for mild solutions to SPDEs with Lipschitz coefficients and Wiener noise.
result Sufficient conditions for positivity of forward rates in the Heath-Jarrow-Morton model.

New algorithms improve distributed optimization under mild variance conditions.

problem Improving distributed optimization for large-scale machine learning problems.
method Revisited Federated Averaging and SCAFFOLD algorithms under a general variance condition.
result Established convergence results for smooth nonconvex objective functions under mild variance conditions.

Offline RL with pre-trained features amplifies errors even under mild shifts.

problem Sample-efficient offline RL with pre-trained features under mild distribution shift.
method Empirical study of offline RL with pre-trained neural representations.
result Substantial error amplification occurs even with pre-trained features, requiring stronger conditions for successful offline RL.

New methods for non-convex optimization using inexact Hessian approximations.

problem Optimization of non-convex functions with inexact Hessian information.
method Trust-region and cubic regularization methods with inexact Hessian approximations.
result Iteration complexity to achieve ε-approximate second-order optimality.

New algorithms for causal bandits without knowing the graph structure.

problem Causal bandit problems with unknown graph structure.
method Developed novel causal bandit algorithms for causal trees, forests, and general graphs without prior knowledge of the causal graph.
result Regret guarantees significantly improved over standard MAB algorithms under mild conditions.

Study on Navier-Stokes equations on non-compact manifolds, proving existence and decay of solutions.

problem Existence and asymptotic behavior of solutions to Navier-Stokes equations on non-compact manifolds.
method Used LpLqL^p-L^q-dispersive and smoothing estimates of the Stokes semigroup, fixed point arguments, and Gronwall's inequality.
result Established existence and exponential decay of almost periodic and asymptotically almost periodic mild solutions.

New algorithms improve tensor CP decomposition under mild conditions.

problem Improving tensor CP decomposition with theoretical guarantees under mild incoherence conditions.
method Composite PCA and Concurrent Orthogonalization algorithms.
result Theoretical guarantees and practical superiority over existing methods.

We will prove the relative homotopy principle for smooth maps with singularities of a given {\cal K}-invariant class with a mild condition. We next study a filtration of the group of homotopy self-equivalences of a given manifold P by considering singularities of non-negative {\cal K}-codimensions.

2007-04-02abs ↗pdf ↗

This paper focuses on the stability of the non-arbitrage condition in discrete time market models when some unknown information ττ is partially/fully incorporated into the market. Our main conclusions are twofold. On the one hand, for a fixed market SS, we prove that the non-arbitrage condition is preserved under a m…

2014-07-06abs ↗pdf ↗

We show that a map between complex-analytic manifolds, at least one of which is in the Fujiki class, is a biholomorphism under a natural condition on the second cohomologies. We use this to establish that, with mild restrictions, a certain relation of "domination" introduced by Gromov is in fact a partial order.

2013-12-19abs ↗pdf ↗

DEQs converge to optimal solutions with mild over-parameterization.

problem Training over-parameterized deep equilibrium models.
method Solves equilibrium point directly, uses gradient descent, and analyzes convergence via linear rate.
result Gradient descent converges to a globally optimal solution at a linear rate for quadratic loss.

We make a conjecture about mean curvature flow of Lagrangian submanifolds of Calabi-Yau manifolds, expanding on \cite{Th}. We give new results about the stability condition, and propose a Jordan-Hölder-type decomposition of (special) Lagrangians. The main results are the uniqueness of special Lagrangians in hamiltonian…

2001-04-19abs ↗pdf ↗

Working in a continuous time setting, we extend to the general case of dynamic risk measures continuous from above the characterization of time consistency in terms of ``cocycle condition'' of the minimal penalty function. We prove also the supermartingale property for general time consistent dynamic risk measures. Whe…

2006-07-08abs ↗pdf ↗

We prove, under some mild conditions, that the equivariant twisted K-theory group of a crossed module admits a ring structure if the twisting 2-cocycle is 2-multiplicative. We also give an explicit construction of the transgression map T1:H(Γ;A)H1((NΓ;A)T_1: H^*(Γ;A) \to H^{*-1}((N\rtimes Γ;A) for any crossed module NΓN\to Γ and prove…

2006-04-07abs ↗pdf ↗

We study possible real structures in the space of solutions to the quantum differential equation. We show that, under mild conditions, a real structure in orbifold quantum cohomology yields a pure and polarized tt^*-geometry near the large radius limit. We compute an example of P^1 which is pure and polarized over the …

2009-06-06abs ↗pdf ↗

Estimates CATEs for structured treatments using a new decomposition method.

problem Estimating conditional average treatment effects for complex data types.
method Generalized Robinson decomposition, isolating causal estimand, arbitrary model plugging, quasi-oracle convergence guarantee.
result Demonstrates superior performance in CATE estimation compared to prior work.

We obtain explicit representations of locally risk-minimizing strategies of call and put options for the Barndorff-Nielsen and Shephard models, which are Ornstein--Uhlenbeck-type stochastic volatility models. Using Malliavin calculus for Levy processes, Arai and Suzuki (2015) obtained a formula for locally risk-minimiz…

2015-03-30abs ↗pdf ↗

Let MM be a quasi-Fuchsian three-manifold that contains a closed incompressible surface with principal curvatures within the range of the unit interval, for a prescribed function HH (with mild conditions) on MM, we construct a closed incompressible surface with mean curvature HH . A direct application is the existe…

2010-03-08abs ↗pdf ↗

Let (M, g) be an (n+1) dimensional space-time, with bounded curvature with respect to a bounded framing. If (M, g) is vacuum or satisfies a mild condition on the stress-energy tensor, then we show that (M, g) locally admits coordinate systems in which the Lorentz metric is well-controlled in the (space-time) Sobolev sp…

2002-09-20abs ↗pdf ↗

Study of navigation on Hermitian manifolds with complex wind effects.

problem Zermelo navigation problem on Hermitian manifolds with complex wind.
method Admits space-dependent relative speed, discusses projectively related metrics, geodesics, and necessary conditions for locally projectively flat solutions.
result Presented necessary and sufficient conditions for locally projectively flat solutions.

We prove the following result, conjectured by Alan Weinstein: every smooth proper Lie groupoid near a fixed point is locally linearizable, i.e. it is locally isomorphic to the associated groupoid of a linear action of a compact Lie group. In combination with a slice theorem of Weinstein, our result implies the smooth l…

2003-01-25abs ↗pdf ↗

We present a novel analysis of the dynamics of tensor power iterations in the overcomplete regime where the tensor CP rank is larger than the input dimension. Finding the CP decomposition of an overcomplete tensor is NP-hard in general. We consider the case where the tensor components are randomly drawn, and show that …

2014-11-06abs ↗pdf ↗

A framework for real-time edge intelligence using federated meta-learning.

problem Real-time intelligent decisions at edge devices with limited resources and data.
method Federated meta-learning approach for rapid adaptation of learned models.
result Effective framework demonstrated on various datasets.

Defines hierarchical clustering axioms for various densities.

problem Defining hierarchical clustering for different types of densities.
method An axiomatic approach to piecewise constant densities, then extending to general densities.
result Our axiomatic definition results in Hartigan's cluster tree under certain conditions.

We show that the holonomy invariance of a function on the tangent bundle of a manifold, together with very mild regularity conditions on the function, is equivalent to the existence of local parallelisms compatible with the function in a natural way. Thus, in particular, we obtain a characterization of generalized Berw…

2012-10-01abs ↗pdf ↗