activity
20122022
most citedGupShup: An Annotated Corpus for Abstractive Summarization of Open-Domain Code-Switched Conversations

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

collaborators

10 papers

cs.CL20226 cited

LDKP: A Dataset for Identifying Keyphrases from Long Scientific Documents

Debanjan Mahata, Navneet Agarwal, Dibya Gautam +5

Identifying keyphrases (KPs) from text documents is a fundamental task in natural language processing and information retrieval. Vast majority of the benchmark datasets for this ta…

cs.CL2021

DISCO : efficient unsupervised decoding for discrete natural language problems via convex relaxation

Anish Acharya, Rudrajit Das

In this paper we study test time decoding; an ubiquitous step in almost all sequential text generation task spanning across a wide array of natural language processing (NLP) proble…

cs.LG20217 cited

Robust Training in High Dimensions via Block Coordinate Geometric Median Descent

Anish Acharya, Abolfazl Hashemi, Prateek Jain +3

Geometric median (\textsc{Gm}) is a classical method in statistics for achieving a robust estimation of the uncorrupted data; under gross corruption, it achieves the optimal breakd…

cs.CL20213 cited

Alexa Conversations: An Extensible Data-driven Approach for Building Task-oriented Dialogue Systems

Anish Acharya, Suranjit Adhikari, Sanchit Agarwal +28

Traditional goal-oriented dialogue systems rely on various components such as natural language understanding, dialogue state tracking, policy learning and response generation. Trai…

cs.CL20218 cited

GupShup: An Annotated Corpus for Abstractive Summarization of Open-Domain Code-Switched Conversations

Laiba Mehnaz, Debanjan Mahata, Rakesh Gosangi +7

Code-switching is the communication phenomenon where speakers switch between different languages during a conversation. With the widespread adoption of conversational agents and ch…

stat.ML2020

Faster Non-Convex Federated Learning via Global and Local Momentum

Rudrajit Das, Anish Acharya, Abolfazl Hashemi +3

We propose \texttt{FedGLOMO}, a novel federated learning (FL) algorithm with an iteration complexity of to converge to an -stationary point (i.e., $\math…