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…
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
48 results for “forward-backward methods”
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.
Method solves optimisation problems on non-Riemannian surfaces with bilateral curvature bounds.
problem Optimisation problems on non-Riemannian surfaces with sharp edges.
method Forward-backward splitting in Alexandrov spaces with bilateral curvature bounds.
result Convergence of the forward-backward method in Alexandrov spaces with bilateral curvature bounds.
FBSJNN solves PIDEs and FBSDEJs with deep learning, offering theoretical and numerical efficiency.
problem Solving Partial Integro-Differential Equations and Forward-Backward Stochastic Differential Equations with Jumps.
method FBSJNN framework using a single neural network for both solution approximation and non-local integral.
result FBSJNN achieves numerical solutions with a relative error of , demonstrating efficiency.
Optimal wealth strategy derived for jump-diffusion models with liabilities.
problem Maximizing utility in jump-diffusion models with random liabilities.
method Forward Backward SDEs system for optimal strategy.
result Explicit results for pure jump model and exponential utilities.
Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraintstat.ML
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…
Kernel learning FBSDE filter improves nonlinear filtering efficiency.
problem Nonlinear filtering problem in high-dimensional systems.
method Iterative and adaptive meshfree approach using forward backward SDE and KDE.
result Rigorous convergence analysis provided, supporting empirical results.
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…
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.
problem Inference in large populations with indistinguishable individuals and continuous measurements.
method Continuous observation collective forward-backward algorithm extending existing discrete case algorithm.
result Efficacy demonstrated through numerical experiments.
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 …
New HMC method handles features in POS tagging, outperforming MEMM.
problem HMC struggles with arbitrary features in POS tagging.
method Introduced Entropic Forward-Backward (EFB) probabilities to compute HMC restorations.
result EFB-based HMC outperforms MEMM in POS tagging.
New sampling method uses stochastic interpolants and FBSDEs.
problem Sampling from high-dimensional distributions with unnormalized densities.
method Stochastic interpolants and FBSDEs to define and solve diffusion process.
result Effective sampling from challenging distributions.
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,…
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…
New method for efficient conditional sampling from diffusion models.
problem Efficient conditional simulation from diffusion models.
method Explicit forward-backward bridging to express conditional simulation as an inference problem.
result Principled particle Gibbs and pseudo-marginal samplers for conditional distribution.
The paper extends NUP representations to factor graphs for better estimation.
problem Nontrivial model-based estimation problems.
method Augmenting factor graphs with convex-dual variables and NUP representations; proposing a new iterative algorithm.
result A new dual algorithm for state space problems.
Study numerical methods for singular FBSDEs with degenerate forward component.
problem Numerical approximation of singular fully coupled FBSDEs with degenerate forward component and non-smooth terminal condition.
method Splitting approach to treat diffusion and transport parts separately.
result The splitting method converges with rate 1/2 under structural condition.
A new family of momentum coefficients improves the convergence rate of accelerated algorithms.
problem Improving the convergence rate of accelerated gradient methods for strongly convex functions.
method Introducing a family of controllable momentum coefficients for forward-backward accelerated methods.
result Established a controllable $O\left(1/k^{2α}
ight)$ convergence rate for the NAG- method.
Solves wealth maximization problem using variational analysis.
problem Maximizing expected utility of terminal wealth.
method Variational analysis, forward-backward stochastic differential equation (FBSDE).
result Characterization and solutions for various utility functions.
Continuous-time mean-variance portfolio selection model with nonlinear wealth equations and bankruptcy prohibition is investigated by the dual method. A necessary and sufficient condition which the optimal terminal wealth satisfies is obtained through a terminal perturbation technique. It is also shown that the optimal…
SGD converges with perturbed forward-backward passes, explained by geometric amplification.
problem Analyzing convergence of SGD with perturbed forward-backward passes in composite optimization.
method Characterized propagation and amplification of perturbations, derived convergence guarantees for non-convex and PL objectives.
result Perturbations cascade through the computational graph, affecting convergence order under specific conditions.
Direction Finding Based on Multi-Step Knowledge-Aided Iterative Conjugate Gradient Algorithmseess.SP
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…
Bayesian units improve speech recognition with minimal parameters.
problem Improving speech recognition models with fewer parameters.
method Derived Bayesian recurrent units integrated into deep learning frameworks.
result Adding Bayesian units improves speech recognition performance.
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…
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…
Two new algorithms optimize decentralized convex optimization with reduced communication rounds.
problem Decentralized minimization of smooth strongly convex functions in a network.
method Proposes two new algorithms based on accelerated Forward Backward methods.
result First algorithm is optimal in terms of communication rounds and gradient computations.
We introduce a new, systematic framework for visualizing information flow in deep networks. Specifically, given any trained deep convolutional network model and a given test image, our method produces a compact support in the image domain that corresponds to a (high-resolution) feature that contributes to the given exp…
Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Ratesmath.OC
Paper generalizes extragradient methods for solving equations and inclusions with improved convergence rates.
problem Solving equations and inclusions using extragradient methods.
method Unified and generalized extragradient methods for a broader class of algorithms, analyzing sublinear convergence rates.
result Unified and improved convergence results for various extragradient variants.
New framework trains Schrödinger Bridge models using SDEs for generative tasks.
problem Unclear relation between SB optimization and modern generative model training.
method Forward-Backward SDEs theory for likelihood training of SB models.
result Training algorithm achieves comparable results on image generation datasets.
Innovative method solves nonconvex optimization on manifolds.
problem Nonconvex optimization problems on Riemannian manifolds.
method Intrinsic Riemannian proximal gradient method.
result Converges for nonconvex or nonembedded problems.
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…
We propose a new method for the numerical solution of backward stochastic differential equations (BSDEs) which finds its roots in Fourier analysis. The method consists of an Euler time discretization of the BSDE with certain conditional expectations expressed in terms of Fourier transforms and computed using the fast F…
We present a deep recurrent neural network architecture to solve a class of stochastic optimal control problems described by fully nonlinear Hamilton Jacobi Bellmanpartial differential equations. Such PDEs arise when one considers stochastic dynamics characterized by uncertainties that are additive and control multipli…
We consider a class of participation rights, i.e. obligations issued by a company to investors who are interested in performance-based compensation. Albeit having desirable economic properties equity-based debt obligations (EbDO) pose challenges in accounting and contract pricing. We formulate and solve the associated …
This paper provides a unifying theoretical framework for stochastic optimization algorithms by means of a latent stochastic variational problem. Using techniques from stochastic control, the solution to the variational problem is shown to be equivalent to that of a Forward Backward Stochastic Differential Equation (FBS…
DeepGSB solves MFGs with non-differentiable preferences.
problem Solving MFGs with non-differentiable preferences and exact population convergence.
method Generalized Schrödinger Bridge via Forward-Backward SDEs and Temporal Difference learning.
result DeepGSB provides necessary and sufficient conditions for mean-field problems.
This work provides a semi-analytic approximation method for decoupled forwardbackward SDEs (FBSDEs) with jumps. In particular, we construct an asymptotic expansion method for FBSDEs driven by the random Poisson measures with σ-finite compensators as well as the standard Brownian motions around the small-variance limit …
New algorithms reduce variance in solving complex mathematical problems.
problem Solving convex-concave saddle point problems, variational inequalities, and inclusions.
method Stochastic variance reduction for extragradient, forward-backward-forward, and forward-reflected-backward methods.
result All proposed methods converge with complexities matching or improving deterministic counterparts.
Study uses MFG approach to model equilibrium pricing with market clearing condition.
problem Continuous asset pricing with market clearing condition.
method Mean field game approach to solve forward-backward SDEs of McKean-Vlasov type.
result Net order flow converges to zero in large N-limit with specified conditions.
New insights show NAG and FISTA converge linearly without knowing strong convexity modulus.
problem Understanding linear convergence of NAG and FISTA without strong convexity modulus knowledge.
method High-resolution ODE framework, dynamically adapting kinetic energy coefficient.
result NAG and FISTA demonstrate linear convergence without requiring strong convexity modulus knowledge.
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…
Convergence of the Forward-Backward Algorithm: Beyond the Worst Case with the Help of Geometrymath.OC
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…
Investor optimizes utility in a market with endogenous pricing.
problem Maximizing utility in an incomplete market with endogenous pricing.
method Characterized optimality via FBSDEs and BSPDEs using generalized subgradients.
result Existence and smoothness of solutions for optimal investment and FBSDEs.
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…
DQNs can approximate optimal Q-functions with high accuracy on compact sets.
problem Approximating optimal Q-functions in continuous-time Markov Decision Processes.
method Stochastic control, FBSDEs, residual network approximation theorems, large deviation bounds, viscosity solutions.
result DQNs can approximate optimal Q-functions on compact sets with arbitrary accuracy and high probability.
Forward-backward selection is one of the most basic and commonly-used feature selection algorithms available. It is also general and conceptually applicable to many different types of data. In this paper, we propose a heuristic that significantly improves its running time, while preserving predictive accuracy. The idea…
Study on feature learning dynamics in infinite-depth neural networks, focusing on ResNets.
problem Understanding how features evolve during training in deep neural networks, especially in the large-depth limit.
method Conditional Gaussian representations and SDE system with decoupled backward weights.
result Depth-induced suppression of forward-backward coupling in infinite-depth networks, leading to a decoupled forward-backward SDE system.