Siddhartha Mishra

I’m a Machine Learning Researcher at Palantir. My research interests are in Natural Language Understanding, Structured data prediction, and Retrieval Augmented Generation with LLMs.

Previously, I was an Applied science intern at Amazon Alexa AI - NLU and an Analyst at Goldman Sachs. I was supervised by Prof. Andrew McCallum during my grad school at UMass NLP. I also did my Bachelor’s in Computer Science at Indian Institute of Technology, Hyderabad, where I worked on Bayesian Machine Learning and Natural Language Processing with Prof. Srijith P.K..

Selected Publications

EMNLP

Benchmarking Generalization via In-Context Instructions on 1,600+ Language Tasks

Wang, Yizhong, Mishra, Swaroop, Alipoormolabashi, Pegah, Mishra, Siddhartha, and others,

2022

Abs HTML Code

How can we measure the generalization of models to a variety of unseen tasks when provided with their language instructions? To facilitate progress in this goal, we introduce Natural-Instructions v2, a benchmark of 1,600+ diverse language tasks and their expert-written instructions. It covers 70+ distinct task types, such as tagging, in-filling, and rewriting. These tasks are collected with contributions of NLP practitioners in the community and through an iterative peer review process to ensure their quality. With this large and diverse collection of tasks, we are able to rigorously benchmark cross-task generalization of models – training on a subset of tasks and evaluating on the remaining unseen ones. For instance, we quantify generalization as a function of various scaling parameters, such as the number of observed tasks, the number of instances, and model sizes. Based on these insights, we introduce Tk-Instruct, an encoder-decoder Transformer that is trained to follow a variety of in-context instructions (plain language task definitions or k-shot examples) which outperforms existing larger models on our benchmark. We hope this benchmark facilitates future progress toward more general-purpose language understanding models.
ACL

Word2Box: Capturing Set-Theoretic Semantics of Words using Box Embeddings

Dasgupta, Shib, Boratko, Michael, Mishra, Siddhartha, Atmakuri, Shriya, Patel, Dhruvesh, Li, Xiang, and McCallum, Andrew

In Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) 2022

Abs HTML

Learning representations of words in a continuous space is perhaps the most fundamental task in NLP, however words interact in ways much richer than vector dot product similarity can provide. Many relationships between words can be expressed set-theoretically, for example, adjective-noun compounds (eg. “red cars”⊆“cars”) and homographs (eg. “tongue”∩“body” should be similar to “mouth”, while “tongue”∩“language” should be similar to “dialect”) have natural set-theoretic interpretations. Box embeddings are a novel region-based representation which provide the capability to perform these set-theoretic operations. In this work, we provide a fuzzy-set interpretation of box embeddings, and learn box representations of words using a set-theoretic training objective. We demonstrate improved performance on various word similarity tasks, particularly on less common words, and perform a quantitative and qualitative analysis exploring the additional unique expressivity provided by Word2Box.
AAAI

An Evaluative Measure of Clustering Methods Incorporating Hyperparameter Sensitivity

Mishra, Siddhartha, Monath, Nicholas, Boratko, Michael, Kobren, Ari, and McCallum, Andrew

In Proceedings of the AAAI Conference on Artificial Intelligence 2022

Abs HTML Code

Abstract: Clustering algorithms are often evaluated using metrics which compare with ground-truth cluster assignments, such as Rand index and NMI. Algorithm performance may vary widely for different hyperparameters, however, and thus model selection based on optimal performance for these metrics is discordant with how these algorithms are applied in practice, where labels are unavailable and tuning is often more art than science. It is therefore desirable to compare clustering algorithms not only on their optimally tuned performance, but also some notion of how realistic it would be to obtain this performance in practice. We propose an evaluation of clustering methods capturing this ease-of-tuning by modeling the expected best clustering score under a given computation budget. To encourage the adoption of the proposed metric alongside classic clustering evaluations, we provide an extensible benchmarking framework. We perform an extensive empirical evaluation of our proposed metric on popular clustering algorithms over a large collection of datasets from different domains, and observe that our new metric leads to several noteworthy observations.