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

Arnav Das 0001

dblp:263/7747 · also Arnav M. Das, Arnav Mohanty Das · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0003-3083-6389ORCID · conflict

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 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 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
3D vision · 32% Efficient and distributed learning · 18% Transfer learning and domain adaptation · 14%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › 3d generation
point cloud generation
1.322023
RadarHD: Demonstrating Lidar-like Point Clouds from mmWave Radar · MobiCom 2023
High Resolution Point Clouds from mmWave Radar · ICRA 2023
Machine learning › Efficient and distributed learning
data selection
0.912025
COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Adaptation · CVPR 2025
Machine learning › Transfer learning and domain adaptation › few-shot learning
few-shot adaptation
0.912025
COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Adaptation · CVPR 2025
Natural language and speech › Language models and text generation
retrieval augmentation
0.912025
COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Adaptation · CVPR 2025
Machine learning › Reinforcement learning
preference learning
0.812024
Deep Submodular Peripteral Networks · NeurIPS 2024
Computer vision › 3D vision › range sensing
depth sensing
0.712023
High Resolution Point Clouds from mmWave Radar · ICRA 2023
Robotics › Robot navigation and mapping
odometry and mapping
0.422023
RadarHD: Demonstrating Lidar-like Point Clouds from mmWave Radar · MobiCom 2023
High Resolution Point Clouds from mmWave Radar · ICRA 2023
Computer vision › Image recognition and object detection
image classification
0.312025
COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Adaptation · CVPR 2025
Machine learning › Efficient and distributed learning
active learning
0.212024
Deep Submodular Peripteral Networks · NeurIPS 2024

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

contrastive learning · 1.5active learning · 1.5nearest neighbor retrieval · 0.9combinatorial mutual information · 0.9neural network · 0.7machine learning super resolution · 0.7end-to-end learning · 0.7LiDAR · 0.7
YearPublicationVenuePosition
2025 COBRA: COmBinatorial Retrieval Augmentation for Few-Shot Adaptation
abstract
Retrieval augmentation, the practice of retrieving additional data from large auxiliary pools, has emerged as an effective technique for enhancing model performance in the low-data regime. Prior approaches have employed only nearest-neighbor based strategies for data selection, which retrieve auxiliary samples with high similarity to instances in the target task. However, these approaches are prone to selecting highly redundant samples, since they fail to incorporate any notion of diversity. In our work, we first demonstrate that data selection strategies used in prior retrieval-augmented few-shot adaptation settings can be generalized using a class of functions known as Combinatorial Mutual Information (CMI) measures. We then propose COBRA (COmBinatorial Retrieval Augmentation), which employs an alternative CMI measure that considers both diversity and similarity to a target dataset. COBRA consistently outperforms previous retrieval approaches across image classification tasks and few-shot learning techniques when used to retrieve samples from LAION-2B. COBRA introduces negligible computational overhead to the cost of retrieval while providing significant gains in downstream model performance.
Arnav Das 0001, Gantavya Bhatt, Lilly Kumari, Sahil Verma 0003, Jeff A. Bilmes
CVPR1
2025 PRimuS: Pretraining IMU Encoders with Multimodal Self-Supervision
abstract
Sensing human motions through Inertial Measurement Units (IMUs) embedded in personal devices has enabled significant applications in health and wellness. Labeled IMU data is scarce, however, unlabeled or weakly labeled IMU data can be used to model human motions. For video or text modalities, the "pretrain and adapt" approach utilizes large volumes of unlabeled or weakly labeled data to build a strong feature extractor, followed by adaptation to specific tasks using limited labeled data. However, pretraining methods are poorly understood for IMU data, and pipelines are rarely evaluated on out-of-domain tasks. We propose PRIMUS: a method for PRetraining IMU encoderS that uses a novel pretraining objective that is empirically validated based on downstream performance on both in-domain and out-of-domain datasets. The PRIMUS objective effectively enhances downstream performance by combining self-supervision, multimodal, and nearest-neighbor supervision. With fewer than 500 labeled samples per class, PRIMUS improves test accuracy by up to 15%, compared to state-of-the-art baselines. To benefit the broader community, we have open-sourced our code at github.com/nokia-bell-labs/pretrained-imu-encoders.
Arnav Das 0001, Chi Ian Tang, Fahim Kawsar, Mohammad Malekzadeh
ICASSP1
2024 Deep Submodular Peripteral Networks
abstract
Submodular functions, crucial for various applications, often lack practical learning methods for their acquisition. Seemingly unrelated, learning a scaling from oracles offering graded pairwise preferences (GPC) is underexplored, despite a rich history in psychometrics. In this paper, we introduce deep submodular peripteral networks (DSPNs), a novel parametric family of submodular functions, and methods for their training using a GPC-based strategy to connect and then tackle both of the above challenges. We introduce newly devised GPC-style ``peripteral'' loss which leverages numerically graded relationships between pairs of objects (sets in our case). Unlike traditional contrastive learning, or RHLF preference ranking, our method utilizes graded comparisons, extracting more nuanced information than just binary-outcome comparisons, and contrasts sets of any size (not just two). We also define a novel suite of automatic sampling strategies for training, including active-learning inspired submodular feedback. We demonstrate DSPNs' efficacy in learning submodularity from a costly target submodular function and demonstrate its superiority both for experimental design and online streaming applications.
Gantavya Bhatt, Arnav Das 0001, Jeff A. Bilmes
NeurIPS2
2023 High Resolution Point Clouds from mmWave Radar
abstract
This paper explores a machine learning approach on data from a single-chip mmWave radar for generating high resolution point clouds – a key sensing primitive for robotic applications such as mapping, odometry and localization. Unlike lidar and vision-based systems, mmWave radar can operate in harsh environments and see through occlusions like smoke, fog, and dust. Unfortunately, current mmWave processing techniques offer poor spatial resolution compared to lidar point clouds. This paper presents RadarHD, an end-to-end neural network that constructs lidar-like point clouds from low resolution radar input. Enhancing radar images is challenging due to the presence of specular and spurious reflections. Radar data also doesn't map well to traditional image processing techniques due to the signal's sinc-like spreading pattern. We overcome these challenges by training RadarHD on a large volume of raw I/Q radar data paired with lidar point clouds across diverse indoor settings. Our experiments show the ability to generate rich point clouds even in scenes unobserved during training and in the presence of heavy smoke occlusion. Further, RadarHD's point clouds are high-quality enough to work with existing lidar odometry and mapping workflows.
Akarsh Prabhakara, Arnav Das 0001, Gantavya Bhatt, Lilly Kumari, Elahe Soltanaghai, Jeff A. Bilmes, Swarun Kumar, Anthony Rowe 0001
ICRA3
2023 RadarHD: Demonstrating Lidar-like Point Clouds from mmWave Radar
abstract
Millimeter wave radars can perceive through occlusions like dust, fog, smoke and clothes. But compared to cameras and lidars, their perception quality is orders of magnitude poorer. RadarHD [3] tackles this problem of poor quality by creating a machine learning super resolution pipeline trained against high quality lidar scans to mimic lidar. RadarHD ingests low resolution radar and generates high quality lidar-like point clouds even in occluded settings. RadarHD can also make use of the high quality output for typical robotics tasks like odometry, mapping and classification using conventional lidar workflows. Here, we demonstrate the effectiveness of RadarHD's point clouds against lidar in occluded settings.
Akarsh Prabhakara, Arnav Das 0001, Gantavya Bhatt, Lilly Kumari, Elahe Soltanaghai, Jeff A. Bilmes, Swarun Kumar, Anthony Rowe 0001
MobiCom3