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

223446669892 · Jun 202019922001200920172026
48 results for LQ problem

We solve a complex trade execution problem by simplifying it into a known LQ control problem.

problem Optimal trade execution with stochastic price impact and resilience.
method Extending the problem to progressively measurable processes and reducing it to a LQ stochastic control problem.
result The solution to the LQ problem traces back to the solution of the original trade execution problem.

Paper solves MV portfolio selection in jump-diffusion models with no-shorting constraint.

problem Mean-variance portfolio selection in jump-diffusion model with no-shorting constraint.
method Reduces problem to LQ control and finding a maximal point of a function, constructs viscosity solution.
result Explicit viscosity solution to Hamilton-Jacobi-Bellman equation, optimal controls derived.

We consider the exploration-exploitation tradeoff in linear quadratic (LQ) control problems, where the state dynamics is linear and the cost function is quadratic in states and controls. We analyze the regret of Thompson sampling (TS) (a.k.a. posterior-sampling for reinforcement learning) in the frequentist setting, i.…

2017-03-27abs ↗pdf ↗

Article presents QR and LQ decomposition algorithms for various matrix sizes and ranks.

problem Solving least squares problems in machine learning and computer vision.
method Developed novel matrix backpropagation algorithms for QR and LQ decompositions of different matrix sizes and ranks.
result Numerical stability and computational efficiency of the proposed methods.

Neural operators learn to solve LQ MFGs efficiently in infinite dimensions.

problem Solving many related LQ MFG problems in infinite-dimensional settings.
method Training neural operators to map problem data to equilibrium strategies.
result NOs reliably solve unseen LQ MFG variants with controlled parameters.

The paper solves a complex control problem with stochastic elements and switching conditions.

problem Non-homogeneous stochastic LQ control with regime switching and random coefficients.
method Explicit optimal control and value obtained through two systems of backward stochastic differential equations (BSDEs). Existence and uniqueness of solutions proved using BMO martingales and contraction mapping method.
result Explicit optimal state feedback control and optimal value derived for the problem.

Study of LQ MFGs in infinite-dimensional Hilbert spaces.

problem Mean field games in infinite-dimensional settings with stochastic dynamics.
method Analysis of coupled semilinear infinite-dimensional stochastic evolution equations, development of Nash equilibrium.
result Characterization of unique Nash equilibrium in the limit of many agents.

Choquet regularization improves exploration in RL.

problem Improving exploration in reinforcement learning.
method Introducing Choquet regularizers to measure and manage exploration, reformulating RL problems and deriving explicit solutions.
result Explicit optimal distributions and Choquet regularizers for various exploratory samplers.

Developed LQ MFG theory with common noise, proving existence and uniqueness.

problem Linear-quadratic mean field games with common noise.
method Coupled forward-backward stochastic evolution equations (FBSEEs) in Hilbert spaces.
result Existence and uniqueness of solutions for small and arbitrary finite time horizons.

Study on PG learning for LQ MFC problems with common noise, proving convergence and sample complexity.

problem Optimal policy learning in LQ MFC problems with common noise and entropy regularization.
method Comprehensive error analysis of PG algorithms in both model-based and model-free settings.
result Global linear convergence and sample complexity of PG algorithms in model-free setting.
Cofrontalsmath.DG

In this paper we introduce the notion of cofrontal mappings, as the dual objects to frontal mappings, and study their basic local and global properties. Cofrontals are very special mappings and far from generic nor stable except for the case of submersions. It is observed that any smooth mapping can be C0C^0-approximat…

2018-11-05abs ↗pdf ↗

This work optimizes RL algorithms using entropy regularisation for continuous-time LQ problems.

problem Designing RL algorithms to balance exploration and exploitation in noisy environments.
method Entropy regularisation in two formulations: exploratory control and proximal policy update.
result Regret of O(N)\mathcal{O}(\sqrt{N}) for both learning algorithms over NN episodes.

A new method solves complex control problems with random coefficients.

problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.

We study the performance of the certainty equivalent controller on Linear Quadratic (LQ) control problems with unknown transition dynamics. We show that for both the fully and partially observed settings, the sub-optimality gap between the cost incurred by playing the certainty equivalent controller on the true system …

2019-02-21abs ↗pdf ↗

Model-free approaches for reinforcement learning (RL) and continuous control find policies based only on past states and rewards, without fitting a model of the system dynamics. They are appealing as they are general purpose and easy to implement; however, they also come with fewer theoretical guarantees than model-bas…

2018-04-17abs ↗pdf ↗

New algorithms improve blind source separation for linear-quadratic mixtures.

problem Blind source separation of linear-quadratic mixtures under separability assumptions.
method Proposed two algorithms: SNPALQ and BF. SNPALQ generalizes SNPA for LQ model, BF post-processes SNPALQ.
result Proven robustness and computational tractability of SNPALQ in separating sources even with noise.

