Demo Data from VLDB 2026 / reviewers in the wild / expert
Julius Vetter
dblp:368/7633
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 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 |
Probabilistic and Bayesian machine learning · 63% Generative modeling · 23% Deep learning architectures and training · 13% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › approximate bayesian inference
simulation-based inference |
1.6 | 2 | 2025 | Effortless, Simulation-Efficient Bayesian Inference using Tabular Foundation Models · NeurIPS 2025 Sourcerer: Sample-based Maximum Entropy Source Distribution Estimation · NeurIPS 2024 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › approximate bayesian inference › simulation-based inference
neural posterior estimation |
0.9 | 1 | 2025 | Effortless, Simulation-Efficient Bayesian Inference using Tabular Foundation Models · NeurIPS 2025 |
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process › neural processes
prior-data fitted networks |
0.9 | 1 | 2025 | Effortless, Simulation-Efficient Bayesian Inference using Tabular Foundation Models · NeurIPS 2025 |
Machine learning › Deep learning architectures and training › foundation model
tabular foundation model |
0.9 | 1 | 2025 | Effortless, Simulation-Efficient Bayesian Inference using Tabular Foundation Models · NeurIPS 2025 |
Machine learning › Generative modeling
diffusion model |
0.8 | 1 | 2024 | Latent Diffusion for Neural Spiking Data · NeurIPS 2024 |
Machine learning › Generative modeling › diffusion model
latent diffusion model |
0.8 | 1 | 2024 | Latent Diffusion for Neural Spiking Data · NeurIPS 2024 |
Bioinformatics and computational biology
neuroscience |
0.2 | 1 | 2024 | Latent Diffusion for Neural Spiking Data · NeurIPS 2024 |
Methods — techniques the papers use, named apart from their topics
structured state-space layers · 1.5conditional diffusion · 1.5autoencoder · 1.5autoregressive density estimation · 0.9TabPFN · 0.9sliced wasserstein distance · 0.8maximum entropy · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Effortless, Simulation-Efficient Bayesian Inference using Tabular Foundation ModelsabstractSimulation-based inference (SBI) offers a flexible and general approach to performing Bayesian inference: In SBI, a neural network is trained on synthetic data simulated from a model and used to rapidly infer posterior distributions for observed data.
A key goal for SBI is to achieve accurate inference with as few simulations as possible, especially for expensive simulators.
In this work, we address this challenge by repurposing recent probabilistic foundation models for tabular data: We show how tabular foundation models---specifically TabPFN---can be used as pre-trained autoregressive conditional density estimators for SBI.
We propose Neural Posterior Estimation with Prior-data Fitted Networks (NPE-PFN) and show that it is competitive with current SBI approaches in terms of accuracy for both benchmark tasks and two complex scientific inverse problems. Crucially, it often substantially outperforms them in terms of simulation efficiency, sometimes requiring orders of magnitude fewer simulations. NPE-PFN eliminates the need for selecting and training an inference network and tuning its hyperparameters. We also show that it exhibits superior robustness to model misspecification and can be scaled to simulation budgets that exceed the context size limit of TabPFN.
NPE-PFN provides a new direction for SBI, where training-free, general-purpose inference models offer efficient, easy-to-use, and flexible solutions for a wide range of stochastic inverse problems. Julius Vetter, Manuel Glöckler, Daniel Gedon, Jakob H. Macke |
NeurIPS | 1 |
| 2024 | Latent Diffusion for Neural Spiking DataabstractModern datasets in neuroscience enable unprecedented inquiries into the relationship between complex behaviors and the activity of many simultaneously recorded neurons. While latent variable models can successfully extract low-dimensional embeddings from such recordings, using them to generate realistic spiking data, especially in a behavior-dependent manner, still poses a challenge. Here, we present Latent Diffusion for Neural Spiking data (LDNS), a diffusion-based generative model with a low-dimensional latent space: LDNS employs an autoencoder with structured state-space (S4) layers to project discrete high-dimensional spiking data into continuous time-aligned latents. On these inferred latents, we train expressive (conditional) diffusion models, enabling us to sample neural activity with realistic single-neuron and population spiking statistics. We validate LDNS on synthetic data, accurately recovering latent structure, firing rates, and spiking statistics. Next, we demonstrate its flexibility by generating variable-length data that mimics human cortical activity during attempted speech. We show how to equip LDNS with an expressive observation model that accounts for single-neuron dynamics not mediated by the latent state, further increasing the realism of generated samples. Finally, conditional LDNS trained on motor cortical activity during diverse reaching behaviors can generate realistic spiking data given reach direction or unseen reach trajectories. In summary, LDNS simultaneously enables inference of low-dimensional latents and realistic conditional generation of neural spiking datasets, opening up further possibilities for simulating experimentally testable hypotheses. Jaivardhan Kapoor, Auguste Schulz, Julius Vetter, Felix Pei, Richard Gao, Jakob H. Macke |
NeurIPS | 3 |
| 2024 | Sourcerer: Sample-based Maximum Entropy Source Distribution EstimationabstractScientific modeling applications often require estimating a distribution of parameters consistent with a dataset of observations - an inference task also known as source distribution estimation. This problem can be ill-posed, however, since many different source distributions might produce the same distribution of data-consistent simulations. To make a principled choice among many equally valid sources, we propose an approach which targets the maximum entropy distribution, i.e., prioritizes retaining as much uncertainty as possible. Our method is purely sample-based - leveraging the Sliced-Wasserstein distance to measure the discrepancy between the dataset and simulations - and thus suitable for simulators with intractable likelihoods. We benchmark our method on several tasks, and show that it can recover source distributions with substantially higher entropy than recent source estimation methods, without sacrificing the fidelity of the simulations. Finally, to demonstrate the utility of our approach, we infer source distributions for parameters of the Hodgkin-Huxley model from experimental datasets with hundreds of single-neuron measurements. In summary, we propose a principled method for inferring source distributions of scientific simulator parameters while retaining as much uncertainty as possible. Julius Vetter, Guy Moss 0001, Cornelius Schröder, Richard Gao, Jakob H. Macke |
NeurIPS | 1 |