VLDB 2026 Research / reviewers in the wild / expert
Ankit Vani
dblp:178/2855
· DBLP profile ↗
6ranked-venue papers
3as first author
5since 2021 · last 2024
0009-0007-4781-9995ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 3 first-author · 5 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
5 papers |
Deep learning architectures and training · 24% Learning paradigms · 16% Optimization for machine learning · 11% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Deep learning architectures and training
training dynamics |
0.9 | 2 | 2024 | Forget Sharpness: Perturbed Forgetting of Model Biases Within SAM Dynamics · ICML 2024 Fortuitous Forgetting in Connectionist Networks · ICLR 2022 |
Machine learning › Learning theory
generalization |
0.8 | 1 | 2024 | Forget Sharpness: Perturbed Forgetting of Model Biases Within SAM Dynamics · ICML 2024 |
Machine learning › Trustworthy machine learning › fairness
model bias |
0.8 | 1 | 2024 | Forget Sharpness: Perturbed Forgetting of Model Biases Within SAM Dynamics · ICML 2024 |
Machine learning › Optimization for machine learning › gradient-based optimization
sharpness-aware minimization |
0.8 | 1 | 2024 | Forget Sharpness: Perturbed Forgetting of Model Biases Within SAM Dynamics · ICML 2024 |
Machine learning › Deep learning architectures and training
transformer |
0.8 | 1 | 2024 | SPARO: Selective Attention for Robust and Compositional Transformer Encodings for Vision · ECCV (66) 2024 |
Machine learning › Graph learning › geometric learning › topological deep learning
simplicial embeddings |
0.7 | 1 | 2023 | Simplicial Embeddings in Self-Supervised Learning and Downstream Classification · ICLR 2023 |
Machine learning › Learning paradigms › continual learning
catastrophic forgetting |
0.6 | 1 | 2022 | Fortuitous Forgetting in Connectionist Networks · ICLR 2022 |
Machine learning › Learning paradigms
continual learning |
0.6 | 1 | 2022 | Fortuitous Forgetting in Connectionist Networks · ICLR 2022 |
Machine learning › Representation and self-supervised learning
systematicity |
0.5 | 1 | 2021 | Iterated learning for emergent systematicity in VQA · ICLR 2021 |
Computer vision › Vision and language
visual question answering |
0.5 | 1 | 2021 | Iterated learning for emergent systematicity in VQA · ICLR 2021 |
Machine learning › Representation and self-supervised learning › representation learning
compositional representation |
0.2 | 1 | 2024 | SPARO: Selective Attention for Robust and Compositional Transformer Encodings for Vision · ECCV (66) 2024 |
Natural language and speech › Language models and text generation › language evolution
iterated learning |
0.1 | 1 | 2021 | Iterated learning for emergent systematicity in VQA · ICLR 2021 |
Methods — techniques the papers use, named apart from their topics
selective attention · 0.8perturbation · 0.8information bottleneck · 0.8connectionist network · 0.6iterated learning · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | SPARO: Selective Attention for Robust and Compositional Transformer Encodings for Vision
Ankit Vani, Bac Nguyen, Samuel Lavoie-Marchildon, Ranjay Krishna, Aaron C. Courville |
ECCV (66) | 1 |
| 2024 | Forget Sharpness: Perturbed Forgetting of Model Biases Within SAM DynamicsabstractDespite attaining high empirical generalization, the sharpness of models trained with sharpness-aware minimization (SAM) do not always correlate with generalization error. Instead of viewing SAM as minimizing sharpness to improve generalization, our paper considers a new perspective based on SAM’s training dynamics. We propose that perturbations in SAM perform perturbed forgetting, where they discard undesirable model biases to exhibit learning signals that generalize better. We relate our notion of forgetting to the information bottleneck principle, use it to explain observations like the better generalization of smaller perturbation batches, and show that perturbed forgetting can exhibit a stronger correlation with generalization than flatness. While standard SAM targets model biases exposed by the steepest ascent directions, we propose a new perturbation that targets biases exposed through the model’s outputs. Our output bias forgetting perturbations outperform standard SAM, GSAM, and ASAM on ImageNet, robustness benchmarks, and transfer to CIFAR-10,100, while sometimes converging to sharper regions. Our results suggest that the benefits of SAM can be explained by alternative mechanistic principles that do not require flatness of the loss surface. Ankit Vani, Frederick Tung, Gabriel L. Oliveira, Hossein Sharifi-Noghabi |
ICML | 1 |
| 2023 | Simplicial Embeddings in Self-Supervised Learning and Downstream Classification
Samuel Lavoie-Marchildon, Christos Tsirigotis, Max Schwarzer, Ankit Vani, Michael Noukhovitch, Kenji Kawaguchi, Aaron C. Courville |
ICLR | 4 |
| 2022 | Fortuitous Forgetting in Connectionist Networks
Hattie Zhou, Ankit Vani, Hugo Larochelle, Aaron C. Courville |
ICLR | 2 |
| 2021 | Iterated learning for emergent systematicity in VQA
Ankit Vani, Max Schwarzer, Eeshan Dhekane, Aaron C. Courville |
ICLR | 1 |
| 2020 | GAIT: A Geometric Approach to Information TheoryabstractWe advocate the use of a notion of entropy that reflects the relative abundances of the symbols in an alphabet, as well as the similarities between them. This concept was originally introduced in theoretical ecology to study the diversity of ecosystems. Based on this notion of entropy, we introduce geometry-aware counterparts for several concepts and theorems in information theory. Notably, our proposed divergence exhibits performance on par with state-of-the-art methods based on the Wasserstein distance, but enjoys a closed-form expression that can be computed efficiently. We demonstrate the versatility of our method via experiments on a broad range of domains: training generative models, computing image barycenters, approximating empirical measures and counting modes. Jose Gallego-Posada, Ankit Vani, Max Schwarzer, Simon Lacoste-Julien |
AISTATS | 2 |