{"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":"/paper/warm-up-cold-start-advertisements-improving","title":"Warm Up Cold-start Advertisements: Improving CTR Predictions via Learning to Learn ID Embeddings","arxiv_id":"1904.11547","date":"2019-04-25","proceeding":null,"authors":["Feiyang Pan","Shuokai Li","Xiang Ao","Pingzhong Tang","Qing He"],"abstract":"Click-through rate (CTR) prediction has been one of the most central problems\nin computational advertising. Lately, embedding techniques that produce\nlow-dimensional representations of ad IDs drastically improve CTR prediction\naccuracies. However, such learning techniques are data demanding and work\npoorly on new ads with little logging data, which is known as the cold-start\nproblem.\n  In this paper, we aim to improve CTR predictions during both the cold-start\nphase and the warm-up phase when a new ad is added to the candidate pool. We\npropose Meta-Embedding, a meta-learning-based approach that learns to generate\ndesirable initial embeddings for new ad IDs. The proposed method trains an\nembedding generator for new ad IDs by making use of previously learned ads\nthrough gradient-based meta-learning. In other words, our method learns how to\nlearn better embeddings. When a new ad comes, the trained generator initializes\nthe embedding of its ID by feeding its contents and attributes. Next, the\ngenerated embedding can speed up the model fitting during the warm-up phase\nwhen a few labeled examples are available, compared to the existing\ninitialization methods.\n  Experimental results on three real-world datasets showed that Meta-Embedding\ncan significantly improve both the cold-start and warm-up performances for six\nexisting CTR prediction models, ranging from lightweight models such as\nFactorization Machines to complicated deep models such as PNN and DeepFM. All\nof the above apply to conversion rate (CVR) predictions as well.","url_abs":"http://arxiv.org/abs/1904.11547v1","url_pdf":"http://arxiv.org/pdf/1904.11547v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"warm-up-cold-start-advertisements-improving","repo_url":"https://github.com/Feiyang/MetaEmbedding","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"click-through-rate-prediction","task_name":"Click-Through Rate Prediction"},{"task_slug":"meta-learning","task_name":"Meta-Learning"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.11547","atlas_url":"https://app.syntology.ai/?focus=1904.11547","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1904.11547"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.11547\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.11547"},"call":"get_concepts_for_paper(arxiv_id=\"1904.11547\")"}],"by_repo":[{"repo":"Feiyang/MetaEmbedding","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7432a2cddda10e842a814f3458353e15744f7f7543638760a63d328a615f6712","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}