Customer-obsessed science
Research areas
-
October 29, 20265 min readTwo optimization techniques, when combined, can significantly improve a model’s speed and cost effectiveness without sacrificing quality.
-
-
October 20, 20263 min read
-
October 12, 202614 min read
-
Featured news
-
Journal of Proteome Research2020There have been more than 2.2 million confirmed cases and over 120 000 deaths from the human coronavirus disease 2019 (COVID-19) pandemic, caused by the novel severe acute respiratory syndrome coronavirus (SARS-CoV-2), in the United States alone. However, there is currently a lack of proven effective medications against COVID-19. Drug repurposing offers a promising route for the development of prevention
-
KDD Converse 20202020An automated metric to evaluate dialogue quality is critical for continuously optimizing large-scale conversational agent systems such as Alexa. Previous approaches for tackling this problem often rely on a limited set of manually designed and/or heuristic features, which cannot be easily scaled to a large number of domains or scenarios. In this paper, we present Interaction-Quality-Network (IQ-Net), a
-
ICML 2020 Workshop on HILL2020Contextual bandit algorithms are extremely popular and widely used in recommendation systems to provide online personalized recommendations. A recurrent assumption is the stationarity of the reward function, which is rather unrealistic in most of the real-world applications. In the music recommendation scenario for instance, people’s music taste can abruptly change during certain events, such as Halloween
-
ECCV 20202020Deep neural networks are known to be susceptible to adversarial noise, which is tiny and imperceptible perturbation. Most previous works on adversarial attack mainly focus on image models, while the vulnerability of video models is less explored. In this paper, we aim to attack video models by utilizing intrinsic movement patterns and regional relative motion among video frames. We propose an effective
-
ICML 20202020Continual Learning (CL) algorithms incrementally learn a predictor or representation across multiple sequentially observed tasks. Designing CL algorithms that perform reliably and avoid so-called catastrophic forgetting has proven a persistent challenge. The current paper develops a theoretical approach that explains why. In particular, we derive the computational properties which CL algorithms would have
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all