New method solves nonseparable stochastic control problems.
problem Nonseparable and non-monotonic stochastic control problems.
method Scenario-decomposition solution framework using progressive hedging algorithm.
result Extends reach of stochastic optimal control.
New methodology controls synthetic data bias for neural program synthesis.
problem Deep networks generalize poorly to certain data distributions when trained on synthetic examples.
method Proposes a new methodology to control and evaluate the bias of synthetic data distributions over programs and specifications.
result Training deep networks on controlled synthetic data distributions leads to improved cross-distribution generalization performance.
In this paper a neural network heuristic dynamic programing (HDP) is used for optimal control of the virtual inertia based control of grid connected three phase inverters. It is shown that the conventional virtual inertia controllers are not suited for non inductive grids. A neural network based controller is proposed …
funcGNN uses graph neural networks to estimate program similarity efficiently.
problem Estimating accurate program similarity for software engineering tasks.
method funcGNN trains on labeled CFG pairs to predict GED between unseen programs using effective embedding vectors.
result funcGNN achieves lower error rate (0.00194) and is 23 times faster than traditional methods.
Variational inference improves hierarchical imitation learning of control programs.
problem Learning structured control policies from demonstrations.
method Variational inference for discovering hierarchical structure in observation-action traces.
result Variational inference leads to more efficient and generalized control policies.
The paper analyzes error propagation in dynamic programming for stochastic control and option pricing.
problem Error propagation in dynamic programming for stochastic control and option pricing.
method Formulated a general dynamic programming framework, used RKHSs for nonparametric regression, and Monte Carlo subsampling for estimating continuation value.
result Proposed a rigorous error decomposition and control mechanism for error propagation in dynamic programming.
Networks of coupled dynamical systems provide a powerful way to model systems with enormously complex dynamics, such as the human brain. Control of synchronization in such networked systems has far reaching applications in many domains, including engineering and medicine. In this paper, we formulate the synchronization…
Solves Merton's investment-consumption problem with certainty equivalent approach.
problem Maximizing CRRA utility of consumption over time and investment mix.
method Identifies a certainty equivalent problem for the Merton problem, reformulates it as an SOCP, and applies it to model predictive control.
result The certainty equivalent problem can be solved as an SOCP, facilitating model predictive control.
Optimal Control Theory optimizes neural networks, improving robustness and efficiency.
problem Optimizing deep neural networks (DNNs) for better performance and efficiency.
method Integrating Optimal Control Theory with Backpropagation to develop a new optimizer.
result Optimal Control Theoretic Neural Optimizer (OCNOpt) improves upon existing methods in robustness and efficiency.
New metric derived for robust optimization in stochastic control problems.
problem Non-parametric uncertainty in multiperiod stochastic control problems.
method Derived a new metric, adapted (p,∞)--Wasserstein distance, and used dynamic programming principle. result Dynamic programming principle for DRO problems with semi-separable cost functions.
New model predicts optimal control for restless bandit problems.
problem Optimizing control in restless bandit problems with minimal assumptions.
method Model Predictive Control with rolling horizon linear programming.
result Sub-optimality gap of O(1/√N) under general conditions, and exp(-Ω(N)) under local-stability condition.
Neural networks powered with external memory simulate computer behaviors. These models, which use the memory to store data for a neural controller, can learn algorithms and other complex tasks. In this paper, we introduce a new memory to store weights for the controller, analogous to the stored-program memory in modern…
Deep learning solves dynamic programming with recursive utility.
problem Challenges in solving high-dimensional discrete-time dynamic programming problems with recursive utility.
method Certainty Equivalent Learning (CEL) algorithm that learns certainty-equivalent value directly with neural networks.
result Accurate value and policy approximations in high-dimensional problems, comparable to VFI in some cases.
We study a stochastic game where one player tries to find a strategy such that the state process reaches a target of controlled-loss-type, no matter which action is chosen by the other player. We provide, in a general setup, a relaxed geometric dynamic programming principle for this problem and derive, for the case of …
Deep learning solves complex stochastic control with jumps.
problem Solving high-dimensional stochastic control tasks with jumps.
method Model-based approach using two neural networks, iteratively trained with objectives derived from the Hamilton-Jacobi-Bellman equation.
result Demonstrates effectiveness in solving complex high-dimensional stochastic control tasks.
We describe an abstract control-theoretic framework in which the validity of the dynamic programming principle can be established in continuous time by a verification of a small number of structural properties. As an application we treat several cases of interest, most notably the lower-hedging and utility-maximization…
The paper solves complex control problems using neural networks.
problem Solving McKean-Vlasov control problems.
method Mean-field neural networks and algorithms based on dynamic programming and stochastic maximum principle.
result Extensive numerical results show the accuracy of the proposed algorithms.
Framework optimizes battery storage for markets by separating long-term degradation from short-term market dynamics.
problem Intractable computation due to timescale mismatch between battery degradation and market dynamics.
method Approximate dynamic programming with value function approximation and pseudo-time encoding.
result Policy outperforms benchmarks in real-time market scenarios.
The paper fits cash management models to data using stochastic and linear programming.
problem Cash flow probability distribution assumptions in cash management models are relaxed.
method Stochastic and linear programming to fit models to data.
result A small random sample of data is sufficient to fit bound-based models.
The paper solves optimal control problems for stochastic delay equations.
problem Optimal control of stochastic delay differential equations.
method Rewriting the problem in an infinite-dimensional Hilbert space, using dynamic programming and viscosity solutions.
result Characterizes the value function as the unique viscosity solution of the Hamilton-Jacobi-Bellman equation.
This paper develops algorithms for high-dimensional stochastic control problems based on deep learning and dynamic programming. Unlike classical approximate dynamic programming approaches, we first approximate the optimal policy by means of neural networks in the spirit of deep reinforcement learning, and then the valu…
ProGraML uses graph-based machine learning to improve program optimization and analysis.
problem Improving program optimization and analysis with machine learning.
method Low-level, language agnostic graph representation and message passing neural networks.
result ProGraML achieves an average 94.0 F1 score on a benchmark dataset, significantly outperforming state-of-the-art approaches.
Improved reinforcement method for optimal control problems.
problem Optimal control problems with limited computational cost.
method Reinforced least squares Monte Carlo method for stochastic control problems.
result Significant improvement in method's efficiency and accuracy.
Paper explores two methods for optimal portfolio selection in financial markets.
problem Optimal portfolio selection for financial markets with jumps.
method Maximum principle and dynamic programming approach.
result Relationship between two methods and their adjoint processes.
New approach generates better synthetic data for neural program synthesis.
problem Current approaches to neural program synthesis generalize poorly to real data.
method Adversarial approach to control synthetic data distributions.
result Proposed method outperforms current approaches.
We introduce and demonstrate a new approach to inference in expressive probabilistic programming languages based on particle Markov chain Monte Carlo. Our approach is simple to implement and easy to parallelize. It applies to Turing-complete probabilistic programming languages and supports accurate inference in models …
Unified approach to path planning using probabilistic inference on factor graphs.
problem Path planning problems using probabilistic inference.
method Unified framework using probabilistic factor graphs and message composition rules.
result Unified approach includes various algorithms like Sum-product, Max-product, Dynamic programming, and mixed criteria.
Paper tackles non-Markovian control problems with new learning methods.
problem Non-Markovian stochastic control problems with unknown parameters.
method Off-model training and importance sampling for deep neural network approximation.
result Quantitative error bounds for adaptive learning under model uncertainty.
Optimizes experimental design using synthetic controls for better outcomes.
problem Estimating average treatment effects in studies with pre-treatment data.
method Mixed-integer programming for selecting treated and control units and weights.
result Improves mean squared error and statistical power compared to simple alternatives.
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.
Develops a model for bid and ask prices using stochastic control.
problem Modeling bid and ask prices of a European asset.
method Formulates a stochastic control problem, uses Girsanov theorem, Esscher transform, and dynamic programming.
result Derives equations to determine bid and ask prices.
We consider an optimal stopping problem where a constraint is placed on the distribution of the stopping time. Reformulating the problem in terms of so-called measure-valued martingales allows us to transform the marginal constraint into an initial condition and view the problem as a stochastic control problem; we esta…
DiffTaichi enables fast, differentiable physical simulations with shorter code.
problem Building efficient differentiable physical simulators.
method Differentiable programming language (DiffTaichi) that generates gradients using source code transformations and a light-weight tape.
result Differentiable physical simulators written in DiffTaichi are faster and more concise than existing methods.
This paper addresses the problem of learning the optimal control policy for a nonlinear stochastic dynamical system with continuous state space, continuous action space and unknown dynamics. This class of problems are typically addressed in stochastic adaptive control and reinforcement learning literature using model-b…
Paper proposes methods to reduce financial contagion by targeted cash injections.
problem Financial contagion through interconnected networks.
method Dynamic model of payments with external control term for corrective cash injections.
result Targeted cash injections can significantly reduce default propagation.
This work addresses time inconsistency in risk measures and develops a dynamic programming principle for risk minimization problems.
problem Time inconsistency in optimized certainty equivalents (OCEs) risk measures.
method Enlargement of state space to achieve a substitute for time consistency, derivation of dynamic programming principle.
result Characterization of the value function via viscosity solutions of Hamilton--Jacobi--Bellman--Issacs equations.
We give the simple proof of Bobkov's inequality using the arguments of dynamical programming principle. As a byproduct of the method we obtain a characterization of optimizers.
Optimal Volt/VAR control rules are designed using deep neural networks.
problem Designing optimal Volt/VAR control rules for distributed energy resources (DERs).
method Formulate optimal rule design as a bilevel program, then reformulate it as training a deep neural network (DNN). Use proximal gradient descent (PGD) iterations to emulate Volt/VAR dynamics.
result The proposed solution can be adapted to single/multi-phase feeders and achieves enhanced steady-state voltage profiles.
We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the …
TreeCaps improves code comprehension for software developers.
problem Processing code efficiently for software developers.
method Tree-based capsule networks for capturing code syntactical structures and dependencies.
result TreeCaps outperforms other approaches in classifying program functionalities.
Simplified approach to portfolio risk management and hedging in practice.
problem Challenges in applying academic portfolio risk management and hedging in real-world business settings.
method A straightforward approach using convex optimization and quadratic programming.
result Demonstrates how to solve portfolio risk management and hedging problems with CVXOPT.
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 book is a graduate-level introduction to probabilistic programming. It not only provides a thorough background for anyone wishing to use a probabilistic programming system, but also introduces the techniques needed to design and build these systems. It is aimed at people who have an undergraduate-level understandi…
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.
Framework for controlling multiple risks in AI models.
problem Enforcing multiple risk constraints in generative AI models.
method Formalizes problem, introduces two dynamic programming algorithms.
result Achieves nearly tight control of all constraint risks under mild assumptions.
CEFOL uses deep learning for dynamic programming with recursive utility.
problem Challenges in solving dynamic programming problems with recursive utility.
method Introduces a separate neural network for certainty equivalent, uses first-order optimality conditions to learn value and policy functions.
result CEFOL achieves high accuracy in learning value and policy functions, matching VFI benchmarks.
A new method streamlines digital payment programming using smart contracts.
problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.
New method uses neural nets to control systems safely with disturbances.
problem Designing safe control laws for systems with disturbances.
method Imitation learning to train neural network controllers that satisfy CBF constraints.
result Demonstrated on a unicycle model with external disturbances.