{"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/4","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":4,"pages_in_order":4,"rows_per_page":100,"rows":[301,391],"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/3","next":null,"papers":[{"url":null,"slug":"visual-encoding-and-debiasing-for-ctr","title":"Visual Encoding and Debiasing for CTR Prediction","date":"2022-05-09","arxiv_id":"2205.04168","repositories_listed":0,"syntology":null},{"url":null,"slug":"v-tcm-vertical-aware-transformer-click-model","title":"v-TCM: Vertical-aware Transformer Click Model for Web Search","date":"2022-05-06","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gating-adapted-wavelet-multiresolution","title":"Gating-adapted Wavelet Multiresolution Analysis for Exposure Sequence Modeling in CTR prediction","date":"2022-04-29","arxiv_id":"2204.14069","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-filtering-modeling-on-long-term","title":"Adversarial Filtering Modeling on Long-term User Behavior Sequences for Click-Through Rate Prediction","date":"2022-04-25","arxiv_id":"2204.11587","repositories_listed":0,"syntology":null},{"url":null,"slug":"single-shot-embedding-dimension-search-in","title":"Single-shot Embedding Dimension Search in Recommender System","date":"2022-04-07","arxiv_id":"2204.03281","repositories_listed":0,"syntology":null},{"url":null,"slug":"concept-drift-adaptation-for-ctr-prediction","title":"On the Adaptation to Concept Drift for CTR Prediction","date":"2022-04-01","arxiv_id":"2204.05101","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-page-level-interest-network-in","title":"Deep Page-Level Interest Network in Reinforcement Learning for Ads Allocation","date":"2022-04-01","arxiv_id":"2204.00377","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-position-bias-modeling-with","title":"Rethinking Position Bias Modeling with Knowledge Distillation for CTR Prediction","date":"2022-04-01","arxiv_id":"2204.00270","repositories_listed":0,"syntology":null},{"url":null,"slug":"dhen-a-deep-and-hierarchical-ensemble-network","title":"DHEN: A Deep and Hierarchical Ensemble Network for Large-Scale Click-Through Rate Prediction","date":"2022-03-11","arxiv_id":"2203.11014","repositories_listed":0,"syntology":null},{"url":null,"slug":"click-through-rate-prediction-in-online","title":"Click-Through Rate Prediction in Online Advertising: A Literature Review","date":"2022-02-22","arxiv_id":"2202.10462","repositories_listed":0,"syntology":null},{"url":null,"slug":"learn-over-past-evolve-for-future-search","title":"Learn over Past, Evolve for Future: Search-based Time-aware Recommendation with Sequential Behavior Data","date":"2022-02-07","arxiv_id":"2202.03097","repositories_listed":0,"syntology":null},{"url":null,"slug":"masked-transformer-for-neighhourhood-aware","title":"Neighbour Interaction based Click-Through Rate Prediction via Graph-masked Transformer","date":"2022-01-25","arxiv_id":"2201.13311","repositories_listed":0,"syntology":null},{"url":null,"slug":"continual-learning-for-ctr-prediction-a","title":"Continual Learning for CTR Prediction: A Hybrid Approach","date":"2022-01-18","arxiv_id":"2201.06886","repositories_listed":0,"syntology":null},{"url":null,"slug":"alleviating-cold-start-problem-in-ctr","title":"Alleviating Cold-start Problem in CTR Prediction with A Variational Embedding Learning Framework","date":"2022-01-17","arxiv_id":"2201.10980","repositories_listed":0,"syntology":null},{"url":null,"slug":"gcwsnet-generalized-consistent-weighted","title":"GCWSNet: Generalized Consistent Weighted Sampling for Scalable and Accurate Training of Neural Networks","date":"2022-01-07","arxiv_id":"2201.02283","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-terabyte-scale-model","title":"Communication-Efficient TeraByte-Scale Model Training Framework for Online Advertising","date":"2022-01-05","arxiv_id":"2201.05500","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-gradient-driven-exploration-for","title":"Adversarial Gradient Driven Exploration for Deep Click-Through Rate Prediction","date":"2021-12-21","arxiv_id":"2112.11136","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhanced-exploration-in-neural-feature","title":"Enhanced Exploration in Neural Feature Selection for Deep Click-Through Rate Prediction Models via Ensemble of Gating Layers","date":"2021-12-07","arxiv_id":"2112.03487","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-framework-for-debiasing-in-ctr","title":"A General Framework for Debiasing in CTR Prediction","date":"2021-12-06","arxiv_id":"2112.02767","repositories_listed":0,"syntology":null},{"url":null,"slug":"miss-multi-interest-self-supervised-learning","title":"MISS: Multi-Interest Self-Supervised Learning Framework for Click-Through Rate Prediction","date":"2021-11-30","arxiv_id":"2111.15068","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-parameterized-network-for-ctr-1","title":"Dynamic Parameterized Network for CTR Prediction","date":"2021-11-09","arxiv_id":"2111.04983","repositories_listed":0,"syntology":null},{"url":null,"slug":"aefe-automatic-embedded-feature-engineering","title":"AEFE: Automatic Embedded Feature Engineering for Categorical Features","date":"2021-10-19","arxiv_id":"2110.09770","repositories_listed":0,"syntology":null},{"url":null,"slug":"caregraph-a-graph-based-recommender-system","title":"CareGraph: A Graph-based Recommender System for Diabetes Self-Care","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-shapley-a-general-framework-to","title":"Feature Shapley: A general framework to discovering useful feature interactions","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"click-through-rate-prediction-with-auto","title":"Click-through Rate Prediction with Auto-Quantized Contrastive Learning","date":"2021-09-27","arxiv_id":"2109.13921","repositories_listed":0,"syntology":null},{"url":null,"slug":"deminet-dependency-aware-multi-interest","title":"DemiNet: Dependency-Aware Multi-Interest Network with Self-Supervised Graph Learning for Click-Through Rate Prediction","date":"2021-09-26","arxiv_id":"2109.12512","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-sequential-graph-learning-for-click","title":"Dynamic Sequential Graph Learning for Click-Through Rate Prediction","date":"2021-09-26","arxiv_id":"2109.12541","repositories_listed":0,"syntology":null},{"url":null,"slug":"attentive-knowledge-aware-graph-convolutional","title":"Attentive Knowledge-aware Graph Convolutional Networks with Collaborative Guidance for Personalized Recommendation","date":"2021-09-05","arxiv_id":"2109.02046","repositories_listed":0,"syntology":null},{"url":null,"slug":"tsi-an-ad-text-strength-indicator-using-text","title":"TSI: an Ad Text Strength Indicator using Text-to-CTR and Semantic-Ad-Similarity","date":"2021-08-18","arxiv_id":"2108.08226","repositories_listed":0,"syntology":null},{"url":null,"slug":"leaf-fm-a-learnable-feature-generation","title":"Leaf-FM: A Learnable Feature Generation Factorization Machine for Click-Through Rate Prediction","date":"2021-07-26","arxiv_id":"2107.12024","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-interaction-detection-for-click","title":"Online Interaction Detection for Click-Through Rate Prediction","date":"2021-06-27","arxiv_id":"2106.15400","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoft-automatic-fine-tune-for-parameters","title":"AutoFT: Automatic Fine-Tune for Parameters Transfer Learning in Click-Through Rate Prediction","date":"2021-06-09","arxiv_id":"2106.04873","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-graph-enhanced-embedding-neural-network","title":"Dual Graph enhanced Embedding Neural Network for CTR Prediction","date":"2021-06-01","arxiv_id":"2106.00314","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-method-for-automatic-discovery-of","title":"A General Method For Automatic Discovery of Powerful Interactions In Click-Through Rate Prediction","date":"2021-05-21","arxiv_id":"2105.10484","repositories_listed":0,"syntology":null},{"url":null,"slug":"explicit-semantic-cross-feature-learning-via","title":"Explicit Semantic Cross Feature Learning via Pre-trained Graph Neural Networks for CTR Prediction","date":"2021-05-17","arxiv_id":"2105.07752","repositories_listed":0,"syntology":null},{"url":null,"slug":"click-through-rate-prediction-using-graph","title":"Click-Through Rate Prediction Using Graph Neural Networks and Online Learning","date":"2021-05-09","arxiv_id":"2105.03811","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-conversational-recommendation","title":"Improving Conversational Recommendation System by Pretraining on Billions Scale of Knowledge Graph","date":"2021-04-30","arxiv_id":"2104.14899","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-click-through-rate-prediction-for","title":"Efficient Click-Through Rate Prediction for Developing Countries via Tabular Learning","date":"2021-04-15","arxiv_id":"2104.07553","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-non-sequential-approach-to-deep-user","title":"A Non-sequential Approach to Deep User Interest Model for CTR Prediction","date":"2021-04-05","arxiv_id":"2104.06312","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-intention-network-for-click-through","title":"Graph Intention Network for Click-through Rate Prediction in Sponsored Search","date":"2021-03-30","arxiv_id":"2103.16164","repositories_listed":0,"syntology":null},{"url":null,"slug":"hsr-hyperbolic-social-recommender","title":"HSR: Hyperbolic Social Recommender","date":"2021-02-15","arxiv_id":"2102.09389","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-a-product-relevance-model-from-click","title":"Learning a Product Relevance Model from Click-Through Data in E-Commerce","date":"2021-02-14","arxiv_id":"2102.07098","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-model-to-serve-all-star-topology-adaptive","title":"One Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Prediction","date":"2021-01-27","arxiv_id":"2101.11427","repositories_listed":0,"syntology":null},{"url":"/paper/towards-practical-second-order-optimization","slug":"towards-practical-second-order-optimization","title":"Towards Practical Second Order Optimization for Deep Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-historical-feature-generation","title":"Automatic Historical Feature Generation through Tree-based Method in Ads Prediction","date":"2020-12-31","arxiv_id":"2012.15522","repositories_listed":0,"syntology":null},{"url":null,"slug":"adnfm-an-attentive-densenet-based","title":"AdnFM: An Attentive DenseNet based Factorization Machine for CTR Prediction","date":"2020-12-20","arxiv_id":"2012.10820","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-interactive-attention-network-for-fine","title":"Multi-Interactive Attention Network for Fine-grained Feature Learning in CTR Prediction","date":"2020-12-13","arxiv_id":"2012.06968","repositories_listed":0,"syntology":null},{"url":null,"slug":"dadnn-multi-scene-ctr-prediction-via-domain","title":"DADNN: Multi-Scene CTR Prediction via Domain-Aware Deep Neural Network","date":"2020-11-24","arxiv_id":"2011.11938","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-revisiting-feature-co-action-for-click","title":"CAN: Feature Co-Action for Click-Through Rate Prediction","date":"2020-11-11","arxiv_id":"2011.05625","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensembled-ctr-prediction-via-knowledge","title":"Ensemble Knowledge Distillation for CTR Prediction","date":"2020-11-08","arxiv_id":"2011.04106","repositories_listed":0,"syntology":null},{"url":null,"slug":"u-rank-utility-oriented-learning-to-rank-with","title":"U-rank: Utility-oriented Learning to Rank with Implicit Feedback","date":"2020-11-01","arxiv_id":"2011.00550","repositories_listed":0,"syntology":null},{"url":null,"slug":"kalman-filtering-attention-for-user-behavior","title":"Kalman Filtering Attention for User Behavior Modeling in CTR Prediction","date":"2020-10-02","arxiv_id":"2010.00985","repositories_listed":0,"syntology":null},{"url":null,"slug":"lt4rec-a-lottery-ticket-hypothesis-based","title":"NCS4CVR: Neuron-Connection Sharing for Multi-Task Learning in Video Conversion Rate Prediction","date":"2020-08-22","arxiv_id":"2008.09872","repositories_listed":0,"syntology":null},{"url":null,"slug":"mtbrn-multiplex-target-behavior-relation","title":"MTBRN: Multiplex Target-Behavior Relation Enhanced Network for Click-Through Rate Prediction","date":"2020-08-13","arxiv_id":"2008.05673","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-boosting-deep-neural-networks-for","title":"Iterative Boosting Deep Neural Networks for Predicting Click-Through Rate","date":"2020-07-26","arxiv_id":"2007.13087","repositories_listed":0,"syntology":null},{"url":"/paper/tfnet-multi-semantic-feature-interaction-for","slug":"tfnet-multi-semantic-feature-interaction-for","title":"TFNet: Multi-Semantic Feature Interaction for CTR Prediction","date":"2020-06-29","arxiv_id":"2006.15939","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-automated-neural-interaction","title":"Towards Automated Neural Interaction Discovery for Click-Through Rate Prediction","date":"2020-06-29","arxiv_id":"2007.06434","repositories_listed":0,"syntology":null},{"url":null,"slug":"category-specific-cnn-for-visual-aware-ctr","title":"Category-Specific CNN for Visual-aware CTR Prediction at JD.com","date":"2020-06-18","arxiv_id":"2006.10337","repositories_listed":0,"syntology":null},{"url":null,"slug":"training-with-multi-layer-embeddings-for","title":"Training with Multi-Layer Embeddings for Model Reduction","date":"2020-06-10","arxiv_id":"2006.05623","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-neural-input-search-for","title":"Differentiable Neural Input Search for Recommender Systems","date":"2020-06-08","arxiv_id":"2006.04466","repositories_listed":0,"syntology":null},{"url":"/paper/feature-interaction-based-neural-network-for","slug":"feature-interaction-based-neural-network-for","title":"Feature Interaction based Neural Network for Click-Through Rate Prediction","date":"2020-06-07","arxiv_id":"2006.05312","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-multimodal-representation","title":"Adversarial Multimodal Representation Learning for Click-Through Rate Prediction","date":"2020-03-07","arxiv_id":"2003.07162","repositories_listed":0,"syntology":null},{"url":null,"slug":"shadowsync-performing-synchronization-in-the","title":"ShadowSync: Performing Synchronization in the Background for Highly Scalable Distributed Training","date":"2020-03-07","arxiv_id":"2003.03477","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-time-stream-framework-for-click-through","title":"Deep Time-Stream Framework for Click-Through Rate Prediction by Tracking Interest Evolution","date":"2020-01-08","arxiv_id":"2001.03025","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-interaction-machine-a-simple-but","title":"Deep Interaction Machine: A Simple but Effective Model for High-order Feature Interactions","date":"2020-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"regularized-adversarial-sampling-and-deep","title":"Regularized Adversarial Sampling and Deep Time-aware Attention for Click-Through Rate Prediction","date":"2019-11-03","arxiv_id":"1911.00886","repositories_listed":0,"syntology":null},{"url":null,"slug":"conversion-rate-prediction-via-post-click","title":"Entire Space Multi-Task Modeling via Post-Click Behavior Decomposition for Conversion Rate Prediction","date":"2019-10-15","arxiv_id":"1910.07099","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepenfm-deep-neural-networks-with-encoder","title":"DeepEnFM: Deep neural networks with Encoder enhanced Factorization Machine","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"addressing-delayed-feedback-for-continuous","title":"Addressing Delayed Feedback for Continuous Training with Neural Networks in CTR prediction","date":"2019-07-15","arxiv_id":"1907.06558","repositories_listed":0,"syntology":null},{"url":null,"slug":"res-embedding-for-deep-learning-based-click","title":"Res-embedding for Deep Learning Based Click-Through Rate Prediction Modeling","date":"2019-06-25","arxiv_id":"1906.10304","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-reliable-and-fair-probabilistic","title":"Field-aware Calibration: A Simple and Empirically Strong Method for Reliable Probabilistic Predictions","date":"2019-05-26","arxiv_id":"1905.10713","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-representations-of-categorical","title":"Learning Representations of Categorical Feature Combinations via Self-Attention","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"block-distributed-gradient-boosted-trees","title":"Block-distributed Gradient Boosted Trees","date":"2019-04-23","arxiv_id":"1904.10522","repositories_listed":0,"syntology":null},{"url":null,"slug":"cpm-sensitive-auc-for-ctr-prediction","title":"CPM-sensitive AUC for CTR prediction","date":"2019-04-23","arxiv_id":"1904.10272","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-tensor-additive-regression","title":"Sparse Tensor Additive Regression","date":"2019-03-31","arxiv_id":"1904.00479","repositories_listed":0,"syntology":null},{"url":null,"slug":"field-aware-neural-factorization-machine-for","title":"Field-aware Neural Factorization Machine for Click-Through Rate Prediction","date":"2019-02-25","arxiv_id":"1902.09096","repositories_listed":0,"syntology":null},{"url":null,"slug":"visualizing-and-understanding-deep-neural","title":"Visualizing and Understanding Deep Neural Networks in CTR Prediction","date":"2018-06-22","arxiv_id":"1806.08541","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-deep-cascade-trees-for-conversion","title":"Multi-Level Deep Cascade Trees for Conversion Rate Prediction in Recommendation System","date":"2018-05-24","arxiv_id":"1805.09484","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-native-ads-ctr-prediction-by-large","title":"Improving Native Ads CTR Prediction by Large Scale Event Embedding and Recurrent Networks","date":"2018-04-24","arxiv_id":"1804.09133","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-must-have-clicked-on-this-ad-by-mistake","title":"You Must Have Clicked on this Ad by Mistake! Data-Driven Identification of Accidental Clicks on Mobile Ads with Applications to Advertiser Cost Discounting and Click-Through Rate Prediction","date":"2018-04-03","arxiv_id":"1804.06912","repositories_listed":0,"syntology":null},{"url":null,"slug":"deeply-supervised-semantic-model-for-click","title":"Deeply Supervised Semantic Model for Click-Through Rate Prediction in Sponsored Search","date":"2018-03-28","arxiv_id":"1803.10739","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-matters-visually-modeling-user","title":"Image Matters: Visually modeling user behaviors using Advanced Model Server","date":"2017-11-17","arxiv_id":"1711.06505","repositories_listed":0,"syntology":null},{"url":null,"slug":"pbodl-parallel-bayesian-online-deep-learning","title":"PBODL : Parallel Bayesian Online Deep Learning for Click-Through Rate Prediction in Tencent Advertising System","date":"2017-07-04","arxiv_id":"1707.00802","repositories_listed":0,"syntology":null},{"url":null,"slug":"click-through-rate-prediction-for-contextual","title":"Click Through Rate Prediction for Contextual Advertisment Using Linear Regression","date":"2017-01-30","arxiv_id":"1701.08744","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-ctr-prediction-in-display-advertising","title":"Deep CTR Prediction in Display Advertising","date":"2016-09-20","arxiv_id":"1609.06018","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-personality-aware-recommendation","title":"Towards Personality-Aware Recommendation","date":"2016-07-23","arxiv_id":"1607.05088","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-flexible-nonlinear-tensor","title":"Distributed Flexible Nonlinear Tensor Factorization","date":"2016-04-27","arxiv_id":"1604.07928","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-sparse-tensor-decomposition","title":"Provable Sparse Tensor Decomposition","date":"2015-02-05","arxiv_id":"1502.01425","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-neural-networks-for-click-prediction-of","title":"Using Neural Networks for Click Prediction of Sponsored Search","date":"2014-12-20","arxiv_id":"1412.6601","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-clicks-in-online-display","title":"Predicting clicks in online display advertising with latent features and side-information","date":"2014-11-28","arxiv_id":"1411.7924","repositories_listed":0,"syntology":null},{"url":null,"slug":"dimensionality-reduction-for-click-through","title":"Dimensionality reduction for click-through rate prediction: Dense versus sparse representation","date":"2013-11-27","arxiv_id":"1311.6976","repositories_listed":0,"syntology":null}],"record_sha256":"ecf15c53e81879f6bfd245bb98a7081b761ddbc724fe9c0e7ee4af1980b7c938","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}