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,657 papers · 148 categories

Trend · papers per month

93186278371 · Jun 202019922001200920172026
48 results for linear contracts

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.

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.

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.

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.

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 ↗

New algorithms improve Bayesian linear regression with spike-and-slab priors.

problem Efficiently sampling from Bayesian linear regression models with sparsity-inducing priors.
method Design of two sampling algorithms: Gibbs sampling and Stochastic Localization.
result Stochastic Localization sampler shows significant advantage for poorly designed data matrices.

In this paper we discuss the asymptotic behaviour of random contractions X=RSX=RS, where RR, with distribution function FF, is a positive random variable independent of S(0,1)S\in (0,1). Random contractions appear naturally in insurance and finance. Our principal contribution is the derivation of the tail asymptotics of $X…

2010-07-31abs ↗pdf ↗

We consider a contracting problem in which a principal hires an agent to manage a risky project. When the agent chooses volatility components of the output process and the principal observes the output continuously, the principal can compute the quadratic variation of the output, but not the individual components. This…

2014-06-23abs ↗pdf ↗

Voluntary insurance contracts constitute a puzzle because they increase the expectation value of one party's wealth, whereas both parties must sign for such contracts to exist. Classically, the puzzle is resolved by introducing non-linear utility functions, which encode asymmetric risk preferences; or by assuming the p…

2015-07-16abs ↗pdf ↗

Derives pricing formulas for perpetual futures contracts.

problem Ensuring fair pricing of perpetual futures contracts without expiration.
method Explicit expressions derived for various types of perpetual contracts, including linear, inverse, and quantos futures.
result Futures price is the risk-neutral expectation of the spot price sampled at a random time reflecting funding payments.

We analyze conditional optimization problems arising in discrete time Principal-Agent problems of delegated portfolio optimization with linear contracts. Applying tools from Conditional Analysis we show that some results known in the literature for very specific instances of the problem carry over to translation invari…

2014-12-15abs ↗pdf ↗

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.

Paper eliminates warm-up phase for PO in linear MDPs, achieving optimal regret.

problem Costly warm-up phase in PO algorithms for linear MDPs.
method Simple contraction mechanism replaces warm-up phase.
result Achieves rate-optimal regret with improved dependence on problem parameters.

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.

New MKABSDEs help calculate initial margins in financial contracts.

problem Calculating initial margins in financial contracts with dependencies.
method Introduced MKABSDEs, provided existence and uniqueness, applied to CVaR, used deterministic and Monte-Carlo methods for numerical approximations.
result MKABSDEs provide a new way to solve for initial margins in financial contracts.

(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a contractible 2-dimensional cell complex) is "hard to embed in R3\mathbb{R}^3", in the …

2014-03-20abs ↗pdf ↗

Deep convolutional networks provide state of the art classifications and regressions results over many high-dimensional problems. We review their architecture, which scatters data with a cascade of linear filter weights and non-linearities. A mathematical framework is introduced to analyze their properties. Computation…

2016-01-19abs ↗pdf ↗

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.

Gradient descent with random weights in linear regression analyzed for various noise types.

problem Analyzing the impact of random noise on gradient descent in linear regression.
method Gradient descent with randomly weighted data points, various weighting distributions, geometric moment contraction.
result Characterization of implicit regularization and non-asymptotic convergence bounds.

The study shows that certain complex geometries are hyperbolic and contractible but fail to be CAT(0).

problem The failure of certain complex geometries to be CAT(0) despite being hyperbolic and contractible.
method The study uses combinatorial methods to demonstrate the failure of these geometries to satisfy a combinatorial isoperimetric inequality.
result The study proves that these geometries, while hyperbolic and contractible, do not satisfy a combinatorial isoperimetric inequality.

Bayesian nonparametric models get better posterior estimates via SPDE methods.

problem Estimating posterior distributions in nonparametric Bayesian models.
method Extending diffusion methods to SPDEs on Hilbert spaces for posterior contraction and Laplace approximation.
result Derivation of posterior contraction rates and finite-sample Bernstein von Mises results.

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.

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.

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.

The paper evaluates joint life insurance risk under dependence uncertainty using copulas and convex risk measures.

problem Evaluating risk of joint life insurance products under uncertainty in dependence structure.
method Monotonicity of risk evaluation with concordance order, linear programming for bounds, and numerical analysis.
result Bounds for mean, Value-at-Risk, and Expected Shortfall computed using linear programs.

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 amplituhedra arise as images of the totally nonnegative Grassmannians by projections that are induced by linear maps. They were introduced in Physics by Arkani-Hamed \& Trnka (Journal of High Energy Physics, 2014) as model spaces that should provide a better understanding of the scattering amplitudes of quantum fie…

2018-06-03abs ↗pdf ↗

Improved bounds for non-linear SA with fast convergence.

problem Stochastic approximation with non-linear mappings and multiple time scales.
method Mean squared error bounds with O(1/k)O(1/k) rate for contractive mappings.
result First O(1/k)O(1/k) rate for non-linear two-time-scale SA without additional smoothness assumptions.