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
-
AAAI 20232023Ensuring the overall end-user experience is a challenging task in arbitrary style transfer (AST) due to the subjective nature of style transfer quality. A good practice is to provide users many instead of one AST result. However, existing approaches require to run multiple AST models or inference a diversified AST (DAST) solution multiple times, and thus they are either slow in speed or limited in diversity
-
AAAI 20232023Pretrained code language models have enabled great progress towards program synthesis. However, common approaches only consider in-file local context and thus miss information and constraints imposed by other parts of the codebase and its external dependencies. Existing code completion benchmarks also lack such context. To resolve these restrictions we curate a new dataset of permissively licensed Python
-
WSDM 20232023An essential part of making a purchase decision when shopping is to compare and contrast products based on key differentiating features, but manually examining product features online or with voice assistants can be overwhelming. Automatically generating an informative, natural-sounding, and factually consistent comparative text across multiple product domains and attribute types is a challenging research
-
QIP 20232023A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that has a nonnegligible overlap with a low-energy state. However, it is notoriously hard to give theoretical guarantees that such a trial state can be prepared efficiently
-
QIP 20232023Topological invariants of a dataset, such as the number of holes that survive from one length scale to another (persistent Betti numbers) can be used to analyse and classify data in machine learning applications. We present an improved quantum algorithm for computing persistent Betti numbers, and provide an end-to-end complexity analysis. Our approach provides large polynomial time improvements, and an
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all