Customer-obsessed science
Research areas
-
October 1, 202610 min readAugmenting a network graph with agentic AI produces a “digital twin” that can help isolate network failures.
-
-
August 21, 20269 min read
-
July 30, 20268 min read
-
July 29, 20266 min read
Featured news
-
EACL 20232023A novel feature represents a cluster of semantically equivalent novel user requests e.g., requests to play a song on a service or reading user’s messages. Detecting and supporting novel features is crucial towards wider adoption of dialog systems by end users. Intuitively, features are represented by a combination of intents, slot types and/or their values. For example, while playing a song is a feature
-
EACL 20232023Pre-trained neural masked language models are often used for predicting a replacement token for a given sequence position, in a cloze-like task. However, this usage is restricted to predicting a single token, from a relatively small pre-trained vocabulary. Recent Sequence2Sequence pre-trained LMs like T5 do allow predicting multi-token completions, but are more expensive to train and run. We show that pre-trained
-
EACL 20232023For extreme multi-label classification (XMC), existing classification-based models poorly perform for tail labels and often ignore the semantic relations among labels, like treating “Wikipedia” and “Wiki” as independent and separate labels. In this paper, we cast XMC as a generation task (XLGen), where we benefit from pre-trained text-to-text models. However, generating labels from the extremely large label
-
EACL 20232023Collecting high quality conversational data can be very expensive for most applications and infeasible for others due to privacy, ethical, or similar concerns. A promising direction to tackle this problem is to generate synthetic dialogues by prompting large language models. In this work, we use a small set of expert-written conversations as in-context examples to synthesize a social conversation dataset
-
European Journal of Operational Research2023This paper addresses instances of the temporal fixed-charge multi-commodity flow (tfMCF) problem that arise in a very large scale dynamic transportation application. We model the tfMCF as a discrete-time Resource Task Network (RTN) with cyclic schedule, and formulate it as a mixed-integer program. These problems are notoriously hard to solve due to their time-expanded nature, and their size renders their
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all