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
-
Interspeech 20222022Neural vocoders have recently demonstrated high quality speech synthesis, but typically require a high computational complexity. LPCNet was proposed as a way to reduce the complexity of neural synthesis by using linear prediction (LP) to assist an autoregressive model. At inference time, LPCNet relies on the LP coefficients being explicitly computed from the input acoustic features. That makes the design
-
AutoML Conference 20222022Key factors underpinning the optimal Knowledge Distillation (KD) performance remain elusive as the effects of these factors are often confounded in sophisticated distillation algorithms. This poses a challenge for choosing the best distillation algorithm from the large design space for existing and new tasks alike and hinders automated distillation. In this work, we aim to identify how the distillation
-
Interspeech 20222022As deep speech enhancement algorithms have recently demonstrated capabilities greatly surpassing their traditional counterparts for suppressing noise, reverberation and echo, attention is turning to the problem of packet loss concealment (PLC). PLC is a challenging task because it not only involves real-time speech synthesis, but also frequent transitions between the received audio and the synthesized concealment
-
Interspeech 20222022We propose a learning-to-rank (LTR) approach to the ASR rescoring problem. The proposed LTR framework has the flexibility of embracing wide varieties of linguistic, semantic, and implicit user feedback signals in rescoring process. BERTbased confidence models (CM) taking account of both acoustic and text information are also proposed to provide features better representing hypothesis quality to the LTR
-
SIGIR 2022 Workshop on Reaching Efficiency in Neural Information Retrieval2022The Plackett-Luce (PL) model is popular in learning-to-rank (LTR) because it provides a useful and intuitive probabilistic model for sampling ranked lists. Counterfactual offline evaluation and optimization of ranking metrics are pivotal for using LTR methods in production. When adopting the PL model as a ranking policy, both tasks require the computation of expectations with respect to the model. These
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all