{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/click-through-rate-prediction/papers/3","list_of":"/task/click-through-rate-prediction","task":"Click-Through Rate Prediction","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":4,"rows_per_page":100,"rows":[201,300],"of":391,"counts":{"archive_papers_tagged":391,"with_a_code_link":165,"where_syntology_ran_a_sample":25,"not_listed_spam_title":0,"listed":391,"listed_where_code_ran":25,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":25,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":25,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/click-through-rate-prediction","prev":"/task/click-through-rate-prediction/papers/2","next":"/task/click-through-rate-prediction/papers/4","papers":[{"url":null,"slug":"aie-auction-information-enhanced-framework","title":"AIE: Auction Information Enhanced Framework for CTR Prediction in Online Advertising","date":"2024-08-15","arxiv_id":"2408.07907","repositories_listed":0,"syntology":null},{"url":null,"slug":"mlora-multi-domain-low-rank-adaptive-network","title":"MLoRA: Multi-Domain Low-Rank Adaptive Network for CTR Prediction","date":"2024-08-14","arxiv_id":"2408.08913","repositories_listed":0,"syntology":null},{"url":null,"slug":"moment-cross-next-generation-real-time-cross","title":"Moment&Cross: Next-Generation Real-Time Cross-Domain CTR Prediction for Live-Streaming Recommendation at Kuaishou","date":"2024-08-11","arxiv_id":"2408.05709","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-01332","title":"HMDN: Hierarchical Multi-Distribution Network for Click-Through Rate Prediction","date":"2024-08-02","arxiv_id":"2408.01332","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-ctr-prediction-through-sequential","title":"Enhancing CTR Prediction through Sequential Recommendation Pre-training: Introducing the SRP4CTR Framework","date":"2024-07-29","arxiv_id":"2407.19658","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedud-exploiting-unaligned-data-for-cross","title":"FedUD: Exploiting Unaligned Data for Cross-Platform Federated Click-Through Rate Prediction","date":"2024-07-26","arxiv_id":"2407.18472","repositories_listed":0,"syntology":null},{"url":null,"slug":"twin-v2-scaling-ultra-long-user-behavior","title":"TWIN V2: Scaling Ultra-Long User Behavior Sequence Modeling for Enhanced CTR Prediction at Kuaishou","date":"2024-07-23","arxiv_id":"2407.16357","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bag-of-tricks-for-scaling-cpu-based-deep","title":"A Bag of Tricks for Scaling CPU-based Deep FFMs to more than 300m Predictions per Second","date":"2024-07-14","arxiv_id":"2407.10115","repositories_listed":0,"syntology":null},{"url":null,"slug":"warming-up-cold-start-ctr-prediction-by","title":"Warming Up Cold-Start CTR Prediction by Learning Item-Specific Feature Interactions","date":"2024-07-14","arxiv_id":"2407.10112","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-epoch-learning-with-data-augmentation","title":"Multi-Epoch learning with Data Augmentation for Deep Click-Through Rate Prediction","date":"2024-06-27","arxiv_id":"2407.01607","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-effects-of-data-split-strategies-on-the","title":"The Effects of Data Split Strategies on the Offline Experiments for CTR Prediction","date":"2024-06-26","arxiv_id":"2406.18320","repositories_listed":0,"syntology":null},{"url":null,"slug":"extreme-learning-machines-for-fast-training","title":"Extreme Learning Machines for Fast Training of Click-Through Rate Prediction Models","date":"2024-06-25","arxiv_id":"2406.17828","repositories_listed":0,"syntology":null},{"url":null,"slug":"light-weight-end-to-end-graph-interest","title":"Light-weight End-to-End Graph Interest Network for CTR Prediction in E-commerce Search","date":"2024-06-25","arxiv_id":"2406.17745","repositories_listed":0,"syntology":null},{"url":null,"slug":"star-a-new-multi-domain-model-for-ctr","title":"Star+: A New Multi-Domain Model for CTR Prediction","date":"2024-06-24","arxiv_id":"2406.16568","repositories_listed":0,"syntology":null},{"url":null,"slug":"mutual-learning-for-finetuning-click-through","title":"Mutual Learning for Finetuning Click-Through Rate Prediction Models","date":"2024-06-17","arxiv_id":"2406.12087","repositories_listed":0,"syntology":null},{"url":null,"slug":"polyhedral-conic-classifier-for-ctr","title":"Polyhedral Conic Classifier for CTR Prediction","date":"2024-06-06","arxiv_id":"2406.03892","repositories_listed":0,"syntology":null},{"url":null,"slug":"predict-click-through-rates-with-deep","title":"Predict Click-Through Rates with Deep Interest Network Model in E-commerce Advertising","date":"2024-06-04","arxiv_id":"2406.10239","repositories_listed":0,"syntology":null},{"url":null,"slug":"mitigate-position-bias-with-coupled-ranking","title":"Mitigate Position Bias with Coupled Ranking Bias on CTR Prediction","date":"2024-05-29","arxiv_id":"2405.18971","repositories_listed":0,"syntology":null},{"url":null,"slug":"look-into-the-future-deep-contextualized","title":"Look into the Future: Deep Contextualized Sequential Recommendation","date":"2024-05-23","arxiv_id":"2405.14359","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-click-through-rate-prediction-method-based","title":"A Click-Through Rate Prediction Method Based on Cross-Importance of Multi-Order Features","date":"2024-05-14","arxiv_id":"2405.08852","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-pattern-network-for-click-through-rate","title":"Deep Pattern Network for Click-Through Rate Prediction","date":"2024-04-17","arxiv_id":"2404.11456","repositories_listed":0,"syntology":null},{"url":null,"slug":"recall-augmented-ranking-enhancing-click","title":"Recall-Augmented Ranking: Enhancing Click-Through Rate Prediction Accuracy with Cross-Stage Data","date":"2024-04-15","arxiv_id":"2404.09578","repositories_listed":0,"syntology":null},{"url":null,"slug":"jobformer-skill-aware-job-recommendation-with","title":"JobFormer: Skill-Aware Job Recommendation with Semantic-Enhanced Transformer","date":"2024-04-05","arxiv_id":"2404.04313","repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-the-length-barrier-llm-enhanced-ctr","title":"Breaking the Length Barrier: LLM-Enhanced CTR Prediction in Long Textual User Behaviors","date":"2024-03-28","arxiv_id":"2403.19347","repositories_listed":0,"syntology":null},{"url":null,"slug":"ppm-a-pre-trained-plug-in-model-for-click","title":"PPM : A Pre-trained Plug-in Model for Click-through Rate Prediction","date":"2024-03-15","arxiv_id":"2403.10049","repositories_listed":0,"syntology":null},{"url":null,"slug":"metasplit-meta-split-network-for-limited","title":"MetaSplit: Meta-Split Network for Limited-Stock Product Recommendation","date":"2024-03-11","arxiv_id":"2403.06747","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-online-learning-algorithms-for-ctr","title":"Improved Online Learning Algorithms for CTR Prediction in Ad Auctions","date":"2024-02-29","arxiv_id":"2403.00845","repositories_listed":0,"syntology":null},{"url":null,"slug":"lirank-industrial-large-scale-ranking-models","title":"LiRank: Industrial Large Scale Ranking Models at LinkedIn","date":"2024-02-10","arxiv_id":"2402.06859","repositories_listed":0,"syntology":null},{"url":null,"slug":"calibration-then-calculation-a-variance","title":"Calibration-then-Calculation: A Variance Reduced Metric Framework in Deep Click-Through Rate Prediction Models","date":"2024-01-30","arxiv_id":"2401.16692","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-evolutional-instant-interest-network-for","title":"Deep Evolutional Instant Interest Network for CTR Prediction in Trigger-Induced Recommendation","date":"2024-01-15","arxiv_id":"2401.07769","repositories_listed":0,"syntology":null},{"url":null,"slug":"gace-learning-graph-based-cross-page-ads","title":"GACE: Learning Graph-Based Cross-Page Ads Embedding For Click-Through Rate Prediction","date":"2024-01-15","arxiv_id":"2401.07445","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-embedding-dimension-optimization","title":"Fine-Grained Embedding Dimension Optimization During Training for Recommender Systems","date":"2024-01-09","arxiv_id":"2401.04408","repositories_listed":0,"syntology":null},{"url":null,"slug":"less-or-more-from-teacher-exploiting","title":"Less or More From Teacher: Exploiting Trilateral Geometry For Knowledge Distillation","date":"2023-12-22","arxiv_id":"2312.15112","repositories_listed":0,"syntology":null},{"url":null,"slug":"calibration-compatible-listwise-distillation","title":"Calibration-compatible Listwise Distillation of Privileged Features for CTR Prediction","date":"2023-12-14","arxiv_id":"2312.08727","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-lifelong-sequential-modeling-for","title":"Cross Domain LifeLong Sequential Modeling for Online Click-Through Rate Prediction","date":"2023-12-11","arxiv_id":"2312.06424","repositories_listed":0,"syntology":null},{"url":null,"slug":"at4ctr-auxiliary-match-tasks-for-enhancing","title":"AT4CTR: Auxiliary Match Tasks for Enhancing Click-Through Rate Prediction","date":"2023-12-09","arxiv_id":"2312.06683","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-cross-domain-click-through-rate","title":"Enhancing Cross-domain Click-Through Rate Prediction via Explicit Feature Augmentation","date":"2023-11-30","arxiv_id":"2312.00078","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-importance-factor-for-loss-functions","title":"Temporal Importance Factor for Loss Functions for CTR Prediction","date":"2023-11-28","arxiv_id":"2311.16878","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-group-interest-modeling-of-full-lifelong","title":"Deep Group Interest Modeling of Full Lifelong User Behaviors for CTR Prediction","date":"2023-11-15","arxiv_id":"2311.10764","repositories_listed":0,"syntology":null},{"url":null,"slug":"farthest-greedy-path-sampling-for-two-shot","title":"Farthest Greedy Path Sampling for Two-shot Recommender Search","date":"2023-10-31","arxiv_id":"2310.20705","repositories_listed":0,"syntology":null},{"url":null,"slug":"llp-bench-a-large-scale-tabular-benchmark-for","title":"LLP-Bench: A Large Scale Tabular Benchmark for Learning from Label Proportions","date":"2023-10-16","arxiv_id":"2310.10096","repositories_listed":0,"syntology":null},{"url":null,"slug":"clickprompt-ctr-models-are-strong-prompt","title":"ClickPrompt: CTR Models are Strong Prompt Generators for Adapting Language Models to CTR Prediction","date":"2023-10-13","arxiv_id":"2310.09234","repositories_listed":0,"syntology":null},{"url":null,"slug":"emofm-ensemble-mlp-model-with-feature-based","title":"EMOFM: Ensemble MLP mOdel with Feature-based Mixers for Click-Through Rate Prediction","date":"2023-10-06","arxiv_id":"2310.04482","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-cross-category-learning-in","title":"Enhancing Cross-Category Learning in Recommendation Systems with Multi-Layer Embedding Training","date":"2023-09-27","arxiv_id":"2309.15881","repositories_listed":0,"syntology":null},{"url":null,"slug":"making-the-full-model-adaptive-multi-level","title":"Making the Full Model Adaptive: Multi-level Domain Adaptation for Multi-Domain CTR Prediction","date":"2023-09-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"scenario-aware-hierarchical-dynamic-network","title":"Scenario-Aware Hierarchical Dynamic Network for Multi-Scenario Recommendation","date":"2023-09-05","arxiv_id":"2309.02061","repositories_listed":0,"syntology":null},{"url":null,"slug":"antm-2-c-a-large-scale-dataset-for-multi","title":"AntM$^{2}$C: A Large Scale Dataset For Multi-Scenario Multi-Modal CTR Prediction","date":"2023-08-31","arxiv_id":"2308.16437","repositories_listed":0,"syntology":null},{"url":null,"slug":"fragment-and-integrate-network-fin-a-novel","title":"Fragment and Integrate Network (FIN): A Novel Spatial-Temporal Modeling Based on Long Sequential Behavior for Online Food Ordering Click-Through Rate Prediction","date":"2023-08-30","arxiv_id":"2308.15703","repositories_listed":0,"syntology":null},{"url":"/paper/stec-see-through-transformer-based-encoder","slug":"stec-see-through-transformer-based-encoder","title":"STEC: See-Through Transformer-based Encoder for CTR Prediction","date":"2023-08-29","arxiv_id":"2308.15033","repositories_listed":0,"syntology":null},{"url":"/paper/mmbattn-max-mean-and-bit-wise-attention-for","slug":"mmbattn-max-mean-and-bit-wise-attention-for","title":"MMBAttn: Max-Mean and Bit-wise Attention for CTR Prediction","date":"2023-08-25","arxiv_id":"2308.13187","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-aligned-exposure-enhanced-model-for","title":"Time-aligned Exposure-enhanced Model for Click-Through Rate Prediction","date":"2023-08-19","arxiv_id":"2308.09966","repositories_listed":0,"syntology":null},{"url":null,"slug":"bert4ctr-an-efficient-framework-to-combine","title":"BERT4CTR: An Efficient Framework to Combine Pre-trained Language Model with Non-textual Features for CTR Prediction","date":"2023-08-17","arxiv_id":"2308.11527","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-context-interest-network-for-click","title":"Deep Context Interest Network for Click-Through Rate Prediction","date":"2023-08-11","arxiv_id":"2308.06037","repositories_listed":0,"syntology":null},{"url":null,"slug":"cspm-a-contrastive-spatiotemporal-preference","title":"CSPM: A Contrastive Spatiotemporal Preference Model for CTR Prediction in On-Demand Food Delivery Services","date":"2023-08-10","arxiv_id":"2308.08446","repositories_listed":0,"syntology":null},{"url":null,"slug":"tbin-modeling-long-textual-behavior-data-for","title":"TBIN: Modeling Long Textual Behavior Data for CTR Prediction","date":"2023-08-09","arxiv_id":"2308.08483","repositories_listed":0,"syntology":null},{"url":null,"slug":"unleash-the-power-of-context-enhancing-large","title":"Unleash the Power of Context: Enhancing Large-Scale Recommender Systems with Context-Based Prediction Models","date":"2023-07-25","arxiv_id":"2308.01231","repositories_listed":0,"syntology":null},{"url":null,"slug":"news-popularity-beyond-the-click-through-rate","title":"News Popularity Beyond the Click-Through-Rate for Personalized Recommendations","date":"2023-07-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-ctr-prediction-rethinking","title":"Streaming CTR Prediction: Rethinking Recommendation Task for Real-World Streaming Data","date":"2023-07-14","arxiv_id":"2307.07509","repositories_listed":0,"syntology":null},{"url":null,"slug":"confidence-ranking-for-ctr-prediction","title":"Confidence Ranking for CTR Prediction","date":"2023-06-28","arxiv_id":"2307.01206","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collaborative-transfer-learning-framework","title":"A Collaborative Transfer Learning Framework for Cross-domain Recommendation","date":"2023-06-26","arxiv_id":"2306.16425","repositories_listed":0,"syntology":null},{"url":null,"slug":"contentctr-frame-level-live-streaming-click","title":"ContentCTR: Frame-level Live Streaming Click-Through Rate Prediction with Multimodal Transformer","date":"2023-06-26","arxiv_id":"2306.14392","repositories_listed":0,"syntology":null},{"url":null,"slug":"optmsm-optimizing-multi-scenario-modeling-for","title":"OptMSM: Optimizing Multi-Scenario Modeling for Click-Through Rate Prediction","date":"2023-06-23","arxiv_id":"2306.13382","repositories_listed":0,"syntology":null},{"url":null,"slug":"rec4ad-a-free-lunch-to-mitigate-sample","title":"Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao","date":"2023-06-06","arxiv_id":"2306.03527","repositories_listed":0,"syntology":null},{"url":null,"slug":"ctrl-connect-tabular-and-language-model-for","title":"CTRL: Connect Collaborative and Language Model for CTR Prediction","date":"2023-06-05","arxiv_id":"2306.02841","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-long-term-and-short-term-interest","title":"Graph Based Long-Term And Short-Term Interest Model for Click-Through Rate Prediction","date":"2023-06-05","arxiv_id":"2306.10028","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-epoch-learning-for-deep-click-through","title":"Multi-Epoch Learning for Deep Click-Through Rate Prediction Models","date":"2023-05-31","arxiv_id":"2305.19531","repositories_listed":0,"syntology":null},{"url":null,"slug":"dadin-domain-adversarial-deep-interest","title":"DADIN: Domain Adversarial Deep Interest Network for Cross Domain Recommender Systems","date":"2023-05-20","arxiv_id":"2305.12058","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-domain-augmentation-networks-for-click","title":"Cross-domain Augmentation Networks for Click-Through Rate Prediction","date":"2023-05-06","arxiv_id":"2305.03953","repositories_listed":0,"syntology":null},{"url":null,"slug":"delta-direct-embedding-enhancement-and","title":"DELTA: Dynamic Embedding Learning with Truncated Conscious Attention for CTR Prediction","date":"2023-05-03","arxiv_id":"2305.04891","repositories_listed":0,"syntology":null},{"url":null,"slug":"always-strengthen-your-strengths-a-drift","title":"Always Strengthen Your Strengths: A Drift-Aware Incremental Learning Framework for CTR Prediction","date":"2023-04-17","arxiv_id":"2304.09062","repositories_listed":0,"syntology":null},{"url":null,"slug":"cold-start-based-multi-scenario-ranking-model","title":"Cold-Start based Multi-Scenario Ranking Model for Click-Through Rate Prediction","date":"2023-04-16","arxiv_id":"2304.07858","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchically-fusing-long-and-short-term","title":"Hierarchically Fusing Long and Short-Term User Interests for Click-Through Rate Prediction in Product Search","date":"2023-04-04","arxiv_id":"2304.02089","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-representation-learning-for-click","title":"Feature Representation Learning for Click-through Rate Prediction: A Review and New Perspectives","date":"2023-02-04","arxiv_id":"2302.02241","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-behavior-path-matching-network-for","title":"A Deep Behavior Path Matching Network for Click-Through Rate Prediction","date":"2023-02-01","arxiv_id":"2302.00302","repositories_listed":0,"syntology":null},{"url":null,"slug":"causality-based-ctr-prediction-using-graph","title":"Causality-based CTR Prediction using Graph Neural Networks","date":"2023-01-30","arxiv_id":"2301.12762","repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-making-context-interaction-network","title":"Decision-Making Context Interaction Network for Click-Through Rate Prediction","date":"2023-01-29","arxiv_id":"2301.12402","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaensemble-learning-adaptively-sparse","title":"AdaEnsemble: Learning Adaptively Sparse Structured Ensemble Network for Click-Through Rate Prediction","date":"2023-01-06","arxiv_id":"2301.08353","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynint-dynamic-interaction-modeling-for-large","title":"DynInt: Dynamic Interaction Modeling for Large-scale Click-Through Rate Prediction","date":"2023-01-03","arxiv_id":"2301.08139","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-low-precision-training-for","title":"Adaptive Low-Precision Training for Embeddings in Click-Through Rate Prediction","date":"2022-12-12","arxiv_id":"2212.05735","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptdhm-adaptive-distribution-hierarchical","title":"AdaptDHM: Adaptive Distribution Hierarchical Model for Multi-Domain CTR Prediction","date":"2022-11-22","arxiv_id":"2211.12105","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-intention-aware-network-for-click","title":"Deep Intention-Aware Network for Click-Through Rate Prediction","date":"2022-11-16","arxiv_id":"2211.08650","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoattention-automatic-field-pair-selection","title":"AutoAttention: Automatic Field Pair Selection for Attention in User Behavior Modeling","date":"2022-10-27","arxiv_id":"2210.15154","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-device-model-fine-tuning-with-label","title":"On-Device Model Fine-Tuning with Label Correction in Recommender Systems","date":"2022-10-21","arxiv_id":"2211.01163","repositories_listed":0,"syntology":null},{"url":null,"slug":"sml-enhance-the-network-smoothness-with-skip","title":"SML:Enhance the Network Smoothness with Skip Meta Logit for CTR Prediction","date":"2022-10-09","arxiv_id":"2210.10725","repositories_listed":0,"syntology":null},{"url":null,"slug":"kast-knowledge-aware-adaptive-session-multi","title":"KAST: Knowledge Aware Adaptive Session Multi-Topic Network for Click-Through Rate Prediction","date":"2022-10-07","arxiv_id":"2210.03624","repositories_listed":0,"syntology":null},{"url":null,"slug":"boost-ctr-prediction-for-new-advertisements","title":"Boost CTR Prediction for New Advertisements via Modeling Visual Content","date":"2022-09-23","arxiv_id":"2209.11727","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatiotemporal-enhanced-network-for-click","title":"Spatiotemporal-Enhanced Network for Click-Through Rate Prediction in Location-based Services","date":"2022-09-20","arxiv_id":"2209.09427","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-incremental-learning-framework-for-large","title":"An Incremental Learning framework for Large-scale CTR Prediction","date":"2022-09-01","arxiv_id":"2209.00458","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-meta-learning-for-model-update","title":"Online Meta-Learning for Model Update Aggregation in Federated Learning for Click-Through Rate Prediction","date":"2022-08-30","arxiv_id":"2209.00629","repositories_listed":0,"syntology":null},{"url":null,"slug":"field-wise-embedding-size-search-via","title":"Field-wise Embedding Size Search via Structural Hard Auxiliary Mask Pruning for Click-Through Rate Prediction","date":"2022-08-17","arxiv_id":"2208.08004","repositories_listed":0,"syntology":null},{"url":null,"slug":"aminergnn-heterogeneous-graph-neural-network","title":"AMinerGNN: Heterogeneous Graph Neural Network for Paper Click-through Rate Prediction with Fusion Query","date":"2022-08-15","arxiv_id":"2208.07201","repositories_listed":0,"syntology":null},{"url":null,"slug":"continual-transfer-learning-for-cross-domain","title":"Continual Transfer Learning for Cross-Domain Click-Through Rate Prediction at Taobao","date":"2022-08-11","arxiv_id":"2208.05728","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploration-with-model-uncertainty-at-extreme","title":"Exploration with Model Uncertainty at Extreme Scale in Real-Time Bidding","date":"2022-08-03","arxiv_id":"2208.01951","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-wrapper-differentiable-wrapping-operator","title":"Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction","date":"2022-06-28","arxiv_id":"2206.14647","repositories_listed":0,"syntology":null},{"url":null,"slug":"adasparse-learning-adaptively-sparse","title":"AdaSparse: Learning Adaptively Sparse Structures for Multi-Domain Click-Through Rate Prediction","date":"2022-06-27","arxiv_id":"2206.13108","repositories_listed":0,"syntology":null},{"url":null,"slug":"research-a-pre-computing-solution-for-online","title":"PCDF: A Parallel-Computing Distributed Framework for Sponsored Search Advertising Serving","date":"2022-06-26","arxiv_id":"2206.12893","repositories_listed":0,"syntology":null},{"url":"/paper/0-1-deep-neural-networks-via-block-coordinate","slug":"0-1-deep-neural-networks-via-block-coordinate","title":"0/1 Deep Neural Networks via Block Coordinate Descent","date":"2022-06-19","arxiv_id":"2206.09379","repositories_listed":0,"syntology":null},{"url":null,"slug":"phn-parallel-heterogeneous-network-with-soft","title":"PHN: Parallel heterogeneous network with soft gating for CTR prediction","date":"2022-06-18","arxiv_id":"2206.09184","repositories_listed":0,"syntology":null},{"url":null,"slug":"soft-retargeting-network-for-click-through","title":"Soft Retargeting Network for Click Through Rate Prediction","date":"2022-06-04","arxiv_id":"2206.01894","repositories_listed":0,"syntology":null},{"url":null,"slug":"hien-hierarchical-intention-embedding-network","title":"HIEN: Hierarchical Intention Embedding Network for Click-Through Rate Prediction","date":"2022-06-01","arxiv_id":"2206.00510","repositories_listed":0,"syntology":null}],"record_sha256":"8dfeb0552ee0ab2226be9b8b810673130247a286304c31aedb3d0d420fd6b153","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}