Ruimeng Hu

Bio: Ruimeng Hu is an academic researcher from University of California, Santa Barbara. The author has contributed to research in topics: Portfolio optimization & Mathematics. The author has an hindex of 10, co-authored 31 publications receiving 232 citations. Previous affiliations of Ruimeng Hu include Columbia University.

Sequential Design for Ranking Response Surfaces

Abstract: Motivated by the problem of estimating optimal feedback policy maps in stochastic control applications, we propose and analyze sequential design methods for ranking several response surfaces. Namely, given $L \ge 2$ response surfaces over a continuous input space $\mathcal{X}$, the aim is to efficiently find the index of the minimal response across the entire $\mathcal{X}$. The response surfaces are not known and have to be noisily sampled one at a time, requiring joint experimental design both in space and response-index dimensions. To generate sequential design heuristics we investigate Bayesian stepwise uncertainty reduction approaches, as well as sampling based on posterior classification complexity. We also make connections between our continuous-input formulation and the discrete framework of pure regret in multi-armed bandits. To model the response surfaces we utilize kriging metamodels. Several numerical examples using both synthetic data and an epidemics control problem are provided to illustrate...

Deep fictitious play for stochastic differential games

Abstract: In this paper, we apply the idea of fictitious play to design deep neural networks (DNNs), and develop deep learning theory and algorithms for computing the Nash equilibrium of asymmetric $N$-player non-zero-sum stochastic differential games, for which we refer as \emph{deep fictitious play}, a multi-stage learning process. Specifically at each stage, we propose the strategy of letting individual player optimize her own payoff subject to the other players' previous actions, equivalent to solve $N$ decoupled stochastic control optimization problems, which are approximated by DNNs. Therefore, the fictitious play strategy leads to a structure consisting of $N$ DNNs, which only communicate at the end of each stage. The resulted deep learning algorithm based on fictitious play is scalable, parallel and model-free, {\it i.e.}, using GPU parallelization, it can be applied to any $N$-player stochastic differential game with different symmetries and heterogeneities ({\it e.g.}, existence of major players). We illustrate the performance of the deep learning algorithm by comparing to the closed-form solution of the linear quadratic game. Moreover, we prove the convergence of fictitious play under appropriate assumptions, and verify that the convergent limit forms an open-loop Nash equilibrium. We also discuss the extensions to other strategies designed upon fictitious play and closed-loop Nash equilibrium in the end.

Sequential Design for Ranking Response Surfaces

Abstract: We propose and analyze sequential design methods for the problem of ranking several response surfaces. Namely, given $L \ge 2$ response surfaces over a continuous input space $\cal X$, the aim is to efficiently find the index of the minimal response across the entire $\cal X$. The response surfaces are not known and have to be noisily sampled one-at-a-time. This setting is motivated by stochastic control applications and requires joint experimental design both in space and response-index dimensions. To generate sequential design heuristics we investigate stepwise uncertainty reduction approaches, as well as sampling based on posterior classification complexity. We also make connections between our continuous-input formulation and the discrete framework of pure regret in multi-armed bandits. To model the response surfaces we utilize kriging surrogates. Several numerical examples using both synthetic data and an epidemics control problem are provided to illustrate our approach and the efficacy of respective adaptive designs.

Optimal Portfolio under Fast Mean-Reverting Fractional Stochastic Environment

Abstract: Empirical studies indicate the existence of long-range dependence in the volatility of the underlying asset. This feature can be captured by modeling its return and volatility using functions of a stationary fractional Ornstein--Uhlenbeck (fOU) process with Hurst index $H \in (\frac{1}{2}, 1)$. In this paper, we analyze the nonlinear optimal portfolio allocation problem under this model and in the regime where the fOU process is fast mean-reverting. We first consider the case of power utility, and rigorously give first order approximations of the value and the optimal strategy by a martingale distortion transformation. We also establish the asymptotic optimality in all admissible controls of a zeroth order trading strategy. Then, we consider the case with general utility functions using the epsilon-martingale decomposition technique, and we obtain similar asymptotic optimality results within a specific family of admissible strategies.

Optimal Portfolio under Fast Mean-reverting Fractional Stochastic Environment

Abstract: Empirical studies indicate the existence of long range dependence in the volatility of the underlying asset. This feature can be captured by modeling its return and volatility using functions of a stationary fractional Ornstein--Uhlenbeck (fOU) process with Hurst index $H \in (\frac{1}{2}, 1)$. In this paper, we analyze the nonlinear optimal portfolio allocation problem under this model and in the regime where the fOU process is fast mean-reverting. We first consider the case of power utility, and rigorously give first order approximations of the value and the optimal strategy by a martingale distortion transformation. We also establish the asymptotic optimality in all admissible controls of a zeroth order trading strategy. Then, we extend the discussions to general utility functions using the epsilon-martingale decomposition technique, and we obtain similar asymptotic optimality results within a specific family of admissible strategies.

Continuous-time stochastic control and optimization with financial applications / Huyen Pham

Abstract: Stochastic optimization problems arise in decision-making problems under uncertainty, and find various applications in economics and finance. On the other hand, problems in finance have recently led to new developments in the theory of stochastic control. This volume provides a systematic treatment of stochastic optimization problems applied to finance by presenting the different existing methods: dynamic programming, viscosity solutions, backward stochastic differential equations, and martingale duality methods. The theory is discussed in the context of recent developments in this field, with complete and detailed proofs, and is illustrated by means of concrete examples from the world of finance: portfolio allocation, option hedging, real options, optimal investment, etc. This book is directed towards graduate students and researchers in mathematical finance, and will also benefit applied mathematicians interested in financial applications and practitioners wishing to know more about the use of stochastic optimization methods in finance.

Deep Potential Molecular Dynamics: a Scalable Model with the Accuracy of Quantum Mechanics

Abstract: We introduce a scheme for molecular simulations, the deep potential molecular dynamics (DPMD) method, based on a many-body potential and interatomic forces generated by a carefully crafted deep neural network trained with ab initio data. The neural network model preserves all the natural symmetries in the problem. It is first-principles based in the sense that there are no ad hoc components aside from the network model. We show that the proposed scheme provides an efficient and accurate protocol in a variety of systems, including bulk materials and molecules. In all these cases, DPMD gives results that are essentially indistinguishable from the original data, at a cost that scales linearly with system size.

Practical Heteroscedastic Gaussian Process Modeling for Large Simulation Experiments

Abstract: We present a unified view of likelihood based Gaussian progress regression for simulation experiments exhibiting input-dependent noise. Replication plays an important role in that context, however ...

Algorithms for Solving High Dimensional PDEs: From Nonlinear Monte Carlo to Machine Learning.

Abstract: In recent years, tremendous progress has been made on numerical algorithms for solving partial differential equations (PDEs) in a very high dimension, using ideas from either nonlinear (multilevel) Monte Carlo or deep learning. They are potentially free of the curse of dimensionality for many different applications and have been proven to be so in the case of some nonlinear Monte Carlo methods for nonlinear parabolic PDEs. In this paper, we review these numerical and theoretical advances. In addition to algorithms based on stochastic reformulations of the original problem, such as the multilevel Picard iteration and the Deep BSDE method, we also discuss algorithms based on the more traditional Ritz, Galerkin, and least square formulations. We hope to demonstrate to the reader that studying PDEs as well as control and variational problems in very high dimensions might very well be among the most promising new directions in mathematics and scientific computing in the near future.