Customer-obsessed science
Research areas
-
October 23, 20266 min read“Controllable text to speech” makes speech more expressive, character voices more distinct and consistent.
-
October 22, 20267 min read
-
October 20, 20263 min read
-
October 12, 202614 min read
-
Featured news
-
Interspeech 20182018In this paper we investigate statistical model compression applied to natural language understanding (NLU) models. Small-footprint NLU models are important for enabling offline systems on hardware restricted devices, and for decreasing on demand model loading latency in cloud-based systems. To compress NLU models, we present two main techniques, parameter quantization and perfect feature hashing. These
-
CIKM 20182018The success of applications that process data critically depends on the quality of the ingested data. Completeness of a data source is essential in many cases. Yet, most missing value imputation approaches suffer from severe limitations. They are almost exclusively restricted to numerical data, and they either offer only simple imputation methods or are difficult to scale and maintain in production. Here
-
NeurIPS 20182018Modern machine learning (ML) systems are comprised of complex ML pipelines which typically have many implicit assumptions about the data they consume (e.g., about the scales of variables, the presence of missing values or the dictionary of categorical values). Violations of these assumptions can result in crashes or wrong predictions. We therefore present Deequ, a library that allows users to explicitly
-
ECCV 20182018We propose a framework that harnesses visual cues in an unsupervised manner to learn the co-occurrence distribution of items in real-world images for complementary recommendation. Our model learns a non-linear transformation between the two manifolds of source and target item categories (e.g., tops and bottoms in outfits). Given a large dataset of images containing instances of co-occurring items, we train
-
ICDM 20182018Identifying sets of items that are equivalent to one another is a problem common to many fields. Systems addressing this generally have at their core a function s(di, dj ) for computing the similarity between pairs of records di, dj . The output of s() can be interpreted as a weighted graph where edges indicate the likelihood of two records matching. Partitioning this graph into equivalence classes is non-trivial
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all