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

Lise Le Boudec

dblp:349/2988 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
—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.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Computational science and engineering · 100%
Artificial intelligence
2 papers
Generative modeling · 62% Optimization for machine learning · 19% Language models and text generation · 19%

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

TopicWeightPapersLastEvidence papers
Computational science and engineering › scientific machine learning
neural operator
1.522025
ENMA: Tokenwise Autoregression for Continuous Neural PDE Operators · NeurIPS 2025
Operator Learning with Neural Fields: Tackling PDEs on General Geometries · NeurIPS 2023
Machine learning › Generative modeling
autoregressive model
0.912025
ENMA: Tokenwise Autoregression for Continuous Neural PDE Operators · NeurIPS 2025
Computational science and engineering › partial differential equations
parametric PDEs
0.912025
Learning a Neural Solver for Parametric PDEs to Enhance Physics-Informed Methods · ICLR 2025
Computational science and engineering › scientific machine learning
PDE operator learning
0.912025
ENMA: Tokenwise Autoregression for Continuous Neural PDE Operators · NeurIPS 2025
Computational science and engineering › scientific machine learning › physics-informed machine learning
physics-informed neural networks
0.912025
Learning a Neural Solver for Parametric PDEs to Enhance Physics-Informed Methods · ICLR 2025
Computational science and engineering › scientific machine learning › physics-informed machine learning › physics-informed neural networks
partial differential equation solving
0.712023
Operator Learning with Neural Fields: Tackling PDEs on General Geometries · NeurIPS 2023
Machine learning › Optimization for machine learning › gradient-based optimization
gradient descent
0.312025
Learning a Neural Solver for Parametric PDEs to Enhance Physics-Informed Methods · ICLR 2025
Natural language and speech › Language models and text generation
in-context learning
0.312025
ENMA: Tokenwise Autoregression for Continuous Neural PDE Operators · NeurIPS 2025

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

physics-informed learning · 1.7gradient descent · 1.7flow matching · 1.7convolutional encoder · 1.7attention mechanism · 1.7neural operator · 0.7neural field · 0.7coordinate-based network · 0.7
YearPublicationVenuePosition
2025 Learning a Neural Solver for Parametric PDEs to Enhance Physics-Informed Methods
abstract
Physics-informed deep learning often faces optimization challenges due to the complexity of solving partial differential equations (PDEs), which involve exploring large solution spaces, require numerous iterations, and can lead to unstable training. These challenges arise particularly from the ill-conditioning of the optimization problem, caused by the differential terms in the loss function. To address these issues, we propose learning a solver, i.e., solving PDEs using a physics-informed iterative algorithm trained on data. Our method learns to condition a gradient descent algorithm that automatically adapts to each PDE instance, significantly accelerating and stabilizing the optimization process and enabling faster convergence of physics-aware models. Furthermore, while traditional physics-informed methods solve for a single PDE instance, our approach addresses parametric PDEs. Specifically, our method integrates the physical loss gradient with the PDE parameters to solve over a distribution of PDE parameters, including coefficients, initial conditions, or boundary conditions. We demonstrate the effectiveness of our method through empirical experiments on multiple datasets, comparing training and test-time optimization performance.
Lise Le Boudec, Emmanuel de Bézenac, Louis Serrano, Ramon Daniel Regueiro-Espino, Patrick Gallinari
ICLR1
2025 ENMA: Tokenwise Autoregression for Continuous Neural PDE Operators
abstract
Solving time-dependent parametric partial differential equations (PDEs) remains a fundamental challenge for neural solvers, particularly when generalizing across a wide range of physical parameters and dynamics. When data is uncertain or incomplete—as is often the case—a natural approach is to turn to generative models. We introduce ENMA, a generative neural operator designed to model spatio-temporal dynamics arising from physical phenomena. ENMA predicts future dynamics in a compressed latent space using a generative masked autoregressive transformer trained with flow matching loss, enabling tokenwise generation. Irregularly sampled spatial observations are encoded into uniform latent representations via attention mechanisms and further compressed through a spatio-temporal convolutional encoder. This allows ENMA to perform in-context learning at inference time by conditioning on either past states of the target trajectory or auxiliary context trajectories with similar dynamics. The result is a robust and adaptable framework that generalizes to new PDE regimes and supports one-shot surrogate modeling of time-dependent parametric PDEs.
Armand Kassaï Koupaï, Lise Le Boudec, Louis Serrano, Patrick Gallinari
NeurIPS2
2023 Operator Learning with Neural Fields: Tackling PDEs on General Geometries
abstract
Machine learning approaches for solving partial differential equations require learning mappings between function spaces. While convolutional or graph neural networks are constrained to discretized functions, neural operators present a promising milestone toward mapping functions directly. Despite impressive results they still face challenges with respect to the domain geometry and typically rely on some form of discretization. In order to alleviate such limitations, we present CORAL, a new method that leverages coordinate-based networks for solving PDEs on general geometries. CORAL is designed to remove constraints on the input mesh, making it applicable to any spatial sampling and geometry. Its ability extends to diverse problem domains, including PDE solving, spatio-temporal forecasting, and inverse problems like geometric design. CORAL demonstrates robust performance across multiple resolutions and performs well in both convex and non-convex domains, surpassing or performing on par with state-of-the-art models.
Louis Serrano, Lise Le Boudec, Armand Kassaï Koupaï, Thomas X. Wang, Jean-Noël Vittaut, Patrick Gallinari
NeurIPS2