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

2605207801,040 · Jun 202019922001200920172026
48 results for Markov control problem

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.

Abstract: Surveying connections between ML and Control Theory.

problem Addressing the intersection of Machine Learning and Control Theory.
method Develops connections through reinforcement learning, supervised learning, deep learning, and stochastic gradient descent.
result Machine Learning and Control Theory are interconnected, with ML solving large control problems and Control Theory providing tools for ML.

Study nonparametric estimator for Markov chain transition matrices in offline setting.

problem Estimating transition matrices of finite controlled Markov chains from logged data.
method Developed sample complexity bounds and conditions for minimaxity.
result Achieving certain statistical risk requires balancing mixing properties and sample size.

Study uses DRL with Lagrangian relaxation to solve temporal control tasks with STL constraints.

problem Optimal control problems with temporal logic constraints.
method Extended CMDP formulation, Lagrangian relaxation, two-phase constrained DRL algorithm.
result Demonstrated learning performance of the proposed algorithm through simulations.

This paper tackles adaptive control of unknown Markov jump systems with sample complexity and regret bounds.

problem Adaptive control of unknown Markov jump systems with changing dynamics.
method Identification-based adaptive control using a system identification algorithm and certainty equivalent control.
result The proposed adaptive control scheme achieves O(T)\mathcal{O}(\sqrt{T}) regret, improving to O(polylog(T))\mathcal{O}(polylog(T)) with partial knowledge.

Optimizes costs in uncertain Markov systems using risk filters.

problem Optimizing costs in systems with model uncertainty and unknown parameters.
method Risk filters and Bellman principle of optimality applied to Bayesian framework.
result Derives the Bellman principle for non-standard risk-averse control problems.

Paper proposes a DRL-based controller for networked AP systems that reduces communication frequency.

problem Reduce communication frequency in networked AP systems while maintaining control performance.
method Develops a DRL-based controller that avoids explicit update timing learning, using a semi-Markov decision process (SMDP).
result Improves communication efficiency without sacrificing control performance.

We consider the inverse reinforcement learning problem, that is, the problem of learning from, and then predicting or mimicking a controller based on state/action data. We propose a statistical model for such data, derived from the structure of a Markov decision process. Adopting a Bayesian approach to inference, we sh…

2012-11-26abs ↗pdf ↗

This paper investigates methods for estimating the optimal stochastic control policy for a Markov Decision Process with unknown transition dynamics and an unknown reward function. This form of model-free reinforcement learning comprises many real world systems such as playing video games, simulated control tasks, and r…

2019-11-16abs ↗pdf ↗

Optimal investment strategy with expert opinions in uncertain conditions.

problem Optimizing wealth in a model with unobservable drift and costly expert opinions.
method Embedding into a full information problem, using viscosity solutions and stochastic Perron's method.
result Constructing optimal trading and expert opinion strategies under sufficient regularity conditions.

New algorithm solves uncertain Markov decision processes using Wasserstein uncertainty.

problem Solving Markov decision processes with uncertain transition probabilities.
method Distributionally robust QQ-learning algorithm for Wasserstein uncertainty.
result Convergence of the algorithm proved and demonstrated with real data.

Framework for robust control in cooperative systems with uncertain common noise.

problem Optimizing collective behavior of agents in the presence of uncertain common noise.
method Proposes a robust mean-field control framework and proves existence of optimal controls.
result Existence of optimal open-loop controls linked to a lifted robust Markov decision problem.

This paper improves MARL for networked systems through new protocols and discount factors.

problem Improving control in networked systems using multi-agent reinforcement learning.
method Formulated as a spatiotemporal Markov decision process, introduced a spatial discount factor, and proposed NeurComm.
result Appropriate spatial discount factor enhances learning curves of non-communicative MARL algorithms.

Bootstrap method for Markov chains in reinforcement learning.

problem Distributional consistency in finite controlled Markov chains with unknown control policies.
method Model-based bootstrap with novel LLN and CLT for visitation counts and transition increments.
result Asymptotically valid confidence intervals for value and QQ-functions in offline RL.

We introduce a general framework for measuring risk in the context of Markov control processes with risk maps on general Borel spaces that generalize known concepts of risk measures in mathematical finance, operations research and behavioral economics. Within the framework, applying weighted norm spaces to incorporate …

