VLDB 2026 Research / reviewers in the wild / expert
Alexander van Meegen
dblp:297/6231
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0003-2766-3982ORCID · verified
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 · 70% Optimization for machine learning · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
gradient flow |
0.9 | 1 | 2025 | Flat Channels to Infinity in Neural Loss Landscapes · NeurIPS 2025 |
Machine learning › Deep learning architectures and training
loss landscape |
0.9 | 1 | 2025 | Flat Channels to Infinity in Neural Loss Landscapes · NeurIPS 2025 |
Machine learning › Deep learning architectures and training › training dynamics
optimization dynamics |
0.9 | 1 | 2025 | Flat Channels to Infinity in Neural Loss Landscapes · NeurIPS 2025 |
Machine learning › Deep learning architectures and training
neural network expressivity |
0.3 | 1 | 2025 | Flat Channels to Infinity in Neural Loss Landscapes · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
gradient flow analysis · 0.9adam · 0.9SGD · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Flat Channels to Infinity in Neural Loss LandscapesabstractThe loss landscapes of neural networks contain minima and saddle points that may be connected in flat regions or appear in isolation. We identify and characterize a special structure in the loss landscape: channels along which the loss decreases extremely slowly, while the output weights of at least two neurons, $a_i$ and $a_j$, diverge to $\pm$infinity, and their input weight vectors, $\mathbf{w_i}$ and $\mathbf{w_j}$, become equal to each other. At convergence, the two neurons implement a gated linear unit: $a_i\sigma(\mathbf{w_i} \cdot \mathbf{x}) + a_j\sigma(\mathbf{w_j} \cdot \mathbf{x}) \rightarrow c \sigma(\mathbf{w} \cdot \mathbf{x}) + (\mathbf{v} \cdot \mathbf{x}) \sigma'(\mathbf{w} \cdot \mathbf{x})$. Geometrically, these channels to infinity are asymptotically parallel to symmetry-induced lines of critical points. Gradient flow solvers, and related optimization methods like SGD or ADAM, reach the channels with high probability in diverse regression settings, but without careful inspection they look like flat local minima with finite parameter values. Our characterization provides a comprehensive picture of this quasi-flat region in terms of gradient dynamics, geometry, and functional interpretation. The emergence of gated linear units at the end of the channels highlights a surprising aspect of the computational capabilities of fully connected layers. Flavio Martinelli, Alexander van Meegen, Berfin Simsek, Wulfram Gerstner, Johanni Brea |
NeurIPS | 2 |