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

70139209278 · Jun 202019922001200920172026
48 results for nonlinear costs

We study the problem of the optimal execution of a large trade in the presence of nonlinear transient impact. We propose an approach based on homotopy analysis, whereby a well behaved initial strategy is continuously deformed to lower the expected execution cost. We find that the optimal solution is front loaded for co…

2014-12-16abs ↗pdf ↗

We discuss investment allocation to multiple alpha streams traded on the same execution platform with internal crossing of trades and point out differences with allocating investment when alpha streams are traded on separate execution platforms with no crossing. First, in the latter case allocation weights are non-nega…

2014-05-19abs ↗pdf ↗

Optimizes angular velocity transfers for rigid bodies under deadline constraints.

problem Stochastic guidance of spin states of rigid bodies over a hard deadline.
method Structural analysis of Kantorovich optimal coupling formulation for nonlinear dynamics.
result Derives the ground cost for optimal transport of angular velocity.

This paper presents a stochastic model for discrete-time trading in financial markets where trading costs are given by convex cost functions and portfolios are constrained by convex sets. The model does not assume the existence of a cash account/numeraire. In addition to classical frictionless markets and markets with …

2008-07-16abs ↗pdf ↗

Study optimal investment and consumption strategies with various transaction costs.

problem Investment and consumption decisions under varying transaction costs.
method Dynamic programming and singular perturbation expansion for small cost-to-wealth ratio.
result Derive leading-order asymptotic formulas for no-trade regions and trading boundaries.

New convergence bounds for online learning with heavy-tailed noise.

problem Learning on streaming data with heavy-tailed noise.
method Nonlinear stochastic gradient descent (SGD) for non-convex and strongly convex costs.
result Strong convergence rates for various nonlinearities and noise distributions.

GyroSwin models plasma turbulence with neural nets, reducing costs and capturing neglected nonlinearities.

problem Understanding plasma turbulence in fusion reactors, which impairs confinement and limits reactor design.
method Introduces GyroSwin, a scalable 5D neural surrogate that approximates 5D nonlinear gyrokinetic simulations.
result GyroSwin outperforms reduced models in heat flux prediction and captures turbulent energy cascade.

Policy gradient converges to globally optimal policy in nearly linear-quadratic systems.

problem Finding optimal policies in nonlinear control systems with partial information.
method Policy gradient algorithm designed for nearly linear-quadratic regulators with small Lipschitz nonlinear components.
result Policy gradient algorithm converges to globally optimal policy with linear rate.

Study Nash competition among dealers quoting prices to clients with unknown trading motives.

problem Adverse selection and inventory costs in dealer-client interactions.
method Analyzes one-shot Nash competition with unknown client type and inventory constraints.
result Unique symmetric Nash equilibrium exists and can be characterized by a nonlinear ODE.

In these notes we discuss investment allocation to multiple alpha streams traded on the same execution platform, including when trades are crossed internally resulting in turnover reduction. We discuss approaches to alpha weight optimization where one maximizes P&L subject to bounds on volatility (or Sharpe ratio). The…

2014-06-05abs ↗pdf ↗

Non-bilinear observations make optimal control harder, showing non-convex costs and non-affine optimal controllers.

problem Optimal control from bilinear observations in linear systems is challenging.
method Analytical and numerical methods to study the non-convex cost-to-go and non-affine optimal controllers.
result The Separation Principle does not hold for bilinear observations, leading to non-convex costs and non-affine optimal controllers.

The paper explores how the depth of neural networks affects their ability to represent data accurately.

problem Understanding the implicit bias and rank of neural networks with large depth.
method Analyzing the convergence of representation cost to a notion of rank as network depth increases, and investigating conditions for recovering the true rank of data.
result There is a range of network depths where the true rank of data is recovered, and this affects the topology of class boundaries.

Over the last decade, both the neural network and kernel adaptive filter have successfully been used for nonlinear signal processing. However, they suffer from high computational cost caused by their complex/growing network structures. In this paper, we propose two random Euler filters for complex-valued nonlinear filt…

2018-01-02abs ↗pdf ↗

We study contingent claims in a discrete-time market model where trading costs are given by convex functions and portfolios are constrained by convex sets. In addition to classical frictionless markets and markets with transaction costs or bid-ask spreads, our framework covers markets with nonlinear illiquidity effects…

2008-07-18abs ↗pdf ↗

We study risk-sharing economies where heterogenous agents trade subject to quadratic transaction costs. The corresponding equilibrium asset prices and trading strategies are characterised by a system of nonlinear, fully-coupled forward-backward stochastic differential equations. We show that a unique solution generally…

2019-01-30abs ↗pdf ↗

We investigate the application of two heuristic methods, genetic algorithms and tabu/scatter search, to the optimisation of realistic portfolios. The model is based on the classical mean-variance approach, but enhanced with floor and ceiling constraints, cardinality constraints and nonlinear transaction costs which inc…

2005-01-04abs ↗pdf ↗

New method improves nonlinear filtering accuracy with reduced computation.

problem Complex nonlinear filtering with small system noise.
method Asymptotic expansion with ordinary differential equations and Edgeworth-type correction.
result Significantly lower computational cost with improved accuracy.

This article provides a novel framework to evaluate limit order tactics that highlights expected fill price, adverse price selection cost, and opportunity cost. We formulate the problem of optimal execution of market orders with nonlinear market impact, power law decay kernel, and stochastic and deterministic liquidity…

