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
-
CIKM 20202020Personalization is a crucial aspect of many online experiences. In particular, content ranking is often a key component in delivering sophisticated personalization results. Commonly, supervised learning-to-rank methods are applied, which suffer from bias introduced during data collection by production systems in charge of producing the ranking. To compensate for this problem, we leverage contextual multi-armed
-
Interspeech 20202020General embeddings like word2vec, GloVe and ELMo have shown a lot of success in natural language tasks. The embeddings are typically extracted from models that are built on general tasks such as skip-gram models and natural language generation. In this paper, we extend the work from natural language understanding to multi-modal architectures that use audio, visual and textual information for machine learning
-
CIKM 20202020Natural-language-understanding (NLU) models on voice-controlled speakers face several challenges. In particular, music streaming services have large catalogues, often containing millions of songs, artists, and albums and several thousands of custom playlists and stations. In many cases there is ambiguity and little structural difference between carrier phrases and entity names. In this work, we describe
-
DSAA 20202020Developing learning methods which do not discriminate subgroups in the population is the central goal of algorithmic fairness. One way to reach this goal is by modifying the data representation in order to satisfy prescribed fairness constraints. This allows to reuse the same representation in other context (tasks) without discriminate subgroups. In this work we measure fairness according to demographic
-
EMNLP 2020 Workshop on Data Integration and Applications2020In the field of database deduplication, the goal is to find approximately matching records within a database. Blocking is a typical stage in this process that involves cheaply finding candidate pairs of records that are potential matches for further processing. We present here Hashed Dynamic Blocking, a new approach to blocking designed to address datasets larger than those studied in most prior work. Hashed
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all