Demo Data from EDBT 2026 / reviewers in the wild / expert
Szymon Sidor
dblp:164/5870
· DBLP profile ↗
4ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 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
4 papers |
Learning theory · 23% Reinforcement learning · 22% Knowledge representation and reasoning · 13% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Optimization for machine learning
hyperparameter optimization |
0.5 | 1 | 2021 | Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer · NeurIPS 2021 |
Machine learning › Learning theory › neural network theory › neural network parameterization
maximal update parameterization |
0.5 | 1 | 2021 | Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer · NeurIPS 2021 |
Machine learning › Learning theory › neural network theory
neural network parameterization |
0.5 | 1 | 2021 | Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer · NeurIPS 2021 |
Machine learning › Deep learning architectures and training › hyperparameter transfer
zero-shot hyperparameter transfer |
0.5 | 1 | 2021 | Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfer · NeurIPS 2021 |
Machine learning › Reinforcement learning
exploration |
0.3 | 1 | 2018 | Parameter Space Noise for Exploration · ICLR (Poster) 2018 |
Knowledge, reasoning and agents › Multi-agent systems › multi-agent decision making
multi-agent competition |
0.3 | 1 | 2018 | Emergent Complexity via Multi-Agent Competition · ICLR (Poster) 2018 |
Machine learning › Reinforcement learning
multi-agent reinforcement learning |
0.3 | 1 | 2018 | Emergent Complexity via Multi-Agent Competition · ICLR (Poster) 2018 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning |
0.3 | 1 | 2017 | Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive Physics · ICML 2017 |
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal model
causal world model |
0.3 | 1 | 2017 | Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive Physics · ICML 2017 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › commonsense reasoning
intuitive physics |
0.3 | 1 | 2017 | Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive Physics · ICML 2017 |
Machine learning › Reinforcement learning
model-based reinforcement learning |
0.3 | 1 | 2017 | Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive Physics · ICML 2017 |
Machine learning › Transfer learning and domain adaptation
zero-shot transfer |
0.1 | 1 | 2017 | Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive Physics · ICML 2017 |
Methods — techniques the papers use, named apart from their topics
mutransfer · 0.5maximal update parametrization · 0.5reinforcement learning · 0.3noise injection · 0.3physics simulation · 0.3object-oriented generative model · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Tuning Large Neural Networks via Zero-Shot Hyperparameter TransferabstractHyperparameter (HP) tuning in deep learning is an expensive process, prohibitively so for neural networks (NNs) with billions of parameters.We show that, in the recently discovered Maximal Update Parametrization ($\mu$P), many optimal HPs remain stable even as model size changes. This leads to a new HP tuning paradigm we call *$\mu$Transfer*: parametrize the target model in $\mu$P, tune the HP indirectly on a smaller model, and *zero-shot transfer* them to the full-sized model, i.e., without directly tuning the latter at all.We verify $\mu$Transfer on Transformer and ResNet. For example, 1) by transferring pretraining HPs from a model of 13M parameters, we outperform published numbers of BERT-large (350M parameters), with a total tuning cost equivalent to pretraining BERT-large once; 2) by transferring from 40M parameters, we outperform published numbers of the 6.7B GPT-3 model, with tuning cost only 7% of total pretraining cost. A Pytorch implementation of our technique can be found at github.com/microsoft/mup. See arxiv.org for the full, up-to-date version of this work. Edward J. Hu, Igor Babuschkin, Szymon Sidor, Xiaodong Liu 0003, David Farhi, Nick Ryder, Jakub Pachocki, Weizhu Chen, Jianfeng Gao 0001 |
NeurIPS | 4 |
| 2018 | Emergent Complexity via Multi-Agent Competition
Trapit Bansal, Jakub Pachocki, Szymon Sidor, Ilya Sutskever, Igor Mordatch |
ICLR (Poster) | 3 |
| 2018 | Parameter Space Noise for Exploration
Matthias Plappert, Rein Houthooft, Prafulla Dhariwal, Szymon Sidor, Richard Y. Chen, Xi Chen 0022, Tamim Asfour, Pieter Abbeel, Marcin Andrychowicz |
ICLR (Poster) | 4 |
| 2017 | Schema Networks: Zero-shot Transfer with a Generative Causal Model of Intuitive PhysicsabstractThe recent adaptation of deep neural network-based methods to reinforcement learning and planning domains has yielded remarkable progress on individual tasks. Nonetheless, progress on task-to-task transfer remains limited. In pursuit of efficient and robust generalization, we introduce the Schema Network, an object-oriented generative physics simulator capable of disentangling multiple causes of events and reasoning backward through causes to achieve goals. The richly structured architecture of the Schema Network can learn the dynamics of an environment directly from data. We compare Schema Networks with Asynchronous Advantage Actor-Critic and Progressive Networks on a suite of Breakout variations, reporting results on training efficiency and zero-shot generalization, consistently demonstrating faster, more robust learning and better transfer. We argue that generalizing from limited data and learning causal relationships are essential abilities on the path toward generally intelligent systems. Ken Kansky, Tom Silver, David A. Mély, Mohamed Eldawy, Miguel Lázaro-Gredilla, Xinghua Lou, Nimrod Dorfman, Szymon Sidor, D. Scott Phoenix, Dileep George |
ICML | 8 |