REVIEW 32 cited by
DeepFM: A Factorization-Machine based Neural Network for CTR Prediction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
DeepFM: A Factorization-Machine based Neural Network for CTR Prediction
read the original abstract
Learning sophisticated feature interactions behind user behaviors is critical in maximizing CTR for recommender systems. Despite great progress, existing methods seem to have a strong bias towards low- or high-order interactions, or require expertise feature engineering. In this paper, we show that it is possible to derive an end-to-end learning model that emphasizes both low- and high-order feature interactions. The proposed model, DeepFM, combines the power of factorization machines for recommendation and deep learning for feature learning in a new neural network architecture. Compared to the latest Wide \& Deep model from Google, DeepFM has a shared input to its "wide" and "deep" parts, with no need of feature engineering besides raw features. Comprehensive experiments are conducted to demonstrate the effectiveness and efficiency of DeepFM over the existing models for CTR prediction, on both benchmark data and commercial data.
Forward citations
Cited by 32 Pith papers
-
Rethinking Sales Lead Scoring with LLM-based Hierarchical Preference Ranking
HPRO is a new LLM discriminative framework with hierarchical preference ranking optimization that reports AUC 0.8161, +39.7% top-lead precision, and 9.5% sales uplift on NEV brand data.
-
From Item-Only to Query-Item: Query-Conditioned Generative Search with QGS in Quark
QGS introduces query-item pair encoding and query-conditioned prediction with a linear HSTU encoder and HFG-Attention to reduce noise from query switches in generative search ranking, reporting online gains in a comme...
-
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.
-
DeRes: Decoupling Residual Stability and Adaptivity for Scalable CTR Prediction
DeRes decouples residual stability and adaptivity via identity and block-attention paths with SiLU pointwise attention, delivering up to 0.32% AUC gains and steeper scaling laws on industrial and public CTR datasets.
-
Dual-Stream MLP is All You Need for CTR Prediction
DS-MLP achieves state-of-the-art CTR prediction on three benchmarks using a final vanilla MLP structure trained via knowledge distillation and two alignment strategies.
-
Synthetic Data from Cross-Domain Events for Large-Scale Recommendation Systems
SCALR generates synthetic cross-domain events to augment recommendation training data and reports statistically significant improvements in industrial A/B tests.
-
Generative Long-term User Interest Modeling for Click-Through Rate Prediction
GenLI generates diverse target-independent interest distributions via an IGM, retrieves behaviors with O(1) lookup in BRM, and fuses via IFM gating to balance accuracy and efficiency in CTR prediction.
-
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.
-
Modular Representation Compression: Adapting LLMs for Efficient and Effective Recommendations
LLMs exhibit mid-layer representation advantage for recommendations; MARC compresses representations modularly to reduce costs while improving performance, as shown in a large-scale online advertising deployment.
-
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 confusio...
-
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.
-
Performance-Driven QUBO for Recommender Systems on Quantum Annealers
PDQUBO is a new performance-driven QUBO method for feature selection in recommender systems that incorporates counterfactual performance impacts of features and pairs, is model-agnostic, and outperforms prior quantum ...
-
PACEvolve++: Improving Test-time Learning for Evolutionary Search Agents
PACEvolve++ uses a phase-adaptive reinforcement learning advisor to decouple hypothesis selection from execution in LLM-driven evolutionary search, delivering faster convergence than prior frameworks on load balancing...
-
Light-FMP: Lightweight Feature and Model Pruning for Enhanced Deep Recommender Systems
Light-FMP prunes features and model parameters in deep recommender systems by pretraining a hard-concrete masking layer on data subsets, then retraining the reduced model to improve both efficiency and accuracy over p...
-
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.
-
Decoupled Multimodal Fusion for User Interest Modeling in Click-Through Rate Prediction
DMF adds target-aware bridging features and an inference-optimized decoupled attention layer to combine modality-centric and modality-enriched user interest modeling for CTR prediction.
-
OneRec: Unifying Retrieve and Rank with Generative Recommender and Iterative Preference Alignment
OneRec unifies retrieval and ranking in a generative recommender using session-wise decoding and iterative DPO-based preference alignment, achieving real-world gains on Kuaishou.
-
Retrieval-Augmented Generation with Graphs (GraphRAG)
A survey proposing a holistic GraphRAG framework with components including query processor, retriever, organizer, generator, and data source, plus domain-tailored reviews, challenges, and future directions.
-
CCNETS: A Modular Causal Learning Framework for Pattern Recognition in Imbalanced Datasets
CCNETS is a new modular causal framework using three cooperative modules and a Zoint mechanism to align synthetic data generation with classifier needs on imbalanced pattern recognition tasks.
-
Cloudless-Training: A Framework to Improve Efficiency of Geo-Distributed ML Training
Cloudless-Training proposes a two-layer serverless framework with elastic scheduling and two new synchronization strategies (ASGD-GA and inter-PS model averaging) that reports 9.2-24% cost reduction and up to 1.7x spe...
-
POEM: Partial-Order Enhanced Real-Time Sequential Modeling for Recommendation
POEM constructs dynamic partial-order sequences from multi-task ranking scores to enhance real-time sequential recommendation, reporting 0.2% watch-time lifts when deployed on Kuaishou.
-
UniFormer: Efficient and Unified Model-Centric Scaling for Industrial Recommendation
UniFormer introduces a unified model-centric scaling approach for recommender systems via feature-space and task-space modules, semantic tokenization, and multi-sequence attention, with reported gains in production A/...
-
Building a privacy-preserving Federated Recommender system for mobile devices
Presents a two-stage federated recommendation pipeline that runs collaborative filtering on non-sensitive data in the cloud and re-ranks candidates on-device using sensitive mobile signals.
-
Building a privacy-preserving Federated Recommender system for mobile devices
A two-stage federated recommendation pipeline separates non-sensitive and sensitive data to enable on-device re-ranking while preserving privacy.
-
RecGPT-Mobile: On-Device Large Language Models for User Intent Understanding in Taobao Feed Recommendation
RecGPT-Mobile runs a compact LLM on phones to understand evolving user intent from behaviors and improve mobile e-commerce recommendations.
-
Deep Situation-Aware Interaction Network for Click-Through Rate Prediction
DSAIN introduces situational features and tri-directional fusion to enhance behavior sequence modeling for CTR prediction, delivering 2.7% CTR, 2.62% CPM, and 2.16% GMV lifts in online A/B tests on the Meituan platform.
-
Joint Model Parameter Scaling and Universal-Domain Data Integration for E-commerce Search Ranking
UniScale couples entire-space data construction with a hierarchical fusion transformer to improve scaling behavior and deliver 1.70% purchase and 2.04% GMV lifts in large-scale e-commerce search A/B tests.
-
Exploring Vision Neural Network Pruning via Screening Methodology
A unified F-statistic screening and weighted evaluation method prunes both unstructured and structured parameters in FNNs and CNNs, claiming order-of-magnitude size reduction with competitive accuracy on vision datasets.
-
A Unified Framework for Modeling Heterogeneous Financial Data via Dual-Granularity Prompting
FinLangNet applies dual-granularity prompting in a sequential model to heterogeneous financial data, reporting 6.3 pp KS improvement and 9.9% bad debt reduction in real-world deployment.
-
Infer Implicit Contexts in Real-time Online-to-Offline Recommendation
MACDAE infers implicit contexts via a constrained autoencoder and integrates them into an end-to-end O2O recommender, reporting gains on Yelp/Dianping/Koubei and 2.9%/5.6% lifts in online CTR/conversion.
-
On the Practice of Scaling Search Conversion Rate Prediction
Empirical scaling of backbone, embeddings, and data shows largely independent additive gains, enabling a deployed model with 2.5x data and 8x compute that delivers +2.6% CVR improvement with minimal latency change.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.