arXiv (All)
open access
Cut Binary Cross Entropy: Efficient Large-Vocabulary Loss and Gradient Kernels for Sequential Recommendation
Industrial sequential recommender systems operate over massive item catalogs (e.g., 10^5--10^7 items). Multi-label recommendation models are trained with Binary Cross-Entropy (BCE) loss over the full vocabulary, but standard BCE materializes a dense [B, N, V] logits tensor in High Bandwidth Memory (
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- SetMIR: Multi-Interest Retrieval as Set Prediction#799467
- SetMIR: Multi-Interest Retrieval as Set Prediction#798044
- Dual-Interest Sequential Product Recommendation With Multi-Granular SSM#1035945
- IISAN: Efficiently Adapting Multimodal Representation for Sequential Recommendation with Decoupled PEFT#226724
- TME-PSR: Time-aware, Multi-interest, and Explanation Personalization for Sequential Recommendation#6002
Record · ID 1201572
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive