Gobinda Saha

dblp:218/5562 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
6since 2021 · last 2025
0000-0001-5756-6679ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 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
4 papers
Learning paradigms · 37% Trustworthy machine learning · 34% Efficient and distributed learning · 11%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 67% Memory systems · 33%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
continual learning
1.222023
Continual Learning with Scaled Gradient Projection · AAAI 2023
Gradient Projection Memory for Continual Learning · ICLR 2021
Machine learning › Learning paradigms › continual learning
gradient projection
1.222023
Continual Learning with Scaled Gradient Projection · AAAI 2023
Gradient Projection Memory for Continual Learning · ICLR 2021
Machine learning › Trustworthy machine learning › robustness › learning with noisy labels
label noise robustness
0.912025
SAP: Corrective Machine Unlearning with Scaled Activation Projection for Label Noise Robustness · AAAI 2025
Machine learning › Trustworthy machine learning
machine unlearning
0.912025
SAP: Corrective Machine Unlearning with Scaled Activation Projection for Label Noise Robustness · AAAI 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
SAP: Corrective Machine Unlearning with Scaled Activation Projection for Label Noise Robustness · AAAI 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
SAP: Corrective Machine Unlearning with Scaled Activation Projection for Label Noise Robustness · AAAI 2025
Machine learning › Reinforcement learning › non-stationary reinforcement learning
continual reinforcement learning
0.712023
Continual Learning with Scaled Gradient Projection · AAAI 2023
Emerging computing paradigms › neuromorphic computing
cognitive computing
0.612022
A cross-layer approach to cognitive computing: invited · DAC 2022
Emerging computing paradigms
neuromorphic computing
0.612022
A cross-layer approach to cognitive computing: invited · DAC 2022
Memory systems
processing-in-memory
0.612022
A cross-layer approach to cognitive computing: invited · DAC 2022
Machine learning › Learning paradigms › continual learning
catastrophic forgetting
0.512021
Gradient Projection Memory for Continual Learning · ICLR 2021
Machine learning › Deep learning architectures and training › training optimization
gradient-based training
0.512021
Gradient Projection Memory for Continual Learning · ICLR 2021

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

singular value decomposition · 1.5cross-layer design · 1.1bio-inspired learning · 1.1activation projection · 0.9orthogonal gradient projection · 0.7gradient projection memory · 0.5
YearPublicationVenuePosition
2025 SAP: Corrective Machine Unlearning with Scaled Activation Projection for Label Noise Robustness
abstract
Label corruption, where training samples are mislabeled due to non-expert annotation or adversarial attacks, significantly degrades model performance. Acquiring large, perfectly labeled datasets is costly, and retraining models from scratch is computationally expensive. To address this, we introduce Scaled Activation Projection (SAP), a novel SVD (Singular Value Decomposition)-based corrective machine unlearning algorithm. SAP mitigates label noise by identifying a small subset of trusted samples using cross-entropy loss and projecting model weights onto a clean activation space estimated using SVD on these trusted samples. This process suppresses the noise introduced in activations due to the mislabeled samples. In our experiments, we demonstrate SAP’s effectiveness on synthetic noise with different settings and real-world label noise. SAP applied to the CIFAR dataset with 25% synthetic corruption show upto 6% generalization improvements. Additionally, SAP can improve the generalization over noise robust training approaches on CIFAR dataset by ∼ 3.2% on average. Further, we observe generalization improvements of 2.31% for a Vision Transformer model trained on naturally corrupted Clothing1M.
Sangamesh Kodge, Deepak Ravikumar, Gobinda Saha, Kaushik Roy 0001
AAAI3
2023 Continual Learning with Scaled Gradient Projection
abstract
In neural networks, continual learning results in gradient interference among sequential tasks, leading to catastrophic forgetting of old tasks while learning new ones. This issue is addressed in recent methods by storing the important gradient spaces for old tasks and updating the model orthogonally during new tasks. However, such restrictive orthogonal gradient updates hamper the learning capability of the new tasks resulting in sub-optimal performance. To improve new learning while minimizing forgetting, in this paper we propose a Scaled Gradient Projection (SGP) method, where we combine the orthogonal gradient projections with scaled gradient steps along the important gradient spaces for the past tasks. The degree of gradient scaling along these spaces depends on the importance of the bases spanning them. We propose an efficient method for computing and accumulating importance of these bases using the singular value decomposition of the input representations for each task. We conduct extensive experiments ranging from continual image classification to reinforcement learning tasks and report better performance with less training overhead than the state-of-the-art approaches.
Gobinda Saha, Kaushik Roy 0001
AAAI1
2023 Saliency Guided Experience Packing for Replay in Continual Learning
abstract
Artificial learning systems aspire to mimic human intelligence by continually learning from a stream of tasks without forgetting past knowledge. One way to enable such learning is to store past experiences in the form of input examples in episodic memory and replay them when learning new tasks. However, performance of such method suffers as the size of the memory becomes smaller. In this paper, we propose a new approach for experience replay, where we select the past experiences by looking at the saliency maps which provide visual explanations for the model’s decision. Guided by these saliency maps, we pack the memory with only the parts or patches of the input images important for the model’s prediction. While learning a new task, we replay these memory patches with appropriate zero-padding to remind the model about its past decisions. We evaluate our algorithm on CIFAR-100, miniImageNet and CUB datasets and report better performance than the state-of-the-art approaches. With qualitative and quantitative analyses we show that our method captures richer summaries of past experiences without any memory increase, and hence performs well with small episodic memory.
Gobinda Saha, Kaushik Roy 0001
WACV1
2023 Online continual learning with saliency-guided experience replay using tiny episodic memory
Gobinda Saha, Kaushik Roy 0001
Mach. Vis. Appl.1
2022 A cross-layer approach to cognitive computing: invited
abstract
Remarkable advances in machine learning and artificial intelligence have been made in various domains, achieving near-human performance in a plethora of cognitive tasks including vision, speech and natural language processing. However, implementations of such cognitive algorithms in conventional "von-Neumann" architectures are orders of magnitude more area and power expensive than the biological brain. Therefore, it is imperative to search for fundamentally new approaches so that the improvement in computing performance and efficiency can keep up with the exponential growth of the AI computational demand. In this article, we present a cross-layer approach to the exploration of new paradigms in cognitive computing. This effort spans new learning algorithms inspired from biological information processing principles, network architectures best suited for such algorithms, and neuromorphic hardware substrates such as computing-in-memory fabrics in order to build intelligent machines that can achieve orders of improvement in energy efficiency at cognitive processing. We argue that such cross-layer innovations in cognitive computing are well-poised to enable a new wave of autonomous intelligence across the computing spectrum, from resource-constrained IoT devices to the cloud.
Gobinda Saha, Cheng Wang 0036, Anand Raghunathan, Kaushik Roy 0001
DAC1
2021 Gradient Projection Memory for Continual Learning
Gobinda Saha, Isha Garg, Kaushik Roy 0001
ICLR1