SearcharxivSearch

arXiv subjects

Azar Louzi

Publications and source records attributed to Azar Louzi.

4 recordsLinked to original sources

Stochastic Gradient Descent Revisited

Stochastic gradient descent (SGD) has been a go-to algorithm for nonconvex stochastic optimization problems arising in machine learning. Its theory however often requires a strong framework to guarantee convergence properties. We hereby present a full scope convergence study of biased nonconvex SGD, including weak convergence, function-value convergence and global convergence, and also provide subsequent convergence rates and complexities, all under relatively mild conditions in comparison with literature.

math.OC

Adaptive Multilevel Stochastic Approximation of the Value-at-Risk

Cr\'epey, Frikha, and Louzi (2025) introduced a multilevel stochastic approximation scheme to compute the value-at-risk of a financial loss that is only simulatable by Monte Carlo. The best complexity of the scheme is in O($\varepsilon^{-\frac52}$), $\varepsilon>0$ being a prescribed accuracy, which is suboptimal compared to the canonical multilevel Monte Carlo performance. This suboptimality stems from the discontinuity ofthe Heaviside function involved in the biased stochastic gradient that is recursively evaluated to derive the value-at-risk. To mitigate this issue, this paper proposes and analyzes a multilevel stochastic approximation algorithm that adaptively selects the number of inner samples at each level, and proves that its best complexity is in O($\varepsilon^{-2}|\ln{\varepsilon}|^\frac52$). Our theoretical analysis is exemplified through numerical experiments.

q-fin.RM

Asymptotic Error Analysis of Multilevel Stochastic Approximations for the Value-at-Risk and Expected Shortfall

Cr\'epey, Frikha, and Louzi (2025) introduced a nested stochastic approximation algorithm and its multilevel acceleration to compute the value-at-risk and expected shortfall of a random financial loss. We hereby establish central limit theorems for the renormalized estimation errors associated with both algorithms as well as their averaged versions. Our findings are substantiated through a numerical example.

q-fin.RM

A Multilevel Stochastic Approximation Algorithm for Value-at-Risk and Expected Shortfall Estimation

We propose a multilevel stochastic approximation (MLSA) scheme for the computation of the value-at-risk (VaR) and expected shortfall (ES) of a financial loss, which can only be computed via simulations conditionally on the realisation of future risk factors. Thus the problem of estimating its VaR and ES is nested in nature and can be viewed as an instance of stochastic approximation problems with biased innovations. In this framework, for a prescribed accuracy $\varepsilon$, the optimal complexity of a nested stochastic approximation algorithm is shown to be of the order $\varepsilon^{-3}$. To estimate the VaR, our MLSA algorithm attains an optimal complexity of the order $\varepsilon^{-2-\delta}$, where $\delta\in(0,1)$ is some parameter depending on the integrability degree of the loss, while to estimate the ES, the algorithm achieves an optimal complexity of the order $\varepsilon^{-2}|\ln{\varepsilon}|^2$. Numerical studies of the joint evolution of the error rate and the execution time demonstrate how our MLSA algorithm regains a significant amount of the performance lost due to the nested nature of the problem.

q-fin.CP