Andrew Papanicolaou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Andrew Papanicolaou has a total of 64 co-authors. Here are the top co-authors by number of shared publications:
- Roozbeh Rezaie
Department of Pediatrics, Division of Clinical Neurosciences, University of Tennessee Health Science Center, Memphis, TN, USA; Neuroscience Institute, Le Bonheur Children's Hospital, Memphis, TN, USA
6 shared publications - Stavros I. Dimitriadis
Department of Clinical Psychology and Psychobiology, Faculty of Psychology, University of Barcelona, Barcelona, Spain
6 shared publications - Panagiotis G. Simos
Medical School, University of Crete, Heraklion, Greece
5 shared publications - Farshad Khorrami
New York University
4 shared publications - George Zouridakis
Department of Engineering Technology, University of Houston, Sugar Land, TX 77479, USA
4 shared publications - Prashanth Krishnamurthy
New York University
4 shared publications
Latest Publications
- Open Access
An Optimal Control Strategy for Execution of Large Stock Orders Using LSTMs
In this paper, we simulate the execution of a large stock order with real data and general power law in the Almgren and Chriss model. The example that we consider is the liquidation of a large position executed over the course of a single trading day in a limit order book. Transaction costs are incurred because large orders walk the order book, that is, they consume order book liquidity beyond the best bid/ask. We model the order book with a power law that is proportional to trading volume, and thus transaction costs are inversely proportional to a power of trading volume. We obtain a policy approximation by training a long short term memory (LSTM) neural network to minimize transaction costs accumulated when execution is carried out as a sequence of smaller suborders. Using historical S&P100 price and volume data, we evaluate our LSTM strategy relative to strategies based on time-weighted average price (TWAP) and volume-weighted average price (VWAP). For execution of a single stock, the input to the LSTM is the cross section of data on all 100 stocks, including prices, volumes, TWAPs and VWAPs. By using this data cross section, the LSTM should be able to exploit inter-stock co-dependence in volume and price movements, thereby reducing transaction costs for the day. Our tests on S&P100 data demonstrate that in fact this is so, as our LSTM strategy consistently outperforms TWAP and VWAP-based strategies.
Open AccessAn Optimal Control Strategy for Execution of Large Stock Orders Using LSTMs
In this paper, we simulate the execution of a large stock order with real data and general power law in the Almgren and Chriss model. The example that we consider is the liquidation of a large position executed over the course of a single trading day in a limit order book. Transaction costs are incurred because large orders walk the order book, that is, they consume order book liquidity beyond the best bid/ask. We model the order book with a power law that is proportional to trading volume, and thus transaction costs are inversely proportional to a power of trading volume. We obtain a policy approximation by training a long short term memory (LSTM) neural network to minimize transaction costs accumulated when execution is carried out as a sequence of smaller suborders. Using historical S&P100 price and volume data, we evaluate our LSTM strategy relative to strategies based on time-weighted average price (TWAP) and volume-weighted average price (VWAP). For execution of a single stock, the input to the LSTM is the cross section of data on all 100 stocks, including prices, volumes, TWAPs and VWAPs. By using this data cross section, the LSTM should be able to exploit inter-stock co-dependence in volume and price movements, thereby reducing transaction costs for the day. Our tests on S&P100 data demonstrate that in fact this is so, as our LSTM strategy consistently outperforms TWAP and VWAP-based strategies.
- Open Access
State Constrained Stochastic Optimal Control for Continuous and Hybrid Dynamical Systems Using DFBSDE
We develop a computationally efficient learning-based forward-backward stochastic differential equations (FBSDE) controller for both continuous and hybrid dynamical (HD) systems subject to stochastic noise and state constraints. Solutions to stochastic optimal control (SOC) problems satisfy the Hamilton-Jacobi-Bellman (HJB) equation. Using current FBSDE-based solutions, the optimal control can be obtained from the HJB equations using deep neural networks (e.g., long short-term memory (LSTM) networks). To ensure the learned controller respects the constraint boundaries, we enforce the state constraints using a soft penalty function. In addition to previous works, we adapt the deep FBSDE (DFBSDE) control framework to handle HD systems consisting of continuous dynamics and a deterministic discrete state change. We demonstrate our proposed algorithm in simulation on a continuous nonlinear system (cart-pole) and a hybrid nonlinear system (five-link biped).
Open AccessState Constrained Stochastic Optimal Control for Continuous and Hybrid Dynamical Systems Using DFBSDE
We develop a computationally efficient learning-based forward-backward stochastic differential equations (FBSDE) controller for both continuous and hybrid dynamical (HD) systems subject to stochastic noise and state constraints. Solutions to stochastic optimal control (SOC) problems satisfy the Hamilton-Jacobi-Bellman (HJB) equation. Using current FBSDE-based solutions, the optimal control can be obtained from the HJB equations using deep neural networks (e.g., long short-term memory (LSTM) networks). To ensure the learned controller respects the constraint boundaries, we enforce the state constraints using a soft penalty function. In addition to previous works, we adapt the deep FBSDE (DFBSDE) control framework to handle HD systems consisting of continuous dynamics and a deterministic discrete state change. We demonstrate our proposed algorithm in simulation on a continuous nonlinear system (cart-pole) and a hybrid nonlinear system (five-link biped).
- Open Access
Singular Perturbation Expansion for Utility Maximization with Order-$ε$ Quadratic Transaction Costs
We present an expansion for portfolio optimization in the presence of small, instantaneous, quadratic transaction costs. Specifically, the magnitude of transaction costs has a coefficient that is of the order $\epsilon$ small, which leads to the optimization problem having an asymptotically-singular Hamilton-Jacobi-Bellman equation whose solution can be expanded in powers of $\sqrt\epsilon$. In this paper we derive explicit formulae for the first two terms of this expansion. Analysis and simulation are provided to show the behavior of this approximating solution.Open AccessSingular Perturbation Expansion for Utility Maximization with Order-$ε$ Quadratic Transaction Costs
We present an expansion for portfolio optimization in the presence of small, instantaneous, quadratic transaction costs. Specifically, the magnitude of transaction costs has a coefficient that is of the order $\epsilon$ small, which leads to the optimization problem having an asymptotically-singular Hamilton-Jacobi-Bellman equation whose solution can be expanded in powers of $\sqrt\epsilon$. In this paper we derive explicit formulae for the first two terms of this expansion. Analysis and simulation are provided to show the behavior of this approximating solution. - Open Access
Partial-Information Q-Learning for General Two-Player Stochastic Games
In this article we analyze a partial-information Nash Q-learning algorithm for a general 2-player stochastic game. Partial information refers to the setting where a player does not know the strategy or the actions taken by the opposing player. We prove convergence of this partially informed algorithm for general 2-player games with finitely many states and actions, and we confirm that the limiting strategy is in fact a full-information Nash equilibrium. In implementation, partial information offers simplicity because it avoids computation of Nash equilibria at every time step. In contrast, full-information Q-learning uses the Lemke-Howson algorithm to compute Nash equilibria at every time step, which can be an effective approach but requires several assumptions to prove convergence and may have runtime error if Lemke-Howson encounters degeneracy. In simulations, the partial information results we obtain are comparable to those for full-information Q-learning and fictitious play.
Open AccessPartial-Information Q-Learning for General Two-Player Stochastic Games
In this article we analyze a partial-information Nash Q-learning algorithm for a general 2-player stochastic game. Partial information refers to the setting where a player does not know the strategy or the actions taken by the opposing player. We prove convergence of this partially informed algorithm for general 2-player games with finitely many states and actions, and we confirm that the limiting strategy is in fact a full-information Nash equilibrium. In implementation, partial information offers simplicity because it avoids computation of Nash equilibria at every time step. In contrast, full-information Q-learning uses the Lemke-Howson algorithm to compute Nash equilibria at every time step, which can be an effective approach but requires several assumptions to prove convergence and may have runtime error if Lemke-Howson encounters degeneracy. In simulations, the partial information results we obtain are comparable to those for full-information Q-learning and fictitious play.
- Open Access
A Deep Neural Network Algorithm for Linear-Quadratic Portfolio Optimization with MGARCH and Small Transaction Costs
We analyze a fixed-point algorithm for reinforcement learning (RL) of optimal portfolio mean-variance preferences in the setting of multivariate generalized autoregressive conditional-heteroskedasticity (MGARCH) with a small penalty on trading. A numerical solution is obtained using a neural network (NN) architecture within a recursive RL loop. A fixed-point theorem proves that NN approximation error has a big-oh bound that we can reduce by increasing the number of NN parameters. The functional form of the trading penalty has a parameter $ε>0$ that controls the magnitude of transaction costs. When $ε$ is small, we can implement an NN algorithm based on the expansion of the solution in powers of $ε$. This expansion has a base term equal to a myopic solution with an explicit form, and a first-order correction term that we compute in the RL loop. Our expansion-based algorithm is stable, allows for fast computation, and outputs a solution that shows positive testing performance.Open AccessA Deep Neural Network Algorithm for Linear-Quadratic Portfolio Optimization with MGARCH and Small Transaction Costs
We analyze a fixed-point algorithm for reinforcement learning (RL) of optimal portfolio mean-variance preferences in the setting of multivariate generalized autoregressive conditional-heteroskedasticity (MGARCH) with a small penalty on trading. A numerical solution is obtained using a neural network (NN) architecture within a recursive RL loop. A fixed-point theorem proves that NN approximation error has a big-oh bound that we can reduce by increasing the number of NN parameters. The functional form of the trading penalty has a parameter $ε>0$ that controls the magnitude of transaction costs. When $ε$ is small, we can implement an NN algorithm based on the expansion of the solution in powers of $ε$. This expansion has a base term equal to a myopic solution with an explicit form, and a first-order correction term that we compute in the RL loop. Our expansion-based algorithm is stable, allows for fast computation, and outputs a solution that shows positive testing performance. - Open Access
- 14 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 16774-16792
A Deep Neural Network Algorithm for Linear-Quadratic Portfolio Optimization With MGARCH and Small Transaction Costs
We analyze a fixed-point algorithm for reinforcement learning (RL) of optimal portfolio mean-variance preferences in the setting of multivariate generalized autoregressive conditional-heteroskedasticity (MGARCH) with a small penalty on trading. A numerical solution is obtained using a neural network (NN) architecture within a recursive RL loop. A fixed-point theorem proves that NN approximation error has a big-oh bound that we can reduce by increasing the number of NN parameters. The functional form of the trading penalty has a parameter ϵ > 0 that controls the magnitude of transaction costs. When ϵ is small, we can implement an NN algorithm based on the expansion of the solution in powers of ϵ. This expansion has a base term equal to a myopic solution with an explicit form, and a first-order correction term that we compute in the RL loop. Our expansion-based algorithm is stable, allows for fast computation, and outputs a solution that shows positive testing performance.
- 14 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 16774-16792
Open AccessA Deep Neural Network Algorithm for Linear-Quadratic Portfolio Optimization With MGARCH and Small Transaction Costs
We analyze a fixed-point algorithm for reinforcement learning (RL) of optimal portfolio mean-variance preferences in the setting of multivariate generalized autoregressive conditional-heteroskedasticity (MGARCH) with a small penalty on trading. A numerical solution is obtained using a neural network (NN) architecture within a recursive RL loop. A fixed-point theorem proves that NN approximation error has a big-oh bound that we can reduce by increasing the number of NN parameters. The functional form of the trading penalty has a parameter ϵ > 0 that controls the magnitude of transaction costs. When ϵ is small, we can implement an NN algorithm based on the expansion of the solution in powers of ϵ. This expansion has a base term equal to a myopic solution with an explicit form, and a first-order correction term that we compute in the RL loop. Our expansion-based algorithm is stable, allows for fast computation, and outputs a solution that shows positive testing performance.
- 7 June 2022
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 86 (1) , 1-38
Statistical Arbitrage for Multiple Co-integrated Stocks
In this article, we analyse optimal statistical arbitrage strategies from stochastic control and optimisation problems for multiple co-integrated stocks with eigenportfolios being factors. Optimal portfolio weights are found by solving a Hamilton–Jacobi–Bellman (HJB) partial differential equation, which we solve for both an unconstrained portfolio and a portfolio constrained to be market neutral. Our analyses demonstrate sufficient conditions on the model parameters to ensure long-term stability of the HJB solutions and stable growth rates for the optimal portfolios. To gauge how these optimal portfolios behave in practice, we perform backtests on historical stock prices of the S&P 500 constituents from year 2000 through year 2021. These backtests suggest three key conclusions: that the proposed co-integrated model with eigenportfolios being factors can generate a large number of co-integrated stocks over a long time horizon, that the optimal portfolios are sensitive to parameter estimation, and that the statistical arbitrage strategies are more profitable in periods when overall market volatilities are high.
- 7 June 2022
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 86 (1) , 1-38
Statistical Arbitrage for Multiple Co-integrated Stocks
In this article, we analyse optimal statistical arbitrage strategies from stochastic control and optimisation problems for multiple co-integrated stocks with eigenportfolios being factors. Optimal portfolio weights are found by solving a Hamilton–Jacobi–Bellman (HJB) partial differential equation, which we solve for both an unconstrained portfolio and a portfolio constrained to be market neutral. Our analyses demonstrate sufficient conditions on the model parameters to ensure long-term stability of the HJB solutions and stable growth rates for the optimal portfolios. To gauge how these optimal portfolios behave in practice, we perform backtests on historical stock prices of the S&P 500 constituents from year 2000 through year 2021. These backtests suggest three key conclusions: that the proposed co-integrated model with eigenportfolios being factors can generate a large number of co-integrated stocks over a long time horizon, that the optimal portfolios are sensitive to parameter estimation, and that the statistical arbitrage strategies are more profitable in periods when overall market volatilities are high.
- Open Access
- 14 May 2022
- Published by Wiley in Mathematical Finance
- Vol. 32 (3) , 907-940
Consistent time‐homogeneous modeling of SPX and VIX derivatives
This paper shows how to recover a stochastic volatility model (SVM) from a market model of the VIX futures term structure. Market models have more flexibility for fitting of curves than do SVMs, and therefore are better suited for pricing VIX futures and VIX derivatives. But the VIX itself is a derivative of the S&P500 (SPX) and it is common practice to price SPX derivatives using an SVM. Therefore, consistent modeling for both SPX and VIX should involve an SVM that can be obtained by inverting the market model. This paper's main result is a method for the recovery of a stochastic volatility function by solving an inverse problem where the input is the VIX function given by a market model. Analysis will show conditions necessary for there to be a unique solution to this inverse problem. The models are consistent if the recovered volatility function is non‐negative. Examples are presented to illustrate the theory, to highlight the issue of negativity in solutions, and to show the potential for inconsistency in non‐Markov settings.
- 14 May 2022
- Published by Wiley in Mathematical Finance
- Vol. 32 (3) , 907-940
Open AccessConsistent time‐homogeneous modeling of SPX and VIX derivatives
This paper shows how to recover a stochastic volatility model (SVM) from a market model of the VIX futures term structure. Market models have more flexibility for fitting of curves than do SVMs, and therefore are better suited for pricing VIX futures and VIX derivatives. But the VIX itself is a derivative of the S&P500 (SPX) and it is common practice to price SPX derivatives using an SVM. Therefore, consistent modeling for both SPX and VIX should involve an SVM that can be obtained by inverting the market model. This paper's main result is a method for the recovery of a stochastic volatility function by solving an inverse problem where the input is the VIX function given by a market model. Analysis will show conditions necessary for there to be a unique solution to this inverse problem. The models are consistent if the recovered volatility function is non‐negative. Examples are presented to illustrate the theory, to highlight the issue of negativity in solutions, and to show the potential for inconsistency in non‐Markov settings.
- Open Access
Consistent Time-Homogeneous Modeling of SPX and VIX Derivatives
This paper shows how to recover a stochastic volatility model (SVM) from a market model of the VIX futures term structure. Market models have more flexibility for fitting of curves than do SVMs, and therefore are better suited for pricing VIX futures and VIX derivatives. But the VIX itself is a derivative of the S&P500 (SPX) and it is common practice to price SPX derivatives using an SVM. Therefore, consistent modeling for both SPX and VIX should involve an SVM that can be obtained by inverting the market model. This paper's main result is a method for the recovery of a stochastic volatility function by solving an inverse problem where the input is the VIX function given by a market model. Analysis will show conditions necessary for there to be a unique solution to this inverse problem. The models are consistent if the recovered volatility function is non-negative. Examples are presented to illustrate the theory, to highlight the issue of negativity in solutions, and to show the potential for inconsistency in non-Markov settings.
Open AccessConsistent Time-Homogeneous Modeling of SPX and VIX Derivatives
This paper shows how to recover a stochastic volatility model (SVM) from a market model of the VIX futures term structure. Market models have more flexibility for fitting of curves than do SVMs, and therefore are better suited for pricing VIX futures and VIX derivatives. But the VIX itself is a derivative of the S&P500 (SPX) and it is common practice to price SPX derivatives using an SVM. Therefore, consistent modeling for both SPX and VIX should involve an SVM that can be obtained by inverting the market model. This paper's main result is a method for the recovery of a stochastic volatility function by solving an inverse problem where the input is the VIX function given by a market model. Analysis will show conditions necessary for there to be a unique solution to this inverse problem. The models are consistent if the recovered volatility function is non-negative. Examples are presented to illustrate the theory, to highlight the issue of negativity in solutions, and to show the potential for inconsistency in non-Markov settings.
- Open Access
Statistical Arbitrage for Multiple Co-Integrated Stocks
In this article, we analyse optimal statistical arbitrage strategies from stochastic control and optimisation problems for multiple co-integrated stocks with eigenportfolios being factors. Optimal portfolio weights are found by solving a Hamilton-Jacobi-Bellman (HJB) partial differential equation, which we solve for both an unconstrained portfolio and a portfolio constrained to be market neutral. Our analyses demonstrate sufficient conditions on the model parameters to ensure long-term stability of the HJB solutions and stable growth rates for the optimal portfolios. To gauge how these optimal portfolios behave in practice, we perform backtests on historical stock prices of the S&P 500 constituents from year 2000 through year 2021. These backtests suggest three key conclusions: that the proposed co-integrated model with eigenportfolios being factors can generate a large number of co-integrated stocks over a long time horizon, that the optimal portfolios are sensitive to parameter estimation, and that the statistical arbitrage strategies are more profitable in periods when overall market volatilities are high.
Open AccessStatistical Arbitrage for Multiple Co-Integrated Stocks
In this article, we analyse optimal statistical arbitrage strategies from stochastic control and optimisation problems for multiple co-integrated stocks with eigenportfolios being factors. Optimal portfolio weights are found by solving a Hamilton-Jacobi-Bellman (HJB) partial differential equation, which we solve for both an unconstrained portfolio and a portfolio constrained to be market neutral. Our analyses demonstrate sufficient conditions on the model parameters to ensure long-term stability of the HJB solutions and stable growth rates for the optimal portfolios. To gauge how these optimal portfolios behave in practice, we perform backtests on historical stock prices of the S&P 500 constituents from year 2000 through year 2021. These backtests suggest three key conclusions: that the proposed co-integrated model with eigenportfolios being factors can generate a large number of co-integrated stocks over a long time horizon, that the optimal portfolios are sensitive to parameter estimation, and that the statistical arbitrage strategies are more profitable in periods when overall market volatilities are high.