{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:03:58Z","timestamp":1750309438799,"version":"3.41.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1956393, 1900654, 1815666, 2051592, 2102347, 2103038, 2103439, 2105084, 2138139, 2339266"],"award-info":[{"award-number":["1956393, 1900654, 1815666, 2051592, 2102347, 2103038, 2103439, 2105084, 2138139, 2339266"]}]},{"name":"gift from the UC Noyce Foundation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Priv. Secur."],"published-print":{"date-parts":[[2025,2,28]]},"abstract":"<jats:p>Adblocking relies on filter lists, which are manually curated and maintained by a community of filter list authors. Filter list curation is a laborious process that does not scale well to a large number of sites or over time. In this article, we introduce AutoFR, a reinforcement learning framework to fully automate the process of filter rule creation and evaluation for sites of interest. We design an algorithm based on multi-arm bandits to generate filter rules that block ads while controlling the trade-off between blocking ads and avoiding visual breakage. We test AutoFR on thousands of sites and show that it is efficient: It takes only a few minutes to generate filter rules for a site of interest. AutoFR is effective: It optimizes filter rules for a particular site that can block 86% of the ads, as compared to 87% by EasyList, while achieving comparable visual breakage. Using AutoFR as a building block, we devise three methodologies that generate filter rules across sites based on: (1) a modified version of AutoFR, (2) rule popularity, and (3) site similarity. We conduct an in-depth comparative analysis of these approaches by considering their effectiveness, efficiency, and maintainability. We demonstrate that some of them can generalize well to new sites in both controlled and live settings. We envision that AutoFR can assist the adblocking community in automatically generating and updating filter rules at scale.<\/jats:p>","DOI":"10.1145\/3703836","type":"journal-article","created":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T10:04:27Z","timestamp":1731578667000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["AutoFR: Automated Filter Rule Generation for Adblocking"],"prefix":"10.1145","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-1977-2619","authenticated-orcid":false,"given":"Hieu","family":"Le","sequence":"first","affiliation":[{"name":"Electrical Engineering and Computer Science, University of California Irvine, Irvine, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0969-0197","authenticated-orcid":false,"given":"Salma","family":"Elmalaki","sequence":"additional","affiliation":[{"name":"Electrical Engineering and Computer Science, University of California Irvine, Irvine, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1803-8675","authenticated-orcid":false,"given":"Athina","family":"Markopoulou","sequence":"additional","affiliation":[{"name":"Electrical Engineering and Computer Science, University of California Irvine, Irvine, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4500-9354","authenticated-orcid":false,"given":"Zubair","family":"Shafiq","sequence":"additional","affiliation":[{"name":"Computer Science, University of California Davis, Davis, United States"}]}],"member":"320","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"e_1_3_3_2_2","first-page":"387","volume-title":"Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201920)","author":"Din Zainul Abi","year":"2020","unstructured":"Zainul Abi Din, Panagiotis Tigas, Samuel T. King, and Benjamin Livshits. 2020. PERCIVAL: Making in-browser perceptual ad blocking practical with deep learning. In Proceedings of the USENIX Annual Technical Conference (USENIX ATC\u201920). USENIX Association, 387\u2013400."},{"key":"e_1_3_3_3_2","unstructured":"Adblock Plus. 2018. Sentinel is Online. Retrieved Jan. 24 2022 from https:\/\/blog.adblockplus.org\/blog\/sentinel-is-online"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3355369.3355588"},{"key":"e_1_3_3_5_2","doi-asserted-by":"crossref","unstructured":"Peter Auer Nicolo Cesa-Bianchi and Paul Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47 2 (2002) 235\u2013256.","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_3_6_2","first-page":"116","volume-title":"Proceedings of the Conference on Learning Theory","author":"Auer Peter","year":"2016","unstructured":"Peter Auer and Chao-Kai Chiang. 2016. An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits. In Proceedings of the Conference on Learning Theory. PMLR, 116\u2013120."},{"key":"e_1_3_3_7_2","unstructured":"Backlinko. 2022. Ad Blockers Usage and Demographic Statistics in 2022. Retrieved Jan. 27 2022 from https:\/\/backlinko.com\/ad-blockers-users"},{"key":"e_1_3_3_8_2","unstructured":"Collin Barrett. 2022. FilterLists. Retrieved Jan. 27 2022 from https:\/\/filterlists.com\/"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/2666652.2666662"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485730.3485944"},{"key":"e_1_3_3_11_2","first-page":"258","volume-title":"Proceedings of the 30th International Conference on International Conference on Machine Learning","author":"Bubeck S\u00e9bastien","year":"2013","unstructured":"S\u00e9bastien Bubeck, Tengyao Wang, and Nitin Viswanathan. 2013. Multiple identifications in multi-armed bandits. In Proceedings of the 30th International Conference on International Conference on Machine Learning. PMLR, 258\u2013265."},{"key":"e_1_3_3_12_2","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems","volume":"28","author":"Cao Wei","year":"2015","unstructured":"Wei Cao, Jian Li, Yufei Tao, and Zhize Li. 2015. On Top-k selection in multi-armed bandits and hidden bipartite graphs. In Proceedings of the Conference on Advances in Neural Information Processing Systems, C. Cortes, N. Lawrence, D. Lee, M. Sugiyama, and R. Garnett (Eds.), Vol. 28. Curran Associates. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2015\/file\/ab233b682ec355648e7891e66c54191b-Paper.pdf"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00007"},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","unstructured":"Gabriel Dulac-Arnold Nir Levine Daniel J Mankowitz Jerry Li Cosmin Paduraru Sven Gowal and Todd Hester. 2021. Challenges of real-world reinforcement learning: Definitions benchmarks and analysis. Mach. Learn. 110 9 (2021) 2419\u20132468.","DOI":"10.1007\/s10994-021-05961-4"},{"key":"e_1_3_3_15_2","unstructured":"EasyList. 2022. EasyList. Retrieved from https:\/\/easylist.to\/"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3450268.3453525"},{"key":"e_1_3_3_17_2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/3274783.3274843","volume-title":"Proceedings of the 16th ACM Conference on Embedded Networked Sensor Systems","author":"Elmalaki Salma","year":"2018","unstructured":"Salma Elmalaki, Huey-Ru Tsai, and Mani Srivastava. 2018. Sentio: Driver-in-the-loop forward collision warning using multisample reinforcement learning. In Proceedings of the 16th ACM Conference on Embedded Networked Sensor Systems. ACM, 28\u201340."},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0038"},{"key":"e_1_3_3_19_2","first-page":"3212","volume-title":"Proceedings of the 25th International Conference on Neural Information Processing Systems","author":"Gabillon Victor","year":"2012","unstructured":"Victor Gabillon, Mohammad Ghavamzadeh, and Alessandro Lazaric. 2012. Best arm identification: A unified approach to fixed budget and fixed confidence. In Proceedings of the 25th International Conference on Neural Information Processing Systems. Curran Associates, 3212\u20133220."},{"key":"e_1_3_3_20_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Gleave Adam","year":"2020","unstructured":"Adam Gleave, Michael Dennis, Cody Wild, Neel Kant, Sergey Levine, and Stuart Russell. 2020. Adversarial policies: Attacking deep reinforcement learning. In Proceedings of the International Conference on Learning Representations. ICLR."},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0018"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1609\/hcomp.v7i1.5279"},{"key":"e_1_3_3_23_2","first-page":"202","volume-title":"Proceedings of the IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS\u201919)","author":"Immorlica Nicole","year":"2019","unstructured":"Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire, and Aleksandrs Slivkins. 2019. Adversarial bandits with knapsacks. In Proceedings of the IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS\u201919). IEEE, 202\u2013219."},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00005"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00624"},{"key":"e_1_3_3_26_2","first-page":"1839","volume-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics","author":"Katariya Sumeet","year":"2018","unstructured":"Sumeet Katariya, Lalit Jain, Nandana Sengupta, James Evans, and Robert Nowak. 2018. Adaptive sampling for coarse ranking. In Proceedings of the International Conference on Artificial Intelligence and Statistics. PMLR, 1839\u20131848."},{"key":"e_1_3_3_27_2","first-page":"697","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems","volume":"17","author":"Kleinberg Robert","year":"2004","unstructured":"Robert Kleinberg. 2004. Nearly tight bounds for the continuum-armed bandit problem. In Proceedings of the Conference on Advances in Neural Information Processing Systems, L. Saul, Y. Weiss, and L. Bottou (Eds.), Vol. 17. MIT Press, Vancouver, Canada, 697\u2013704. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2004\/file\/b75bd27b5a48a1b48987a18d831f6336-Paper.pdf"},{"key":"e_1_3_3_28_2","first-page":"594","volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science","author":"Kleinberg Robert","year":"2003","unstructured":"Robert Kleinberg and Tom Leighton. 2003. The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 594\u2013605."},{"key":"e_1_3_3_29_2","unstructured":"Hieu Le. 2023. AutoFR Project Page. Retrieved Jan. 5 2023 from https:\/\/athinagroup.eng.uci.edu\/projects\/ats-on-the-web\/"},{"key":"e_1_3_3_30_2","unstructured":"Hieu Le Salma Elmalaki Athina Markopoulou and Zubair Shafiq. 2022. AutoFR: Automated filter rule generation for adblocking (extended version). Retrieved from https:\/\/arXiv:2202.12872"},{"key":"e_1_3_3_31_2","first-page":"7535","volume-title":"Proceedings of the 32nd USENIX Security Symposium (USENIX Security\u201923)","author":"Le Hieu","year":"2023","unstructured":"Hieu Le, Salma Elmalaki, Athina Markopoulou, and Zubair Shafiq. 2023. AutoFR: Automated filter rule generation for adblocking. In Proceedings of the 32nd USENIX Security Symposium (USENIX Security\u201923). USENIX Association, 7535\u20137552. Retrieved from https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/le"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24055"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2019.23386"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"e_1_3_3_35_2","series-title":"Proceedings of Machine Learning Research","first-page":"1690","volume-title":"Proceedings of the 33rd International Conference on Machine Learning","volume":"48","author":"Locatelli Andrea","year":"2016","unstructured":"Andrea Locatelli, Maurilio Gutzeit, and Alexandra Carpentier. 2016. An optimal algorithm for the Thresholding Bandit Problem. In Proceedings of the 33rd International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol. 48), Maria Florina Balcan and Kilian Q. Weinberger (Eds.). PMLR, 1690\u20131698. Retrieved from https:\/\/proceedings.mlr.press\/v48\/locatelli16.html"},{"key":"e_1_3_3_36_2","unstructured":"MDN. 2022. Text: Web APIs. Retrieved Jan. 6 2022 from https:\/\/developer.mozilla.org\/en-US\/docs\/Web\/API\/Text"},{"key":"e_1_3_3_37_2","unstructured":"Humara Minhas. 2022. Project Moonshot: Experimentation with Machine Learning based Ad Blocking. Retrieved Jan. 28 2022 from https:\/\/www.youtube.com\/watch?v=1nJfvtvOOs0"},{"key":"e_1_3_3_38_2","unstructured":"mozdev. 2002. Adblocker. Retrieved Jan. 28 2022 from https:\/\/web.archive.org\/web\/20021206021438http:\/\/adblock.mozdev.org\/"},{"key":"e_1_3_3_39_2","first-page":"1977","volume-title":"Proceedings of the 33rd International Conference on Machine Learning","author":"Rakhlin Alexander","year":"2016","unstructured":"Alexander Rakhlin and Karthik Sridharan. 2016. Bistro: An efficient relaxation-based method for contextual bandits. In Proceedings of the 33rd International Conference on Machine Learning. PMLR, 1977\u20131985."},{"key":"e_1_3_3_40_2","unstructured":"scrapinghub. 2016. Python Parser for Adblock Plus Filters. Retrieved Jan. 7 2022 from https:\/\/github.com\/scrapinghub\/adblockparser"},{"key":"e_1_3_3_41_2","volume-title":"Proceedings of the 31st USENIX Security Symposium (USENIX Security\u201922)","author":"Siby Sandra","year":"2022","unstructured":"Sandra Siby, Umar Iqbal, Steven Englehardt, Zubair Shafiq, and Carmela Troncoso. 2022. WebGraph: Capturing advertising and tracking information flows for robust blocking. In Proceedings of the 31st USENIX Security Symposium (USENIX Security\u201922). USENIX Association. Retrieved from https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/siby"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380239"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3392144"},{"key":"e_1_3_3_44_2","unstructured":"Grant Storey Dillon Reisman Jonathan R. Mayer and Arvind Narayanan. 2017. The future of Ad Blocking: An analytical framework and new techniques. Retrieved from http:\/\/arxiv.org\/abs\/1705.08568"},{"key":"e_1_3_3_45_2","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton Richard","year":"2018","unstructured":"Richard Sutton and Andrew Barto. 2018. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA."},{"key":"e_1_3_3_46_2","first-page":"2005","volume-title":"Proceedings of the ACM SIGSAC Conference on Computer and Communications Security","author":"Tram\u00e8r Florian","year":"2019","unstructured":"Florian Tram\u00e8r, Pascal Dupr\u00e9, Gili Rusak, Giancarlo Pellegrino, and Dan Boneh. 2019. Adversarial: Perceptual ad blocking meets adversarial machine learning. In Proceedings of the ACM SIGSAC Conference on Computer and Communications Security. ACM, 2005\u20132021."},{"key":"e_1_3_3_47_2","unstructured":"Tranco. 2022. Information on the Tranco List with ID XV9N. Retrieved Jan. 31 2022 from https:\/\/tranco-list.eu\/list\/XV9N\/full"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","DOI":"10.1145\/2815675.2815703"},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2021.24486"},{"key":"e_1_3_3_50_2","first-page":"22550","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems","volume":"34","author":"Xu Yinglun","year":"2021","unstructured":"Yinglun Xu, Bhuvesh Kumar, and Jacob D. Abernethy. 2021. Observation-free attacks on stochastic bandits. In Proceedings of the Conference on Advances in Neural Information Processing Systems, M. Ranzato, A. Beygelzimer, Y. Dauphin, P. S. Liang, and J. Wortman Vaughan (Eds.), Vol. 34. Curran Associates, Inc., Virtual, 22550\u201322561. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/be315e7f05e9f13629031915fe87ad44-Paper.pdf"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833670"},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","unstructured":"Liang Yu Weiwei Xie Di Xie Yulong Zou Dengyin Zhang Zhixin Sun Linghua Zhang Yue Zhang and Tao Jiang. 2019. Deep reinforcement learning for smart home energy management. IEEE Internet Things J. 7 4 (2019) 2751\u20132762.","DOI":"10.1109\/JIOT.2019.2957289"},{"key":"e_1_3_3_53_2","volume-title":"Proceedings of the Network and Distributed System Security Symposium (NDSS\u201918)","author":"Zhu Shitong","year":"2018","unstructured":"Shitong Zhu, Xunchao Hu, Zhiyun Qian, Zubair Shafiq, and Heng Yin. 2018. Measuring and disrupting anti-adblockers using differential execution analysis. In Proceedings of the Network and Distributed System Security Symposium (NDSS\u201918). The Internet Society."}],"container-title":["ACM Transactions on Privacy and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3703836","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3703836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:09:42Z","timestamp":1750295382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3703836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,28]]}},"alternative-id":["10.1145\/3703836"],"URL":"https:\/\/doi.org\/10.1145\/3703836","relation":{},"ISSN":["2471-2566","2471-2574"],"issn-type":[{"type":"print","value":"2471-2566"},{"type":"electronic","value":"2471-2574"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"2023-09-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-29","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}