Saket Anand

Saket Anand

Auto-generated profile, based on publicly available information

Saket Anand

Department of CSE and ECE, IIIT-Delhi, New Delhi, India

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 November 2020
Verified
Book Chapter
Closed access
PDF file
LTLokender Tiwari
Lokender Tiwari
PJPan Ji
Pan Ji
QTQuoc-Huy Tran
Quoc-Huy Tran
BZBingbing Zhuang
Bingbing Zhuang
SASaket Anand
Saket Anand
MCManmohan Chandraker
Manmohan Chandraker

18 August 2021 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
NMNikita Mehrotra
Nikita Mehrotra
NANavdha Agarwal
Navdha Agarwal
PGPiyush Gupta
Piyush Gupta
SASaket Anand
Saket Anand
DLDavid Lo
David Lo
RPRahul Purandare
Rahul Purandare
Code clones are duplicate code fragments that share (nearly) similar syntax or semantics. Code clone detection plays an important role in software maintenance, code refactoring, and reuse. A substantial amount of research has been conducted in the past to detect clones. A majority of these approaches use lexical and syntactic information to detect clones. However, only a few of them target semantic clones. Recently, motivated by the success of deep learning models in other fields, including natural language processing and computer vision, researchers have attempted to adopt deep learning techniques to detect code clones. These approaches use lexical information (tokens) and(or) syntactic structures like abstract syntax trees (ASTs) to detect code clones. However, they do not make sufficient use of the available structural and semantic information, hence limiting their capabilities. This paper addresses the problem of semantic code clone detection using program dependency graphs and geometric neural networks, leveraging the structured syntactic and semantic information. We have developed a prototype tool HOLMES, based on our novel approach and empirically evaluated it on popular code clone benchmarks. Our results show that \tool performs considerably better than the other state-of-the-art tool, TBCCD. We also assessed HOLMES on unseen projects and performed cross dataset experiments to evaluate the generalizability of HOLMES. Our results affirm that HOLMES outperforms TBCCD since most of the pairs that HOLMES detected were either undetected or suboptimally reported by TBCCD.

1 March 2018
Verified
Conference Paper
Open access
LTLokender Tiwari
Lokender Tiwari
SASaket Anand
Saket Anand
In this paper, we present an automatic multi-model fitting pipeline that can robustly fit multiple geometric models present in the corrupted and noisy data. Our approach can handle large data corruption and requires no user input, unlike most state-of-the-art approaches. The pipeline can be used as an independent block in many geometric vision applications like 3D reconstruction, motion and planar segmentation. We use residual density as the primary tool to guide hypothesis generation, estimate the fraction of inliers, and perform model selection. We show results for a diverse set of geometric models like planar homographies, fundamental matrices and vanishing points, which often arise in various computer vision applications. Despite being fully automatic, our approach achieves competitive performance compared to state-of-the-art approaches in terms of accuracy and computational time.

20 May 2025 in ACM Transactions on Cyber-Physical Systems
Verified
Journal Article
Open access
SAShivangi Agarwal
Shivangi Agarwal
AAAdi Asija
Adi Asija
SKSanjit Kaul
Sanjit Kaul
SASaket Anand
Saket Anand
Data-driven models for state estimation using measurements obtained over a wireless network are essential to cyber-physical systems. Learning a data-driven model for an estimator using real wireless network deployments is, however, impractical as it would require data that captures varied wireless network conditions and their impact on estimation. We propose and evaluate a simulation to real-world transfer of a data-driven model for state estimation. Specifically, we train an estimator model using only data generated by a low-fidelity simulation of networks. Our choice of network simulation is a first-come-first-served single server queue, which is a network model with the two parameters of arrival rate of measurement packets into the queue and packet service rates. We employ domain randomization to bridge the gap between simulation and the real-world, appropriately randomizing the network model parameters during training. The efficacy of the resulting estimator model is demonstrated by testing it over two deployments of real wireless networks. In one, the estimator model estimates vehicles’ positions and speeds using data from vehicular trajectories received by it over a shared WiFi network, with up to seventy sources sending the measurements. In the other, GPS coordinates are communicated by public transit buses over city-wide cellular networks. The estimator uses the received measurements to estimate locations of the buses.

17 December 2025
Verified
Conference Paper
Open access
SPSumesh Prasad
Sumesh Prasad
OSOjaswini Sharma
Ojaswini Sharma
SASaket Anand
Saket Anand
Knowledge distillation (KD) transfers what a large, accurate teacher model has learned to a smaller, faster student model. Standard losses such as Kullback–Leibler (KL) divergence, mean squared error (MSE), and dot product have been used successfully. Still, they often come with limitations, for example, assuming specific data distributions or requiring that teacher and student features have the same dimensionality. We introduce Distance Correlation (DC) as an additional distillation loss to get around these issues. DC measures non-linear dependencies between teacher and student representations and works without the need for matching dimensions, making it more flexible. We tested this idea on CIFAR-100 and Tiny ImageNet classification tasks, with Vision Transformers and ResNets as teachers and MobileNetV2 as the students. For object detection, we use a subset of MS COCO with YOLOv8-medium as the teacher and YOLOv8n as the student. Across these settings, combining KL divergence with DC consistently improves results up to a +5.6% boost in classification accuracy and +1.4% mAP in detection over the baseline. These gains suggest that DC is a practical, general purpose addition to existing KD objectives.

4 December 2024
Verified
Conference Paper
Open access
SCShubham Chaudhary
Shubham Chaudhary
ABArani Bhattacharya
Arani Bhattacharya
SASaket Anand
Saket Anand
ABAruna Balasubramanian
Aruna Balasubramanian
The proliferation of video analytics in applications like autonomous driving, traffic surveillance, and teleoperated vehicles requires on-premise (on edge) execution of deep learning models to meet latency requirements and curb bandwidth usage by limiting frequent offloading of inference tasks. However, constrained by the compute and power availability on the edge, a cheaper model is typically deployed. These shallower models have two major associated problems: 1) using the same model for all cameras/vehicles gives inconsistent accuracy, and 2) trained models are prone to data drift. In this work, we propose to address these problems using two strategies. The first strategy is to intelligently assign individual models to each camera/vehicle by clustering the ones with similar visual scenes to reduce the number of allocated models. Second, to circumvent the data drift, we re-train the model assigned to the cluster, which undergoes accuracy deviation.