Predicting Query-Item Relationship using Adversarial Training and Robust Modeling Techniques
We present an effective way to predict search query-item relationship. We combine pre-trained transformer and LSTM models, and increase model robustness using adversarial training, exponential moving average, multi-sampled dropout, and diversity based ensemble, to tackle an extremely difficult problem of predicting against queries not seen before. All of our strategies focus on increasing robustness of deep learning models and are applicable in any task where deep learning models are used. Applying our strategies, we achieved 10th place in KDD Cup 2022 Product Substitution Classification task.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep LearningDiversityMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
LECF: Recommendation via Learnable Edge Collaborative Filtering
The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering (CF) algorithms compute the likelihood by utilizing simple …
Collaborative FilteringZero-Shot Heterogeneous Transfer Learning from Recommender Systems to Cold-Start Search Retrieval
Many recent advances in neural information retrieval models, which predict top-K items given a query, learn directly from a large training set of (query, item) pairs. However, they are often insufficient when there are m…
Information RetrievalRecommendation SystemsRetrievalTransfer LearningLight-weight End-to-End Graph Interest Network for CTR Prediction in E-commerce Search
Click-through-rate (CTR) prediction has an essential impact on improving user experience and revenue in e-commerce search. With the development of deep learning, graph-based methods are well exploited to utilize graph st…
Click-Through Rate PredictionGraph EmbeddingGraph LearningGraph Sampling+1Predicting Novel Views Using Generative Adversarial Query Network
The problem of predicting a novel view of the scene using an arbitrary number of observations is a challenging problem for computers as well as for humans. This paper introduces the Generative Adversarial Query Network (…
DecoderNovel View SynthesisOnline Local Learning via Semidefinite Programming
In many online learning problems we are interested in predicting local information about some universe of items. For example, we may want to know whether two items are in the same cluster rather than computing an assignm…
Clusteringglobal-optimization