{"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/fat-deepffm-field-attentive-deep-field-aware","title":"FAT-DeepFFM: Field Attentive Deep Field-aware Factorization Machine","arxiv_id":"1905.06336","date":"2019-05-15","proceeding":null,"authors":["Junlin Zhang","Tongwen Huang","Zhiqi Zhang"],"abstract":"Click through rate (CTR) estimation is a fundamental task in personalized advertising and recommender systems. Recent years have witnessed the success of both the deep learning based model and attention mechanism in various tasks in computer vision (CV) and natural language processing (NLP). How to combine the attention mechanism with deep CTR model is a promising direction because it may ensemble the advantages of both sides. Although some CTR model such as Attentional Factorization Machine (AFM) has been proposed to model the weight of second order interaction features, we posit the evaluation of feature importance before explicit feature interaction procedure is also important for CTR prediction tasks because the model can learn to selectively highlight the informative features and suppress less useful ones if the task has many input features. In this paper, we propose a new neural CTR model named Field Attentive Deep Field-aware Factorization Machine (FAT-DeepFFM) by combining the Deep Field-aware Factorization Machine (DeepFFM) with Compose-Excitation network (CENet) field attention mechanism which is proposed by us as an enhanced version of Squeeze-Excitation network (SENet) to highlight the feature importance. We conduct extensive experiments on two real-world datasets and the experiment results show that FAT-DeepFFM achieves the best performance and obtains different improvements over the state-of-the-art methods. We also compare two kinds of attention mechanisms (attention before explicit feature interaction vs. attention after explicit feature interaction) and demonstrate that the former one outperforms the latter one significantly.","url_abs":"https://arxiv.org/abs/1905.06336v1","url_pdf":"https://arxiv.org/pdf/1905.06336v1.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":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/Andy1314Chen/FAT-DeepFFM-Paddle","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"paddle","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/LinJayan/FAT_DeepFFM_Paddle","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"paddle","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/Mind23-2/MindCode-45","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mindspore","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/alililia/ascend_Fat-DeepFFM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mindspore","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/p768lwy3/torecsys","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/sea-wyq/Fat-deepFFM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mindspore","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://git.openi.org.cn/OpenModelZoo/FAT-deepFFM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/2023-MindSpore-1/ms-code-220/tree/main/Fat-DeepFFM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/rank/fat_deepffm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/datawhalechina/torch-rechub/blob/main/torch_rechub/models/ranking/deepffm.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/luxinming/PaddleRec20220725/tree/master/models/rank/fat_deepffm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"paddle","reach":null},{"paper_slug":"fat-deepffm-field-attentive-deep-field-aware","repo_url":"https://github.com/mindspore-ai/models/tree/master/research/recommend/Fat-DeepFFM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"click-through-rate-prediction","task_name":"Click-Through Rate Prediction"},{"task_slug":"feature-importance","task_name":"Feature Importance"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"DeepFFM","rank_in_archive_order":20,"of":39,"metrics":{"AUC":"0.8104","Log Loss":"0.4416"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Andy1314Chen/FAT-DeepFFM-Paddle","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"LinJayan/FAT_DeepFFM_Paddle","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Mind23-2/MindCode-45","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"alililia/ascend_Fat-DeepFFM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"p768lwy3/torecsys","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sea-wyq/Fat-deepFFM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"git.openi.org.cn/OpenModelZoo/FAT-deepFFM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-1/ms-code-220","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PaddlePaddle/PaddleRec","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.05125"],"harvested_for_calls":[{"arxiv_id":"2204.05125","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.05125"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.05125\")"}]},{"repo":"datawhalechina/torch-rechub","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.09433"],"harvested_for_calls":[{"arxiv_id":"1905.09433","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.09433"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.09433\")"}]},{"repo":"luxinming/PaddleRec20220725","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mindspore-ai/models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2208.08084"],"harvested_for_calls":[{"arxiv_id":"2208.08084","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2208.08084"},"call":"get_harvested_code_for_paper(arxiv_id=\"2208.08084\")"}]}],"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":"b0029ae5e01590eee048f6349b2b01bb75e0cca3ea40a9faa2e81d5572a98bc1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}