Motivated by the study of linear quadratic optimal control problems, we consider a dynamical system with a constant, quadratic Hamiltonian, and we characterize the number of conjugate times in terms of the spectrum of the Hamiltonian vector field H\vec{H}. We prove the following dichotomy: the number of conjugate time…

2013-11-08abs ↗pdf ↗

This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing this problem based on ensembles of kernel predictors. This includes novel theoretical guarantees based on the Rademacher complexity of the corres…

2012-02-14abs ↗pdf ↗

We discuss two generalizations of the collar lemma. The first is the stable neighborhood theorem which says that a (not necessarily simple) closed geodesic in a hyperbolic surface has a \lq\lq stable neighborhood\rq\rq whose width only depends on the length of the geodesic. As an application, we show that there is a lo…

1992-07-01abs ↗pdf ↗

The paper solves TIC LQ control problems using stochastic differential games.

problem Time-inconsistent linear-quadratic stochastic control problems.
method Stochastic differential games, spike variation approach.
result Achieves Nash equilibrium for TIC problems, demonstrating impact of ambiguity aversion.

In this paper, we formulate a general time-inconsistent stochastic linear--quadratic (LQ) control problem. The time-inconsistency arises from the presence of a quadratic term of the expected state as well as a state-dependent term in the objective functional. We define an equilibrium, instead of optimal, solution withi…

2011-11-03abs ↗pdf ↗

Stabilization of linear systems with unknown dynamics is a canonical problem in adaptive control. Since the lack of knowledge of system parameters can cause it to become destabilized, an adaptive stabilization procedure is needed prior to regulation. Therefore, the adaptive stabilization needs to be completed in finite…

2018-07-22abs ↗pdf ↗

We develop robust Markov Decision Processes with risk measures for uncertain environments.

problem Uncertainty in Markov Decision Processes and its impact on risk measures.
method Formulation as a Stackelberg game, robust cost and value iterations, existence of optimal policies.
result Existence of deterministic optimal policies for robust optimization and risk measures.

Post-training optimizes model performance beyond base model limits.

problem Optimizing sequence prediction models beyond the base model's support.
method Policy gradient (PG) and adaptive learning rate (LR) techniques.
result Post-training with PG can achieve near-optimal performance beyond the base model's support.

Unitons, i.e.\ harmonic spheres in a unitary group, correspond to \lq uniton bundles\rq, i.e.\ holomorphic bundles over the compactified tangent space to the complex line with certain triviality and other properties. In this paper, we use a monad representation similar to Donaldson's representation of instanton bundles…

1995-12-19abs ↗pdf ↗

New method handles robust and adaptive control of linear systems with non-convex costs.

problem Robust and adaptive control of linear systems with unknown parameters.
method Combining non-asymptotic linear regression, interval prediction, and tree-based planning.
result First end-to-end suboptimality analysis for robust and adaptive MPC with non-convex costs.

Study evaluates various regularization methods for electricity price forecasting.

problem Improving accuracy of electricity price predictions.
method Applied ten different penalty functions to two model structures in two electricity markets.
result LQ and elastic net consistently produce more accurate forecasts than other regularization types.

Study of geometric analysis on asymmetric metric spaces, including heat flow and Sobolev spaces.

problem Analysis of geometric properties on asymmetric metric measure spaces.
method Introduction of upper gradients, qq-Laplacian, and qq-heat flow in asymmetric settings.
result Extension of concepts from symmetric to asymmetric metric measure spaces.

We focus in this paper on high-dimensional regression problems where each regressor can be associated to a location in a physical space, or more generally a generic geometric space. Such problems often employ sparse priors, which promote models using a small subset of regressors. To increase statistical power, the so-c…

2018-05-20abs ↗pdf ↗

Invariants count inflections and vertices in singular plane curves.

problem Counting inflections and vertices in singular plane curves.
method Defining invariants IfI_f and VfV_f to count inflections and vertices, respectively, and analyzing their properties.
result The invariants IfI_f and VfV_f are finite and bounded for curves without smooth components.

Paper proposes a RL approach for ALM with superior performance.

problem Dynamic asset-liability management in financial markets.
method Continuous-time RL with LQ formulation, policy gradient, adaptive and scheduled exploration.
result Method outperforms traditional and state-of-the-art RL algorithms in ALM.

Development systems for deep learning (DL), such as Theano, Torch, TensorFlow, or MXNet, are easy-to-use tools for creating complex neural network models. Since gradient computations are automatically baked in, and execution is mapped to high performance hardware, these models can be trained end-to-end on large amounts…

2017-10-24abs ↗pdf ↗

In this work we introduce the concept of Modular Framization or simply Framization. We construct a framization Fd,nF_{d,n} of the Birman--Wenzl--Murakami algebra, also known as BMW algebra, and start a systematic study of this framization. We show that Fd,nF_{d,n} is finite dimensional and the \lq braid generators\rq\ of t…

2010-07-01abs ↗pdf ↗