Learning Robust Models for e-Commerce Product Search (2020.acl-main)

Copied to clipboard

Challenge: Existing models that understand search intent are difficult to learn due to lack of labeled datasets.
Approach: They develop a deep, end-to-end model that learns to effectively classify mismatches . they introduce a latent variable into the cross-entropy loss that alternates between real and generated samples .
Outcome: The proposed model achieves a relative gain of over 26% in F-score and 17% in Area Under PR curve on live search traffic in multiple countries.

Similar Papers

Deep Metric Learning to Hierarchically Rank - An Application in Product Retrieval (2023.emnlp-industry)

Copied to clipboard

Challenge: e-commerce search engines use customer behavior signals to augment lexical matching and improve search relevance.
Approach: They propose a method to identify duplicate and near-duplicate products across stores . they use Hierarchical Ranked Multi Similarity Loss to learn hierarchical metric space .
Outcome: The proposed model outperforms baselines in terms of catalog coverage and precision of the mappings.
Neural Network based Extreme Classification and Similarity Models for Product Matching (N18-3)

Copied to clipboard

Challenge: Matching a seller listed item to an appropriate product has become a fundamental step for e-commerce platforms.
Approach: They propose to use a shallow neural network to match a seller's item to an appropriate product . they also propose a similarity approach based on deep siamese network to train and infer product information.
Outcome: The proposed models outperform the baseline models by more than 5% in terms of accuracy and are capable of efficient training and inference.
Centrality-aware Product Retrieval and Ranking (2024.emnlp-industry)

Copied to clipboard

Challenge: Ambiguity and complexity of user queries often lead to mismatch between user’s intent and retrieved product titles or documents.
Approach: They propose a user-intent centrality optimization approach which optimizes for the user intent in semantic product search.
Outcome: The proposed approach improves product ranking efficiency for ambiguous queries and lexical terms with alphanumeric characters.
ProductResearch: Training E-Commerce Deep Research Agents via Multi-Agent Synthetic Trajectory Distillation (2026.acl-industry)

Copied to clipboard

Challenge: Existing LLM-based agents lack the interaction depth and contextual breadth required for complex product research.
Approach: They propose a multi-agent framework that synthesizes high-fidelity tool-use trajectories for training robust e-commerce shopping agents.
Outcome: The proposed framework synthesizes high-fidelity, long-horizon tool-use trajectories for training robust e-commerce shopping agents.
Stronger, Lighter, Better: Towards Life-Long Attribute Value Extraction for E-Commerce Products (2024.findings-acl)

Copied to clipboard

Challenge: Existing models for attribute value extraction struggle for parameter efficiency and reliability due to data contamination and catastrophic forgetting.
Approach: They propose to decouple product type and attribute to promote de-contamination and parameter efficiency while scaling up.
Outcome: The proposed model achieves state-of-the-art performance with affordable parameter size, least historical knowledge forgetting, and greatest robustness against noises.
Augmenting Training Data for Massive Semantic Matching Models in Low-Traffic E-commerce Stores (2022.naacl-industry)

Copied to clipboard

Challenge: Existing methods to augment training data for e-commerce stores using behavioral data are limited in low-traffic stores . eXtreme multi-label classification systems require large amounts of customer behavior data .
Approach: They propose a technique that augments behavioral training data via query reformulation . they use an example semantic matching model from the e-commerce store AL-XMC .
Outcome: The proposed method improves quality of the AL-XMC model over a baseline model.
Gumbel Reranking: Differentiable End-to-End Reranker Optimization (2025.acl-long)

Copied to clipboard

Challenge: Existing distillation-based approaches suffer from training-inference misalignment and fail to capture interdependencies among candidate documents.
Approach: They propose a method to optimize rerankers by learning a stochastic, document-wise Top-k attention mask using the Gumbel Trick and Relaxed Top-K Sampling.
Outcome: The proposed framework minimizes the overall language loss and improves recall on hotpotQA.
Adversarial Metric Learning for Fine-Grained Emotion Classification (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in fine-grained emotion classification relied on contrastive learning with hard-pair mining.
Approach: They propose an adversarial metric learning framework that replaces fixed similarity metrics with a learnable metric family and trains representations to remain discriminative under worst-case similarity distortions.
Outcome: The proposed framework trains a pairwise discriminator to maximally confuse two hard pair types while training the encoder to remain discriminative under worst-case similarity distortions.
Search Query Spell Correction with Weak Supervision in E-commerce (2023.acl-industry)

Copied to clipboard

Challenge: Misspelled search queries can lead to empty or irrelevant products . only 29% of the population in india is proficient in english .
Approach: They propose to group spell errors into error classes and then leverage a Transformer model for contextual spell correction.
Outcome: The proposed model improves on tough spell mistakes without human intervention without human input.
End-to-End Self-Debiasing Framework for Robust NLU Training (2021.findings-acl)

Copied to clipboard

Challenge: Existing models incorporate dataset biases leading to strong performance on in-distribution test sets but poor performance on out-of-distortion (OOD) tests.
Approach: They propose a debiasing framework where the shallow representations of the main model are used to derive a bias model and both models are trained simultaneously.
Outcome: The proposed framework outperforms existing approaches on three well-studied NLU tasks while still delivering high in-distribution performance.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations