Search Results for author: Koustav Rudra

Found 16 papers, 8 papers with code

Data Augmentation for Sample Efficient and Robust Document Ranking

no code implementations26 Nov 2023 Abhijit Anand, Jurek Leonhardt, Jaspreet Singh, Koustav Rudra, Avishek Anand

We then adapt a family of contrastive losses for the document ranking task that can exploit the augmented data to learn an effective ranking model.

Data Augmentation Document Ranking

Understanding Lexical Biases when Identifying Gang-related Social Media Communications

no code implementations22 Apr 2023 Dhiraj Murthy, Constantine Caramanis, Koustav Rudra

Individuals involved in gang-related activity use mainstream social media including Facebook and Twitter to express taunts and threats as well as grief and memorializing.

A Review of the Role of Causality in Developing Trustworthy AI Systems

1 code implementation14 Feb 2023 Niloy Ganguly, Dren Fazlija, Maryam Badar, Marco Fisichella, Sandipan Sikdar, Johanna Schrader, Jonas Wallat, Koustav Rudra, Manolis Koubarakis, Gourab K. Patro, Wadhah Zai El Amri, Wolfgang Nejdl

This review aims to provide the reader with an overview of causal methods that have been developed to improve the trustworthiness of AI models.

Supervised Contrastive Learning Approach for Contextual Ranking

no code implementations7 Jul 2022 Abhijit Anand, Jurek Leonhardt, Koustav Rudra, Avishek Anand

This paper proposes a simple yet effective method to improve ranking performance on smaller datasets using supervised contrastive learning for the document ranking problem.

Contrastive Learning Data Augmentation +2

Efficient Neural Ranking using Forward Indexes

1 code implementation12 Oct 2021 Jurek Leonhardt, Koustav Rudra, Megha Khosla, Abhijit Anand, Avishek Anand

In this paper, we propose the Fast-Forward index -- a simple vector forward index that facilitates ranking documents using interpolation of lexical and semantic scores -- as a replacement for contextual re-rankers and dense indexes based on nearest neighbor search.

Document Ranking Retrieval +2

FaxPlainAC: A Fact-Checking Tool Based on EXPLAINable Models with HumAn Correction in the Loop

no code implementations12 Sep 2021 Zijian Zhang, Koustav Rudra, Avishek Anand

It is therefore important to conduct user studies to correct models' inference biases and improve the model in a life-long learning manner in the future according to the user feedback.

Explainable Models Fact Checking

Extractive Explanations for Interpretable Text Ranking

1 code implementation23 Jun 2021 Jurek Leonhardt, Koustav Rudra, Avishek Anand

We introduce the Select-and-Rank paradigm for document ranking, where we first output an explanation as a selected subset of sentences in a document.

Document Ranking Retrieval +1

An In-depth Analysis of Passage-Level Label Transfer for Contextual Document Ranking

1 code implementation30 Mar 2021 Koustav Rudra, Zeon Trevor Fernando, Avishek Anand

However, the documents are longer than the passages and such document ranking models suffer from the token limitation (512) of BERT.

Document Ranking Retrieval

Explain and Predict, and then Predict Again

1 code implementation11 Jan 2021 Zijian Zhang, Koustav Rudra, Avishek Anand

A desirable property of learning systems is to be both effective and interpretable.

Explanation Generation Fact Verification +4

Stance Detection in Web and Social Media: A Comparative Study

1 code implementation12 Jul 2020 Shalmoli Ghosh, Prajwal Singhania, Siddharth Singh, Koustav Rudra, Saptarshi Ghosh

Online forums and social media platforms are increasingly being used to discuss topics of varying polarities where different people take different stances.

Stance Detection

Functions of Code-Switching in Tweets: An Annotation Framework and Some Initial Experiments

no code implementations LREC 2016 Rafiya Begum, Kalika Bali, Monojit Choudhury, Koustav Rudra, Niloy Ganguly

Code-Switching (CS) between two languages is extremely common in communities with societal multilingualism where speakers switch between two or more languages when interacting with each other.

Cannot find the paper you are looking for? You can Submit a new open access paper.