activity
20242026
most citedTime-Constrained Robust MDPs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

6 papers

cs.CL2026

Soft-SVeRL: Self-Verified Reinforcement Learning with Soft Rewards

Saurabh Dash, Pierre Clavier, John Dang +4

Reinforcement Learning from Verifiable Rewards (RLVR) has improved language models in domains such as mathematics and code, where correctness can be checked automatically. However,…

cs.LG2025

ShiQ: Bringing back Bellman to LLMs

Pierre Clavier, Nathan Grinsztajn, Raphael Avalos +8

The fine-tuning of pre-trained large language models (LLMs) using reinforcement learning (RL) is generally formulated as direct policy optimization. This approach was naturally fav…

cs.CL2025

Command A: An Enterprise-Ready Large Language Model

Team Cohere, :, Aakanksha +227

In this report we describe the development of Command A, a powerful large language model purpose-built to excel at real-world enterprise use cases. Command A is an agent-optimised…

cs.LG2024

RRLS : Robust Reinforcement Learning Suite

Adil Zouitine, David Bertoin, Pierre Clavier +2

Robust reinforcement learning is the problem of learning control policies that provide optimal worst-case performance against a span of adversarial environments. It is a crucial in…

cs.LG2024★ 1 cited

Time-Constrained Robust MDPs

Adil Zouitine, David Bertoin, Pierre Clavier +2

Robust reinforcement learning is essential for deploying reinforcement learning algorithms in real-world scenarios where environmental uncertainty predominates. Traditional robust…

cs.LG2024

Bootstrapping Expectiles in Reinforcement Learning

Pierre Clavier, Emmanuel Rachelson, Erwan Le Pennec +1

Many classic Reinforcement Learning (RL) algorithms rely on a Bellman operator, which involves an expectation over the next states, leading to the concept of bootstrapping. To intr…