2011-10-28abs ↗pdf ↗

This paper considers a non-Markov control problem arising in a financial market where asset returns depend on hidden factors. The problem is non-Markov because nonlinear filtering is required to make inference on these factors, and hence the associated dynamic program effectively takes the filtering distribution as one…

2018-07-22abs ↗pdf ↗

Investor selects portfolios based on news attention in a hidden Markov model.

problem Mean-variance portfolio selection in a dynamic attention context.
method Closed-loop equilibrium strategies via extended HJB equation and Markov chain approximation.
result Equilibrium strategies found through iterative algorithm and numerical examples.

Controller-Augmented Hidden Markov Models (CHMMs) are a framework for constrained sequential inference.

problem Hidden Markov models fail under pathwise constraints like precedence, visitation, or monotonic state progression.
method CHMMs compile constraints into finite-state controllers, then use standard forward-backward and Viterbi recursions to compute exact constrained posteriors and paths.
result CHMMs provide exact constrained inference, monotone ascent in constrained EM, and linear complexity in controller cardinality.

Develops CLTs for Markov chain transition probabilities and policies.

problem Estimating transition probabilities and policies in controlled Markov chains.
method Non-parametric estimator for transition matrices; CLTs for value, Q-, and advantage functions; goodness-of-fit tests.
result Asymptotic normality of estimators under specific logging policies.

Model reduction of Markov processes is a basic problem in modeling state-transition systems. Motivated by the state aggregation approach rooted in control theory, we study the statistical state compression of a discrete-state Markov chain from empirical trajectories. Through the lens of spectral decomposition, we study…

2018-02-08abs ↗pdf ↗

We solve a continuous-time game-theoretic problem for Kihlstrom-Mirman preferences.

problem Dynamic inconsistency in preferences due to multiattribute utility theory.
method Formalized an equilibrium control theory for continuous-time Markov processes.
result Equilibrium strategy and value function as solution to extended HJB system.

Market makers optimize bid/ask quotes under hidden Markov chain uncertainty.

problem Optimizing market quotes with hidden factors affecting order intensities.
method Solves stochastic control problem using filtering, control, and PDMPs theory.
result Value function is unique viscosity solution of dynamic programming equation.

New method controls gradient error for sparse MRFs.

problem Efficient learning for sparse discrete MRFs with NP-hard inference.
method Stochastic proximal gradient (SPG) with controlled gradient approximation error.
result Novel bounds control gradient approximation quality.

We study the problem of regret minimization in partially observable linear quadratic control systems when the model dynamics are unknown a priori. We propose ExpCommit, an explore-then-commit algorithm that learns the model Markov parameters and then follows the principle of optimism in the face of uncertainty to desig…

2020-01-31abs ↗pdf ↗

In this paper we consider long-run risk sensitive average cost impulse control applied to a continuous-time Feller-Markov process. Using the probabilistic approach, we show how to get a solution to a suitable continuous-time Bellman equation and link it with the impulse control problem. The optimal strategy for the und…

2019-12-05abs ↗pdf ↗

Study optimal liquidation strategies under partial information in high-frequency trading.

problem Optimal liquidation strategies in high-frequency trading with incomplete information.
method Modeling price formation through Hawkes processes, incorporating liquidity as a hidden Markov process, and formulating as an impulse control problem.
result Development of an algorithm to approximate optimal liquidation strategies.

This paper solves a Bayes sequential impulse control problem for a diffusion, whose drift has an unobservable parameter with a change point. The partially-observed problem is reformulated into one with full observations, via a change of probability measure which removes the drift. The optimal impulse controls can be ex…

2014-04-07abs ↗pdf ↗

Study optimal portfolios in a non-Markovian regime-switching model with random time horizon.

problem Optimal portfolio selection in a market with non-Markovian regime-switching and random time horizon.
method Formulated as a constrained stochastic linear-quadratic optimal control problem, derived closed-form expressions for optimal portfolios and efficient frontier.
result Closed-form expressions for optimal portfolios and efficient frontier derived under non-Markovian regime-switching and random time horizon.

We analyze stochastic approximation with Markov noise for reinforcement learning.

problem Asymptotic convergence analysis of stochastic approximation with controlled Markov noise.
method Relating to limiting differential inclusions and ergodic occupation measures.
result First informative error bounds on function approximation for policy evaluation.