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

203406608811 · Jun 202019922001200920172026
48 results for training contracts

Predicts short-term futures contract direction using neural networks and order flow data.

problem Challenges in predicting short-term directional movement of futures contracts.
method Engineering features from technical analysis, order flow, and order-book data; training a Tabnet neural network.
result Achieved an accuracy of 0.601 in predicting directional change on the Silver Futures Contract.

Improved stable RNNs trained faster with less expressibility trade-off.

problem Stable recurrent neural networks are hard to train without sacrificing expressibility.
method Implicit model structure with contraction analysis for stable models.
result Significant increase in training speed and model performance.

Improved security of smart contracts by classifying them into four categories.

problem Detecting and classifying vulnerabilities in smart contracts efficiently.
method Used AWD-LSTM for multi-class classification, addressing class imbalance.
result Achieved a weighted average Fbeta score of 90.0%.

Transformer pretraining yields strong EB performance without explicit adaptation.

problem Empirical Bayes problems with unknown test distributions.
method Indirect analysis of pretrained transformer's performance under universal priors.
result Near-optimal regret bound of O~(1n)\widetilde{O}(\frac{1}{n}) for arbitrary test distributions.

Ethereum smart contracts have recently drawn a considerable amount of attention from the media, the financial industry and academia. With the increase in popularity, malicious users found new opportunities to profit by deceiving newcomers. Consequently, attackers started luring other attackers into contracts that seem …

2019-10-03abs ↗pdf ↗

Transformers can be made to implement specific algorithms by controlling training parameters.

problem Understanding when and how weight-tied looped transformers implement specific algorithms.
method Controlled experiments on group word problems, analyzing training contracts and convergence times.
result The speed and halting rule of weight-tied looped transformers are determined by the training contract and the number of loops.

We study EγE_γ-divergence contraction and its privacy implications.

problem Analyzing privacy in data processing and algorithms.
method Generalizing Dobrushin's coefficient to EγE_γ-divergence and deriving contraction coefficients.
result Local differential privacy can be expressed in terms of EγE_γ-divergence contraction, leading to precise sample size reductions.

Deep reinforcement learning improves trading performance in financial markets.

problem Improving trading performance in financial markets.
method Deep Q-network (DQN) for designing long-short trading strategies.
result Trained reinforcement learning agent outperformed an index benchmark in trading E-mini S&P 500 futures contracts.

Paper proposes a deep RL method for hedging variable annuities, outperforming misspecified models.

problem Model miscalibration in variable annuity contracts with GMMB and GMDB riders.
method Two-phase deep reinforcement learning approach: training phase in a controlled environment, online learning phase in real market.
result Trained reinforcement learning agent hedges equally well as correct Delta in training phase and outperforms misspecified Deltas.

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 contractive auto-encoder learns a representation of the input data that captures the local manifold structure around each data point, through the leading singular vectors of the Jacobian of the transformation from input to representation. The corresponding singular values specify how much local variation is plausib…

2012-06-27abs ↗pdf ↗

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 ↗

Optimal execution strategy for merger & acquisition contracts with price impact.

problem Optimal execution and pricing of financial derivatives in M&A deals.
method Indifference utility arguments, considering linear and nonlinear contracts.
result Linear contracts are more expensive and vulnerable to manipulation.

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.

This paper develops a method to select a reference contract for multi-contract quoting to minimize execution risk.

problem Minimizing execution risk in multi-contract quoting sequences.
method Develops a diagnostic framework using order-flow Hawkes forecasts and CLF to select a stable reference contract.
result Event-history and LOB-state signals offer complementary views for reference-contract selection.

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.

Bayesian model averaging fails under covariate shift, affecting neural networks' performance.

problem Bayesian model averaging's failure in neural networks under covariate shift.
method Explained the issue and proposed novel priors to improve robustness.
result Bayesian model averaging is problematic under covariate shift, especially with linear feature dependencies.

