{"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/mmbattn-max-mean-and-bit-wise-attention-for","title":"MMBAttn: Max-Mean and Bit-wise Attention for CTR Prediction","arxiv_id":"2308.13187","date":"2023-08-25","proceeding":null,"authors":["Hasan Saribas","Cagri Yesil","Serdarcan Dilbaz","Halit Orenbas"],"abstract":"With the increasing complexity and scale of click-through rate (CTR) prediction tasks in online advertising and recommendation systems, accurately estimating the importance of features has become a critical aspect of developing effective models. In this paper, we propose an attention-based approach that leverages max and mean pooling operations, along with a bit-wise attention mechanism, to enhance feature importance estimation in CTR prediction. Traditionally, pooling operations such as max and mean pooling have been widely used to extract relevant information from features. However, these operations can lead to information loss and hinder the accurate determination of feature importance. To address this challenge, we propose a novel attention architecture that utilizes a bit-based attention structure that emphasizes the relationships between all bits in features, together with maximum and mean pooling. By considering the fine-grained interactions at the bit level, our method aims to capture intricate patterns and dependencies that might be overlooked by traditional pooling operations. To examine the effectiveness of the proposed method, experiments have been conducted on three public datasets. The experiments demonstrated that the proposed method significantly improves the performance of the base models to achieve state-of-the-art results.","url_abs":"https://arxiv.org/abs/2308.13187v1","url_pdf":"https://arxiv.org/pdf/2308.13187v1.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":[],"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":[{"method_slug":"base","method_name":"BASE"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/click-through-rate-prediction-on-avazu","task":"Click-Through Rate Prediction","dataset":"Avazu","model":"FinalMLP + MMBAttn","rank_in_archive_order":12,"of":15,"metrics":{"AUC":"0.7666"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-avazu","task":"Click-Through Rate Prediction","dataset":"Avazu","model":"DNN + MMBAttn","rank_in_archive_order":13,"of":15,"metrics":{"AUC":"0.765"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"FinalMLP + MMBAttn","rank_in_archive_order":6,"of":39,"metrics":{"AUC":"0.81497"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-criteo","task":"Click-Through Rate Prediction","dataset":"Criteo","model":"DNN + MMBAttn","rank_in_archive_order":10,"of":39,"metrics":{"AUC":"0.8143"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-frappe","task":"Click-Through Rate Prediction","dataset":"Frappe","model":"FinalMLP + MMBAttn","rank_in_archive_order":3,"of":5,"metrics":{"AUC":"0.9861"},"uses_additional_data":false},{"leaderboard":"/sota/click-through-rate-prediction-on-frappe","task":"Click-Through Rate Prediction","dataset":"Frappe","model":"DNN + MMBAttn","rank_in_archive_order":4,"of":5,"metrics":{"AUC":"0.985"},"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":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"14f12cd41c2318dc84db460019b6edb8a7251328f8a50454c3c7522d1d744be5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}