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.
Method solves optimisation problems on non-Riemannian surfaces with bilateral curvature bounds.
Study numerical methods for singular FBSDEs with degenerate forward component.
Optimal transport aims to estimate a transportation plan that minimizes a displacement cost. This is realized by optimizing the scalar product between the sought plan and the given cost, over the space of doubly stochastic matrices. When the entropy regularization is added to the problem, the transportation plan can be…
Paper learns dictionaries for sparse signal recovery using automatic differentiation.
Paper generalizes extragradient methods for solving equations and inclusions with improved convergence rates.
Innovative method solves nonconvex optimization on manifolds.
New algorithm samples Bayesian neural networks for improved calibration.
Develops variance-reduced methods for solving generalized equations.
Convex optimization is an essential tool for machine learning, as many of its problems can be formulated as minimization problems of specific objective functions. While there is a large variety of algorithms available to solve convex problems, we can argue that it becomes more and more important to focus on efficient, …
In this paper, we further study the forward-backward envelope first introduced in [28] and [30] for problems whose objective is the sum of a proper closed convex function and a twice continuously differentiable possibly nonconvex function with Lipschitz continuous gradient. We derive sufficient conditions on the origin…
Optimal wealth strategy derived for jump-diffusion models with liabilities.
In this paper, we introduce a large class of convergent numerical methods, based on (linear) basis function regression technique, to approximate the solution to a forward-backward stochastic differential equation with jumps (FBSDEJ hereafter). Numerical experiment shows good applicability of the proposed method.
It is common to encounter large-scale monotone inclusion problems where the objective has a finite sum structure. We develop a general framework for variance-reduced forward-backward splitting algorithms for this problem. This framework includes a number of existing deterministic and variance-reduced algorithms for fun…
This paper presents a novel approach to numerically solve stochastic differential games for nonlinear systems. The proposed approach relies on the nonlinear Feynman-Kac theorem that establishes a connection between parabolic deterministic partial differential equations and forward-backward stochastic differential equat…
New algorithm for aggregate inference in HMMs with continuous observations.
We study the convergence rate of stochastic optimization of exact (NP-hard) objectives, for which only biased estimates of the gradient are available. We motivate this problem in the context of learning the structure and parameters of Ising models. We first provide a convergence-rate analysis of deterministic errors fo…
New algorithms solve monotone inclusions and convex-concave minimax problems.
Optimization is at the heart of machine learning, statistics and many applied scientific disciplines. It also has a long history in physics, ranging from the minimal action principle to finding ground states of disordered systems such as spin glasses. Proximal algorithms form a class of methods that are broadly applica…
This paper develops a new methodology for studying continuous-time Nash equilibrium in a financial market with asymmetrically informed agents. This approach allows us to lift the restriction of risk neutrality imposed on market makers by the current literature. It turns out that, when the market makers are risk averse,…
We consider forward-backward greedy algorithms for solving sparse feature selection problems with general convex smooth functions. A state-of-the-art greedy method, the Forward-Backward greedy algorithm (FoBa-obj) requires to solve a large number of optimization problems, thus it is not scalable for large-size problems…
The paper extends NUP representations to factor graphs for better estimation.
FBSJNN solves PIDEs and FBSDEJs with deep learning, offering theoretical and numerical efficiency.
Solves wealth maximization problem using variational analysis.
SGD converges with perturbed forward-backward passes, explained by geometric amplification.
Bayesian units improve speech recognition with minimal parameters.
Many statistical learning problems can be posed as minimization of a sum of two convex functions, one typically a composition of non-smooth and linear functions. Examples include regression under structured sparsity assumptions. Popular algorithms for solving such problems, e.g., ADMM, often involve non-trivial optimiz…
This paper formulates and studies a stochastic maximum principle for forward-backward stochastic Volterra integral equations (FBSVIEs in short), while the control area is assumed to be convex. Then a linear quadratic (LQ in short) problem for backward stochastic Volterra integral equations (BSVIEs in short) is present …
We propose a new forward-backward stochastic differential equation solver for high-dimensional derivatives pricing problems by combining deep learning solver with least square regression technique widely used in the least square Monte Carlo method for the valuation of American options. Our numerical experiments demonst…
We introduce two simple models of forward-backward stochastic differential equations with a singular terminal condition and we explain how and why they appear naturally as models for the valuation of CO2 emission allowances. Single phase cap-and-trade schemes lead readily to terminal conditions given by indicator funct…
Adaptive filtering algorithms operating in reproducing kernel Hilbert spaces have demonstrated superiority over their linear counterpart for nonlinear system identification. Unfortunately, an undesirable characteristic of these methods is that the order of the filters grows linearly with the number of input data. This …
Kernel learning FBSDE filter improves nonlinear filtering efficiency.
Variable selection and dimension reduction are two commonly adopted approaches for high-dimensional data analysis, but have traditionally been treated separately. Here we propose an integrated approach, called sparse gradient learning (SGL), for variable selection and dimension reduction via learning the gradients of t…
Paper tests Markov assumption in sequential decision making.
New framework trains Schrödinger Bridge models using SDEs for generative tasks.
New HMC method handles features in POS tagging, outperforming MEMM.
Two accelerated extragradient methods converge at rate for co-hypomonotone inclusions.
The paper proposes an efficient algorithm for solving Schatten- quasi-norm problems.
New sampling method uses stochastic interpolants and FBSDEs.
In this work, we present direction-of-arrival (DoA) estimation algorithms based on the Krylov subspace that effectively exploit prior knowledge of the signals that impinge on a sensor array. The proposed multi-step knowledge-aided iterative conjugate gradient (CG) (MS-KAI-CG) algorithms perform subtraction of the unwan…
New method for efficient conditional sampling from diffusion models.
Classical numerical methods for solving partial differential equations suffer from the curse dimensionality mainly due to their reliance on meticulously generated spatio-temporal grids. Inspired by modern deep learning based techniques for solving forward and inverse problems associated with partial differential equati…
Applications in quantitative finance such as optimal trade execution, risk management of options, and optimal asset allocation involve the solution of high dimensional and nonlinear Partial Differential Equations (PDEs). The connection between PDEs and systems of Forward-Backward Stochastic Differential Equations (FBSD…
Study uses MFG approach to model equilibrium pricing with market clearing condition.
We propose a model for hedging in a market with jumps for a large investor. The dynamics of the stock prices and the value process is governed by forward-backward SDEs driven by Teugels martingales. Unlike known FBSDE market models, ours accounts for jumps in stock prices. Moreover, it allows to find an optimal hedging…
We provide a comprehensive study of the convergence of the forward-backward algorithm under suitable geometric conditions, such as conditioning or Łojasiewicz properties. These geometrical notions are usually local by nature, and may fail to describe the fine geometry of objective functions relevant in inverse problems…
A new family of momentum coefficients improves the convergence rate of accelerated algorithms.
Investor optimizes utility in a market with endogenous pricing.
This paper addresses the problem of neighborhood selection for Gaussian graphical models. We present two heuristic algorithms: a forward-backward greedy algorithm for general Gaussian graphical models based on mutual information test, and a threshold-based algorithm for walk summable Gaussian graphical models. Both alg…