Demo Data from SIGIR 2026 / reviewers in the wild / expert
Sebastian Moraga Scheuermann
dblp:281/6914 · also Sebastian Moraga
· DBLP profile ↗
3ranked-venue papers
0as first author
3since 2021 · last 2025
0000-0001-9886-5712ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Theory of computation · 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
1 paper |
Deep learning architectures and training · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
operator learning |
0.8 | 1 | 2024 | Optimal deep learning of holomorphic operators between Banach spaces · NeurIPS 2024 |
Computational science and engineering
partial differential equations |
0.2 | 1 | 2024 | Optimal deep learning of holomorphic operators between Banach spaces · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
feedforward neural network · 1.5generalization bounds · 0.8generalization bound · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples
Ben Adcock, Nick C. Dexter, Sebastian Moraga Scheuermann |
J. Complex. | 3 |
| 2025 | Near-optimal learning of Banach-valued, high-dimensional functions via deep neural networks
Ben Adcock, Simone Brugiapaglia, Nick C. Dexter, Sebastian Moraga Scheuermann |
Neural Networks | 4 |
| 2024 | Optimal deep learning of holomorphic operators between Banach spacesabstractOperator learning problems arise in many key areas of scientific computing where Partial Differential Equations (PDEs) are used to model physical systems. In such scenarios, the operators map between Banach or Hilbert spaces. In this work, we tackle the problem of learning operators between Banach spaces, in contrast to the vast majority of past works considering only Hilbert spaces. We focus on learning holomorphic operators -- an important class of problems with many applications. We combine arbitrary approximate encoders and decoders with standard feedforward Deep Neural Network (DNN) architectures -- specifically, those with constant width exceeding the depth -- under standard $\ell^2$-loss minimization. We first identify a family of DNNs such that the resulting Deep Learning (DL) procedure achieves optimal generalization bounds for such operators. For standard fully-connected architectures, we then show that there are uncountably many minimizers of the training problem that yield equivalent optimal performance. The DNN architectures we consider are `problem agnostic', with width and depth only depending on the amount of training data $m$ and not on regularity assumptions of the target operator. Next, we show that DL is optimal for this problem: no recovery procedure can surpass these generalization bounds up to log terms. Finally, we present numerical results demonstrating the practical performance on challenging problems including the parametric diffusion, Navier-Stokes-Brinkman and Boussinesq PDEs. Ben Adcock, Nick C. Dexter, Sebastian Moraga Scheuermann |
NeurIPS | 3 |