activity
20212026
most citedExplain and Predict, and then Predict Again

45 citations · 127 across the 24 of their papers we have counts for

collaborators
Showing 2024Show all

9 papers · 1 filter

cs.AI2024

DISCO: DISCovering Overfittings as Causal Rules for Text Classification Models

Zijian Zhang, Vinay Setty, Yumeng Wang +1

With the rapid advancement of neural language models, the deployment of over-parameterized models has surged, increasing the need for interpretable explanations comprehensible to h…

cs.LG2024

EXPLORA: Efficient Exemplar Subset Selection for Complex Reasoning

Kiran Purohit, Venktesh V, Raghuram Devalla +3

Answering reasoning-based complex questions over text and hybrid sources, including tables, is a challenging task. Recent advances in large language models (LLMs) have enabled in-c…

cs.IR2024

Understanding the User: An Intent-Based Ranking Dataset

Abhijit Anand, Jurek Leonhardt, V Venktesh +1

As information retrieval systems continue to evolve, accurate evaluation and benchmarking of these systems become pivotal. Web search datasets, such as MS MARCO, primarily provide…

cs.LG2024

Local Feature Selection without Label or Feature Leakage for Interpretable Machine Learning Predictions

Harrie Oosterhuis, Lijun Lyu, Avishek Anand

Local feature selection in machine learning provides instance-specific explanations by focusing on the most relevant features for each prediction, enhancing the interpretability of…

cs.CL2024★ 1 cited

DEXTER: A Benchmark for open-domain Complex Question Answering using LLMs

Venktesh V. Deepali Prabhu, Avishek Anand

Open-domain complex Question Answering (QA) is a difficult task with challenges in evidence retrieval and reasoning. The complexity of such questions could stem from questions bein…

cs.IR2024

Is Interpretable Machine Learning Effective at Feature Selection for Neural Learning-to-Rank?

Lijun Lyu, Nirmal Roy, Harrie Oosterhuis +1

Neural ranking models have become increasingly popular for real-world search and recommendation systems in recent years. Unlike their tree-based counterparts, neural models are muc…

cs.CL2024

QuanTemp: A real-world open-domain benchmark for fact-checking numerical claims

Venktesh V, Abhijit Anand, Avishek Anand +1

Automated fact checking has gained immense interest to tackle the growing misinformation in the digital era. Existing systems primarily focus on synthetic claims on Wikipedia, and…

cs.IR2024

The Surprising Effectiveness of Rankers Trained on Expanded Queries

Abhijit Anand, Venktesh V, Vinay Setty +1

An important problem in text-ranking systems is handling the hard queries that form the tail end of the query distribution. The difficulty may arise due to the presence of uncommon…

cs.CL2024

Temporal Blind Spots in Large Language Models

Jonas Wallat, Adam Jatowt, Avishek Anand

Large language models (LLMs) have recently gained significant attention due to their unparalleled ability to perform various natural language processing tasks. These models, benefi…