Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vincent Moens

dblp:220/5625 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
5since 2021 · last 2024
0000-0002-5810-086XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 1 first-author · 5 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Reinforcement learning · 36% Legged, aerial and field robots · 22% Motion planning and robot control · 21%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computing education · 100%

Topics — the 14 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
robot learning
1.022024
BricksRL: A Platform for Democratizing Robotics and Reinforcement Learning Research and Education with LEGO · NeurIPS 2024
RoboHive: A Unified Framework for Robot Learning · NeurIPS 2023
Robotics › Legged, aerial and field robots › legged robots
legged robot locomotion
0.922024
RoboHive: A Unified Framework for Robot Learning · NeurIPS 2023
BricksRL: A Platform for Democratizing Robotics and Reinforcement Learning Research and Education with LEGO · NeurIPS 2024
Machine learning › Reinforcement learning
multi-agent reinforcement learning
0.812024
BenchMARL: Benchmarking Multi-Agent Reinforcement Learning · J. Mach. Learn. Res. 2024
Robotics › Motion planning and robot control › robot learning › robotic reinforcement learning
reinforcement learning for manipulation
0.812024
BricksRL: A Platform for Democratizing Robotics and Reinforcement Learning Research and Education with LEGO · NeurIPS 2024
Machine learning › Reinforcement learning
reinforcement learning library
0.812024
TorchRL: A data-driven decision-making library for PyTorch · ICLR 2024
Robotics › Robot manipulation
dexterous manipulation
0.712023
RoboHive: A Unified Framework for Robot Learning · NeurIPS 2023
Robotics › Robot manipulation
grasping
0.712023
RoboHive: A Unified Framework for Robot Learning · NeurIPS 2023
Robotics › Legged, aerial and field robots › legged robots › legged robot locomotion
quadruped locomotion
0.712023
RoboHive: A Unified Framework for Robot Learning · NeurIPS 2023
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.522023
The Hierarchical Adaptive Forgetting Variational Filter · ICML 2018
RoboHive: A Unified Framework for Robot Learning · NeurIPS 2023
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.312018
The Hierarchical Adaptive Forgetting Variational Filter · ICML 2018
Robotics › Legged, aerial and field robots
legged robots
0.212024
BricksRL: A Platform for Democratizing Robotics and Reinforcement Learning Research and Education with LEGO · NeurIPS 2024
Computing education
robotics education
0.212024
BricksRL: A Platform for Democratizing Robotics and Reinforcement Learning Research and Education with LEGO · NeurIPS 2024
Machine learning › Reinforcement learning
imitation learning
0.212023
RoboHive: A Unified Framework for Robot Learning · NeurIPS 2023
Machine learning › Optimization for machine learning
stochastic gradient descent
0.112018
The Hierarchical Adaptive Forgetting Variational Filter · ICML 2018

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 2.2sim-to-real transfer · 1.5tensordict · 0.8imitation learning · 0.7variational update equations · 0.3exponential family · 0.3
YearPublicationVenuePosition
2024 TorchRL: A data-driven decision-making library for PyTorch
abstract
PyTorch has ascended as a premier machine learning framework, yet it lacks a native and comprehensive library for decision and control tasks suitable for large development teams dealing with complex real-world data and environments. To address this issue, we propose TorchRL, a generalistic control library for PyTorch that provides well-integrated, yet standalone components. We introduce a new and flexible PyTorch primitive, the TensorDict, which facilitates streamlined algorithm development across the many branches of Reinforcement Learning (RL) and control. We provide a detailed description of the building blocks and an extensive overview of the library across domains and tasks. Finally, we experimentally demonstrate its reliability and flexibility, and show comparative benchmarks to demonstrate its computational efficiency. TorchRL fosters long-term support and is publicly available on GitHub for greater reproducibility and collaboration within the research community. The code is open-sourced on GitHub.
Albert Bou, Matteo Bettini, Sebastian Dittert, Shagun Sodhani, Gianni De Fabritiis, Vincent Moens
ICLR8
2024 BricksRL: A Platform for Democratizing Robotics and Reinforcement Learning Research and Education with LEGO
abstract
We present BricksRL, a platform designed to democratize access to robotics for reinforcement learning research and education. BricksRL facilitates the creation, design, and training of custom LEGO robots in the real world by interfacing them with the TorchRL library for reinforcement learning agents. The integration of TorchRL with the LEGO hubs, via Bluetooth bidirectional communication, enables state-of-the-art reinforcement learning training on GPUs for a wide variety of LEGO builds. This offers a flexible and cost-efficient approach for scaling and also provides a robust infrastructure for robot-environment-algorithm communication. We present various experiments across tasks and robot configurations, providing built plans and training results. Furthermore, we demonstrate that inexpensive LEGO robots can be trained end-to-end in the real world to achieve simple tasks, with training times typically under 120 minutes on a normal laptop. Moreover, we show how users can extend the capabilities, exemplified by the successful integration of non-LEGO sensors. By enhancing accessibility to both robotics and reinforcement learning, BricksRL establishes a strong foundation for democratized robotic learning in research and educational settings.
Sebastian Dittert, Vincent Moens, Gianni De Fabritiis
NeurIPS2
2024 BenchMARL: Benchmarking Multi-Agent Reinforcement Learning
abstract
The field of Multi-Agent Reinforcement Learning (MARL) is currently facing a reproducibility crisis. While solutions for standardized reporting have been proposed to address the issue, we still lack a benchmarking tool that enables standardization and reproducibility, while leveraging cutting-edge Reinforcement Learning (RL) implementations. In this paper, we introduce BenchMARL, the first MARL training library created to enable standardized benchmarking across different algorithms, models, and environments. BenchMARL uses TorchRL as its backend, granting it high-performance and maintained state-of-the-art implementations while addressing the broad community of MARL PyTorch users. Its design enables systematic configuration and reporting, thus allowing users to create and run complex benchmarks from simple one-line inputs. BenchMARL is open-sourced on GitHub at https://github.com/facebookresearch/BenchMARL
Matteo Bettini, Amanda Prorok, Vincent Moens
J. Mach. Learn. Res.3
2023 RoboHive: A Unified Framework for Robot Learning
abstract
We present RoboHive, a comprehensive software platform and ecosystem for research in the field of Robot Learning and Embodied Artificial Intelligence. Our platform encompasses a diverse range of pre-existing and novel environments, including dexterous manipulation with the Shadow Hand, whole-arm manipulation tasks with Franka and Fetch robots, quadruped locomotion, among others. Included environments are organized within and cover multiple domains such as hand manipulation, locomotion, multi-task, multi-agent, muscles, etc. In comparison to prior works, RoboHive offers a streamlined and unified task interface taking dependency on only a minimal set of well-maintained packages, features tasks with high physics fidelity and rich visual diversity, and supports common hardware drivers for real-world deployment. The unified interface of RoboHive offers a convenient and accessible abstraction for algorithmic research in imitation, reinforcement, multi-task, and hierarchical learning. Furthermore, RoboHive includes expert demonstrations and baseline results for most environments, providing a standard for benchmarking and comparisons. Details: https://sites.google.com/view/robohive
Rutav M. Shah, Gaoyue Zhou, Vincent Moens, Vittorio Caggiano, Abhishek Gupta 0004, Aravind Rajeswaran
NeurIPS4
2022 SAMBA: safe model-based & active reinforcement learning
Alexander I. Cowen-Rivers, Daniel Palenicek, Vincent Moens, Mohammed Amin Abdullah 0001, Aivar Sootla, Jun Wang 0012, Haitham Bou-Ammar
Mach. Learn.3
2019 Learning and forgetting using reinforced Bayesian change detection
abstract
Agents living in volatile environments must be able to detect changes in contingencies while refraining to adapt to unexpected events that are caused by noise. In Reinforcement Learning (RL) frameworks, this requires learning rates that adapt to past reliability of the model. The observation that behavioural flexibility in animals tends to decrease following prolonged training in stable environment provides experimental evidence for such adaptive learning rates. However, in classical RL models, learning rate is either fixed or scheduled and can thus not adapt dynamically to environmental changes. Here, we propose a new Bayesian learning model, using variational inference, that achieves adaptive change detection by the use of Stabilized Forgetting, updating its current belief based on a mixture of fixed, initial priors and previous posterior beliefs. The weight given to these two sources is optimized alongside the other parameters, allowing the model to adapt dynamically to changes in environmental volatility and to unexpected observations. This approach is used to implement the "critic" of an actor-critic RL model, while the actor samples the resulting value distributions to choose which action to undertake. We show that our model can emulate different adaptation strategies to contingency changes, depending on its prior assumptions of environmental stability, and that model parameters can be fit to real data with high accuracy. The model also exhibits trade-offs between flexibility and computational costs that mirror those observed in real data. Overall, the proposed method provides a general framework to study learning flexibility and decision making in RL contexts.
Vincent Moens, Alexandre Zenon
PLoS Comput. Biol.1
2018 The Hierarchical Adaptive Forgetting Variational Filter
abstract
A common problem in Machine Learning and statistics consists in detecting whether the current sample in a stream of data belongs to the same distribution as previous ones, is an isolated outlier or inaugurates a new distribution of data. We present a hierarchical Bayesian algorithm that aims at learning a time-specific approximate posterior distribution of the parameters describing the distribution of the data observed. We derive the update equations of the variational parameters of the approximate posterior at each time step for models from the exponential family, and show that these updates find interesting correspondents in Reinforcement Learning (RL). In this perspective, our model can be seen as a hierarchical RL algorithm that learns a posterior distribution according to a certain stability confidence that is, in turn, learned according to its own stability confidence. Finally, we show some applications of our generic model, first in a RL context, next with an adaptive Bayesian Autoregressive model, and finally in the context of Stochastic Gradient Descent optimization.
Vincent Moens
ICML1