2014-09-04abs ↗pdf ↗

The paper solves a complex option pricing model using finite elements.

problem Risk-Adjusted Pricing Methodology (RAPM) Black-Scholes model with transaction costs.
method Spatial finite element models based on P1 and/or P2 elements, combined with a Crank-Nicolson-type temporal scheme.
result Results compare favorably with finite difference methods in the literature.

Optimizes exploration for nonlinear systems to learn controllers efficiently.

problem Learning optimal controllers for unknown nonlinear systems.
method Formally quantifies which parameters are most critical, and develops an algorithm to efficiently explore these parameters.
result Proves a near-instance-optimal rate for learning controllers.

The paper tackles data-driven optimal control of unknown nonlinear systems using RKHS.

problem Unknown nonlinear dynamics and stage cost functions.
method Embed state densities into RKHS, learn Markov operators, solve Hamilton-Jacobi-Bellman recursions.
result Solves a wide range of nonlinear control problems, including depth regulation.

This paper analyzes a simplified strategy for nonlinear control using local linear models and iLQR updates.

problem Nonlinear policy optimization in control systems.
method Iterative estimation of local linear models and iLQR-like policy updates.
result Demonstrates polynomial sample complexity and overcomes exponential problem horizon dependence.

The objective of this paper is to provide a comprehensive study no-arbitrage pricing of financial derivatives in the presence of funding costs, the counterparty credit risk and market frictions affecting the trading mechanism, such as collateralization and capital requirements. To achieve our goals, we extend in severa…

2017-01-29abs ↗pdf ↗

Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good kernel has to be chosen. Picking a good kernel is a very challenging problem in its…

2015-03-12abs ↗pdf ↗

We consider filtering in high-dimensional non-Gaussian state-space models with intractable transition kernels, nonlinear and possibly chaotic dynamics, and sparse observations in space and time. We propose a novel filtering methodology that harnesses transportation of measures, convex optimization, and ideas from proba…

2019-06-30abs ↗pdf ↗

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.

We study superhedging of contingent claims with physical delivery in a discrete-time market model with convex transaction costs. Our model extends Kabanov's currency market model by allowing for nonlinear illiquidity effects. We show that an appropriate generalization of Schachermayer's robust no arbitrage condition im…

2008-10-11abs ↗pdf ↗

A new method reduces Volterra kernel complexity and uncertainty quantification.

problem Challenges in modeling nonlinear systems with Volterra series due to high model order.
method Bayesian Tensor Network Volterra kernel machines (BTN-V) using canonical polyadic decomposition.
result Competitive accuracy, enhanced uncertainty quantification, and reduced computational cost.

The study examines pricing American options with both exogenous and endogenous transaction costs.

problem Pricing American options with transaction costs and liquidity risks.
method Modeling liquidity risks as a mean-reverting process and transaction costs as proportional to trading amount. Two nonlinear PDEs are used to characterize option values. Numerical solution via ADI method and model calibration using maximum likelihood estimation.
result The model incorporating liquidity risks significantly outperforms the Leland model.

Hedging in the presence of transaction costs leads to complex optimization problems. These problems typically lack closed-form solutions, and their implementation relies on numerical methods that provide hedging strategies for specific parameter values. In this paper we use a genetic programming algorithm to derive exp…

2013-05-29abs ↗pdf ↗

Investigates portfolio selection with transaction costs and stochastic volatility, using deep learning for computation.

problem Optimal portfolio selection with transaction costs and stochastic volatility.
method Two-factor stochastic volatility model, option-implied utility function, deep learning policy iteration.
result Deep learning method effectively computes optimal investment decisions under transaction costs and stochastic volatility.

AdaKoop efficiently models nonlinear dynamics from nonstationary data streams.

problem Capturing nonlinear dynamics in nonstationary data streams with computational efficiency.
method Koopman operator theory and probabilistic framework for streaming data.
result AdaKoop outperforms state-of-the-art methods in real-time forecasting accuracy and efficiency.

We study risk-sharing equilibria with general convex costs on the agents' trading rates. For an infinite-horizon model with linear state dynamics and exogenous volatilities, we prove that the equilibrium returns mean-revert around their frictionless counterparts - the deviation has Ornstein-Uhlenbeck dynamics for quadr…

2019-05-13abs ↗pdf ↗

This study optimizes trading and arbitrage in decentralized finance's CPMs, revealing convexity costs and developing efficient strategies.

problem Optimizing trading and arbitrage in decentralized finance's constant product markets (CPMs).
method Developed models for CPMs in competing centralised exchanges, CPMs, and both venues. Derived computationally efficient strategies.
result Accurately estimated convexity costs in CPMs, which are linear in trade size and nonlinear in liquidity depth and exchange rate.

Breaks down complex nonlinear dynamics into simpler components.

problem Control of nonlinear dynamical systems remains challenging.
method Inspired by hybrid switching systems, decomposes dynamics into simpler stochastic switching linear dynamical systems.
result Extracts hierarchies of Markovian and auto-regressive locally linear controllers from nonlinear experts.

The problem of optimal switching between nonlinear autonomous subsystems is investigated in this study where the objective is not only bringing the states to close to the desired point, but also adjusting the switching pattern, in the sense of penalizing switching occurrences and assigning different preferences to util…

2014-11-17abs ↗pdf ↗