Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Nilakshan Kunananthaseelan

dblp:365/4240 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 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
Vision and language · 37% Trustworthy machine learning · 15% Representation and self-supervised learning · 15%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction › manifold learning › geometric representation learning
hyperbolic representation learning
1.012026
DIET: Machine Unlearning on a Data-Diet · AAAI 2026
Machine learning › Trustworthy machine learning
machine unlearning
1.012026
DIET: Machine Unlearning on a Data-Diet · AAAI 2026
Computer vision › Vision and language
multimodal representation
1.012026
DIET: Machine Unlearning on a Data-Diet · AAAI 2026
Machine learning › Efficient and distributed learning
parameter-efficient fine-tuning
0.812024
LaViP: Language-Grounded Visual Prompting · AAAI 2024
Natural language and speech › Language models and text generation
prompt tuning
0.812024
LaViP: Language-Grounded Visual Prompting · AAAI 2024
Computer vision › Vision and language › vision-language model
vision-language model adaptation
0.812024
LaViP: Language-Grounded Visual Prompting · AAAI 2024
Computer vision › Vision and language
visual prompting
0.812024
LaViP: Language-Grounded Visual Prompting · AAAI 2024
Machine learning › Transfer learning and domain adaptation › few-shot learning
few-shot generalization
0.212024
LaViP: Language-Grounded Visual Prompting · AAAI 2024
Computer vision › Image recognition and object detection
image classification
0.212024
LaViP: Language-Grounded Visual Prompting · AAAI 2024

Methods — techniques the papers use, named apart from their topics

optimal transport · 1.0hyperbolic geometry · 1.0busemann function · 1.0visual prompt tuning · 0.8black-box adaptation · 0.8
YearPublicationVenuePosition
2026 DIET: Machine Unlearning on a Data-Diet
abstract
Machine Unlearning (MU) aims to remove the influence of specific knowledge from a pretrained model. Existing methods often rely on retained training data to preserve utility; such dependence is impractical due to privacy and scalability constraints. A further complication arises when unlearning is applied to vision-language models (VLMs), where entangled multimodal representations make targeted forgetting especially challenging. We propose DIET, a principled retain-data-free unlearning method for VLMs that addresses these challenges by leveraging the geometry of hyperbolic space. The core idea is to push forget embeddings toward class-mismatched prototypes located at the boundary of the hyperbolic space. In hyperbolic geometry, points near the boundary become infinitely distant from interior points. As a result, moving forget embeddings to the boundary makes their influence on the model asymptotically negligible. To formalize this, we guide the forgetting process using the Busemann function, which quantifies directional distance to the boundary. We further develop an adaptive scheme based on optimal transport that selects mismatched prototypes for each forget embedding, enabling flexible unlearning dynamics. Extensive experiments on fine-grained datasets such as Flowers102, OxfordPets, and StanfordCars show that DIET achieves an average forget accuracy of 8.06%, while preserving 69.04% utility using only 16 samples per concept, significantly outperforming the best retain-free baselines with a 117.5% improvement in model utility, and showing competitive performance to retain-data baselines with only a 3.79% drop
Nilakshan Kunananthaseelan, Jing Wu 0021, Trung Le 0001, Gholamreza Haffari, Mehrtash Harandi
AAAI1
2024 LaViP: Language-Grounded Visual Prompting
abstract
We introduce a language-grounded visual prompting method to adapt the visual encoder of vision-language models for downstream tasks. By capitalizing on language integration, we devise a parameter-efficient strategy to adjust the input of the visual encoder, eliminating the need to modify or add to the model's parameters. Due to this design choice, our algorithm can operate even in black-box scenarios, showcasing adaptability in situations where access to the model's parameters is constrained. We will empirically demonstrate that, compared to prior art, grounding visual prompts with language enhances both the accuracy and speed of adaptation. Moreover, our algorithm excels in base-to-novel class generalization, overcoming limitations of visual prompting and exhibiting the capacity to generalize beyond seen classes. We thoroughly assess and evaluate our method across a variety of image recognition datasets, such as EuroSAT, UCF101, DTD, and CLEVR, spanning different learning situations, including few-shot adaptation, base-to-novel class generalization, and transfer learning.
Nilakshan Kunananthaseelan, Jing Zhang 0052, Mehrtash Harandi
AAAI1