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

85170254339 · Jun 202019922001200920172026
48 results for contractive systems

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.

In an online contract selection problem there is a seller which offers a set of contracts to sequentially arriving buyers whose types are drawn from an unknown distribution. If there exists a profitable contract for the buyer in the offered set, i.e., a contract with payoff higher than the payoff of not accepting any c…

2013-05-15abs ↗pdf ↗

The study examines how alternative resource adequacy contract designs affect market participants' risk profiles and resource mix.

problem The tension between promoting reliability and competition in liberalized electricity markets.
method Constructs a stochastic equilibrium model of a competitive market with incomplete risk trading and computes investment equilibria under different contracting regimes.
result Alternative contracting regimes can induce different risk profiles and resource mixes, affecting market outcomes.

In this note we describe the application of existing smart contract technologies with the aim to construct a new digital representation of a financial derivative contract. We compare several existing DLT based technologies. We provide a detailed description of two separate prototypes which are able to be executed on a …

2019-02-26abs ↗pdf ↗

A new method streamlines digital payment programming using smart contracts.

problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.

This paper gives a description of the full space of Bridgeland stability conditions on the bounded derived category of a contraction algebra associated to a 3-fold flop. The main result is that the stability manifold is the universal cover of a naturally associated hyperplane arrangement, which is known to be simplicia…

2019-07-30abs ↗pdf ↗

Recurrent iterated function systems (RIFSs) are improvements of iterated function systems (IFSs) using elements of the theory of Marcovian stochastic processes which can produce more natural looking images. We construct new RIFSs consisting substantially of a vertical contraction factor function and nonlinear transform…

2013-04-07abs ↗pdf ↗

RotEqNet preserves rotation symmetry in fluid systems using high-order tensors.

problem Lack of rotational symmetry in machine learning models for fluid systems.
method Introduces RotEqNet, a network that guarantees rotation-equivariance for high-order tensors.
result RotEqNet reduces errors and maintains rotation-equivariance in fluid systems.

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.

Study risk-controlling prediction sets for single trajectory data from dynamical systems.

problem Performance guarantees for risk-controlling prediction sets in single trajectory data from unknown stochastic dynamical systems.
method Used blocking and decoupling techniques to analyze performance guarantees under different data generating processes.
result Performance guarantees similar to iid setting when data is stationary and contractive, with graceful degradation otherwise.

New Q-learning method achieves optimal sample complexity for average-reward problems.

problem Challenges in achieving optimal sample complexity for average-reward Q-learning.
method Synchronous and asynchronous Q-learning with a new contraction principle.
result Optimal O~(ε2)\widetilde{O}(\varepsilon^{-2}) sample complexity guarantees.

A new method improves communication efficiency in distributed learning.

problem Reducing communication overhead in distributed machine learning.
method Transforming contractive compressors into induced unbiased compressors.
result Significant improvements in memory requirements and communication complexity.

Study optimal reinsurance pricing under model uncertainty for multiple insurers.

problem Optimal reinsurance pricing in the presence of multiple sources of model uncertainty.
method Solves a continuous-time Stackelberg game for general reinsurance contracts, considering entropy penalties and ambiguity in insurers' models.
result Reinsurer prices under a distortion of the barycentre of insurers' models, maximizing expected wealth with an entropy penalty.

We propose a new non-parametric framework for learning incrementally stable dynamical systems x' = f(x) from a set of sampled trajectories. We construct a rich family of smooth vector fields induced by certain classes of matrix-valued kernels, whose equilibria are placed exactly at a desired set of locations and whose …

2018-04-13abs ↗pdf ↗

The study identifies conditions under which algorithmic stability explains generalization in interpolating learning systems.

problem Understanding when algorithmic stability explains generalization in interpolating learning systems.
method Modeling training as a function-space trajectory and measuring sensitivity to single-sample perturbations.
result There exist interpolating regimes with small risk where contractive sensitivity cannot hold, showing that stability is not a universal explanation.

Study optimizes smart contract adoption under high demand variability using Negative Binomial models.

problem Effective supply chain management under high demand variability.
method Combines dynamic Negative Binomial demand modeling with endogenous smart contract adoption optimization.
result The NB model outperforms other benchmarks in forecasting and optimizing smart contract adoption and order quantity.

We develop a model for contagion in reinsurance networks by which primary insurers' losses are spread through the network. Our model handles general reinsurance contracts, such as typical excess of loss contracts. We show that simpler models existing in the literature--namely proportional reinsurance--greatly underesti…

2018-05-30abs ↗pdf ↗

In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …

2015-10-15abs ↗pdf ↗

