Is Standard Deviation the New Standard? Revisiting the Critic in Deep Policy Gradients. - Yannis Flet-Berliac; Reda Ouhamma; Odalric-Ambrym Maillard; Philippe Preux (CoRR, 2020)

Learning Value Functions in Deep Policy Gradients using Residual Variance. - Yannis Flet-Berliac; Reda Ouhamma; Odalric-Ambrym Maillard; Philippe Preux (ICLR, 2021)

Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. - Reda Ouhamma; Odalric-Ambrym Maillard; Vianney Perchet (NeurIPS, 2021)

Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge. - Reda Ouhamma; Odalric-Ambrym Maillard; Vianney Perchet (NeurIPS, 2021)

Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. - Reda Ouhamma; Rémy Degenne; Pierre Gaillard; Vianney Perchet (CoRR, 2021)

Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration and Planning. - Reda Ouhamma; Debabrota Basu; Odalric-Ambrym Maillard (CoRR, 2022)

Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration & Planning. - Reda Ouhamma; Debabrota Basu; Odalric Maillard (AAAI, 2023)

Learning Nash Equilibria in Zero-Sum Markov Games: A Single Time-scale Algorithm Under Weak Reachability. - Reda Ouhamma; Maryam Kamgarpour (CoRR, 2023)

Toward realistic reinforcement learning. (Apprentissage par renforcement réaliste). - Reda Ouhamma (2023)

Finite-time convergence to an ε-efficient Nash equilibrium in potential games. - Anna M. Maddux; Reda Ouhamma; Maryam Kamgarpour (CoRR, 2024)

Nash equilibria in scalar discrete-time linear quadratic games. - Giulio Salizzoni; Reda Ouhamma; Maryam Kamgarpour (CoRR, 2024)

Efficient Preference-Based Reinforcement Learning: Randomized Exploration Meets Experimental Design. - Andreas Schlaginhaufen; Reda Ouhamma; Maryam Kamgarpour (CoRR, 2025)