This article introduces Baidu's PGL2.2 graph learning platform, explains graph modeling and message‑passing GNN techniques, details training strategies for small, medium and large graphs, showcases node classification and link‑prediction methods, and describes how the framework is applied in search, recommendation, risk control, and knowledge‑graph competitions.
This article examines how recommendation systems have evolved, highlighting the shared matching and ranking mechanisms with computational advertising while also identifying the distinct elements such as ad bidding and multi‑party objectives that differentiate advertising from pure recommendation.
artificial intelligencecomputational advertisingrecommendation systems
This article presents the multimodal learning demands of QQ Music, introduces the MMatch series of multimodal matching technologies—including image‑text matching, music similarity, AI tagging, and video scoring—and details their practical applications in business scenarios such as merchant public‑play, search, recommendation, and future product ideas.
This article presents an in‑depth overview of Alibaba's e‑commerce and travel recommendation systems, covering the evolution of full‑space CVR estimation models such as ESMM, ESM² and HM³, their architectural components, challenges, and practical applications in the Feizhu platform.
HetMatch is a heterogeneous graph neural network for keyword recommendation in search advertising that tackles cold‑start and large‑scale challenges by hierarchically fusing node and subgraph features, denoising graph convolutions, applying self‑attention, twin matching, and multi‑view learning, delivering notable recall gains and online performance improvements for Alibaba’s advertising tools.
The article introduces the Dual Vector Foil (DVF) algorithm system, which decouples index construction from model training to enable lightweight, high‑precision large‑scale recall using arbitrary complex models, and details its two‑stage and one‑stage solutions, graph‑based retrieval implementation, performance optimizations, and experimental results.
This article reviews recent advances in user representation learning for recommender systems, covering self‑supervised pre‑training, lifelong learning, multi‑task modeling, and large‑scale contrastive methods, and provides code and dataset links for key papers such as PeterRec, Conure, DUPN, ShopperBERT, PTUM, UPRec, and LURM.
On December 3, Alibaba’s DAMO Academy announced its first AI chip that integrates memory and compute using hybrid‑bond 3D stacking, promising ten‑fold performance gains and 300× energy efficiency for AI workloads such as recommendation systems, and marking a shift from traditional von Neumann designs.
Meituan heavily customized TensorFlow 1.x for large‑scale sparse training, replacing variable embeddings with hash tables, improving load balancing, using RDMA communication, pipeline‑embedding graphs, high‑performance hash tables, and operator merges, achieving over ten‑fold scalability, up to 51% operator speedups, and enabling billions‑parameter models on CPU clusters with future GPU expansion.
AMTL inserts an adaptively‑learned twin‑network mask after each representation layer to prune unnecessary embedding dimensions per feature value, automatically assigning larger sizes to high‑frequency features, achieving higher CTR accuracy, about 60% storage reduction, and seamless hot‑starting across recommendation models.
This article introduces ByteDance's Deep Retrieval (DR) framework, describing its learnable index structure that aligns embedding training with retrieval objectives, detailing the core model, structure‑loss training via EM and online EM algorithms, beam‑search serving, multi‑task learning, and practical insights from Q&A.
The presentation offers a comprehensive overview of online experiment fundamentals, design variations, and real-world case studies from Tencent Lookpoint, emphasizing hypothesis validation, causal analysis, best practices, and actionable recommendations for improving product growth and decision‑making.
This article presents a comprehensive technical overview of JD.com’s e‑commerce recommendation and advertising systems, covering business scenarios, recall optimizations (profile and similarity‑based), multi‑task ranking improvements, sample weighting, multi‑model ensembles, PID‑based CPC control, conversion‑delay modeling, and the achieved performance gains and future research plans.
This article presents a comprehensive overview of online experiment design and analysis, covering basic definitions, AB testing principles, complex experiment types, real-world case studies from Tencent's information flow platform, and practical guidelines for reliable experiment evaluation and product decision‑making.
This talk explains contrastive learning fundamentals, typical image‑domain models such as SimCLR, MoCo and SwAV, and shows how their principles—positive/negative sample construction, encoder design, loss functions, alignment and uniformity—can be applied to improve dual‑tower retrieval and ranking models, embedding normalization, temperature scaling, and graph‑based recommender systems.
This article explains how contrastive learning, originally popular in computer‑vision, can be interpreted and applied to recommendation‑system recall and coarse‑ranking models, covering its theoretical roots, typical architectures like SimCLR, MoCo and SwAV, and practical tricks such as in‑batch negatives, embedding normalization, temperature scaling, and graph‑based extensions.
The ByteDance Engine Developer Community Meetup featured senior engineers from ByteDance and OPPO who presented the latest advances in intelligent audio signal processing, natural language processing for recommendation, entity linking in knowledge graphs, and multimedia machine translation, highlighting practical applications and performance challenges.
Alibaba Mama’s advertising platform modernized its Tree‑based Deep Model by introducing a dual‑tower full‑library DNN with aggressive pre‑filtering and custom GPU TopK kernels, and a flattened‑tree model that retains beam search with multi‑head attention, while applying memory‑aware tricks such as attention swapping, softmax approximation, tiled‑matmul splitting, TensorCore batching, INT8 quantization and cache‑resident ad vectors, enabling multi‑fold latency reductions with minimal recall loss.
This article provides a curated list of publicly available data query websites, simple universal datasets, large-scale collections, and specialized datasets for machine learning, image classification, text classification, and recommendation systems, offering valuable resources for AI research and data-driven projects.
This article explains how large‑scale UGC data is used to build a multi‑type interest point graph, describes the mining, hierarchical and associative relationship extraction methods, and demonstrates how the graph improves content understanding and recommendation accuracy while mitigating filter‑bubble effects.
This article surveys recent industrial multi‑task learning approaches for recommendation, covering models such as Alibaba's ESMM and ESM2, DUPN, Meituan's deep ranking, Google’s MMoE, YouTube’s multi‑objective system, Zhihu’s ranking, and summarizing their architectures, loss functions, and practical gains.
This article describes how Alibaba's advertising team tackled the challenges of modeling long‑term user interests for CTR prediction by co‑designing incremental computation services, introducing memory‑network‑based models (MIMN and HPMN), and achieving significant offline and online performance gains.
This article presents a comprehensive overview of Alibaba 1688's user‑growth strategy, detailing lifecycle segmentation, budget‑constrained installation optimization, intelligent red‑packet allocation, smart push mechanisms, information‑flow advertising, and the deep‑learning‑driven search pipeline that together power the platform's growth engine.
This article describes the evolution of a multi‑objective deep‑learning framework for automatically assigning CRM opportunities to salespeople, detailing five model versions—from an XGBoost baseline with sample weighting to advanced PLE‑based architectures—while reporting offline and online performance gains in both call‑out and connection‑out conversion rates.
This article reviews the evolution of end-to-end deep learning models, describes how they were adapted and optimized for a real‑estate broker churn‑warning scenario, and presents experimental results showing significant improvements in AUC, KS and lift over traditional classifiers.
Meituan Search tackles the multi‑business ranking challenge by introducing a quota‑allocation model (MQM) and a series of precise ranking models (MBN) that progressively incorporate sub‑networks, multi‑task learning and transformer‑based behavior sequences, delivering consistent CTR and purchase‑rate gains across food, hotel, travel and other services while outlining future work on feature utilization, sample‑imbalance mitigation and multi‑objective optimization.
The paper introduces PAPERec, a personalized multi‑objective recommendation framework that leverages Pareto‑oriented reinforcement learning to generate user‑specific objective weights, enabling the model to approximate Pareto‑optimal solutions and achieve superior click‑through rate and dwell‑time performance in both offline and online experiments.
This article introduces JD.com's 9N GRAPH industrialization framework for large‑scale graph algorithms in advertising, covering the challenges of e‑commerce recommendation, the end‑to‑end solution architecture, the BVSHG multi‑behavior heterogeneous GNN model, training pipelines, and observed business impact.
PCF‑GNN builds a heterogeneous graph of feature nodes and learns edge statistics via pre‑training, enabling it to infer unseen cross‑features, reduce storage by over 50%, and consistently improve CTR prediction AUC compared to implicit and explicit baselines, with proven online gains.
The article details how iQIYI doubled online inference speed and cut p99 latency by over 50% in TensorFlow‑based CTR recommendation models by replacing costly string‑based integer hashing, removing redundant dense‑sparse conversions, and deduplicating user features for efficient broadcasting, demonstrating that modest Feature Column tweaks can yield major production gains.
This article presents a comprehensive overview of Alibaba's 1688 live‑streaming recommendation system, detailing core challenges such as heterogeneous behavior modeling, multi‑objective optimization, and bias mitigation, and describing four successive model iterations—from feature‑engineered GBDT to attention‑based heterogeneous networks and transformer architectures—along with experimental results and practical insights.
The 3rd International Workshop on Deep Learning Practice for High-Dimensional Sparse Data (DLP‑KDD 2021) invites submissions on deep‑learning systems, data representation, and user modeling for large‑scale sparse data, with a submission deadline of May 10 2021 and results announced on June 10 2021.
User behavior sequence modeling, crucial for search and recommendation advertising ranking, has evolved from simple pooling to attention, RNN, capsule, and Transformer architectures, with industrial applications across e‑commerce, social, video, and music platforms, and future directions include time‑aware, multi‑dimensional, and self‑supervised approaches.
This article explains how Tubi leverages machine learning—particularly PyTorch, Databricks, and cloud services—to improve content understanding, advertising technology, and recommendation systems within its advertising‑based video‑on‑demand platform, outlining the three AVOD pillars, technical stack, and future research directions.
This article presents a comprehensive technical overview of Momo's model‑based recall system for social recommendation, detailing the underlying user‑scenario behavior models, social graph embeddings, multimodal content semantics, and deployment results that improve matching relevance and user interaction rates.
This article presents a comprehensive overview of Taobao Live's deep ranking system evolution, detailing the DBMTL multi‑task learning framework, the two‑tower DMR matching‑ranking architecture, and the RUI Ranking refer‑item model, together with their offline formulas, online deployment scenarios, and measured performance gains across click‑through, watch‑time, and conversion metrics.
This article presents the Search‑Based Interest Model (SIM), a two‑stage retrieval framework that indexes a user's entire behavior history to enable long‑term interest modeling for click‑through‑rate prediction, demonstrating practical deployment and improved recommendation of long‑term interests in e‑commerce.
This article provides an in‑depth introduction to multi‑task learning (MTL), explaining its core concepts, why it is widely used in recommendation systems, NLP, CV and reinforcement learning, and offering guidance on model architectures, loss design, auxiliary tasks, and practical deployment tips.
EdgeRec explores how moving recommendation system components to the edge—leveraging real‑time user behavior, heterogeneous action modeling, on‑device reranking, mixed‑ranking, and personalized “thousand‑person‑one‑model” training—can reduce latency, improve relevance, and boost business metrics compared to traditional cloud‑centric pipelines.
This article details how 58.com tackled the challenges of multi‑business recommendation on its home page by developing a dual‑channel deep interest model, introducing customized feature‑crossing, optimizing training and online performance, and exploring multi‑channel extensions for broader scenario adaptation.
This article describes how 58.com’s rental platform leverages deep learning models such as Wide&Deep, DeepFM, DCN, DIN, and DIEN to improve search ranking, detailing data pipelines, feature engineering, model iteration, multi‑task training, prediction optimizations, and resulting online performance gains.
Deep Learningfeature engineeringmodel optimization
JD Tech showcased a remarkable 21-paper presence at AAAI 2021, covering federated learning, spatio‑temporal AI, recommendation systems, computer vision, and causal learning, highlighting the company’s transition from research to real‑world AI applications across smart cities, retail, and risk management.
This article explains how Fliggy combines interactive recommendation with travel‑theme recommendation, detailing the underlying algorithms, user‑demand classification, real‑time interest capture, recall strategies, multi‑task learning for CTR prediction, and engineering tricks that improve personalization and click‑through rates.
This article presents Hulu's multi‑layered approach to content understanding and embedding, describing tag‑based graph embeddings, metadata‑BERT enhancements, multimodal video/audio feature aggregation, and various applications such as similarity search, ranking, cold‑start retrieval, and collection modeling, while also discussing current limitations and open research questions.
The recall stage, the first filtering step after candidate generation, transforms intuitive attribute‑based shortcuts into sophisticated matrix‑factorization and embedding methods—such as dual‑tower and tree‑based models—enabling fast, personalized, diverse candidate selection for real‑time recommendation pipelines.
This article introduces the concept of user preference mining, discusses challenges such as accurate expression, interpretability, and high-dimensional preferences, reviews statistical and model-based approaches including weighting, decay, XGBoost, DNN, LSTM, Seq4Rec, and Deep Interest Network, and describes their practical implementation at Beike.
This article surveys recent research on extracting and expanding hot topics from short texts by constructing user‑behavior graphs, applying graph‑embedding techniques, and leveraging multi‑task learning to improve recommendation relevance, timeliness, and cold‑start handling in large‑scale platforms.
This article introduces graph neural networks, explains their underlying sampling and aggregation mechanisms, and demonstrates how they are applied in large‑scale recommendation scenarios such as video and content feeds at Tencent, highlighting practical results and lessons learned.
This article introduces graph neural networks, explains their fundamentals and GraphSAGE/DGI algorithms, and demonstrates how Tencent applies them to recommendation scenarios such as video and WeChat content, highlighting network construction, feature engineering, sampling and aggregation techniques, and practical performance gains.
This article examines the unique properties of novel literature and the difficulties of tag‑based recommendation, then details multi‑modal feature representation, dual‑tower semantic modeling, clustering, and YouTube‑style DNN recall techniques used to improve free novel recommendation systems.
This article explains how Tencent's Angel platform powers game recommendation on Steam, Wegame, and the Tesla platform, comparing traditional linear tag‑based and collaborative‑filtering methods with the non‑linear DeepFM model and offering practical deployment tips.
The article presents a comprehensive study of re‑ranking in large‑scale industrial recommendation pipelines, identifies four key challenges—context awareness, permutation specificity, computational complexity, and business constraints—and proposes a two‑stage List Retrieval System that combines fast sequence search and a generative re‑ranking network with a deep context‑wise model, achieving significant online gains across multiple Taobao feed scenarios.
This article presents a comprehensive study on automatically extracting theme‑based recommendation reasons for travel content, detailing a three‑stage retrieval framework, the advantages of interactive matching models over classification, rule‑based and back‑translation data augmentation techniques, and various model optimization strategies including priors, transfer learning, seed selection, optimizer choice, and layer‑wise learning rates.
Meituan’s search and NLP team announced that six knowledge‑graph papers—covering query‑aware tip generation, BERT‑based ranking, multi‑modal and sequential recommendation, conversational recommendation, and graph‑embedding for personalized product search—were accepted at CIKM 2020, resulting from university collaborations and already deployed to boost Meituan’s search, recommendation and product‑search services.
This article examines how low‑level recommendation algorithm techniques can upgrade content‑feed systems to boost user growth, covering problem analysis, growth factors, personalization upgrades, cold‑start mechanisms, bias mitigation via causal inference, and utility‑driven user profiling.
This article systematically reviews mainstream embedding technologies—including matrix factorization, static and dynamic word embeddings, and graph‑based methods—explaining their principles, implementations, and practical applications in recommendation, advertising, and search systems.
This article examines the unique properties of novel literature, the difficulties of tag‑based representation, and how multi‑modal AI techniques—including dual‑tower models, feature fusion, clustering, and YouTube‑style DNN recall—are applied to improve recommendation accuracy and user decision‑making.
This article explains how reinforcement learning, with its focus on maximizing long‑term reward, can improve recommendation system mixing by covering basic RL concepts, differences from supervised learning, multi‑armed bandit approaches, practical OpenAI Gym experiments, new AUC metrics, online gains, and advanced model optimizations.
The article reviews RecSys 2020’s shift to a virtual format, highlights the organizers’ use of tools like Whova and Gather.town, and summarizes several industrial and academic research breakthroughs presented at the conference, including PURS, behavior‑based popularity ranking, contextual item‑to‑item recommendation, counterfactual learning, debiasing techniques, and a large‑scale bandit dataset.
This article explains how a binary‑classification model combining estimated future behavior and statistical data is used to compute a unified popularity score for web novels, improving both recall and ranking in search and library scenarios while addressing challenges of cold‑start and long‑tail items.
JD’s recommendation team outlines three key innovations—knowledge‑graph‑based interest recall, enhanced CTR estimation with a DRM module, and a listwise ranking strategy—that together address user‑interest expansion challenges in e‑commerce, especially for cold‑start items, long‑tail products, and dynamic promotional scenarios.
The Hulu AI Class event showcased a series of technical talks covering large‑scale graph neural network optimizations, multi‑factor video ad placement algorithms, recommendation and search engine techniques, machine‑learning‑driven video codec improvements, and advanced content‑embedding methods, highlighting practical engineering experiences from Hulu’s Beijing office.
TensorNet is a TensorFlow‑based distributed training framework optimized for massive sparse‑feature models in advertising and recommendation, dramatically reducing parameter sync overhead, enabling near‑infinite feature dimensions, cutting training time from hours to minutes, and boosting inference performance by up to 35%.
This article explores the fundamentals and evaluation of recommendation systems, detailing their definition, key performance dimensions such as accuracy, diversity, novelty, serendipity, trust, and real‑time utility, and presents a practical case study from 58.com with reflections on methodology and future improvements.
This article explains how large-scale recommendation systems rely on efficient feature engineering, describes the three-layer architecture (offline, stream, online), and details how Spark SQL and the LLVM‑optimized FESQL engine improve performance and ensure offline‑online feature consistency.
This article explains the fundamental differences between computational advertising and recommendation systems, outlines the distinct problems each field addresses, and surveys the most widely used advertising models—including traditional machine‑learning approaches, deep‑learning architectures, and hybrid solutions—providing practical insights for engineers in both domains.
This article explains Alibaba’s User Interest Center approach to real‑time model serving, detailing how it separates offline sequence modeling from lightweight online inference, uses an online interest‑embedding store, and dramatically reduces latency for recommendation models such as DIEN and MIMN.
The winning KDD Cup 2020 debiasing solution builds a heterogeneous item‑to‑item graph with click‑co‑occurrence and multimodal similarity edges, uses multi‑hop random walks to generate unbiased candidate samples, trains LightGBM with a popularity‑weighted loss, and aggregates scores to lift low‑popularity items, thereby eliminating selection and popularity bias and achieving first place among 1,895 teams.
This article details the technical architecture behind WeChat's 'Kan Kan' content understanding platform, covering text and multimedia analysis, tag extraction, entity recognition, knowledge graph construction, and how these components enhance recommendation recall, ranking, and user engagement across the ecosystem.
SimSvr is a high‑performance, distributed feature‑retrieval component designed for recommendation systems that supports billion‑scale indexes, sub‑millisecond query latency, real‑time and batch updates, multi‑model AB‑testing, and advanced filtering, all while running on Tencent's production workloads.
The 43rd ACM SIGIR 2020 International Conference on Research and Development in Information Retrieval, a premier CCF A‑class event, will be held virtually from July 25‑30, featuring theoretical and applied research on knowledge graph construction, explainable recommendation, and content generation, with a keynote by Meituan Waimai’s senior algorithm expert Maodi Hu.
This article analyses the unique challenges of stranger‑social platforms such as Tinder and Tantan, exploring business models, user behavior, network effects, gender dynamics, data collection, algorithmic matching, risk control, and system architecture to guide product strategy and optimization.
The paper describes Didi’s online driver‑repositioning system that treats idle‑driver dispatch as a recommender problem, generating candidate destinations, scoring tasks with a marginal‑gain model, and selecting optimal assignments via a minimum‑cost‑flow optimizer, which in live A/B tests boosted driver efficiency, earnings, and satisfaction while reducing empty cruising.
This article surveys the role of social tagging (folksonomy) in modern recommendation systems, describing how user‑generated tags form a three‑dimensional "tag cube" that can be combined with rating matrices, and reviewing a range of algorithms—including neighbor‑based, ranking (FolkRank/SocialRank), content‑based, linear regression, and matrix‑factorization approaches—while also discussing tag selection, noise handling, and scalability challenges.
This article explains the fundamentals of recommendation systems, discusses early hotness‑based approaches, describes modern architectures with recall and ranking stages, reviews collaborative‑filtering techniques, matrix factorization, deep learning models such as NCF and NeuMF, and details how these methods are applied and optimized for live‑streaming services.
The article examines the rapid growth of live‑streaming e‑commerce, explains the trust‑based dynamics of influencers, outlines standard recommendation‑system metrics such as accuracy, recall, diversity and explainability, and argues that these models fall short of long‑term user utility because they are driven by short‑term commercial goals, highlighting economic and neuroscientific perspectives on preference randomness.
This article provides a detailed overview of various recommendation system types—including neighbor-based, personalized, content-based, contextual, hybrid, and model-based approaches—explaining their principles, advantages, disadvantages, and practical examples with formulas and visual illustrations for real-world applications.
iQIYI’s recommendation team transformed its offline, slow‑query system into a real‑time engine by sharding databases, adding caching, and adopting Kafka, Spark‑Streaming and Flink, cutting peak timeout from 4% to under 0.3%, delivering second‑level personalized, diverse, high‑quality video suggestions while keeping engineers close to the front‑line.
NetEase improves its news‑feed recommendation by applying a multi‑stage semantic text understanding pipeline—lexical analysis, hierarchical content tagging, and quality filtering—using two‑level classifiers, LDA‑based topic modeling, multi‑label concept and entity extraction, and dense vector representations to better capture user interests and boost personalization performance.
This article introduces the challenges of traditional centralized recommendation systems, explains the principles and implementations of federated recommendation algorithms—including vertical and horizontal federated matrix factorization and factorization machines—using WeBank’s open-source FATE platform, and discusses cloud services, practical use cases, and performance benefits.
This article provides a comprehensive overview of graph embedding methods—including DeepWalk, LINE, node2vec, and EGES—explaining their algorithms, random‑walk strategies, proximity definitions, incorporation of side information, and their applications in large‑scale recommendation systems.
This article reviews how knowledge distillation—using a large teacher model to guide a smaller student model—can be applied across the recall, coarse‑ranking, and fine‑ranking stages of recommendation systems, detailing logits‑based and feature‑based approaches, joint and two‑stage training, and point‑wise, pair‑wise, and list‑wise loss designs.
Based on academic and industry experience, iQIYI has designed a deep semantic representation learning framework that integrates multimodal side information and deep models such as Transformers and graph neural networks, improving recall, ranking, deduplication, diversity and semantic matching across recommendation and search scenarios.
This article examines the DeepMatch retrieval model for Tmall Genie music recommendation, detailing how incorporating user feedback such as play‑rate and query intent signals via multi‑task learning and feedback‑aware self‑attention improves recall accuracy and reduces negative recommendations, while also discussing embedding factorization, loss functions, and distributed training optimizations.
The article reviews recent research on representing massive sparse features in click‑through‑rate (CTR) models, introducing Alibaba's Res‑embedding method and Google's Neural Input Search (NIS) approach, and discusses how these techniques improve embedding efficiency and model generalization in large‑scale recommendation systems.
JD announced that two of its research papers—one on a hierarchical reinforcement‑learning framework for multi‑objective recommendation (MaHRL) and another on an attention‑based model for delayed‑feedback conversion‑rate prediction (pCVR)—were accepted as full papers at the prestigious IJCAI2020 and SIGIR2020 conferences, highlighting the company's strong AI capabilities.
artificial intelligenceconversion rate predictionrecommendation systems
The article explains how the fourth paradigm's distributed machine learning framework GDBT tackles the massive data, high‑dimensional features, and real‑time requirements of modern recommendation systems by leveraging heterogeneous computing, parameter servers, RDMA networking, and optimized workloads.
This article presents a comprehensive overview of graph‑based recommendation techniques, including collaborative filtering, graph embedding, side‑information enhanced embeddings, two‑tower DSSM models, and practical cold‑start strategies from Alibaba and Airbnb, followed by a mixed model and Q&A session.
The article explains how Alibaba Entertainment leverages causal inference and uplift modeling to build unbiased user‑cf recommendation algorithms that model user states and upgrade personalized distribution, achieving significant click‑through and re‑activation gains for long‑video services like Youku.
This article surveys the application of attention mechanisms in deep learning recommendation systems, reviewing models such as AFM, DIN, DIEN, DSIN, Behavior Sequence Transformer, Deep Spatio‑Temporal Networks, and ATRank, and discusses their architectures, attention types, advantages, and limitations.
In this article, Wang Zhe addresses fifteen common questions about recommendation systems, covering topics such as building cross‑domain knowledge, the role of deep reinforcement learning, handling sparse or low‑sample data, offline‑online evaluation, knowledge graphs, graph neural networks, model interpretability, large‑scale ID embedding, and career advice for engineers.
DeepMatch is an open‑source Python library that implements several mainstream deep‑learning based recall‑matching algorithms, provides easy installation via pip, detailed usage examples with code, and supports exporting user and item vectors for ANN search, making it ideal for rapid experimentation and learning in recommendation systems.
Personalized recommendation systems, essential for modern internet platforms, can be enhanced by knowledge graphs which provide auxiliary information to improve accuracy, diversity, and explainability, with various methods such as embedding-based (DKN, MKR), path-based, and hybrid approaches like RippleNet and KGCN.
This article provides a comprehensive technical overview of Toutiao’s recommendation system, covering its three‑dimensional modeling approach, feature engineering, user‑tag pipelines, real‑time training infrastructure, evaluation methodology, and content‑safety mechanisms.
ByteDance’s recommendation system models user satisfaction as a function of content, user, and context features, employing diverse algorithms—from logistic regression to deep learning—while leveraging real‑time training, hierarchical text classification, dynamic user tagging, rigorous A/B testing, and multi‑layer content safety checks to deliver personalized feeds at massive scale.
The article reviews recent deep‑learning breakthroughs in personalized content recommendation, covering news and e‑commerce systems, JD Digits' multi‑dimensional user behavior prediction models, knowledge‑graph meta‑learning, and the impact of multimodal AI on future recommendation technologies.
The paper proposes the Deep Match to Rank (DMR) model, which integrates matching‑stage collaborative‑filtering ideas into the ranking stage to explicitly represent user‑to‑item relevance, thereby enhancing personalization and achieving significant CTR and DPV improvements in e‑commerce recommendation scenarios.
The article introduces iQIYI's double‑DNN ranking architecture that combines a high‑performance teacher network with a lightweight student network through online knowledge distillation, detailing the evolution of deep learning‑based ranking models, the motivation for model upgrades, training pipelines, and experimental results that demonstrate significant latency reduction and ROI improvement.