Demo Data from EDBT 2026 / reviewers in the wild / expert
Joseba Dalmau
dblp:181/9951
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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 · 33% Optimization for machine learning · 33% Reinforcement learning · 33% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
function approximation |
0.9 | 1 | 2025 | Deep Sturm-Liouville: From Sample-Based to 1D Regularization with Learnable Orthogonal Basis Functions · ICML 2025 |
Machine learning › Optimization for machine learning
implicit regularization |
0.9 | 1 | 2025 | Deep Sturm-Liouville: From Sample-Based to 1D Regularization with Learnable Orthogonal Basis Functions · ICML 2025 |
Machine learning › Deep learning architectures and training
regularization |
0.9 | 1 | 2025 | Deep Sturm-Liouville: From Sample-Based to 1D Regularization with Learnable Orthogonal Basis Functions · ICML 2025 |
Mathematical optimization › numerical analysis
eigenvalue problem |
0.3 | 1 | 2025 | Deep Sturm-Liouville: From Sample-Based to 1D Regularization with Learnable Orthogonal Basis Functions · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
sturm-liouville theory · 1.7stochastic gradient descent · 1.7implicit differentiation · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Deep Sturm-Liouville: From Sample-Based to 1D Regularization with Learnable Orthogonal Basis FunctionsabstractAlthough Artificial Neural Networks (ANNs) have achieved remarkable success across various tasks, they still suffer from limited generalization. We hypothesize that this limitation arises from the traditional sample-based (0--dimensionnal) regularization used in ANNs. To overcome this, we introduce Deep Sturm-Liouville (DSL), a novel function approximator that enables continuous 1D regularization along field lines in the input space by integrating the Sturm-Liouville Theorem (SLT) into the deep learning framework. DSL defines field lines traversing the input space, along which a Sturm-Liouville problem is solved to generate orthogonal basis functions, enforcing implicit regularization thanks to the desirable properties of SLT. These basis functions are linearly combined to construct the DSL approximator. Both the vector field and basis functions are parameterized by neural networks and learned jointly. We demonstrate that the DSL formulation naturally arises when solving a Rank-1 Parabolic Eigenvalue Problem. DSL is trained efficiently using stochastic gradient descent via implicit differentiation and achieves competitive performance on diverse multivariate datasets, including high-dimensional image datasets such as MNIST and CIFAR-10. David Vigouroux, Joseba Dalmau, Louis Béthune, Victor Boutin |
ICML | 2 |