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

104207311414 · Jun 202019922001200920172026
48 results for contractive fixed point

A new clustering framework using fixed points for data analysis.

problem Lack of unified understanding and application of clustering algorithms in data analysis.
method Restated model-based clustering using fixed point theory, iteratively constructing contraction maps to find cluster centers.
result Unified clustering framework reveals convergence mechanisms and interconnections among clustering algorithms.

Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the natural metric in their domain, making the applicability of Banach's theorem li…

2017-02-23abs ↗pdf ↗

We study the fixed point set in the ideal boundary of a parabolic isometry of a proper CAT(0)-space. We show that the radius of the fixed point set is at most pi/2, and study its centers. As a consequence, we prove that the set of fixed points is contractible with respect to the Tits topology.

2004-08-25abs ↗pdf ↗

Study variance-reduced method for estimating fixed points in Banach spaces.

problem Estimating fixed points of contractive operators in Banach spaces with noisy evaluations.
method Variance-reduced stochastic approximation scheme in Banach spaces.
result Establish non-asymptotic bounds for operator defect and estimation error.

Kakimizu complex of a knot is a flag simplicial complex whose vertices correspond to minimal genus Seifert surfaces and edges to disjoint pairs of such surfaces. We discuss a general setting in which one can define a similar complex. We prove that this complex is contractible, which was conjectured by Kakimizu. More ge…

2010-04-23abs ↗pdf ↗

This work studies the contraction coefficients of Schrödinger bridge problems in linear systems.

problem Optimally controlling the evolution of a system's state density over time.
method Analyzes and improves the convergence rates of dynamic Schrödinger systems via geometric and control-theoretic interpretations.
result New insights into improving computation of worst-case contraction coefficients by preconditioning.

Unified framework for solving fixed-point equations in deterministic and stochastic settings.

problem Solving fixed-point equations for seminorm-contractive operators in both deterministic and stochastic contexts.
method Fixed-point theorem and stochastic approximation analysis.
result Unified finite-sample bounds for various reinforcement learning algorithms.

The study provides a generalization bound for a family of implicit networks.

problem Theoretical understanding of implicit networks' generalization is limited.
method A generalization bound is derived for a family of implicit networks using a covering number argument for Rademacher complexity.
result A theoretical generalization bound is established for implicit networks.

We characterize the price of an Asian option, a financial contract, as a fixed-point of a non-linear operator. In recent years, there has been interest in incorporating changes of regime into the parameters describing the evolution of the underlying asset price, namely the interest rate and the volatility, to model sud…

2015-10-28abs ↗pdf ↗

Improved stochastic Halpern iteration for fixed-point approximation in normed spaces.

problem Approximating fixed-points of nonexpansive and contractive operators in normed finite-dimensional spaces.
method Stochastic Halpern iteration with minibatch, analyzing oracle complexity.
result Improved oracle complexity for nonexpansive operators, with a lower bound of Ω(ε3)Ω(\varepsilon^{-3}).

Be it for taking advantage of stock undervaluation or in order to distribute part of their profits to shareholders, firms may buy back their own shares. One of the way they proceed is by including Accelerated Share Repurchases (ASR) as part of their repurchase programs. In this article, we study the pricing and optimal…

2014-10-06abs ↗pdf ↗

Recently, \citet{SuttonMW15} introduced the emphatic temporal differences (ETD) algorithm for off-policy evaluation in Markov decision processes. In this short note, we show that the projected fixed-point equation that underlies ETD involves a contraction operator, with a γ\sqrtγ-contraction modulus (where γγ is the …

2015-08-14abs ↗pdf ↗

New framework improves robustness of implicit neural networks.

problem Ill-posedness and convergence instability in implicit neural networks.
method NEMON framework based on contraction theory for \ell_{\infty} norm, including well-posedness condition, average iteration, and input-output Lipschitz constant regularization.
result Improved accuracy and robustness of implicit models with smaller input-output Lipschitz bounds.

New mortgage contracts reduce underwater default by adjusting loan balances, but must balance prepayment incentives.

problem Underwater default incentives in mortgages.
method Analyzes automatic balance adjustment and prepayment penalties in mortgage contracts.
result Automatic balance adjustments are preferable to traditional contracts at certain spreads, reducing underwater default.

Study efficient power iteration for tensor models, proving convergence under specific conditions.

problem Simultaneous alternating power iteration for fixed-order asymmetric rank-one spiked tensor models.
method Finite-iteration local theory, geometrically decaying transient, fixed-order multilinear noise event, warm-start mechanism.
result Convergence to the unique informative local fixed point under specific conditions.

We prove that every countable family of countable acylindrically hyperbolic groups has a common finitely generated acylindrically hyperbolic quotient. As an application, we obtain an acylindrically hyperbolic group QQ with strong fixed point properties: QQ has property FLpFL^p for all p[1,+)p\in [1, +\infty), and every ac…

2018-04-23abs ↗pdf ↗

The study proves conditions for symplectic torus actions on manifolds with non-contractible orbits.

problem Conditions for symplectic torus actions with non-contractible orbits.
method Analyzes symplectic torus actions on manifolds, proving conditions for Hamiltonian actions and orbit properties.
result Symplectic Tn1T^{n-1} actions with non-contractible orbits are not Hamiltonian unless the orbits are contractible.

In this paper we consider some insurance policies related to drawdown and drawup events of log-returns for an underlying asset modeled by a spectrally negative geometric Lévy process. We consider four contracts, three of which were introduced in Zhang et al. (2013) for a geometric Brownian motion. The first one is an i…

2017-01-07abs ↗pdf ↗

Despite the high importance of grouping in practice, there exists little research on the respective topic. The present work presents a complete framework for grouping and a novel method to optimize model points. Model points are used to substitute clusters of contracts in an insurance portfolio and thus yield a smaller…

2019-12-20abs ↗pdf ↗

New method achieves optimal sample complexity without warm-start in bilevel optimization.

problem Optimizing smooth objective functions with fixed point constraints in meta-learning and equilibrium models.
method Fixed point iterations at lower-level and projected inexact gradient descent at upper-level.
result Achieves near optimal sample complexity O(ε2)O(ε^{-2}) and ildeO(ε1) ilde{O}(ε^{-1}) samples.

New RL approach uses future state and action visitation measures for better exploration.

problem Improving exploration in reinforcement learning.
method Intrinsic reward based on future state and action visitation measures, using contraction operators.
result Policies achieve good state-action space coverage and high performance.

Researchers prove spaces of positive scalar curvature metrics are contractible with symmetry.

problem Contractibility of spaces of invariant positive scalar curvature metrics.
method Combining equivariant Morse theory with conformal deformations and local flexibility properties.
result Spaces of invariant positive scalar curvature metrics are contractible.

Study shows symplectic hypersurfaces transform complex projective spaces.

problem Transforming symplectic manifolds into complex projective spaces.
method Hamiltonian circle action and invariant hypersurface analysis.
result Symplectic manifolds and hypersurfaces transform into homotopy complex projective spaces.

We study dismantling properties of the arc, disc and sphere graphs. We prove that any finite subgroup H of the mapping class group of a surface with punctures, the handlebody group, or Out(F_n) fixes a filling (resp. simple) clique in the appropriate graph. We deduce realisation theorems, in particular the Nielsen Real…

2012-05-02abs ↗pdf ↗

We prove a "gluing" theorem for monotone homotopies; a monotone homotopy is a homotopy through simple contractible closed curves which themselves are pairwise disjoint. We show that two monotone homotopies which have appropriate overlap can be replaced by a single monotone homotopy. The ideas used to prove this theorem…

2013-11-13abs ↗pdf ↗

Study efficient derivative computation for nondifferentiable maps in machine learning.

problem Efficiently compute derivatives of fixed-point of nondifferentiable contractions.
method Iterative Differentiation (ITD), Approximate Implicit Differentiation (AID), and New Stochastic Implicit Differentiation (NSID).
result Established convergence rates for ITD, AID, and NSID, matching or improving smooth setting rates.

Bayesian KANs achieve near-minimax posterior contraction rates in anisotropic Besov spaces.

problem Statistical foundation for Bayesian Kolmogorov-Arnold networks in anisotropic Besov spaces.
method Sparse Bayesian KANs with spike-and-slab priors, hyperprior on model size, and approximation complexity bounds.
result Posterior contraction rates depend on intrinsic anisotropic smoothness and effective dimension of the compositional structure.

New bounds for SA with arbitrary norm contractions and Markovian noise.

problem Finite-time analysis of two-time-scale stochastic approximation with arbitrary norm contractions and Markovian noise.
method Use of generalized Moreau envelope for arbitrary norm contractions and solutions of Poisson equation for Markovian noise.
result Mean square error decays at rates of O(1/n2/3)O(1/n^{2/3}) and O(1/n)O(1/n) under different conditions.

Paper analyzes SA for fixed-point equations with noise, establishing convergence rates.

problem Solving fixed-point equations with noisy data.
method Uses smooth convex envelopes to construct Lyapunov functions and show negative drift.
result Establishes first-known convergence rate for V-trace algorithm in RL.

We prove that the number of critical points of a Li-Tam Green's function on a complete open Riemannian surface of finite type admits a topological upper bound, given by the first Betti number of the surface. In higher dimensions, we show that there are no topological upper bounds on the number of critical points by con…

2010-05-28abs ↗pdf ↗

This paper presents some partial answers to the following question. QUESTION. If a normal space X is the union of an increasing sequence of open sets U(1), U(2), U(3) ... such that each U(n) contracts to a point in X, must X be contractible? The main results of the paper are: THEOREM 1. If a normal space X is the union…

2016-06-16abs ↗pdf ↗

Study compares methods for computing hypergradients in machine learning problems.

problem Computing exact hypergradients in machine learning is difficult.
method Investigates reverse mode iterative differentiation and approximate implicit differentiation methods.
result Unified analysis provides iteration complexity bounds and hierarchy of methods.

Let DD be a Riemannian 2-disc of area AA, diameter dd and length of the boundary LL. We prove that it is possible to contract the boundary of DD through curves of length L+200dmax{1,lnAd}\leq L + 200d\max\{1,\ln {\sqrt{A}\over d} \}. This answers a twenty-year old question of S. Frankel and M. Katz, a version of which was asked …

2012-05-24abs ↗pdf ↗

About a decade ago Thurston proved that a vast collection of 3-manifolds carry metrics of constant negative curvature. These manifolds are thus elements of {\em hyperbolic geometry}, as natural as Euclid's regular polyhedra. For a closed manifold, Mostow rigidity assures that a hyperbolic structure is unique when it ex…

1992-10-01abs ↗pdf ↗