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.

169,051 papers · 148 categories

Trend · papers per month

63127190253 · May 202619922001200920182026
48 results for dual control

A simpler edge-based discretization method without dual volumes.

problem Efficiently computing edge-based discretization vectors without forming dual volumes.
method Directly compute edge-midpoint vectors and reduce dual volume formation.
result Significant reduction in computing time for tetrahedral grids.

Study optimal consumption with relaxed benchmarks and drawdown constraints.

problem Optimal consumption under relaxed benchmark tracking and consumption drawdown constraint.
method Transformed stochastic control problem into regular control problem with state-control constraints, then solved using dual transform and optimal consumption behavior.
result Closed-form solution for optimal investment and consumption in feedback form.

Paper approximates free boundary for optimal investment stopping problems.

problem Optimal investment stopping problems with utility maximization.
method Dual control method to derive asymptotic properties and construct a global closed-form approximation.
result Global closed-form approximation of dual free boundary reduces computational cost.

Control of non-episodic, finite-horizon dynamical systems with uncertain dynamics poses a tough and elementary case of the exploration-exploitation trade-off. Bayesian reinforcement learning, reasoning about the effect of actions and future observations, offers a principled solution, but is intractable. We review, then…

2015-10-13abs ↗pdf ↗

We develop a general theory of convex duality for certain singular control problems, taking the abstract results by Kramkov and Schachermayer (1999) for optimal expected utility from nonnegative random variables to the level of optimal expected utility from increasing, adapted controls. The main contributions are the f…

2014-07-29abs ↗pdf ↗

The paper solves a control problem using reflections to track a benchmark process.

problem Optimal consumption with a benchmark process that grows over time.
method Introduced two auxiliary state processes with reflections to transform the problem into a more tractable form.
result Established the existence of a unique classical solution to the dual PDE.

This paper improves robot grasping by integrating meta-control and latent-space imagination.

problem Dual-system approaches fail to consider the reliability of the learned model when making multiple-step predictions.
method A meta-controller arbitrates between model-based and model-free decisions based on local reliability, encouraging actions that improve the model and generating imagined experiences for additional training.
result Our approach learns near-optimal grasping policies in dense- and sparse-reward environments, outperforming baseline and state-of-the-art methods.

The paper introduces a method to create more reliable models for robot dynamics.

problem Creating accurate models for robot dynamics to improve control and planning algorithms.
method A primal-dual method to enforce constraints on error in specific parts of the state-space.
result The learned models have more predictable error characteristics, enhancing their usability for planning and control algorithms.

In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual problems in terms of FBSDEs plus additional conditions. Such formulation then allows…

2016-12-13abs ↗pdf ↗

We study an optimal control problem related to swing option pricing in a general non-Markovian setting in continuous time. As a main result we show that the value process solves a first-order non-linear backward stochastic partial differential equation. Based on this result we can characterize the set of optimal contro…

2013-05-17abs ↗pdf ↗

A new framework for generative modeling using value-driven transport.

problem Developing efficient methods for generative modeling.
method A discrete-time stochastic control formulation of measure transport, formulated as a linear program with dual variables corresponding to the optimal value function.
result Well-trained VDT policies lead to straight transport paths that can be simulated quickly and robustly.

We propose a novel reformulation of the stochastic optimal control problem as an approximate inference problem, demonstrating, that such a interpretation leads to new practical methods for the original problem. In particular we characterise a novel class of iterative solutions to the stochastic optimal control problem …

2010-09-20abs ↗pdf ↗

The dual risk model is a popular model in finance and insurance, which is often used to model the wealth process of a venture capital or high tech company. Optimal dividends have been extensively studied in the literature for a dual risk model. It is well known that the value function of this optimal control problem do…

2016-01-13abs ↗pdf ↗

Unified market making controls risk, arbitrage, and volatility surfaces.

problem Market making risk, arbitrage, and volatility surface consistency.
method Constrained RL and stochastic control for risk-sensitive execution and hedging.
result Agent achieves positive P&L with zero calendar and butterfly violations.

Geometric problems are usually formulated by means of (exterior) differential systems. In this theory, one enriches the system by adding algebraic and differential constraints, and then looks for regular solutions. Here we adopt a dual approach, which consists to enrich a plane field, as this is often practised in cont…

