EDBT 2026 Demo / reviewers in the wild / expert
Korbinian Abstreiter
dblp:293/9511
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 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
1 paper |
Generative modeling · 70% Representation and self-supervised learning · 23% Image recognition and object detection · 7% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › score matching
denoising score matching |
0.7 | 1 | 2023 | Diffusion Based Representation Learning · ICML 2023 |
Machine learning › Generative modeling › diffusion model
diffusion-based representation learning |
0.7 | 1 | 2023 | Diffusion Based Representation Learning · ICML 2023 |
Machine learning › Generative modeling
diffusion model |
0.7 | 1 | 2023 | Diffusion Based Representation Learning · ICML 2023 |
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
self-supervised representation learning |
0.7 | 1 | 2023 | Diffusion Based Representation Learning · ICML 2023 |
Computer vision › Image recognition and object detection › image classification › label-efficient image classification
semi-supervised image classification |
0.2 | 1 | 2023 | Diffusion Based Representation Learning · ICML 2023 |
Methods — techniques the papers use, named apart from their topics
stochastic differential equation · 0.7denoising score matching · 0.7contrastive learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Diffusion Based Representation LearningabstractDiffusion-based methods, represented as stochastic differential equations on a continuous-time domain, have recently proven successful as non-adversarial generative models. Training such models relies on denoising score matching, which can be seen as multi-scale denoising autoencoders. Here, we augment the denoising score matching framework to enable representation learning without any supervised signal. GANs and VAEs learn representations by directly transforming latent codes to data samples. In contrast, the introduced diffusion-based representation learning relies on a new formulation of the denoising score matching objective and thus encodes the information needed for denoising. We illustrate how this difference allows for manual control of the level of details encoded in the representation. Using the same approach, we propose to learn an infinite-dimensional latent code that achieves improvements on state-of-the-art models on semi-supervised image classification. We also compare the quality of learned representations of diffusion score matching with other methods like autoencoder and contrastively trained systems through their performances on downstream tasks. Finally, we also ablate with a different SDE formulation for diffusion models and show that the benefits on downstream tasks are still present on changing the underlying differential equation. Sarthak Mittal, Korbinian Abstreiter, Stefan Bauer, Bernhard Schölkopf, Arash Mehrjou |
ICML | 2 |