Portrait de Ivan Anokhin n'est pas disponible

Ivan Anokhin

ivan.anokhin@mila.quebec
Doctorat - UdeM
Superviseur⋅e principal⋅e
Irina Rish
Co-supervisor
Samira Ebrahimi Kahou
Sujets de recherche
Apprentissage par renforcement
Google Scholar
GitHub

Publications

Learning From the Past with Cascading Eligibility Traces
Tokiniaina Raharison Ralambomihanta
Ivan Anokhin
Roman Pogodin
Samira Ebrahimi Kahou
Jonathan Cornford
Blake A. Richards
2026-12-30
OpenReview (publié)
doi.org
openreview.net
Temporal Recurrence Favors Fewer Layers
Ivan Anokhin
Johan Obando-Ceron
Irina Rish
Sebastian Risi
In streaming tasks, recurrent models can carry latent computation across time, allowing each update to build on representations produced ear… (voir plus)lier. This raises a basic question: once temporal recurrence provides sequential computation across steps, how much depth is still needed within each step? Prior work has shown that recurrence can make shallow models competitive. We instead study this question as a compute-allocation problem, varying within-step depth, expert width, and the number of parallel experts per layer across several compute budgets. For each budget, we compare the best observed recurrent and non-recurrent allocations and the performance they achieve under approximately matched per-step computation. Across Sokoban and autoregressive FineWeb language modeling, we find that temporal recurrence shifts the best observed compute allocation toward substantially fewer layers, with comparable or better performance.
2026-09-10
arXiv (prépublication)
doi.org
arxiv.org
AIF-GEN: Open-Source Platform and Synthetic Dataset Suite for Reinforcement Learning on Large Language Models
Jacob Chmura
Shahrad Mohammadzadeh
Ivan Anokhin
Jacob-Junqi Tian
Mandana Samiei
Taz Scott-Talib
Irina Rish
Doina Precup
Reihaneh Rabbany
Nishanth Anand
2026-03-01
LLA @ International Conference on Learning Representations (poster)
openreview.net
openreview.net
Handling Delay in Reinforcement Learning Caused by Parallel Computations of Neurons
Ivan Anokhin
Rishav
Stephen Chung
Irina Rish
S Ebrahimi Kahou
Biological neural networks operate in parallel, a feature that sets them apart from artificial neural networks and can significantly enhance… (voir plus) inference speed. However, this parallelism introduces challenges: when each neuron operates asynchronously with a fixed execution time, an
2024-06-18
ICML.cc/2024/Workshop/ARLET (poster)
openreview.net
openreview.net
Thinker: Learning to Plan and Act
Stephen Chung
Ivan Anokhin
David Krueger
We propose the Thinker algorithm, a novel approach that enables reinforcement learning agents to autonomously interact with and utilize a le… (voir plus)arned world model. The Thinker algorithm wraps the environment with a world model and introduces new actions designed for interacting with the world model. These model-interaction actions enable agents to perform planning by proposing alternative plans to the world model before selecting a final action to execute in the environment. This approach eliminates the need for handcrafted planning algorithms by enabling the agent to learn how to plan autonomously and allows for easy interpretation of the agent's plan with visualization. We demonstrate the algorithm's effectiveness through experimental results in the game of Sokoban and the Atari 2600 benchmark, where the Thinker algorithm achieves state-of-the-art performance and competitive results, respectively. Visualizations of agents trained with the Thinker algorithm demonstrate that they have learned to plan effectively with the world model to select better actions. Thinker is the first work showing that an RL agent can learn to plan with a learned world model in complex environments.
2023-12-11
Conference on Neural Information Processing Systems (Accept (poster))
doi.org
openreview.net