Demo Data from VLDB 2026 / reviewers in the wild / expert
Krishnakant Singh
dblp:243/3173
· DBLP profile ↗
3ranked-venue papers
2as first author
2since 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 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 2 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 |
Representation and self-supervised learning · 41% Generative modeling · 20% Image recognition and object detection · 20% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | GLASS: Guided Latent Slot Diffusion for Object-Centric Learning · CVPR 2025 |
Machine learning › Representation and self-supervised learning › representation learning
object-centric representation learning |
0.9 | 1 | 2025 | GLASS: Guided Latent Slot Diffusion for Object-Centric Learning · CVPR 2025 |
Computer vision › Image recognition and object detection
object discovery |
0.9 | 1 | 2025 | GLASS: Guided Latent Slot Diffusion for Object-Centric Learning · CVPR 2025 |
Machine learning › Representation and self-supervised learning › representation learning › object-centric representation learning
slot attention |
0.9 | 1 | 2025 | GLASS: Guided Latent Slot Diffusion for Object-Centric Learning · CVPR 2025 |
Machine learning › Graph learning › graph neural network training
mini-batch training |
0.4 | 1 | 2019 | Submodular Batch Selection for Training Deep Neural Networks · IJCAI 2019 |
Machine learning › Optimization for machine learning › combinatorial optimization
submodular optimization |
0.4 | 1 | 2019 | Submodular Batch Selection for Training Deep Neural Networks · IJCAI 2019 |
Methods — techniques the papers use, named apart from their topics
slot attention · 0.9semantic guidance · 0.9instance guidance · 0.9submodular function maximization · 0.4stochastic gradient descent · 0.4greedy algorithm · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | GLASS: Guided Latent Slot Diffusion for Object-Centric LearningabstractObject-centric learning aims to decompose an input image into a set of meaningful object files (slots). These latent object representations enable a variety of downstream tasks. Yet, object-centric learning struggles on real-world datasets, which contain multiple objects of complex textures and shapes in natural everyday scenes. To address this, we introduce Guided Latent Slot Diffusion (GLASS), a novel slot-attention model that learns in the space of generated images and uses semantic and instance guidance modules to learn better slot embeddings for various downstream tasks. Our experiments show that GLASS surpasses state-of-the-art slot-attention methods by a wide margin on tasks such as (zero-shot) object discovery and conditional image generation for real-world scenes. Moreover, GLASS enables the first application of slot attention to the compositional generation of complex, realistic scenes. * Krishnakant Singh, Simone Schaub-Meyer, Stefan Roth 0001 |
CVPR | 1 |
| 2022 | $S^2$-Flow: Joint Semantic and Style Editing of Facial Images
Krishnakant Singh, Simone Schaub-Meyer, Stefan Roth 0001 |
BMVC | 1 |
| 2019 | Submodular Batch Selection for Training Deep Neural NetworksabstractMini-batch gradient descent based methods are the de facto algorithms for training neural network architectures today.We introduce a mini-batch selection strategy based on submodular function maximization. Our novel submodular formulation captures the informativeness of each sample and diversity of the whole subset. We design an efficient, greedy algorithm which can give high-quality solutions to this NP-hard combinatorial optimization problem. Our extensive experiments on standard datasets show that the deep models trained using the proposed batch selection strategy provide better generalization than Stochastic Gradient Descent as well as a popular baseline sampling strategy across different learning rates, batch sizes, and distance metrics. K. J. Joseph, Vamshi Teja R, Krishnakant Singh, Vineeth N. Balasubramanian |
IJCAI | 3 |