activity
20222026
most citedTabConv: Low-Computation CNN Inference via Table Lookups

6 citations · 21 across the 34 of their papers we have counts for

collaborators
Showing 2026Show all

6 papers · 1 filter

cs.RO2026

PhysWAM: Physically Consistent World Action Model for Autonomous Driving

Dhruv Parikh, Fengcheng Yu, Quankai Gao +11

World-action models (WAMs) jointly predict how a scene will evolve and how an agent should act, however joint generation alone does not necessarily impose a shared geometric constr…

cs.LG2026

Accurate and Resource-Efficient Federated Continual Learning

Jebacyril Arockiaraj, Dhruv Parikh, Jayashree Adivarahan +2

Federated continual learning (FCL) must learn from distributed task streams under limited resources, such as communication, computation, memory, and label availability. Existing FC…

cs.CV2026

Can Graphs Help Vision SSMs See Better?

Dhruv Parikh, Anvitha Ramachandran, Haoyang Fan +3

Vision state space models inherit the efficiency and long-range modeling ability of Mamba-style selective scans. However, their performance depends critically on the representation…

cs.LG2026

TypeBandit: Type-Level Context Allocation and Reweighting for Effective Attribute Completion in Heterogeneous Graph Neural Networks

Ta-Yang Wang, Rajgopal Kannan, Viktor Prasanna

Heterogeneous graphs are widely used to model multi-relational systems, but missing node attributes remain a major bottleneck for downstream learning. In this paper, we identify an…

cs.LG2026

Action-Graph Policies: Learning Action Co-dependencies in Multi-Agent Reinforcement Learning

Nikunj Gupta, James Zachary Hare, Jesse Milzman +2

Coordinating actions is the most fundamental form of cooperation in multi-agent reinforcement learning (MARL). Successful decentralized decision-making often depends not only on go…

cs.CV2026

ConsensusDrop: Fusing Visual and Cross-Modal Saliency for Efficient Vision Language Models

Dhruv Parikh, Haoyang Fan, Rajgopal Kannan +1

Vision-Language Models (VLMs) are expensive because the LLM processes hundreds of largely redundant visual tokens. Existing token reduction methods typically exploit \textit{either…