{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T19:49:15Z","timestamp":1774554555709,"version":"3.50.1"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2026,3,26]]},"abstract":"<jats:p>Modern content platforms offer paid promotion to mitigate cold start by allocating exposure via auctions. Our empirical analysis reveals a counterintuitive flaw in this paradigm: while promotion rescues low-to-medium quality content, it can harm high-quality content by forcing exposure to suboptimal audiences, polluting engagement signals and downgrading future recommendation. We recast content promotion as a dual-objective optimization that balances short-term value acquisition with long-term model improvement. To make this tractable at bid time in content promotion, we introduce a decomposable surrogate objective, gradient coverage, and establish its formal connection to Fisher Information and optimal experimental design. We design a two-stage auto-bidding algorithm based on Lagrange duality that dynamically paces budget through a shadow price and optimizes impression-level bids using per-impression marginal utilities. To address missing labels at bid time, we propose a confidence-gated gradient heuristic, paired with a zeroth-order variant for black-box models that reliably estimates learning signals in real time. We provide theoretical guarantees, proving monotone submodularity of the composite objective, sublinear regret in online auction, and budget feasibility. Extensive offline experiments on synthetic and real-world datasets validate the framework: it outperforms baselines, achieves superior final AUC\/LogLoss, adheres closely to budget targets, and remains effective when gradients are approximated zeroth-order. These results show that strategic, information-aware promotion can improve long-term model performance and organic outcomes beyond naive impression-maximization strategies.<\/jats:p>","DOI":"10.1145\/3788094","type":"journal-article","created":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T18:49:47Z","timestamp":1774550987000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Guiding the Recommender: Information-Aware Auto-Bidding for Content Promotion"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0136-9248","authenticated-orcid":false,"given":"Yumou","family":"Liu","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5094-5331","authenticated-orcid":false,"given":"Zhenzhe","family":"Zheng","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4210-8153","authenticated-orcid":false,"given":"Jiang","family":"Rong","sequence":"additional","affiliation":[{"name":"Xiaohongshu, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1274-7111","authenticated-orcid":false,"given":"Yao","family":"Hu","sequence":"additional","affiliation":[{"name":"Xiaohongshu, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0965-9058","authenticated-orcid":false,"given":"Fan","family":"Wu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6934-1685","authenticated-orcid":false,"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,26]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Advances in Neural Information Processing Systems","volume":"22","author":"Agarwal Alekh","year":"2009","unstructured":"Alekh Agarwal, Martin J Wainwright, Peter Bartlett, and Pradeep Ravikumar. 2009. Information-Theoretic Lower Bounds on the Oracle Complexity of Convex Optimization. Advances in Neural Information Processing Systems, Vol. 22 (2009)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/3699824.3699838","article-title":". Auto-Bidding and Auctions in Online Advertising: A Survey","volume":"22","author":"Aggarwal Gagan","year":"2024","unstructured":"Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, et al., 2024. Auto-Bidding and Auctions in Online Advertising: A Survey. ACM SIGecom Exchanges, Vol. 22, 1 (2024), 159-183.","journal-title":"ACM SIGecom Exchanges"},{"key":"e_1_2_1_3_1","volume-title":"No-Regret Learning in Repeated First-Price Auctions with Budget Constraints. arXiv preprint arXiv:2205.14572","author":"Ai Rui","year":"2022","unstructured":"Rui Ai, Chang Wang, Chenchen Li, Jinshan Zhang, Wenhan Huang, and Xiaotie Deng. 2022. No-Regret Learning in Repeated First-Price Auctions with Budget Constraints. arXiv preprint arXiv:2205.14572 (2022)."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10107-019-01464-2","article-title":"Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach","volume":"186","author":"Allen-Zhu Zeyuan","year":"2021","unstructured":"Zeyuan Allen-Zhu, Yuanzhi Li, Aarti Singh, and Yining Wang. 2021. Near-Optimal Discrete Optimization for Experimental Design: A Regret Minimization Approach. Mathematical Programming, Vol. 186, 1 (2021), 439-478.","journal-title":"Mathematical Programming"},{"key":"e_1_2_1_5_1","volume-title":"Uncertain Gradient Lower Bounds. In International Conference on Learning Representations.","author":"Ash Jordan T.","year":"2020","unstructured":"Jordan T. Ash, Chicheng Zhang, Akshay Krishnamurthy, John Langford, and Alekh Agarwal. 2020. Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds. In International Conference on Learning Representations."},{"key":"e_1_2_1_6_1","volume-title":"Advances in Neural Information Processing Systems","volume":"31","author":"Balasubramanian Krishnakumar","year":"2018","unstructured":"Krishnakumar Balasubramanian and Saeed Ghadimi. 2018. Zeroth-Order (Non)-Convex Stochastic Optimization via Conditional Gradient and Gradient Updates. Advances in Neural Information Processing Systems, Vol. 31 (2018)."},{"key":"e_1_2_1_7_1","unstructured":"Bernard Marr & Co. 2025. How Much Data Do We Create Every Day? The Mind-Blowing Stats Everyone Should Read. https:\/\/bernardmarr.com\/how-much-data-do-we-create-every-day-the-mind-blowing-stats-everyone-should-read\/"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"3312","DOI":"10.1137\/17M1154679","article-title":"Adaptive Sampling Strategies for Stochastic Optimization","volume":"28","author":"Bollapragada Raghu","year":"2018","unstructured":"Raghu Bollapragada, Richard Byrd, and Jorge Nocedal. 2018. Adaptive Sampling Strategies for Stochastic Optimization. SIAM Journal on Optimization, Vol. 28, 4 (2018), 3312-3343.","journal-title":"SIAM Journal on Optimization"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/21M1392966","article-title":"Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling","volume":"32","author":"Cai HanQin","year":"2022","unstructured":"HanQin Cai, Daniel Mckenzie, Wotao Yin, and Zhenliang Zhang. 2022. Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling. SIAM Journal on Optimization, Vol. 32, 2 (2022), 687-714.","journal-title":"SIAM Journal on Optimization"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Kathryn Chaloner and Isabella Verdinelli. 1995. Bayesian Experimental Design: A Review. Statist. Sci. (1995) 273-304.","DOI":"10.1214\/ss\/1177009939"},{"key":"e_1_2_1_11_1","volume-title":"Regression-Based Single-Point Zeroth-Order Optimization. arXiv preprint arXiv:2507.04223","author":"Chen Xin","year":"2025","unstructured":"Xin Chen and Zhaolin Ren. 2025. Regression-Based Single-Point Zeroth-Order Optimization. arXiv preprint arXiv:2507.04223 (2025)."},{"key":"e_1_2_1_12_1","volume-title":"International Conference on Machine Learning. 3603-3620","author":"Chen Xin","year":"2022","unstructured":"Xin Chen, Yujie Tang, and Na Li. 2022. Improve Single-Point Zeroth-Order Optimization using High-Pass and Low-Pass Filters. In International Conference on Machine Learning. 3603-3620."},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1613\/jair.295","article-title":"Active Learning with Statistical Models","volume":"4","author":"Cohn David A","year":"1996","unstructured":"David A Cohn, Zoubin Ghahramani, and Michael I Jordan. 1996. Active Learning with Statistical Models. Journal of Artificial Intelligence Research, Vol. 4 (1996), 129-145.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"e_1_2_1_14_1","volume-title":"Advances in Neural Information Processing Systems","volume":"20","author":"Dani Varsha","year":"2007","unstructured":"Varsha Dani, Sham M Kakade, and Thomas Hayes. 2007. The Price of Bandit Information for Online Optimization. Advances in Neural Information Processing Systems, Vol. 20 (2007)."},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the AdKDD and TargetAd Workshop. ACM.","author":"Eustache Diemert","year":"2017","unstructured":"Diemert Eustache, Meynet Julien, Pierre Galland, and Damien Lefortier. 2017. Attribution Modeling Increases Efficiency of Bidding in Display Advertising. In Proceedings of the AdKDD and TargetAd Workshop. ACM."},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","article-title":"Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations","volume":"61","author":"Duchi John C","year":"2015","unstructured":"John C Duchi, Michael I Jordan, Martin J Wainwright, and Andre Wibisono. 2015. Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations. IEEE Transactions on Information Theory, Vol. 61, 5 (2015), 2788-2806.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1111\/j.2517-6161.1992.tb01897.x","article-title":"The Use of a Canonical Form in the Construction of Locally Optimal Designs for Non-Linear Problems","volume":"54","author":"Ford Ian","year":"1992","unstructured":"Ian Ford, Bernard Torsney, and CF Jeff Wu. 1992. The Use of a Canonical Form in the Construction of Locally Optimal Designs for Non-Linear Problems. Journal of the Royal Statistical Society Series B: Statistical Methodology, Vol. 54, 2 (1992), 569-583.","journal-title":"Journal of the Royal Statistical Society Series B: Statistical Methodology"},{"key":"e_1_2_1_18_1","volume-title":"Selecting Influential Examples: Active Learning with Expected Model Output Changes. In European Conference on Computer Vision. Springer, 562-577","author":"Freytag Alexander","year":"2014","unstructured":"Alexander Freytag, Erik Rodner, and Joachim Denzler. 2014. Selecting Influential Examples: Active Learning with Expected Model Output Changes. In European Conference on Computer Vision. Springer, 562-577."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1134\/S0005117917020035","article-title":"Stochastic Online Optimization. Single-Point and Multi-Point Non-Linear Multi-Armed Bandits","volume":"78","author":"Gasnikov Alexander V","year":"2017","unstructured":"Alexander V Gasnikov, Ekaterina A Krymova, Anastasia A Lagunovskaya, Ilnura N Usmanova, and Fedor A Fedorenko. 2017. Stochastic Online Optimization. Single-Point and Multi-Point Non-Linear Multi-Armed Bandits. Convex and Strongly-Convex Case. Automation and Remote Control, Vol. 78, 2 (2017), 224-234.","journal-title":"Convex and Strongly-Convex Case. Automation and Remote Control"},{"key":"e_1_2_1_20_1","volume-title":"Variance-Reduced Zeroth-Order Methods for Fine-Tuning Language Models. arXiv preprint arXiv:2404.08080","author":"Gautam Tanmay","year":"2024","unstructured":"Tanmay Gautam, Youngsuk Park, Hao Zhou, Parameswaran Raman, and Wooseok Ha. 2024. Variance-Reduced Zeroth-Order Methods for Fine-Tuning Language Models. arXiv preprint arXiv:2404.08080 (2024)."},{"key":"e_1_2_1_21_1","unstructured":"Google AdSense. 2021. Moving AdSense to a First-Price Auction. https:\/\/blog.google\/products\/adsense\/our-move-to-a-first-price-auction\/"},{"key":"e_1_2_1_22_1","volume-title":"Large Scale Ad Latency Analysis. In International Conference on Big Data. IEEE, 762-767","author":"Grbovic Mihajlo","year":"2013","unstructured":"Mihajlo Grbovic, Jon Malkin, and Hirakendu Das. 2013. Large Scale Ad Latency Analysis. In International Conference on Big Data. IEEE, 762-767."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 22nd International Conference on Machine Learning. 265-272","author":"Guestrin Carlos","year":"2005","unstructured":"Carlos Guestrin, Andreas Krause, and Ajit Paul Singh. 2005. Near-Optimal Sensor Placements in Gaussian Processes. In Proceedings of the 22nd International Conference on Machine Learning. 265-272."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/opre.2020.0282","article-title":"Optimal No-Regret Learning in Repeated First-Price Auctions","volume":"73","author":"Han Yanjun","year":"2025","unstructured":"Yanjun Han, Tsachy Weissman, and Zhengyuan Zhou. 2025. Optimal No-Regret Learning in Repeated First-Price Auctions. Operations Research, Vol. 73, 1 (2025), 209-238.","journal-title":"Operations Research"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1017\/S0962492924000023","article-title":"Optimal Experimental Design: Formulations and Computations","volume":"33","author":"Huan Xun","year":"2024","unstructured":"Xun Huan, Jayanth Jagalur, and Youssef Marzouk. 2024. Optimal Experimental Design: Formulations and Computations. Acta Numerica, Vol. 33 (2024), 715-840.","journal-title":"Acta Numerica"},{"key":"e_1_2_1_26_1","volume-title":"Zeroth-Order Learning in Continuous Games via Residual Pseudogradient Estimates","author":"Huang Yuanhanqing","year":"2024","unstructured":"Yuanhanqing Huang and Jianghai Hu. 2024. Zeroth-Order Learning in Continuous Games via Residual Pseudogradient Estimates. IEEE Trans. Automat. Control (2024)."},{"key":"e_1_2_1_27_1","volume-title":"Advances in Neural Information Processing Systems","volume":"25","author":"Jamieson Kevin G","year":"2012","unstructured":"Kevin G Jamieson, Robert Nowak, and Ben Recht. 2012. Query Complexity of Derivative-Free Optimization. Advances in Neural Information Processing Systems, Vol. 25 (2012)."},{"key":"e_1_2_1_28_1","volume-title":"Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization. In International Conference on Machine Learning. 3100-3109","author":"Ji Kaiyi","year":"2019","unstructured":"Kaiyi Ji, Zhe Wang, Yi Zhou, and Yingbin Liang. 2019. Improved Zeroth-Order Variance Reduced Algorithms and Analysis for Nonconvex Optimization. In International Conference on Machine Learning. 3100-3109."},{"key":"e_1_2_1_29_1","first-page":"3","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"38","author":"Jiang Shuoran","year":"2024","unstructured":"Shuoran Jiang, Qingcai Chen, Youcheng Pan, Yang Xiang, Yukang Lin, Xiangping Wu, Chuanyi Liu, and Xiaobao Song. 2024. ZO-AdamU optimizer: Adapting Perturbation by the Momentum and Uncertainty in Zeroth-Order Optimization. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38. 18363-18371."},{"key":"e_1_2_1_30_1","volume-title":"Adaptive Bid Shading Optimization of First-Price Ad Inventory. In American Control Conference. IEEE, 4983-4990","author":"Karlsson Niklas","year":"2021","unstructured":"Niklas Karlsson and Qian Sang. 2021. Adaptive Bid Shading Optimization of First-Price Ad Inventory. In American Control Conference. IEEE, 4983-4990."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1111\/j.2517-6161.1959.tb00338.x","article-title":"Optimum Experimental Designs","volume":"21","author":"Kiefer Jack","year":"1959","unstructured":"Jack Kiefer. 1959. Optimum Experimental Designs. Journal of the Royal Statistical Society: Series B (Methodological), Vol. 21, 2 (1959), 272-304.","journal-title":"Journal of the Royal Statistical Society: Series B (Methodological)"},{"key":"e_1_2_1_32_1","volume-title":"Subspace-Based Approximate Hessian Method for Zeroth-Order Optimization. arXiv preprint arXiv:2507.06125","author":"Kim Dongyoon","year":"2025","unstructured":"Dongyoon Kim, Sungjae Lee, Wonjin Lee, and Kwang In Kim. 2025. Subspace-Based Approximate Hessian Method for Zeroth-Order Optimization. arXiv preprint arXiv:2507.06125 (2025)."},{"key":"e_1_2_1_33_1","first-page":"26160","article-title":"Gradient-Free methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization","volume":"35","author":"Lin Tianyi","year":"2022","unstructured":"Tianyi Lin, Zeyu Zheng, and Michael Jordan. 2022. Gradient-Free methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization. Advances in Neural Information Processing Systems, Vol. 35 (2022), 26160-26175.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1214\/aoms\/1177728069","article-title":"On a Measure of the Information Provided by an Experiment","volume":"27","author":"Lindley Dennis V","year":"1956","unstructured":"Dennis V Lindley. 1956. On a Measure of the Information Provided by an Experiment. The Annals of Mathematical Statistics, Vol. 27, 4 (1956), 986-1005.","journal-title":"The Annals of Mathematical Statistics"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MSP.2020.3003837","article-title":"A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learning: Principals, Recent Advances, and Applications","volume":"37","author":"Liu Sijia","year":"2020","unstructured":"Sijia Liu, Pin-Yu Chen, Bhavya Kailkhura, Gaoyuan Zhang, Alfred O Hero III, and Pramod K Varshney. 2020. A Primer on Zeroth-Order Optimization in Signal Processing and Machine Learning: Principals, Recent Advances, and Applications. IEEE Signal Processing Magazine, Vol. 37, 5 (2020), 43-54.","journal-title":"IEEE Signal Processing Magazine"},{"key":"e_1_2_1_36_1","volume-title":"Advances in Neural Information Processing Systems","volume":"31","author":"Liu Sijia","year":"2018","unstructured":"Sijia Liu, Bhavya Kailkhura, Pin-Yu Chen, Paishun Ting, Shiyu Chang, and Lisa Amini. 2018. Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization. Advances in Neural Information Processing Systems, Vol. 31 (2018)."},{"key":"e_1_2_1_37_1","volume-title":"Praneeth Vepakomma, Michael Jordan, and Ramesh Raskar.","author":"Lu Charles","year":"2024","unstructured":"Charles Lu, Baihe Huang, Sai Praneeth Karimireddy, Praneeth Vepakomma, Michael Jordan, and Ramesh Raskar. 2024. DAVED: Data Acquisition via Experimental Design for Data Markets. arXiv preprint arXiv:2403.13893 (2024)."},{"key":"e_1_2_1_38_1","first-page":"2579","article-title":"Visualizing Data Using t-SNE","volume":"9","author":"van der Maaten Laurens","year":"2008","unstructured":"Laurens van der Maaten and Geoffrey Hinton. 2008. Visualizing Data Using t-SNE. Journal of Machine Learning Research, Vol. 9, Nov (2008), 2579-2605.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_39_1","volume-title":"Information-Based Objective Functions for Active Data Selection. Neural computation","author":"MacKay David JC","year":"1992","unstructured":"David JC MacKay. 1992. Information-Based Objective Functions for Active Data Selection. Neural computation, Vol. 4, 4 (1992), 590-604."},{"key":"e_1_2_1_40_1","volume-title":"Fine-Tuning Language Models with Just Forward Passes. arXiv preprint arXiv:2305.17333","author":"Malladi Sadhika","year":"2023","unstructured":"Sadhika Malladi, Tianyu Gao, Eshaan Nichani, Alex Damian, Jason D Lee, Danqi Chen, and Sanjeev Arora. 2023. Fine-Tuning Language Models with Just Forward Passes. arXiv preprint arXiv:2305.17333 (2023)."},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/moor.6.1.58","article-title":"Optimal Auction Design","volume":"6","author":"Myerson Roger B","year":"1981","unstructured":"Roger B Myerson. 1981. Optimal Auction Design. Mathematics of Operations Research, Vol. 6, 1 (1981), 58-73.","journal-title":"Mathematics of Operations Research"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","article-title":"Random Gradient-Free Minimization of Convex Functions","volume":"17","author":"Nesterov Yurii","year":"2017","unstructured":"Yurii Nesterov and Vladimir Spokoiny. 2017. Random Gradient-Free Minimization of Convex Functions. Foundations of Computational Mathematics, Vol. 17, 2 (2017), 527-566.","journal-title":"Foundations of Computational Mathematics"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0377-2217(98)00186-6","article-title":"Strategic Facility Location","volume":"111","author":"Owen Susan Hesse","year":"1998","unstructured":"Susan Hesse Owen and Mark S Daskin. 1998. Strategic Facility Location: A Review. European Journal of Operational Research, Vol. 111, 3 (1998), 423-447.","journal-title":"A Review. European Journal of Operational Research"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10844-022-00698-5","article-title":"Approaches and Algorithms to Mitigate Cold Start Problems in Recommender Systems: a Systematic Literature Review","volume":"59","author":"Panda Deepak Kumar","year":"2022","unstructured":"Deepak Kumar Panda and Sanjog Ray. 2022. Approaches and Algorithms to Mitigate Cold Start Problems in Recommender Systems: a Systematic Literature Review. Journal of Intelligent Information Systems, Vol. 59, 2 (2022), 341-366.","journal-title":"Journal of Intelligent Information Systems"},{"key":"e_1_2_1_45_1","volume-title":"Stochastic Two Points Method for Deep Model Zeroth-order Optimization. arXiv preprint arXiv:2402.01621","author":"Pang Yijiang","year":"2024","unstructured":"Yijiang Pang and Jiayu Zhou. 2024. Stochastic Two Points Method for Deep Model Zeroth-order Optimization. arXiv preprint arXiv:2402.01621 (2024)."},{"key":"e_1_2_1_46_1","series-title":"Lecture Notes in Statistics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-6363-4","volume-title":"Design of Experiments in Nonlinear Models","author":"Pronzato Luc","year":"2013","unstructured":"Luc Pronzato and Andrej P\u00e1zman. 2013. Design of Experiments in Nonlinear Models. Lecture Notes in Statistics, Vol. 212, 1 (2013)."},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Friedrich Pukelsheim. 2006. Optimal Design of Experiments. SIAM.","DOI":"10.1137\/1.9780898719109"},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","first-page":"7036","DOI":"10.1109\/TIT.2011.2154375","article-title":"Information-Based Complexity, Feedback and Dynamics in Convex Programming","volume":"57","author":"Raginsky Maxim","year":"2011","unstructured":"Maxim Raginsky and Alexander Rakhlin. 2011. Information-Based Complexity, Feedback and Dynamics in Convex Programming. IEEE Transactions on Information Theory, Vol. 57, 10 (2011), 7036-7056.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_49_1","volume-title":"Active Learning for Convolutional Neural Networks: A Core-Set Approach. In International Conference on Learning Representations.","author":"Sener Ozan","year":"2018","unstructured":"Ozan Sener and Silvio Savarese. 2018. Active Learning for Convolutional Neural Networks: A Core-Set Approach. In International Conference on Learning Representations."},{"key":"e_1_2_1_50_1","unstructured":"Burr Settles. 2009. Active Learning Literature Survey. (2009)."},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing. 1070-1079","author":"Settles Burr","year":"2008","unstructured":"Burr Settles and Mark Craven. 2008. An Analysis of Active Learning Strategies for Sequence Labeling Tasks. In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing. 1070-1079."},{"key":"e_1_2_1_52_1","volume-title":"On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization. In Conference on Learning Theory. PMLR, 3-24","author":"Shamir Ohad","year":"2013","unstructured":"Ohad Shamir. 2013. On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization. In Conference on Learning Theory. PMLR, 3-24."},{"key":"e_1_2_1_53_1","first-page":"1703","article-title":"An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback","volume":"18","author":"Shamir Ohad","year":"2017","unstructured":"Ohad Shamir. 2017. An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback. The Journal of Machine Learning Research, Vol. 18, 1 (2017), 1703-1713.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729893"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","article-title":"Optimal Facility Location with Concave Costs","volume":"22","author":"Soland Richard M","year":"1974","unstructured":"Richard M Soland. 1974. Optimal Facility Location with Concave Costs. Operations Research, Vol. 22, 2 (1974), 373-382.","journal-title":"Operations Research"},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/9.119632","article-title":"Multivariate Stochastic Approximation Using a Simultaneous Perturbation Gradient Approximation","volume":"37","author":"Spall James C","year":"1992","unstructured":"James C Spall. 1992. Multivariate Stochastic Approximation Using a Simultaneous Perturbation Gradient Approximation. IEEE Transactions on Automatic Control, Vol. 37, 3 (1992), 332-341.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"e_1_2_1_57_1","unstructured":"TikTok. 2025. About Promote on TikTok. https:\/\/ads.tiktok.com\/help\/article\/about-promote-on-tiktok?lang=en"},{"key":"e_1_2_1_58_1","unstructured":"TikTok. 2025. TikTok. https:\/\/www.tiktok.com"},{"key":"e_1_2_1_59_1","volume-title":"International Conference on Machine Learning. 36494-36513","author":"Wang Qian","year":"2023","unstructured":"Qian Wang, Zongjun Yang, Xiaotie Deng, and Yuqing Kong. 2023. Learning to Bid in Repeated First-Price Auctions with Budgets. In International Conference on Machine Learning. 36494-36513."},{"key":"e_1_2_1_60_1","first-page":"15070","article-title":"Relizo: Sample Reusable Linear Interpolation-Based Zeroth-Order Optimization","volume":"37","author":"Wang Xiaoxing","year":"2024","unstructured":"Xiaoxing Wang, Xiaohan Qin, Xiaokang Yang, and Junchi Yan. 2024. Relizo: Sample Reusable Linear Interpolation-Based Zeroth-Order Optimization. Advances in Neural Information Processing Systems, Vol. 37 (2024), 15070-15096.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_61_1","volume-title":"Stochastic Zeroth-Order Optimization in High Dimensions. In Twenty-First Annual Conference on Artificial Intelligence and Statistics. 1356-1365","author":"Wang Yining","year":"2018","unstructured":"Yining Wang, Simon Du, Sivaraman Balakrishnan, and Aarti Singh. 2018. Stochastic Zeroth-Order Optimization in High Dimensions. In Twenty-First Annual Conference on Artificial Intelligence and Statistics. 1356-1365."},{"key":"e_1_2_1_62_1","volume-title":"Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities. arXiv preprint arXiv:2001.07819","author":"Wang Zhongruo","year":"2020","unstructured":"Zhongruo Wang, Krishnakumar Balasubramanian, Shiqian Ma, and Meisam Razaviyayn. 2020. Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities. arXiv preprint arXiv:2001.07819 (2020)."},{"key":"e_1_2_1_63_1","volume-title":"Fisher Matrix for Beginners. arXiv preprint arXiv:2510.09683","author":"Wittman David","year":"2025","unstructured":"David Wittman. 2025. Fisher Matrix for Beginners. arXiv preprint arXiv:2510.09683 (2025)."},{"key":"e_1_2_1_64_1","unstructured":"Xiaohongshu. 2025. What is Shutiao? https:\/\/help.reditorapp.com\/yunying\/liuliang\/shutiao.html"},{"key":"e_1_2_1_65_1","unstructured":"Xiaohongshu. 2025. Xiaohongshu. https:\/\/www.xiaohongshu.com"},{"key":"e_1_2_1_66_1","doi-asserted-by":"crossref","first-page":"110353","DOI":"10.1016\/j.automatica.2022.110353","article-title":"Zeroth-Order Algorithms for Stochastic Distributed Nonconvex Optimization","volume":"142","author":"Yi Xinlei","year":"2022","unstructured":"Xinlei Yi, Shengjun Zhang, Tao Yang, and Karl H Johansson. 2022. Zeroth-Order Algorithms for Stochastic Distributed Nonconvex Optimization. Automatica, Vol. 142 (2022), 110353.","journal-title":"Automatica"},{"key":"e_1_2_1_67_1","volume-title":"User Cold Start Problem in Recommendation Systems: A Systematic Review","author":"Yuan Hongli","year":"2023","unstructured":"Hongli Yuan and Alexander A Hernandez. 2023. User Cold Start Problem in Recommendation Systems: A Systematic Review. IEEE access, Vol. 11 (2023), 136958-136977."},{"key":"e_1_2_1_68_1","volume-title":"Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1077-1086","author":"Zhang Weinan","year":"2014","unstructured":"Weinan Zhang, Shuai Yuan, and Jun Wang. 2014a. Optimal Real-Time Bidding for Display Advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1077-1086."},{"key":"e_1_2_1_69_1","volume-title":"Real-time Bidding Benchmarking with iPinyou Dataset. arXiv preprint arXiv:1407.7073","author":"Zhang Weinan","year":"2014","unstructured":"Weinan Zhang, Shuai Yuan, Jun Wang, and Xuehua Shen. 2014b. Real-time Bidding Benchmarking with iPinyou Dataset. arXiv preprint arXiv:1407.7073 (2014)."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.110006"},{"key":"e_1_2_1_71_1","doi-asserted-by":"crossref","DOI":"10.1145\/3447548","volume-title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 3996-4004","author":"Zhou Tian","year":"2021","unstructured":"Tian Zhou, Hao He, Shengjun Pan, Niklas Karlsson, Bharatbhushan Shetty, Brendan Kitts, Djordje Gligorijevic, San Gultekin, Tingyu Mao, Junwei Pan, et al., 2021. An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 3996-4004."}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3788094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T18:51:26Z","timestamp":1774551086000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3788094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,26]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3,26]]}},"alternative-id":["10.1145\/3788094"],"URL":"https:\/\/doi.org\/10.1145\/3788094","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,26]]},"assertion":[{"value":"2026-03-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}