VLDB 2026 Research / reviewers in the wild / expert
Manuel Brenner
dblp:323/8935
· DBLP profile ↗
7ranked-venue papers
4as first author
7since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 7 · 4 first-author · 7 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
7 papers |
Deep learning architectures and training · 52% Representation and self-supervised learning · 16% Efficient and distributed learning · 16% | |
| Interdisciplinary, comprehensive, and emerging computing
5 papers |
Computational science and engineering · 100% |
Topics — the 11 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational science and engineering › dynamical systems
dynamical systems reconstruction |
2.4 | 3 | 2025 | Learning Interpretable Hierarchical Dynamical Systems Models from Time Series Data · ICLR 2025 Almost-Linear RNNs Yield Highly Interpretable Symbolic Codes in Dynamical Systems Reconstruction · NeurIPS 2024 Out-of-Domain Generalization in Dynamical Systems Reconstruction · ICML 2024 |
Machine learning › Deep learning architectures and training
recurrent neural network |
2.1 | 3 | 2024 | Almost-Linear RNNs Yield Highly Interpretable Symbolic Codes in Dynamical Systems Reconstruction · NeurIPS 2024 Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction · ICML 2024 Tractable Dendritic RNNs for Reconstructing Nonlinear Dynamical Systems · ICML 2022 |
Computational science and engineering
dynamical systems |
1.5 | 2 | 2024 | Almost-Linear RNNs Yield Highly Interpretable Symbolic Codes in Dynamical Systems Reconstruction · NeurIPS 2024 Out-of-Domain Generalization in Dynamical Systems Reconstruction · ICML 2024 |
Computational science and engineering
time series analysis |
0.9 | 1 | 2025 | Learning Interpretable Hierarchical Dynamical Systems Models from Time Series Data · ICLR 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction · ICML 2024 |
Machine learning › Generative modeling › variational autoencoder
multimodal variational autoencoder |
0.8 | 1 | 2024 | Integrating Multimodal Data for Joint Generative Modeling of Complex Dynamics · ICML 2024 |
Machine learning › Efficient and distributed learning › model compression
pruning |
0.8 | 1 | 2024 | Optimal Recurrent Network Topologies for Dynamical Systems Reconstruction · ICML 2024 |
Machine learning › Deep learning architectures and training
scientific machine learning |
0.8 | 1 | 2024 | Out-of-Domain Generalization in Dynamical Systems Reconstruction · ICML 2024 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation
symbolic representation |
0.8 | 1 | 2024 | Almost-Linear RNNs Yield Highly Interpretable Symbolic Codes in Dynamical Systems Reconstruction · NeurIPS 2024 |
Machine learning › Deep learning architectures and training › recurrent neural network
recurrent neural network training |
0.7 | 1 | 2023 | Generalized Teacher Forcing for Learning Chaotic Dynamics · ICML 2023 |
Computational science and engineering › dynamical systems
nonlinear dynamics |
0.4 | 2 | 2024 | Integrating Multimodal Data for Joint Generative Modeling of Complex Dynamics · ICML 2024 Tractable Dendritic RNNs for Reconstructing Nonlinear Dynamical Systems · ICML 2022 |
Methods — techniques the papers use, named apart from their topics
transfer learning · 1.7hierarchical framework · 1.7topological analysis · 1.5teacher signal · 1.5multimodal variational autoencoder · 1.5latent dynamics space · 1.5ergodic theory · 1.5deep learning · 1.5piecewise-linear RNN · 1.2symbolic dynamics · 0.8piecewise linear system · 0.8geometric pruning · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Learning Interpretable Hierarchical Dynamical Systems Models from Time Series DataabstractIn science, we are often interested in obtaining a generative model of the underlying system dynamics from observed time series. While powerful methods for dynamical systems reconstruction (DSR) exist when data come from a single domain, how to best integrate data from multiple dynamical regimes and leverage it for generalization is still an open question. This becomes particularly important when individual time series are short, and group-level information may help to fill in for gaps in single-domain data. Here we introduce a hierarchical framework that enables to harvest group-level (multi-domain) information while retaining all single-domain characteristics, and showcase it on popular DSR benchmarks, as well as on neuroscience and medical data. In addition to faithful reconstruction of all individual dynamical regimes, our unsupervised methodology discovers common low-dimensional feature spaces in which datasets with similar dynamics cluster. The features spanning these spaces were further dynamically highly interpretable, surprisingly in often linear relation to control parameters that govern the dynamics of the underlying system. Finally, we illustrate transfer learning and generalization to new parameter regimes, paving the way toward DSR foundation models. Manuel Brenner, Elias Weber, Georgia Koppe, Daniel Durstewitz |
ICLR | 1 |
| 2024 | Integrating Multimodal Data for Joint Generative Modeling of Complex DynamicsabstractMany, if not most, systems of interest in science are naturally described as nonlinear dynamical systems. Empirically, we commonly access these systems through time series measurements. Often such time series may consist of discrete random variables rather than continuous measurements, or may be composed of measurements from multiple data modalities observed simultaneously. For instance, in neuroscience we may have behavioral labels in addition to spike counts and continuous physiological recordings. While by now there is a burgeoning literature on deep learning for dynamical systems reconstruction (DSR), multimodal data integration has hardly been considered in this context. Here we provide such an efficient and flexible algorithmic framework that rests on a multimodal variational autoencoder for generating a sparse teacher signal that guides training of a reconstruction model, exploiting recent advances in DSR training techniques. It enables to combine various sources of information for optimal reconstruction, even allows for reconstruction from symbolic data (class labels) alone, and connects different types of observations within a common latent dynamics space. In contrast to previous multimodal data integration techniques for scientific applications, our framework is fully generative, producing, after training, trajectories with the same geometrical and temporal structure as those of the ground truth system. Manuel Brenner, Florian Hess, Georgia Koppe, Daniel Durstewitz |
ICML | 1 |
| 2024 | Out-of-Domain Generalization in Dynamical Systems ReconstructionabstractIn science we are interested in finding the governing equations, the dynamical rules, underlying empirical phenomena. While traditionally scientific models are derived through cycles of human insight and experimentation, recently deep learning (DL) techniques have been advanced to reconstruct dynamical systems (DS) directly from time series data. State-of-the-art dynamical systems reconstruction (DSR) methods show promise in capturing invariant and long-term properties of observed DS, but their ability to generalize to unobserved domains remains an open challenge. Yet, this is a crucial property we would expect from any viable scientific theory. In this work, we provide a formal framework that addresses generalization in DSR. We explain why and how out-of-domain (OOD) generalization (OODG) in DSR profoundly differs from OODG considered elsewhere in machine learning. We introduce mathematical notions based on topological concepts and ergodic theory to formalize the idea of learnability of a DSR model. We formally prove that black-box DL techniques, without adequate structural priors, generally will not be able to learn a generalizing DSR model. We also show this empirically, considering major classes of DSR algorithms proposed so far, and illustrate where and why they fail to generalize across the whole phase space. Our study provides the first comprehensive mathematical treatment of OODG in DSR, and gives a deeper conceptual understanding of where the fundamental problems in OODG lie and how they could possibly be addressed in practice. Niclas Alexander Göring, Florian Hess, Manuel Brenner, Zahra Monfared, Daniel Durstewitz |
ICML | 3 |
| 2024 | Optimal Recurrent Network Topologies for Dynamical Systems ReconstructionabstractIn dynamical systems reconstruction (DSR) we seek to infer from time series measurements a generative model of the underlying dynamical process. This is a prime objective in any scientific discipline, where we are particularly interested in parsimonious models with a low parameter load. A common strategy here is parameter pruning, removing all parameters with small weights. However, here we find this strategy does not work for DSR, where even low magnitude parameters can contribute considerably to the system dynamics. On the other hand, it is well known that many natural systems which generate complex dynamics, like the brain or ecological networks, have a sparse topology with comparatively few links. Inspired by this, we show that *geometric pruning*, where in contrast to magnitude-based pruning weights with a low contribution to an attractor's geometrical structure are removed, indeed manages to reduce parameter load substantially without significantly hampering DSR quality. We further find that the networks resulting from geometric pruning have a specific type of topology, and that this topology, and not the magnitude of weights, is what is most crucial to performance. We provide an algorithm that automatically generates such topologies which can be used as priors for generative modeling of dynamical systems by RNNs, and compare it to other well studied topologies like small-world or scale-free networks. Christoph Jürgen Hemmer, Manuel Brenner, Florian Hess, Daniel Durstewitz |
ICML | 2 |
| 2024 | Almost-Linear RNNs Yield Highly Interpretable Symbolic Codes in Dynamical Systems ReconstructionabstractDynamical systems theory (DST) is fundamental for many areas of science and engineering. It can provide deep insights into the behavior of systems evolving in time, as typically described by differential or recursive equations. A common approach to facilitate mathematical tractability and interpretability of DS models involves decomposing nonlinear DS into multiple linear DS combined by switching manifolds, i.e. piecewise linear (PWL) systems. PWL models are popular in engineering and a frequent choice in mathematics for analyzing the topological properties of DS. However, hand-crafting such models is tedious and only possible for very low-dimensional scenarios, while inferring them from data usually gives rise to unnecessarily complex representations with very many linear subregions. Here we introduce Almost-Linear Recurrent Neural Networks (AL-RNNs) which automatically and robustly produce most parsimonious PWL representations of DS from time series data, using as few PWL nonlinearities as possible. AL-RNNs can be efficiently trained with any SOTA algorithm for dynamical systems reconstruction (DSR), and naturally give rise to a symbolic encoding of the underlying DS that provably preserves important topological properties. We show that for the Lorenz and Rössler systems, AL-RNNs derive, in a purely data-driven way, the known topologically minimal PWL representations of the corresponding chaotic attractors. We further illustrate on two challenging empirical datasets that interpretable symbolic encodings of the dynamics can be achieved, tremendously facilitating mathematical and computational analysis of the underlying systems. Manuel Brenner, Christoph Jürgen Hemmer, Zahra Monfared, Daniel Durstewitz |
NeurIPS | 1 |
| 2023 | Generalized Teacher Forcing for Learning Chaotic DynamicsabstractChaotic dynamical systems (DS) are ubiquitous in nature and society. Often we are interested in reconstructing such systems from observed time series for prediction or mechanistic insight, where by reconstruction we mean learning geometrical and invariant temporal properties of the system in question (like attractors). However, training reconstruction algorithms like recurrent neural networks (RNNs) on such systems by gradient-descent based techniques faces severe challenges. This is mainly due to exploding gradients caused by the exponential divergence of trajectories in chaotic systems. Moreover, for (scientific) interpretability we wish to have as low dimensional reconstructions as possible, preferably in a model which is mathematically tractable. Here we report that a surprisingly simple modification of teacher forcing leads to provably strictly all-time bounded gradients in training on chaotic systems, and, when paired with a simple architectural rearrangement of a tractable RNN design, piecewise-linear RNNs (PLRNNs), allows for faithful reconstruction in spaces of at most the dimensionality of the observed system. We show on several DS that with these amendments we can reconstruct DS better than current SOTA algorithms, in much lower dimensions. Performance differences were particularly compelling on real world data with which most other methods severely struggled. This work thus led to a simple yet powerful DS reconstruction algorithm which is highly interpretable at the same time. Florian Hess, Zahra Monfared, Manuel Brenner, Daniel Durstewitz |
ICML | 3 |
| 2022 | Tractable Dendritic RNNs for Reconstructing Nonlinear Dynamical SystemsabstractIn many scientific disciplines, we are interested in inferring the nonlinear dynamical system underlying a set of observed time series, a challenging task in the face of chaotic behavior and noise. Previous deep learning approaches toward this goal often suffered from a lack of interpretability and tractability. In particular, the high-dimensional latent spaces often required for a faithful embedding, even when the underlying dynamics lives on a lower-dimensional manifold, can hamper theoretical analysis. Motivated by the emerging principles of dendritic computation, we augment a dynamically interpretable and mathematically tractable piecewise-linear (PL) recurrent neural network (RNN) by a linear spline basis expansion. We show that this approach retains all the theoretically appealing properties of the simple PLRNN, yet boosts its capacity for approximating arbitrary nonlinear dynamical systems in comparatively low dimensions. We employ two frameworks for training the system, one combining BPTT with teacher forcing, and another based on fast and scalable variational inference. We show that the dendritically expanded PLRNN achieves better reconstructions with fewer parameters and dimensions on various dynamical systems benchmarks and compares favorably to other methods, while retaining a tractable and interpretable structure. Manuel Brenner, Florian Hess, Jonas M. Mikhaeil, Leonard F. Bereska, Zahra Monfared, Po-Chen Kuo, Daniel Durstewitz |
ICML | 1 |