EDBT 2026 Demo / reviewers in the wild / expert
Adil Zouitine
dblp:281/6912
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021
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
3 papers |
Reinforcement learning · 71% Learning theory · 9% Time series and sequential data · 9% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › markov decision process
robust MDP |
0.8 | 1 | 2024 | Time-Constrained Robust MDPs · NeurIPS 2024 |
Machine learning › Reinforcement learning
robust reinforcement learning |
0.8 | 1 | 2024 | Time-Constrained Robust MDPs · NeurIPS 2024 |
Machine learning › Reinforcement learning › deep reinforcement learning › visual reinforcement learning
generalization in visual reinforcement learning |
0.6 | 1 | 2022 | Look where you look! Saliency-guided Q-networks for generalization in visual Reinforcement Learning · NeurIPS 2022 |
Machine learning › Reinforcement learning › value-based reinforcement learning
q-learning |
0.6 | 1 | 2022 | Look where you look! Saliency-guided Q-networks for generalization in visual Reinforcement Learning · NeurIPS 2022 |
Machine learning › Reinforcement learning
value-based reinforcement learning |
0.6 | 1 | 2022 | Look where you look! Saliency-guided Q-networks for generalization in visual Reinforcement Learning · NeurIPS 2022 |
Machine learning › Reinforcement learning › deep reinforcement learning
visual reinforcement learning |
0.6 | 1 | 2022 | Look where you look! Saliency-guided Q-networks for generalization in visual Reinforcement Learning · NeurIPS 2022 |
Machine learning › Learning paradigms
continual learning |
0.5 | 1 | 2021 | River: machine learning for streaming data in Python · J. Mach. Learn. Res. 2021 |
Machine learning › Learning theory
online learning |
0.5 | 1 | 2021 | River: machine learning for streaming data in Python · J. Mach. Learn. Res. 2021 |
Machine learning › Time series and sequential data
streaming data |
0.5 | 1 | 2021 | River: machine learning for streaming data in Python · J. Mach. Learn. Res. 2021 |
Machine learning › Reinforcement learning
continuous control |
0.2 | 1 | 2024 | Time-Constrained Robust MDPs · NeurIPS 2024 |
Machine learning › Trustworthy machine learning
interpretability |
0.2 | 1 | 2022 | Look where you look! Saliency-guided Q-networks for generalization in visual Reinforcement Learning · NeurIPS 2022 |
Methods — techniques the papers use, named apart from their topics
rectangularity relaxation · 0.8correlated disturbance modeling · 0.8soft actor-critic · 0.6saliency guidance · 0.6q-network · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Time-Constrained Robust MDPsabstractRobust reinforcement learning is essential for deploying reinforcement learning algorithms in real-world scenarios where environmental uncertainty predominates.
Traditional robust reinforcement learning often depends on rectangularity assumptions, where adverse probability measures of outcome states are assumed to be independent across different states and actions.
This assumption, rarely fulfilled in practice, leads to overly conservative policies.
To address this problem, we introduce a new time-constrained robust MDP (TC-RMDP) formulation that considers multifactorial, correlated, and time-dependent disturbances, thus more accurately reflecting real-world dynamics. This formulation goes beyond the conventional rectangularity paradigm, offering new perspectives and expanding the analytical framework for robust RL.
We propose three distinct algorithms, each using varying levels of environmental information, and evaluate them extensively on continuous control benchmarks.
Our results demonstrate that these algorithms yield an efficient tradeoff between performance and robustness, outperforming traditional deep robust RL methods in time-constrained environments while preserving robustness in classical benchmarks.
This study revisits the prevailing assumptions in robust RL and opens new avenues for developing more practical and realistic RL applications. Adil Zouitine, David Bertoin, Pierre Clavier, Matthieu Geist, Emmanuel Rachelson |
NeurIPS | 1 |
| 2022 | Look where you look! Saliency-guided Q-networks for generalization in visual Reinforcement LearningabstractDeep reinforcement learning policies, despite their outstanding efficiency in simulated visual control tasks, have shown disappointing ability to generalize across disturbances in the input training images. Changes in image statistics or distracting background elements are pitfalls that prevent generalization and real-world applicability of such control policies.We elaborate on the intuition that a good visual policy should be able to identify which pixels are important for its decision, and preserve this identification of important sources of information across images. This implies that training of a policy with small generalization gap should focus on such important pixels and ignore the others. This leads to the introduction of saliency-guided Q-networks (SGQN), a generic method for visual reinforcement learning, that is compatible with any value function learning method. SGQN vastly improves the generalization capability of Soft Actor-Critic agents and outperforms existing state-of-the-art methods on the Deepmind Control Generalization benchmark, setting a new reference in terms of training efficiency, generalization gap, and policy interpretability. David Bertoin, Adil Zouitine, Mehdi Zouitine, Emmanuel Rachelson |
NeurIPS | 2 |
| 2021 | River: machine learning for streaming data in PythonabstractRiver is a machine learning library for dynamic data streams and continual learning. It provides multiple state-of-the-art learning methods, data generators/transformers, performance metrics and evaluators for different stream learning problems. It is the result from the merger of two popular packages for stream learning in Python: Creme and scikit-multiflow. River introduces a revamped architecture based on the lessons learnt from the seminal packages. River's ambition is to be the go-to library for doing machine learning on streaming data. Additionally, this open source package brings under the same umbrella a large community of practitioners and researchers. The source code is available at https://github.com/online-ml/river. Jacob Montiel, Max Halford, Saulo Martiello Mastelini, Geoffrey Bolmier, Raphaël Sourty, Robin Vaysse, Adil Zouitine, Heitor Murilo Gomes, Jesse Read, Talel Abdessalem, Albert Bifet |
J. Mach. Learn. Res. | 7 |