activity
20202026
most citedOn the verification of Embeddings using Hybrid Markov Logic

4 citations · 8 across the 15 of their papers we have counts for

collaborators

19 papers

cs.CL2026

Evaluating VQA in Vision Language Models using Cooperative Principles

Monika Shah, Sudarshan Balaji, Somdeb Sarkhel +2

We evaluate the performance of Vision Language Models in Visual Question Answering (VQA) when questions violate Grice's maxims. To do this, we use VLMs to generate question modifie…

cs.MA2026

Mosaic: Runtime-Efficient Multi-Agent Embodied Planning

Kunjal Panchal, Saayan Mitra, Sunav Choudhary +3

LLM-based multi-agent embodied planning remains impractical due to prohibitively high execution latency. We identify failed actions as the dominant bottleneck, stemming from two co…

cs.AI2026

MOCHA: Multi-Objective Chebyshev Annealing for Agent Skill Optimization

Md Mehrab Tanjim, Jayakumar Subramanian, Xiang Chen +6

LLM agents organize behavior through skills -- structured natural-language specifications that govern how an agent reasons, retrieves, and responds. Unlike monolithic prompts, skil…

cs.AI2026

Rethinking Failure Attribution in Multi-Agent Systems: A Multi-Perspective Benchmark and Evaluation

Yeonjun In, Mehrab Tanjim, Jayakumar Subramanian +6

Failure attribution is essential for diagnosing and improving multi-agent systems (MAS), yet existing benchmarks and methods largely assume a single deterministic root cause for ea…

cs.CV2026

GT-SVJ: Generative-Transformer-Based Self-Supervised Video Judge For Efficient Video Reward Modeling

Shivanshu Shekhar, Uttaran Bhattacharya, Raghavendra Addanki +3

Aligning video generative models with human preferences remains challenging: current approaches rely on Vision-Language Models (VLMs) for reward modeling, but these models struggle…

cs.LG2025

Atom: Efficient On-Device Video-Language Pipelines Through Modular Reuse

Kunjal Panchal, Saayan Mitra, Somdeb Sarkhel +4

Recent advances in video-language models have enabled powerful applications like video retrieval, captioning, and assembly. However, executing such multi-stage pipelines efficientl…

cs.CV2025

Analyzing the Sensitivity of Vision Language Models in Visual Question Answering

Monika Shah, Sudarshan Balaji, Somdeb Sarkhel +2

We can think of Visual Question Answering as a (multimodal) conversation between a human and an AI system. Here, we explore the sensitivity of Vision Language Models (VLMs) through…

cs.CV2025

On Explaining Visual Captioning with Hybrid Markov Logic Networks

Monika Shah, Somdeb Sarkhel, Deepak Venugopal

Deep Neural Networks (DNNs) have made tremendous progress in multimodal tasks such as image captioning. However, explaining/interpreting how these models integrate visual informati…

cs.CL2025

A Penalty Goes a Long Way: Measuring Lexical Diversity in Synthetic Texts Under Prompt-Influenced Length Variations

Vijeta Deshpande, Ishita Dasgupta, Uttaran Bhattacharya +3

Synthetic text generated by Large Language Models (LLMs) is increasingly used for further training and improvement of LLMs. Diversity is crucial for the effectiveness of synthetic…

cs.CV2025★ 1 cited

Disentangling Fine-Tuning from Pre-Training in Visual Captioning with Hybrid Markov Logic

Monika Shah, Somdeb Sarkhel, Deepak Venugopal

Multimodal systems have highly complex processing pipelines and are pretrained over large datasets before being fine-tuned for specific tasks such as visual captioning. However, it…

cs.CV2025

SKALD: Learning-Based Shot Assembly for Coherent Multi-Shot Video Creation

Chen Yi Lu, Md Mehrab Tanjim, Ishita Dasgupta +4

We present SKALD, a multi-shot video assembly method that constructs coherent video sequences from candidate shots with minimal reliance on text. Central to our approach is the Lea…

cs.IR2024

X-Reflect: Cross-Reflection Prompting for Multimodal Recommendation

Hanjia Lyu, Ryan Rossi, Xiang Chen +4

Large Language Models (LLMs) have been shown to enhance the effectiveness of enriching item descriptions, thereby improving the accuracy of recommendation systems. However, most ex…

cs.AI2024

Verifying Relational Explanations: A Probabilistic Approach

Abisha Thapa Magar, Anup Shakya, Somdeb Sarkhel +1

Explanations on relational data are hard to verify since the explanation structures are more complex (e.g. graphs). To verify interpretable explanations (e.g. explanations of predi…

cs.LG2023★ 4 cited

On the verification of Embeddings using Hybrid Markov Logic

Anup Shakya, Abisha Thapa Magar, Somdeb Sarkhel +1

The standard approach to verify representations learned by Deep Neural Networks is to use them in specific tasks such as classification or regression, and measure their performance…

cs.CL2023★ 3 cited

ToolChain*: Efficient Action Space Navigation in Large Language Models with A* Search

Yuchen Zhuang, Xiang Chen, Tong Yu +5

Large language models (LLMs) have demonstrated powerful decision-making and planning capabilities in solving complicated real-world problems. LLM-based autonomous agents can intera…

cs.DS2022

A Faster -means++ Algorithm

Jiehao Liang, Somdeb Sarkhel, Zhao Song +3

-means++ is an important algorithm for choosing initial cluster centers for the -means clustering algorithm. In this work, we present a new algorithm that can solve the -m…

cs.LG2020

Optimal Bidding Strategy without Exploration in Real-time Bidding

Aritra Ghosh, Saayan Mitra, Somdeb Sarkhel +1

Maximizing utility with a budget constraint is the primary goal for advertisers in real-time bidding (RTB) systems. The policy maximizing the utility is referred to as the optimal…

cs.LG2020

Inferring Individual Level Causal Models from Graph-based Relational Time Series

Ryan Rossi, Somdeb Sarkhel, Nesreen Ahmed

In this work, we formalize the problem of causal inference over graph-based relational time-series data where each node in the graph has one or more time-series associated to it. W…

cs.LG2020

Scalable Bid Landscape Forecasting in Real-time Bidding

Aritra Ghosh, Saayan Mitra, Somdeb Sarkhel +3

In programmatic advertising, ad slots are usually sold using second-price (SP) auctions in real-time. The highest bidding advertiser wins but pays only the second-highest bid (know…