{"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/dcnv3-towards-next-generation-deep-cross","title":"FCN: Fusing Exponential and Linear Cross Network for Click-Through Rate Prediction","arxiv_id":"2407.13349","date":"2024-07-18","proceeding":null,"authors":["Honghao Li","Yiwen Zhang","Yi Zhang","Hanwei Li","Lei Sang","Jieming Zhu"],"abstract":"As an important modeling paradigm in click-through rate (CTR) prediction, the Deep & Cross Network (DCN) and its derivative models have gained widespread recognition primarily due to their success in a trade-off between computational cost and performance. This paradigm employs a cross network to explicitly model feature interactions with linear growth, while leveraging deep neural networks (DNN) to implicitly capture higher-order feature interactions. However, these models still face several key limitations: (1) The performance of existing explicit feature interaction methods lags behind that of implicit DNN, resulting in overall model performance being dominated by the DNN; (2) While these models claim to capture high-order feature interactions, they often overlook potential noise within these interactions; (3) The learning process for different interaction network branches lacks appropriate supervision signals; and (4) The high-order feature interactions captured by these models are often implicit and non-interpretable due to their reliance on DNN. To address the identified limitations, this paper proposes a novel model, called Fusing Cross Network (FCN), along with two sub-networks: Linear Cross Network (LCN) and Exponential Cross Network (ECN). FCN explicitly captures feature interactions with both linear and exponential growth, eliminating the need to rely on implicit DNN. Moreover, we introduce the Self-Mask operation to filter noise layer by layer and reduce the number of parameters in the cross network by half. To effectively train these two cross networks, we propose a simple yet effective loss function called Tri-BCE, which provides tailored supervision signals for each network. We evaluate the effectiveness, efficiency, and interpretability of FCN on six benchmark datasets. Furthermore, by integrating LCN and ECN, FCN achieves a new state-of-the-art performance.","url_abs":"https://arxiv.org/abs/2407.13349v7","url_pdf":"https://arxiv.org/pdf/2407.13349v7.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":"dcnv3-towards-next-generation-deep-cross","repo_url":"https://github.com/salmon1802/DCNv3","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"dcnv3-towards-next-generation-deep-cross","repo_url":"https://github.com/reczoo/FuxiCTR","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"click-through-rate-prediction","task_name":"Click-Through Rate Prediction"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"fcn","method_name":"FCN"},{"method_slug":"max-pooling","method_name":"Max Pooling"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/click-through-rate-prediction-on-avazu","task":"Click-Through Rate Prediction","dataset":"Avazu","model":"FCN","rank_in_archive_order":4,"of":15,"metrics":{"AUC":"0.7970","LogLoss":"0.3695"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"FCN","rank_in_archive_order":2,"of":39,"metrics":{"AUC":"0.8162","Log Loss":"0.4358"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-kdd12","task":"Click-Through Rate Prediction","dataset":"KDD12","model":"FCN","rank_in_archive_order":1,"of":5,"metrics":{"AUC":"0.8098","Log Loss":"0.1494"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-kkbox","task":"Click-Through Rate Prediction","dataset":"KKBox","model":"FCN","rank_in_archive_order":1,"of":6,"metrics":{"AUC":"0.8557"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-movielens-1m","task":"Click-Through Rate Prediction","dataset":"MovieLens 1M","model":"DCNv3","rank_in_archive_order":5,"of":6,"metrics":{"AUC":"0.9074","Log Loss":"0.3001"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-ipinyou","task":"Click-Through Rate Prediction","dataset":"iPinYou","model":"FCN","rank_in_archive_order":3,"of":7,"metrics":{"AUC":"0.7856","LogLoss":"0.005535"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2407.13349","atlas_url":"https://app.syntology.ai/?focus=2407.13349","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":"2407.13349"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2407.13349\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2407.13349"},"call":"get_concepts_for_paper(arxiv_id=\"2407.13349\")"}],"by_repo":[{"repo":"salmon1802/DCNv3","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"reczoo/FuxiCTR","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2304.00902"],"harvested_for_calls":[{"arxiv_id":"2304.00902","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.00902"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.00902\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"afc4057fa4b6392fef613eb4c2909eed5409e7cf01955f4c0ccf37e32164f7b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}