Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Paul Baltescu

dblp:156/0183 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › large-scale recommendation › multi-stage recommender systems
candidate generation
0.612022
ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest · KDD 2022
Recommender systems › representation learning for recommendation
embedding-based recommendation
0.612022
ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest · KDD 2022
Recommender systems › representation learning for recommendation
product representation learning
0.612022
ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest · KDD 2022

Methods — techniques the papers use, named apart from their topics

transformer · 0.6multi-task learning · 0.6contrastive learning · 0.6
YearPublicationVenuePosition
2022 ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest
abstract
Learned embeddings for products are an important building block for web-scale e-commerce recommendation systems. At Pinterest, we build a single set of product embeddings called ItemSage to provide relevant recommendations in all shopping use cases including user, image and search based recommendations. This approach has led to significant improvements in engagement and conversion metrics, while reducing both infrastructure and maintenance cost. While most prior work focuses on building product embeddings from features coming from a single modality, we introduce a transformer-based architecture capable of aggregating information from both text and image modalities and show that it significantly outperforms single modality baselines. We also utilize multi-task learning to make ItemSage optimized for several engagement types, leading to a candidate generation system that is efficient for all of the engagement objectives of the end-to-end recommendation system. Extensive offline experiments are conducted to illustrate the effectiveness of our approach and results from online A/B experiments show substantial gains in key business metrics (up to +7% gross merchandise value/user and +11% click volume).
Paul Baltescu, Nikil Pancha, Andrew Zhai, Jure Leskovec, Charles Rosenberg 0001
KDD1
2015 Pragmatic Neural Language Modelling in Machine Translation
abstract
This paper presents an in-depth investigation on integrating neural language models in translation systems. Scaling neural language models is a difficult task, but crucial for real-world applications. This paper evaluates the impact on end-to-end MT quality of both new and existing scaling techniques. We show when explicitly normalising neural models is necessary and what optimisation tricks one should use in such scenarios. We also focus on scalable training algorithms and investigate noise contrastive estimation and diagonal contexts as sources for further speed improvements. We explore the trade-offs between neural models and back-off n-gram models and find that neural models make strong candidates for natural language applications in memory constrained environments, yet still lag behind traditional models in raw translation quality. We conclude with a set of recommendations one should follow to build a scalable neural language model for MT.
Paul Baltescu, Phil Blunsom
HLT-NAACL1