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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tejaswi Tenneti

dblp:164/2958 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0008-7301-6958ORCID · reported

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Artificial intelligence and machine learning · 1 · 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
2 papers
Information retrieval · 53% Recommender systems · 47%

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

TopicWeightPapersLastEvidence papers
Recommender systems
e-commerce recommendation
1.012026
A Cascaded Generative Approach for e-Commerce Recommendations · SIGIR 2026
Recommender systems
generative recommendation
1.012026
A Cascaded Generative Approach for e-Commerce Recommendations · SIGIR 2026
Information retrieval › evaluation
relevance judgment
0.812024
Mitigating Pooling Bias in E-commerce Search via False Negative Estimation · KDD 2024
Information retrieval
retrieval evaluation
0.812024
Mitigating Pooling Bias in E-commerce Search via False Negative Estimation · KDD 2024
Information retrieval
e-commerce search
0.522026
A Cascaded Generative Approach for e-Commerce Recommendations · SIGIR 2026
Mitigating Pooling Bias in E-commerce Search via False Negative Estimation · KDD 2024
Information retrieval
search engines
0.212024
Mitigating Pooling Bias in E-commerce Search via False Negative Estimation · KDD 2024

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

teacher-student fine-tuning · 1.0large language model · 1.0generative modeling · 1.0hard negative sampling · 0.8false negative estimation · 0.8
YearPublicationVenuePosition
2026 A Cascaded Generative Approach for e-Commerce Recommendations
abstract
Personalized storefronts in large e-commerce marketplaces are often assembled from many independent components: static themes per page section (''placement''), retrieval systems to fetch eligible products per placement, and pointwise rankers to order content. While effective in optimizing for aggregate preferences, this paradigm is rigid and can limit personalization and semantic cohesion across the page. This makes it poorly suited to support dynamic objectives and merchandising requirements over time. To address this, we introduce a cascaded merchandising framework that decomposes storefront construction into two generative tasks: (i) placement-level theme generation and (ii) constrained keyword generation per placement to power product retrieval. Teacher–student fine-tuning is leveraged to improve scalability of this framework under production latency and cost constraints. Fine-tuned model ablations are shown to approach closed-weight LLM performance. We further contribute frameworks for AI-driven content evaluation and quality filtering, enabling safe and automated deployment of dynamic content at scale. Generative output is fused with traditional ranking models to preserve hybrid infrastructure. In online experiments, this framework yields an estimated +2.7% lift in cart adds per page view over a strong baseline.
Moein Hasani, Hamidreza Shahidi, Trace Levinson, Yuan Zhong 0002, Guanghua Shu, Vinesh Gudla, Tejaswi Tenneti
SIGIR7
2024 Mitigating Pooling Bias in E-commerce Search via False Negative Estimation
abstract
Efficient and accurate product relevance assessment is critical for user experiences and business success. Training a proficient relevance assessment model requires high-quality query-product pairs, often obtained through negative sampling strategies. Unfortunately, current methods introduce pooling bias by mistakenly sampling false negatives, diminishing performance and business impact. To address this, we present Bias-mitigating Hard Negative Sampling (BHNS), a novel negative sampling strategy tailored to identify and adjust for false negatives, building upon our original False Negative Estimation algorithm. Our experiments in the Instacart search setting confirm BHNS as effective for practical e-commerce use. Furthermore, comparative analyses on public dataset showcase its domain-agnostic potential for diverse applications.
Xiaochen Wang 0002, Ruhan Zhang, Taesik Na, Tejaswi Tenneti, Haixun Wang, Fenglong Ma
KDD6