VLDB 2026 Research / reviewers in the wild / expert
Jan Sobotka
dblp:85/10478
· DBLP profile ↗
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
3 papers |
Trustworthy machine learning · 25% Language models and text generation · 16% Generative modeling · 16% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
brain decoding |
0.9 | 1 | 2025 | MEIcoder: Decoding Visual Stimuli from Neural Activity by Leveraging Most Exciting Inputs · NeurIPS 2025 |
Machine learning › Trustworthy machine learning › robustness
distribution shift |
0.9 | 1 | 2025 | Weak-to-Strong Generalization under Distribution Shifts · NeurIPS 2025 |
Machine learning › Generative modeling
image reconstruction |
0.9 | 1 | 2025 | MEIcoder: Decoding Visual Stimuli from Neural Activity by Leveraging Most Exciting Inputs · NeurIPS 2025 |
Natural language and speech › Language models and text generation › alignment › scalable oversight
weak-to-strong generalization |
0.9 | 1 | 2025 | Weak-to-Strong Generalization under Distribution Shifts · NeurIPS 2025 |
Bioinformatics and computational biology
computational neuroscience |
0.9 | 1 | 2025 | MEIcoder: Decoding Visual Stimuli from Neural Activity by Leveraging Most Exciting Inputs · NeurIPS 2025 |
Bioinformatics and computational biology › computational neuroscience
neural decoding |
0.9 | 1 | 2025 | MEIcoder: Decoding Visual Stimuli from Neural Activity by Leveraging Most Exciting Inputs · NeurIPS 2025 |
Machine learning › Optimization for machine learning
learned optimizer |
0.8 | 1 | 2024 | Investigation into Training Dynamics of Learned Optimizers (Student Abstract) · AAAI 2024 |
Machine learning › Deep learning architectures and training
training dynamics |
0.8 | 1 | 2024 | Investigation into Training Dynamics of Learned Optimizers (Student Abstract) · AAAI 2024 |
Machine learning › Trustworthy machine learning › robustness › adversarial robustness
adversarial training |
0.3 | 1 | 2025 | MEIcoder: Decoding Visual Stimuli from Neural Activity by Leveraging Most Exciting Inputs · NeurIPS 2025 |
Machine learning › Trustworthy machine learning
robustness |
0.3 | 1 | 2025 | Weak-to-Strong Generalization under Distribution Shifts · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
structural similarity index · 1.7most exciting inputs · 1.7adversarial training · 1.7dynamic weak model combination · 0.9stochastic gradient descent · 0.8adam · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Weak-to-Strong Generalization under Distribution ShiftsabstractAs future superhuman models become increasingly complex, accurately supervising their behavior may exceed human capabilities.
Recent works have demonstrated that in such scenarios, weak models can effectively supervise strong models, a phenomenon known as weak-to-strong generalization. However, we find that naive weak-to-strong generalization fails under distribution shifts, often leading to worse performance of the strong model than its weak supervisors. To address this, we propose RAVEN, a robust weak-to-strong generalization framework that dynamically learns the optimal combinations of weak models in addition to parameters of the strong model. We demonstrate the effectiveness of RAVEN on image classification, text classification, and preference alignment tasks. RAVEN outperforms alternative baselines by over 30% on out-of-distribution tasks while matching or surpassing existing methods on in-distribution tasks. Moreover, our results show that RAVEN assigns higher weights to more accurate weak models, demonstrating its ability to automatically identify trustworthy supervision. Myeongho Jeon, Jan Sobotka, Suhwan Choi, Maria Brbic |
NeurIPS | 2 |
| 2025 | MEIcoder: Decoding Visual Stimuli from Neural Activity by Leveraging Most Exciting InputsabstractDecoding visual stimuli from neural population activity is crucial for understanding the brain and for applications in brain-machine interfaces. However, such biological data is often scarce, particularly in primates or humans, where high-throughput recording techniques, such as two-photon imaging, remain challenging or impossible to apply. This, in turn, poses a challenge for deep learning decoding techniques. To overcome this, we introduce MEIcoder, a biologically informed decoding method that leverages neuron-specific most exciting inputs (MEIs), a structural similarity index measure loss, and adversarial training. MEIcoder achieves state-of-the-art performance in reconstructing visual stimuli from single-cell activity in primary visual cortex (V1), especially excelling on small datasets with fewer recorded neurons. Using ablation studies, we demonstrate that MEIs are the main drivers of the performance, and in scaling experiments, we show that MEIcoder can reconstruct high-fidelity natural-looking images from as few as 1,000-2,500 neurons and less than 1,000 training data points. We also propose a unified benchmark with over 160,000 samples to foster future research. Our results demonstrate the feasibility of reliable decoding in early visual system and provide practical insights for neuroscience and neuroengineering applications. Jan Sobotka, Luca Baroni, Ján Antolík |
NeurIPS | 1 |
| 2024 | Investigation into Training Dynamics of Learned Optimizers (Student Abstract)abstractModern machine learning heavily relies on optimization, and as deep learning models grow more complex and data-hungry, the search for efficient learning becomes crucial. Learned optimizers disrupt traditional handcrafted methods such as SGD and Adam by learning the optimization strategy itself, potentially speeding up training. However, the learned optimizers' dynamics are still not well understood. To remedy this, our work explores their optimization trajectories from the perspective of network architecture symmetries and proposed parameter update distributions. Jan Sobotka, Petr Simánek |
AAAI | 1 |
| 2024 | Investigation into the Training Dynamics of Learned Optimizers
Jan Sobotka, Petr Simánek, Daniel Vasata |
ICAART (2) | 1 |