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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tamasha Malepathirana

dblp:237/9091 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0001-7958-5184ORCID · verified

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

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 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
2 papers
Learning paradigms · 55% Deep learning architectures and training · 45%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
neural network growth
0.812024
When to Grow? A Fitting Risk-Aware Policy for Layer Growing in Deep Neural Networks · AAAI 2024
Machine learning › Learning paradigms › continual learning › catastrophic forgetting
catastrophic forgetting mitigation
0.712023
NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector Quantization for Continual Learning · ICCV 2023
Machine learning › Learning paradigms
continual learning
0.712023
NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector Quantization for Continual Learning · ICCV 2023
Machine learning › Learning paradigms › continual learning › class-incremental learning
exemplar-free class incremental learning
0.712023
NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector Quantization for Continual Learning · ICCV 2023
Machine learning › Deep learning architectures and training › data augmentation
prototype augmentation
0.712023
NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector Quantization for Continual Learning · ICCV 2023
Machine learning › Deep learning architectures and training
regularization
0.212024
When to Grow? A Fitting Risk-Aware Policy for Layer Growing in Deep Neural Networks · AAAI 2024

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

population-based training · 0.8vector quantization · 0.7prototype augmentation · 0.7neural gas · 0.7
YearPublicationVenuePosition
2026 AniFaceDiff: Animating stylized avatars via parametric conditioned diffusion models
abstract
Animating stylized head avatars with dynamic poses and expressions has become an important focus in recent research due to its broad range of applications (e.g. VR/AR, film and animation, privacy protection). Previous research has made significant progress by training controllable generative models to animate the reference avatar using the target pose and expression. However, existing portrait animation methods are mostly trained using human faces, making them struggle to generalize to stylized avatar references such as cartoon and painting. Moreover, the mechanisms used to animate avatars—namely, to control the pose and expression of the reference—often inadvertently introduce unintended features—such as facial shape—from the target, while also causing a loss of intended features, like expression-related details. This paper proposes AniFaceDiff, a Stable Diffusion (Rombach et al., 2022)-based method with a new conditioning module for animating stylized avatars. First, we propose a refined spatial conditioning approach by Facial Alignment to minimize identity mismatches, particularly between stylized avatars and human faces. Then, we introduce an Expression Adapter that incorporates additional cross-attention layers to address the potential loss of expression-related information. Extensive experiments demonstrate that our method achieves state-of-the-art performance, particularly in the most challenging out-of-domain stylized avatar animation, i.e., domains unseen during training. It delivers superior image quality, identity preservation, and expression accuracy. This work enhances the quality of virtual stylized avatar animation for constructive and responsible applications. To promote ethical use in virtual environments, we contribute to the advancement of detection for generative content by evaluating state-of-the-art detectors, highlighting potential areas for improvement, and suggesting solutions.
Sachith Seneviratne, Wei Wang 0133, Dongting Hu, Sanjay Saha, Md. Tarek Hasan, Sanka Rasnayaka, Tamasha Malepathirana, Mingming Gong, Saman K. Halgamuge
Pattern Recognit.8
2024 When to Grow? A Fitting Risk-Aware Policy for Layer Growing in Deep Neural Networks
abstract
Neural growth is the process of growing a small neural network to a large network and has been utilized to accelerate the training of deep neural networks. One crucial aspect of neural growth is determining the optimal growth timing. However, few studies investigate this systematically. Our study reveals that neural growth inherently exhibits a regularization effect, whose intensity is influenced by the chosen policy for growth timing. While this regularization effect may mitigate the overfitting risk of the model, it may lead to a notable accuracy drop when the model underfits. Yet, current approaches have not addressed this issue due to their lack of consideration of the regularization effect from neural growth. Motivated by these findings, we propose an under/over fitting risk-aware growth timing policy, which automatically adjusts the growth timing informed by the level of potential under/overfitting risks to address both risks. Comprehensive experiments conducted using CIFAR-10/100 and ImageNet datasets show that the proposed policy achieves accuracy improvements of up to 1.3% in models prone to underfitting while achieving similar accuracies in models suffering from overfitting compared to the existing methods.
Haihang Wu, Wei Wang 0133, Tamasha Malepathirana, Damith A. Senanayake, Denny Oetomo, Saman K. Halgamuge
AAAI3
2023 NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector Quantization for Continual Learning
abstract
Catastrophic forgetting; the loss of old knowledge upon acquiring new knowledge, is a pitfall faced by deep neural networks in real-world applications. Many prevailing solutions to this problem rely on storing exemplars (previously encountered data), which may not be feasible in applications with memory limitations or privacy constraints. Therefore, the recent focus has been on Non-Exemplar based Class Incremental Learning (NECIL) where a model incrementally learns about new classes without using any past exemplars. However, due to the lack of old data, NECIL methods struggle to discriminate between old and new classes causing their feature representations to overlap. We propose NAPA-VQ: Neighborhood Aware Prototype Augmentation with Vector Quantization, a framework that reduces this class overlap in NECIL. We draw inspiration from Neural Gas to learn the topological relationships in the feature space, identifying the neighboring classes that are most likely to get confused with each other. This neighborhood information is utilized to enforce strong separation between the neighboring classes as well as to generate old class representative prototypes that can better aid in obtaining a discriminative decision boundary between old and new classes. Our comprehensive experiments on CIFAR-100, TinyImageNet, and ImageNet-Subset demonstrate that NAPA-VQ outperforms the State-of-the-art NECIL methods by an average improvement of 5%, 2%, and 4% in accuracy and 10%, 3%, and 9% in forgetting respectively. Our code can be found in https://github.com/TamashaM/NAPA-VQ.git.
Tamasha Malepathirana, Damith A. Senanayake, Saman K. Halgamuge
ICCV1
2021 Robustness of Visualization Methods in Preserving the Continuous and Discrete Latent Structures of High-Dimensional Single-Cell Data
abstract
Contemporary single-cell technologies produce data with a vast number of variables at a rapid pace, making large volumes of high-dimensional data available. The exploratory analysis of such high dimensional data can be aided by intuitive low dimensional visualizations. In this work, we investigate how both discrete and continuous structures in single cell data can be captured using the recently proposed dimensionality reduction method SONG, and compare the results with commonly used methods UMAP and PHATE. Using simulated and real-world datasets, we observed that SONG preserves a variety of patterns including discrete clusters, continuums, and branching structures. More importantly, SONG produced more/equally insightful visualizations compared to UMAP and PHATE in all considered datasets. We also quantitatively validate the high-dimensional pairwise distance preservation ability of these visualization methods in the low dimensional space for the generated visualizations.
Tamasha Malepathirana, Damith A. Senanayake, Vini Gautam, Saman K. Halgamuge
CIBCB1