EDBT 2026 Demo / reviewers in the wild / expert
Claudius Gros
dblp:66/6132
· DBLP profile ↗
13ranked-venue papers
3as first author
6since 2021 · last 2025
0000-0002-2126-0843ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 13 · 3 first-author · 6 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
2 papers |
Reinforcement learning · 50% Deep learning architectures and training · 50% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
scaling laws |
1.5 | 2 | 2025 | AlphaZero Neural Scaling and Zipf's Law: a Tale of Board Games and Power Laws · NeurIPS 2025 Scaling Laws for a Multi-Agent Reinforcement Learning Model · ICLR 2023 |
Machine learning › Reinforcement learning › deep reinforcement learning
alphazero |
0.9 | 1 | 2025 | AlphaZero Neural Scaling and Zipf's Law: a Tale of Board Games and Power Laws · NeurIPS 2025 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.7 | 1 | 2023 | Scaling Laws for a Multi-Agent Reinforcement Learning Model · ICLR 2023 |
Methods — techniques the papers use, named apart from their topics
zipf's law analysis · 0.9power-law analysis · 0.9scaling law analysis · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Small Transformer Architectures for Task Switching
Claudius Gros |
ICANN (1) | 1 |
| 2025 | AlphaZero Neural Scaling and Zipf's Law: a Tale of Board Games and Power LawsabstractNeural scaling laws are observed in a range of domains, to date with no universal understanding of why they occur. Recent theories suggest that loss power laws arise from Zipf's law, a power law observed in domains like natural language. One theory suggests that language scaling laws emerge when Zipf-distributed task quanta are learned in descending order of frequency. In this paper we examine power-law scaling in AlphaZero, a reinforcement learning algorithm, using a model of language-model scaling. We find that game states in training and inference data scale with Zipf's law, which is known to arise from the tree structure of the environment, and examine the correlation between scaling-law and Zipf's-law exponents. In agreement with the quanta scaling model, we find that agents optimize state loss in descending order of frequency, even though this order scales inversely with modelling complexity. We also find that inverse scaling, the failure of models to improve with size, is correlated with unusual Zipf curves where end-game states are among the most frequent states. We show evidence that larger models shift their focus to these less-important states, sacrificing their understanding of important early-game states. Oren Neumann, Claudius Gros |
NeurIPS | 2 |
| 2024 | Self-organized Attractoring in Locomoting Animals and Robots: An Emerging Field
Bulcsú Sándor, Claudius Gros |
ICANN (10) | 2 |
| 2023 | Neural Self-organization for Muscle-Driven Robots
Elias Fischer, Bulcsú Sándor, Claudius Gros |
ICANN (1) | 3 |
| 2023 | Scaling Laws for a Multi-Agent Reinforcement Learning Model
Oren Neumann, Claudius Gros |
ICLR | 2 |
| 2022 | Size Scaling in Self-Play Reinforcement LearningabstractPerformance scaling laws with resources are heavily studied in supervised deep learning models but not in reinforcement learning.We examine the scaling of the AlphaZero [1] algorithm's performance with model size by training agents on three competitive two-player games, Connect Four, Oware and Pentago.We find that performance, in the form of the Elo rating, scales logarithmically with the number of free neural network parameters, a trend consistent across games and when using deeper neural networks.This leads to a universal expression for the average match outcome which depends only on the ratio of sizes between opponents, which is supported by an agnostic rating method. Oren Neumann, Claudius Gros |
ESANN | 2 |
| 2017 | Complex activity patterns generated by short-term synaptic plasticity
Bulcsú Sándor, Claudius Gros |
ESANN | 2 |
| 2015 | An objective function for self-limiting neural plasticity rules
Rodrigo Echeveste, Claudius Gros |
ESANN | 2 |
| 2015 | Two-Trace Model for Spike-Timing-Dependent Synaptic PlasticityabstractWe present an effective model for timing-dependent synaptic plasticity (STDP) in terms of two interacting traces, corresponding to the fraction of activated NMDA receptors and the [Formula: see text] concentration in the dendritic spine of the postsynaptic neuron. This model intends to bridge the worlds of existing simplistic phenomenological rules and highly detailed models, thus constituting a practical tool for the study of the interplay of neural activity and synaptic plasticity in extended spiking neural networks. For isolated pairs of pre- and postsynaptic spikes, the standard pairwise STDP rule is reproduced, with appropriate parameters determining the respective weights and timescales for the causal and the anticausal contributions. The model contains otherwise only three free parameters, which can be adjusted to reproduce triplet nonlinearities in hippocampal culture and cortical slices. We also investigate the transition from time-dependent to rate-dependent plasticity occurring for both correlated and uncorrelated spike patterns. Rodrigo Echeveste, Claudius Gros |
Neural Comput. | 2 |
| 2014 | Attractor Metadynamics in Adapting Neural Networks
Claudius Gros, Mathias Linkerhand, Valentin Walther |
ICANN | 1 |
| 2013 | A Self-Organized Neural ComparatorabstractLearning algorithms need generally the ability to compare several streams of information. Neural learning architectures hence need a unit, a comparator, able to compare several inputs encoding either internal or external information, for instance, predictions and sensory readings. Without the possibility of comparing the values of predictions to actual sensory inputs, reward evaluation and supervised learning would not be possible. Comparators are usually not implemented explicitly. Necessary comparisons are commonly performed by directly comparing the respective activities one-to-one. This implies that the characteristics of the two input streams (like size and encoding) must be provided at the time of designing the system. It is, however, plausible that biological comparators emerge from self-organizing, genetically encoded principles, which allow the system to adapt to the changes in the input and the organism. We propose an unsupervised neural circuitry, where the function of input comparison emerges via self-organization only from the interaction of the system with the respective inputs, without external influence or supervision. The proposed neural comparator adapts in an unsupervised form according to the correlations present in the input streams. The system consists of a multilayer feedforward neural network, which follows a local output minimization (anti-Hebbian) rule for adaptation of the synaptic weights. The local output minimization allows the circuit to autonomously acquire the capability of comparing the neural activities received from different neural populations, which may differ in population size and the neural encoding used. The comparator is able to compare objects never encountered before in the sensory input streams and evaluate a measure of their similarity even when differently encoded. Guillermo A. Ludueña, Claudius Gros |
Neural Comput. | 2 |
| 2012 | Intrinsic Adaptation in Autonomous Recurrent Neural NetworksabstractA massively recurrent neural network responds on one side to input stimuli and is autonomously active, on the other side, in the absence of sensory inputs. Stimuli and information processing depend crucially on the quality of the autonomous-state dynamics of the ongoing neural activity. This default neural activity may be dynamically structured in time and space, showing regular, synchronized, bursting, or chaotic activity patterns. We study the influence of nonsynaptic plasticity on the default dynamical state of recurrent neural networks. The nonsynaptic adaption considered acts on intrinsic neural parameters, such as the threshold and the gain, and is driven by the optimization of the information entropy. We observe, in the presence of the intrinsic adaptation processes, three distinct and globally attracting dynamical regimes: a regular synchronized, an overall chaotic, and an intermittent bursting regime. The intermittent bursting regime is characterized by intervals of regular flows, which are quite insensitive to external stimuli, interceded by chaotic bursts that respond sensitively to input signals. We discuss these findings in the context of self-organized information processing and critical brain dynamics. Dimitrije Markovic, Claudius Gros |
Neural Comput. | 2 |
| 2009 | Stimulus processing and unsupervised learning in autonomously active recurrent networks
Claudius Gros, Gregor Kaczor |
ESANN | 1 |