1998-03-11abs ↗pdf ↗

Adaptive framework predicts stock prices better during volatile periods.

problem Inability of standard prediction models to handle regime-dependent stock market behavior.
method Autoencoder-Gated Dual Node Transformers with Reinforcement Learning Control.
result 0.59% MAPE with adaptive system, compared to 0.80% for baseline.

Two deep learning algorithms solve utility maximisation problems in finance.

problem Solving utility maximisation problems in finance with deep learning.
method Two algorithms: one for Markovian problems via HJB equation and 2BSDE, the other for non-Markovian problems via adjoint BSDE.
result Highly accurate results with low computational cost, solving problems with power, log, and non-HARA utilities in various models.

Paper tackles utility maximization with job-switching and retirement constraints.

problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.

Convex sparsity-inducing regularizations are ubiquitous in high-dimensional machine learning, but solving the resulting optimization problems can be slow. To accelerate solvers, state-of-the-art approaches consist in reducing the size of the optimization problem at hand. In the context of regression, this can be achiev…

2018-02-21abs ↗pdf ↗

New method for hedging path-dependent options with price impact using probabilistic arguments.

problem Hedging of path-dependent options with price impact.
method Dual formulation using probabilistic arguments, proving existence of perfect hedging portfolios.
result Existence of a perfect hedging portfolio for path-dependent options with price impact.

Study of motion control systems on Lie groups with specific geometric constraints.

problem Controlling motion systems on Lie groups with geometric constraints.
method Analysis of control systems on Lie groups, focusing on infinitesimal roto-translations and geodesics.
result Explicit geodesics found for the sub-Riemannian structure on the Lie group.

Optimizes control of hybrid systems with multiple switching processes.

problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.

Optimizes wireless power control using graph neural networks and counterfactual optimization.

problem Mitigating interference in wireless networks with multiple transmitter-receiver pairs.
method Graph neural network architecture combined with unsupervised primal-dual counterfactual optimization.
result Guarantees a minimum rate constraint that adapts to network size, balancing user rates.

Paper tackles offline CMDP problems with near-optimal algorithm and sample complexity bound.

problem Offline CMDP problems with only offline data available.
method DPDL algorithm using single-policy concentrability coefficient CC^* and deviation control mechanism.
result DPDL algorithm matches sample complexity lower bound with ildeO((1γ)1) ilde{\mathcal{O}}((1-γ)^{-1}) factor.

Study optimal portfolio strategies with periodic evaluation under short-selling prohibition.

problem Optimal portfolio strategies with periodic evaluation under short-selling prohibition.
method Reformulate the original problem into an auxiliary one-period optimization problem and introduce dual control problem.
result Derive and verify the value function and optimal constrained portfolio for the original problem.

Study efficient convergence of RL algorithm with function approximation.

problem Convergence of actor-critic algorithm with nonlinear function approximation.
method Stochastic gradient descent ascent with adaptive proximal term, Polyak-Łojasiewicz condition.
result First efficient convergence result with rate of O(sqrt{ln(N d G^2) / N}).

Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…

2018-05-28abs ↗pdf ↗

The problem of robust hedging requires to solve the problem of superhedging under a nondominated family of singular measures. Recent progress was achieved by [9,11]. We show that the dual formulation of this problem is valid in a context suitable for martingale optimal transportation or, more generally, for optimal tra…

2013-02-07abs ↗pdf ↗

Paper tackles robust classification and feature selection with a novel primal-dual method.

problem Robust supervised classification and feature selection in high-dimensional data.
method Developed a novel constrained primal-dual method to jointly select features and classifiers.
result Demonstrated effectiveness on synthetic and biological datasets, comparing different costs.

Graph neural networks optimize radio resource management policies for wireless networks.

problem Optimizing user selection and power control in wireless networks with fairness constraints.
method Formulated as a Lagrangian dual problem, RRM policies are parameterized by a GNN architecture trained on channel conditions.
result The method achieves superior tradeoff between average and 5th percentile rates, demonstrating fairness.

The paper explores how AI systems use information geometry to encode semantic structure.

problem How AI systems encode semantic structure into geometric representation spaces.
method Focuses on softmax distributions and develops dual steering method for robust concept manipulation.
result Dual steering optimally modifies target concepts while minimizing off-target changes.