Study on contracting maps and their rigidity under curvature constraints.

problem Rigidity of contracting maps between manifolds with positive curvature.
method Analysis of curvature pinching and contracting conditions involving singular values.
result Established the relation between curvature pinching and contracting conditions.

We study locally compact contractive local groups, that is, locally compact local groups with a contractive pseudo-automorphism. We prove that if such an object is locally connected, then it is locally isomorphic to a Lie group. We also prove a related structure theorem for locally compact contractive local groups whic…

2009-09-24abs ↗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 ↗

Improved online learning for fuzzy min-max neural networks.

problem Classification performance issues due to expansion and contraction steps.
method Proposes an improved online learning algorithm without contraction for overlapping hyperboxes.
result Significant improvement in classification accuracy and stability.

Study on reinsurance decisions using mean-variance criterion with irreversible contracts.

problem Optimizing reinsurance premiums and contracts in a Stackelberg game with irreversible contracts.
method Unified singular control framework applied to both discrete and continuous time reinsurance contracts.
result A single once-for-all reinsurance contract is preferred over multiple contracts, and the signing time is crucial.

Optimal contracts help principals delegate data collection in decentralized ML.

problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

Fair insurance contracts are designed to handle default risk using cooperative game theory.

problem Designing fair insurance contracts in the presence of default risk.
method Cooperative game theory to specify premiums and participation in benefit.
result Fair benefit participation emerges as a game outcome involving residual risks.

One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their 4-dimensional faces are diffeomorphic. It follows that two simple convex polytop…

2013-06-25abs ↗pdf ↗

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.

We define a new notion of contracting element of a group and we show that contracting elements coincide with hyperbolic elements in relatively hyperbolic groups, pseudo-Anosovs in mapping class groups, rank one isometries in groups acting properly on proper CAT(0) spaces, elements acting hyperbolically on the Bass-Serr…

2011-12-12abs ↗pdf ↗

Optimal linear contracts are possible even with memory in Gaussian settings.

problem Can optimal dynamic contracts be linear when agents control memory processes?
method Developed a methodology for non-Markovian and non-semimartingale settings, showed linear contracts are optimal for one-dimensional models.
result Linear contracts are optimal for one-dimensional models with memory, and for radial effort cost functions in higher dimensions.

Safe-EF improves federated learning for non-smooth, constrained optimization.

problem Federated learning's communication bottlenecks with high-dimensional model updates.
method Error feedback (EF) for non-smooth convex optimization with safety constraints.
result Safe-EF matches lower complexity bounds and ensures safety constraints.

Let XX be a contractible 22-complex which is a union of two contractible subcomplexes YY and Z.Z. Is the intersection YZY\cap Z contractible as well? In this note, we prove that the inclusion-induced map π1(YZ)π1(Z)π_{1}(Y\cap Z)\rightarrow π_{1}(Z) is injective if YY is π1π_{1}-injective subcomplex in a locally CAT(0) 2-co…

2018-10-16abs ↗pdf ↗

Establishes exponential contraction in Wasserstein distance on manifolds and flows.

problem Analyzing contraction rates in Wasserstein distance on manifolds and their evolution.
method Explicit estimates and extension to evolving manifolds under geometric flow.
result Gradient estimates with exponential contraction rate under weak curvature conditions.

Curvature conditions distinguish Euclidean space and disks in contractible manifolds.

problem Distinguish Euclidean space and disks among contractible manifolds.
method Investigate curvature conditions on open and compact contractible manifolds with boundary.
result Stronger curvature conditions can distinguish disks from Euclidean spaces.

Prediction markets can be manipulated by traders who can move contract settlements, harming price discovery.

problem Manipulation of settlement times in prediction markets leads to unfair wealth transfer and harms price discovery.
method Developed a model showing how settlement manipulation transfers wealth and harms price discovery, and observed real-world effects on Polymarket's Bitcoin contract.
result Manipulators capture significant profits from retail traders, especially when settlement times are short.