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

Nathan de Lara

dblp:228/8480 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
2 papers
Reinforcement learning · 75% Representation and self-supervised learning · 25%
Theoretical computer science
2 papers
Graph algorithms and graph theory · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › offline reinforcement learning
conservative q-learning
0.712023
Towards Safe Mechanical Ventilation Treatment Using Deep Offline Reinforcement Learning · AAAI 2023
Machine learning › Reinforcement learning
offline reinforcement learning
0.712023
Towards Safe Mechanical Ventilation Treatment Using Deep Offline Reinforcement Learning · AAAI 2023
Machine learning › Representation and self-supervised learning › representation learning › embedding learning › geometric embedding
spectral embedding
0.412020
Spectral Embedding of Regularized Block Models · ICLR 2020
Data mining › structured data mining
graph mining
0.412020
Scikit-network: Graph Analysis in Python · J. Mach. Learn. Res. 2020
Data mining › structured data mining › graph mining › graph learning
node classification
0.412020
Scikit-network: Graph Analysis in Python · J. Mach. Learn. Res. 2020
Graph algorithms and graph theory
graph embedding
0.412020
Scikit-network: Graph Analysis in Python · J. Mach. Learn. Res. 2020
Graph algorithms and graph theory
network analysis
0.412020
Scikit-network: Graph Analysis in Python · J. Mach. Learn. Res. 2020
Medical and health informatics
mechanical ventilation treatment
0.212023
Towards Safe Mechanical Ventilation Treatment Using Deep Offline Reinforcement Learning · AAAI 2023

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

reward shaping · 1.3sparse matrix-vector product · 0.9parallel processing · 0.9cython · 0.9fitted q-evaluation · 0.7fitted q evaluation · 0.7
YearPublicationVenuePosition
2025 STITCH-OPE: Trajectory Stitching with Guided Diffusion for Off-Policy Evaluation
abstract
Off-policy evaluation (OPE) estimates the performance of a target policy using offline data collected from a behavior policy, and is crucial in domains such as robotics or healthcare where direct interaction with the environment is costly or unsafe. Existing OPE methods are ineffective for high-dimensional, long-horizon problems, due to exponential blow-ups in variance from importance weighting or compounding errors from learned dynamics models. To address these challenges, we propose STITCH-OPE, a model-based generative framework that leverages denoising diffusion for long-horizon OPE in high-dimensional state and action spaces. Starting with a diffusion model pre-trained on the behavior data, STITCH-OPE generates synthetic trajectories from the target policy by guiding the denoising process using the score function of the target policy. STITCH-OPE proposes two technical innovations that make it advantageous for OPE: (1) prevents over-regularization by subtracting the score of the behavior policy during guidance, and (2) generates long-horizon trajectories by stitching partial trajectories together end-to-end. We provide a theoretical guarantee that under mild assumptions, these modifications result in an exponential reduction in variance versus long-horizon trajectory diffusion. Experiments on the D4RL and OpenAI Gym benchmarks show substantial improvement in mean squared error, correlation, and regret metrics compared to state-of-the-art OPE methods.
Hossein Goli, Michael Gimelfarb, Nathan de Lara, Haruki Nishimura, Masha Itkina, Florian Shkurti
NeurIPS3
2023 Towards Safe Mechanical Ventilation Treatment Using Deep Offline Reinforcement Learning
abstract
Mechanical ventilation is a key form of life support for patients with pulmonary impairment. Healthcare workers are required to continuously adjust ventilator settings for each patient, a challenging and time consuming task. Hence, it would be beneficial to develop an automated decision support tool to optimize ventilation treatment. We present DeepVent, a Conservative Q-Learning (CQL) based offline Deep Reinforcement Learning (DRL) agent that learns to predict the optimal ventilator parameters for a patient to promote 90 day survival. We design a clinically relevant intermediate reward that encourages continuous improvement of the patient vitals as well as addresses the challenge of sparse reward in RL. We find that DeepVent recommends ventilation parameters within safe ranges, as outlined in recent clinical trials. The CQL algorithm offers additional safety by mitigating the overestimation of the value estimates of out-of-distribution states/actions. We evaluate our agent using Fitted Q Evaluation (FQE) and demonstrate that it outperforms physicians from the MIMIC-III dataset.
Flemming Kondrup, Thomas Jiralerspong, Elaine Lau, Nathan de Lara, Jacob Shkrob, My Duc Tran, Doina Precup, Sumana Basu
AAAI4
2020 Spectral Embedding of Regularized Block Models
Nathan de Lara, Thomas Bonald
ICLR1
2020 Scikit-network: Graph Analysis in Python
abstract
Scikit-network is a Python package inspired by scikit-learn for the analysis of large graphs. Graphs are represented by their adjacency matrix in the sparse CSR format of SciPy. The package provides state-of-the-art algorithms for ranking, clustering, classifying, embedding and visualizing the nodes of a graph. High performance is achieved through a mix of fast matrix-vector products (using SciPy), compiled code (using Cython) and parallel processing. The package is distributed under the BSD license, with dependencies limited to NumPy and SciPy. It is compatible with Python 3.6 and newer. Source code, documentation and installation instructions are available online.
Thomas Bonald, Nathan de Lara, Quentin Lutz, Bertrand Charpentier
J. Mach. Learn. Res.2