arXiv subjects

Othmane Mounjid

Publications and source records attributed to Othmane Mounjid.

7 recordsLinked to original sources

arXiv2021

Convergence of GANs Training: A Game and Stochastic Control Methodology

Training generative adversarial networks (GANs) is known to be difficult, especially for financial time series. This paper first analyzes the well-posedness problem in GANs minimax games and the convexity issue in GANs objective functions. It then proposes a stochastic control framework for hyper-parameters tuning in GANs training. The weak form of dynamic programming principle and the uniqueness and the existence of the value function in the viscosity sense for the corresponding minimax game are established. In particular, explicit forms for the optimal adaptive learning rate and batch size are derived and are shown to depend on the convexity of the objective function, revealing a relation between improper choices of learning rate and explosion in GANs training. Finally, empirical studies demonstrate that training algorithms incorporating this adaptive control approach outperform the standard ADAM method in terms of convergence and robustness. From GANs training perspective, the analysis in this paper provides analytical support for the popular practice of ``clipping'', and suggests that the convexity and well-posedness issues in GANs may be tackled through appropriate choices of hyper-parameters.

stat.ML↗

arXiv2021

Improving reinforcement learning algorithms: towards optimal learning rate policies

This paper investigates to what extent one can improve reinforcement learning algorithms. Our study is split in three parts. First, our analysis shows that the classical asymptotic convergence rate $O(1/\sqrt{N})$ is pessimistic and can be replaced by $O((\log(N)/N)^β)$ with $\frac{1}{2}\leq β\leq 1$ and $N$ the number of iterations. Second, we propose a dynamic optimal policy for the choice of the learning rate $(γ_k)_{k\geq 0}$ used in stochastic approximation (SA). We decompose our policy into two interacting levels: the inner and the outer level. In the inner level, we present the \nameref{Alg:v_4_s} algorithm (for "PAst Sign Search") which, based on a predefined sequence $(γ^o_k)_{k\geq 0}$, constructs a new sequence $(γ^i_k)_{k\geq 0}$ whose error decreases faster. In the outer level, we propose an optimal methodology for the selection of the predefined sequence $(γ^o_k)_{k\geq 0}$. Third, we show empirically that our selection methodology of the learning rate outperforms significantly standard algorithms used in reinforcement learning (RL) in the three following applications: the estimation of a drift, the optimal placement of limit orders and the optimal execution of large number of shares.

cs.LG↗

arXiv2019

From asymptotic properties of general point processes to the ranking of financial agents

We propose a general non-linear order book model that is built from the individual behaviours of the agents. Our framework encompasses Markovian and Hawkes based models. Under mild assumptions, we prove original results on the ergodicity and diffusivity of such system. Then we provide closed form formulas for various quantities of interest: stationary distribution of the best bid and ask quantities, spread, liquidity fluctuations and price volatility. These formulas are expressed in terms of individual order flows of market participants. Our approach enables us to establish a ranking methodology for the market makers with respect to the quality of their trading.

q-fin.ST↗

arXiv2018

Optimal inventory management and order book modeling

We model the behavior of three agent classes acting dynamically in a limit order book of a financial asset. Namely, we consider market makers (MM), high-frequency trading (HFT) firms, and institutional brokers (IB). Given a prior dynamic of the order book, similar to the one considered in the Queue-Reactive models [14, 20, 21], the MM and the HFT define their trading strategy by optimizing the expected utility of terminal wealth, while the IB has a prescheduled task to sell or buy many shares of the considered asset. We derive the variational partial differential equations that characterize the value functions of the MM and HFT and explain how almost optimal control can be deduced from them. We then provide a first illustration of the interactions that can take place between these different market participants by simulating the dynamic of an order book in which each of them plays his own (optimal) strategy.

q-fin.TR↗

arXiv2018

Limit Order Strategic Placement with Adverse Selection Risk and the Role of Latency

This paper is split in three parts: first we use labelled trade data to exhibit how market participants accept or not transactions via limit orders as a function of liquidity imbalance; then we develop a theoretical stochastic control framework to provide details on how one can exploit his knowledge on liquidity imbalance to control a limit order. We emphasis the exposure to adverse selection, of paramount importance for limit orders. For a participant buying using a limit order: if the price has chances to go down the probability to be filled is high but it is better to wait a little more before the trade to obtain a better price. In a third part we show how the added value of exploiting a knowledge on liquidity imbalance is eroded by latency: being able to predict future liquidity consuming flows is of less use if you have not enough time to cancel and reinsert your limit orders. There is thus a rational for market makers to be as fast as possible as a protection to adverse selection. Thanks to our optimal framework we can measure the added value of latency to limit orders placement. To authors' knowledge this paper is the first to make the connection between empirical evidences, a stochastic framework for limit orders including adverse selection, and the cost of latency. Our work is a first stone to shed light on the roles of latency and adverse selection for limit order placement, within an accurate stochastic control framework.

q-fin.TR↗

arXiv2018

Optimal liquidity-based trading tactics

We consider an agent who needs to buy (or sell) a relatively small amount of asset over some fixed short time interval. We work at the highest frequency meaning that we wish to find the optimal tactic to execute our quantity using limit orders, market orders and cancellations. To solve the agent's control problem, we build an order book model and optimize an expected utility function based on our price impact. We derive the equations satisfied by the optimal strategy and solve them numerically. Moreover, we show that our optimal tactic enables us to outperform significantly naive execution strategies.

q-fin.TR↗

arXiv2016

Elasticae and inradius

The elastic energy of a planar convex body is defined by $E(\Om)=\frac 12\,\int\_{\partial\Om} k^2(s)\,ds$where $k(s)$ is the curvature of the boundary. In this paper we are interested in the minimization problemof $E(\Om)$ with a constraint on the inradius of $\Om$. By contrast with all the other minimization problemsinvolving this elastic energy (with a perimeter, area, diameter or circumradius constraints) for which thesolution is always the disk, we prove here that the solution of this minimization problem is not the disk and we completely characterizeit in terms of elementary functions.

math.AP↗