arXiv subjects

Sophie Laruelle

Publications and source records attributed to Sophie Laruelle.

5 recordsLinked to original sources

arXiv2018

Nonlinear Randomized Urn Models: a Stochastic Approximation Viewpoint

This paper extends the link between stochastic approximation (SA) theory and randomized urn models developed in Laruelle, Pag{è}s (2013), and their applications to clinical trials introduced in Bai, HU (1999,2005) and Bai, Hu, Shen (2002). We no longer assume that the drawing rule is uniform among the balls of the urn (which contains d colors), but can be reinforced by a function f. This is a way to model risk aversion. Firstly, by considering that f is concave or convex and by reformulating the dynamics of the urn composition as an SA algorithm with remainder, we derive the a.s. convergence and the asymptotic normality (Central Limit Theorem, CLT) of the normalized procedure by calling upon the so-called ODE and SDE methods. An in-depth analysis of the case d=2 exhibits two different behaviors: A single equilibrium point when f is concave, and when f is convex, a transition phase from a single attracting equilibrium to a system with two attracting and one repulsive equilibrium points. The last setting is solved using results on non-convergence toward noisy and noiseless "traps" in order to deduce the a.s. convergence toward one of the attracting points. Secondly, the special case of a Polya urn (when the addition rule is the identity matrix) is analyzed, still using result from SA theory about "traps". Finally, these results are applied to a function with regular variation and to an optimal asset allocation in Finance.

math.PR↗

arXiv2017

Randomized Urn Models revisited using Stochastic Approximation

This paper presents the link between stochastic approximation and clinical trials based on randomized urn models investigated in Bai and Hu (1999,2005) and Bai, Hu and Shen (2002). We reformulate the dynamics of both the urn composition and the assigned treatments as standard stochastic approximation (SA) algorithms with remainder. Then, we derive the a.s. convergence and the asymptotic normality (CLT) of the normalized procedure under less stringent assumptions by calling upon the ODE and SDE methods. As a second step, we investigate a more involved family of models, known as multi-arm clinical trials, where the urn updating depends on the past performances of the treatments. By increasing the dimension of the state vector, our SA approach provides this time a new asymptotic normality result.

math.PR↗

arXiv2012

Stochastic Approximation with Averaging Innovation Applied to Finance

The aim of the paper is to establish a convergence theorem for multi-dimensional stochastic approximation when the "innovations" satisfy some "light" averaging properties in the presence of a pathwise Lyapunov function. These averaging assumptions allow us to unify apparently remote frameworks where the innovations are simulated (possibly deterministic like in Quasi-Monte Carlo simulation) or exogenous (like market data) with ergodic properties. We propose several fields of applications and illustrate our results on five examples mainly motivated by Finance.

math.PR↗

arXiv2012

Optimal posting price of limit orders: learning by trading

Considering that a trader or a trading algorithm interacting with markets during continuous auctions can be modeled by an iterating procedure adjusting the price at which he posts orders at a given rhythm, this paper proposes a procedure minimizing his costs. We prove the a.s. convergence of the algorithm under assumptions on the cost function and give some practical criteria on model parameters to ensure that the conditions to use the algorithm are fulfilled (using notably the co-monotony principle). We illustrate our results with numerical experiments on both simulated data and using a financial market dataset.

q-fin.TR↗

arXiv2010

Optimal split of orders across liquidity pools: a stochastic algorithm approach

Evolutions of the trading landscape lead to the capability to exchange the same financial instrument on different venues. Because of liquidity issues, the trading firms split large orders across several trading destinations to optimize their execution. To solve this problem we devised two stochastic recursive learning procedures which adjust the proportions of the order to be sent to the different venues, one based on an optimization principle, the other on some reinforcement ideas. Both procedures are investigated from a theoretical point of view: we prove a.s. convergence of the optimization algorithm under some light ergodic (or "averaging") assumption on the input data process. No Markov property is needed. When the inputs are i.i.d. we show that the convergence rate is ruled by a Central Limit Theorem. Finally, the mutual performances of both algorithms are compared on simulated and real data with respect to an "oracle" strategy devised by an "insider" who knows a priori the executed quantities by every venues.

q-fin.TR↗