NSGR is a tree-structured generative reranker that progressively generates optimal lists via next-scale expansion and multi-scale neighbor loss to balance perspectives and align training signals.
hub
InProceedings of the 1st workshop on deep learning for recommender systems
13 Pith papers cite this work. Polarity classification is still indexing.
13
Pith papers citing it
hub tools
citation-role summary
background 2
method 1
citation-polarity summary
representative citing papers
DNNs mitigate dimensional collapse of embeddings in feature interaction models, shown via parallel and stacked experiments plus gradient analysis.
MTServe achieves up to 3.1x speedup for generative recommendation model serving by using hierarchical caches with host RAM and system optimizations while keeping cache hit ratios above 98.5%.
RankUp raises effective rank of representations in deep MetaFormer recommenders via randomized splitting and multi-embeddings, delivering 2-5% GMV gains in production deployments at Weixin.
PGHS fuses policy-guided LLM reasoning and ML fitting to simulate group user behavior with 8.8% error on Meituan data from 101 merchants and 26k trajectories, beating pure reasoning and fitting baselines by 45.8% and 40.9%.
Speculative precomputation of foundation-model user–item embeddings decouples heavy inference from the serving path and yields 0.67% revenue gain at Meta ads scale.
MBGR is a new generative recommendation framework using business-aware semantic IDs, multi-business prediction, and label dynamic routing to handle multiple businesses without seesaw effects or representation confusion, validated by experiments and deployed at Meituan.
MoS applies theme-aware routing to extract multi-scale theme-specific subsequences from noisy long user sequences, achieving state-of-the-art recommendation performance with fewer FLOPs than comparable MoE models.
Next Interest Flow models user intent as continuous evolutionary trajectories on a high-dimensional latent interest manifold with kinematic constraints, bidirectional alignment, and temporal causality mechanisms, yielding reported gains on industrial CTR data.
SSR uses static random filters and iterative competitive sparse mechanisms to explicitly enforce sparsity in recommendation models, outperforming dense baselines on public and billion-scale industrial datasets.
TASTE dataset and MuQ-token aggregation enable effective use of audio features from large music models to improve content-based music recommendations over collaborative filtering alone.
citing papers explorer
-
Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan
NSGR is a tree-structured generative reranker that progressively generates optimal lists via next-scale expansion and multi-scale neighbor loss to balance perspectives and align training signals.
-
Understanding DNNs in Feature Interaction Models: A Dimensional Collapse Perspective
DNNs mitigate dimensional collapse of embeddings in feature interaction models, shown via parallel and stacked experiments plus gradient analysis.
-
MTServe: Efficient Serving for Generative Recommendation Models with Hierarchical Caches
MTServe achieves up to 3.1x speedup for generative recommendation model serving by using hierarchical caches with host RAM and system optimizations while keeping cache hit ratios above 98.5%.
-
RankUp: Towards High-rank Representations for Large Scale Advertising Recommender Systems
RankUp raises effective rank of representations in deep MetaFormer recommenders via randomized splitting and multi-embeddings, delivering 2-5% GMV gains in production deployments at Weixin.
-
Meituan Merchant Business Diagnosis via Policy-Guided Dual-Process User Simulation
PGHS fuses policy-guided LLM reasoning and ML fitting to simulate group user behavior with 8.8% error on Meituan data from 101 merchants and 26k trajectories, beating pure reasoning and fitting baselines by 45.8% and 40.9%.
-
SOLARIS: Speculative Offloading of Latent-bAsed Representation for Inference Scaling
Speculative precomputation of foundation-model user–item embeddings decouples heavy inference from the serving path and yields 0.67% revenue gain at Meta ads scale.
-
MBGR: Multi-Business Prediction for Generative Recommendation at Meituan
MBGR is a new generative recommendation framework using business-aware semantic IDs, multi-business prediction, and label dynamic routing to handle multiple businesses without seesaw effects or representation confusion, validated by experiments and deployed at Meituan.
-
Mixture of Sequence: Theme-Aware Mixture-of-Experts for Long-Sequence Recommendation
MoS applies theme-aware routing to extract multi-scale theme-specific subsequences from noisy long user sequences, achieving state-of-the-art recommendation performance with fewer FLOPs than comparable MoE models.
-
Next Interest Flow: A Generative Pre-training Paradigm for Recommender Systems by Modeling All-domain Movelines
Next Interest Flow models user intent as continuous evolutionary trajectories on a high-dimensional latent interest manifold with kinematic constraints, bidirectional alignment, and temporal causality mechanisms, yielding reported gains on industrial CTR data.
-
Beyond Dense Connectivity: Explicit Sparsity for Scalable Recommendation
SSR uses static random filters and iterative competitive sparse mechanisms to explicitly enforce sparsity in recommendation models, outperforming dense baselines on public and billion-scale industrial datasets.
-
Revisiting Content-Based Music Recommendation: Efficient Feature Aggregation from Large-Scale Music Models
TASTE dataset and MuQ-token aggregation enable effective use of audio features from large music models to improve content-based music recommendations over collaborative filtering alone.
- UniScale: Synergistic Entire Space Data and Model Scaling for Search Ranking
- Rich-Media Re-Ranker: A User Satisfaction-Driven LLM Re-ranking Framework for Rich-Media Search