New smart contract mechanisms evade traditional AML systems by decoupling transaction roles.

problem Current AML systems fail to track economic value migration in composable smart contracts.
method Introduce PEB separation and state-mediated value migration to demonstrate how traditional tracing fails.
result Transfer-layer observation is incomplete and causally ambiguous in composable smart contracts.

The two main theorems of this paper provide a characterization of hyperbolic affine iterated function systems defined on Rm. Atsushi Kameyama (Distances on Topological Self-Similar Sets, Proceedings of Symposia in Pure Mathematics, Volume 72.1, 2004) asked the following fundamental question: given a topological self-si…

2009-08-10abs ↗pdf ↗

Paper proposes a decentralized payment clearing system using blockchain and optimal bidding strategies.

problem Default contagion in a network of smart contracts cleared through blockchain.
method Constructs a decentralized clearing mechanism using blockchain and optimal bidding strategies.
result Proves existence and uniqueness of equilibrium clearing condition for terminal net worths.

The paper uses neural networks to price complex life insurance contracts with multiple risk factors.

problem Pricing equity-linked life insurance contracts with various stochastic risk factors.
method Assuming hedging to reduce local variance, the price is expressed as a system of non-linear PDEs. Reformulated as a backward SDE with jumps, solved numerically using neural networks.
result Neural networks provide an efficient numerical solution for pricing these complex contracts.

A contractible simplicial complex is constructed that parametrizes different ways of representing a fixed one-dimensional homology class in a closed orientable surface by isotopy classes of systems of disjoint oriented simple closed curves. This is a variant on an earlier construction of Bestvina-Bux-Margalit.

2008-06-02abs ↗pdf ↗

A financial contract's value is determined by a quantum measurement outcome, and a pricing state exists to value it.

problem Valuing financial contracts contingent on quantum measurement outcomes.
method Proving the existence of a pricing state equivalent to the physical state on null spaces, and solving optimization problems for optimal contract payouts.
result There exists a pricing state equivalent to the physical state on null spaces, leading to a pricing function for financial contracts.

The paper explores coalescent contractions in contractible spaces, providing criteria and examples.

problem Existence and absence of coalescent contractions in contractible spaces.
method Analysis of contractible finite simplicial complexes and criteria for coalescent contractions.
result Criteria for contractible finite simplicial complexes that ensure no coalescent contractions.

The study calibrates neural networks' parameters through optimal contraction in prediction problems.

problem Ensuring the existence and uniqueness of optimal parameters in neural networks.
method Transforming RNNs into contractions and solving matrix equations involving Sylvester equations.
result Optimal parameters exist, are unique, and can be found through an algorithm with desired precision.

Quantum crypto-economics models price risks in blockchain technology.

problem Quantum technology's potential to undermine blockchain security.
method Building financial models to price quantum risk in blockchain scenarios.
result Quantum crypto-economics models can assess and price quantum risks in blockchain.

This study reveals statistical patterns in ERC20 token transactions on Ethereum blockchain.

problem Understanding transactional dynamics in decentralized systems.
method Examined over 44 million ERC20 token transfers, categorized by address type (EOA or SC), and analyzed using scaling laws.
result EOA-driven transactions exhibit consistent statistical behavior, while SC-driven activity displays sublinear scaling and bursty activity.

Holographic Invariant Storage uses vector architectures to ensure LLM safety at design time.

problem Mitigating context drift in large language models (LLMs) during deployment.
method Introduces Holographic Invariant Storage (HIS) protocol that combines known properties of bipolar Vector Symbolic Architectures into a design-time safety contract.
result Closed-form guarantees for single-signal recovery fidelity, continuous-noise robustness, and multi-signal capacity degradation are provided and validated.

Proposes a regularization approach to model German power derivative market, identifying significant risk spillovers.

problem Large portfolio of German power derivative contracts, identifying significant risk spillovers.
method Combines high-dimensional variable selection with dynamic network analysis.
result Identifies significant risk contributors and interdependencies between contracts, especially spot contracts.

The study explores convex unions and completions in simplicial pseudomanifolds, revealing unexpected behavior.

problem Understanding the behavior of convex unions in simplicial pseudomanifolds.
method Generalization to simplicial pseudomanifolds, considering PL homeomorphisms and edge subdivisions.
result Unexpected behavior in convex unions and completions, including empty contraction spaces and large/small contraction spaces.

We consider here a generalization of a well known discrete dynamical system produced by the bisection of reflection angles that are constructed recursively between two lines in the Euclidean plane. It is shown that similar properties of such systems are observed when the plane is replaced by a regular surface in ${\mat…

2009-02-02abs ↗pdf ↗