{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T19:59:11Z","timestamp":1781294351662,"version":"3.54.1"},"reference-count":93,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","award":["20H00576"],"award-info":[{"award-number":["20H00576"]}]},{"name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","award":["23H03460"],"award-info":[{"award-number":["23H03460"]}]},{"name":"Japan Society for the Promotion of Science (JSPS) KAKENHI","award":["24K14849"],"award-info":[{"award-number":["24K14849"]}]},{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Next Generation (SPRING), Japan","award":["JPMJSP2180"],"award-info":[{"award-number":["JPMJSP2180"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3700257","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T19:40:18Z","timestamp":1780688418000},"page":"85663-85681","source":"Crossref","is-referenced-by-count":0,"title":["Beyond Switching: Adaptive Weighted Integration for Learning-Augmented Caching"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2740-2770","authenticated-orcid":false,"given":"Hiroo","family":"Irobe","sequence":"first","affiliation":[{"name":"Department of Mathematical and Computing Science, Institute of Science Tokyo, Meguro-ku, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2918-1832","authenticated-orcid":false,"given":"Takafumi","family":"Kanamori","sequence":"additional","affiliation":[{"name":"Department of Mathematical and Computing Science, Institute of Science Tokyo, Meguro-ku, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90041-V"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3528087"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3447579"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.112"},{"key":"ref6","first-page":"60:1","article-title":"Better and simpler learning-augmented online caching","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM)","volume":"176","author":"Wei","year":"2020"},{"key":"ref7","first-page":"1920","article-title":"Robust learning-augmented caching: An experimental study","volume-title":"Proc. 38th Int. Conf. Mach. Learn","author":"Ch\u0142\u0229dowski"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2744"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1186736.1186737"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840766"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/9781108637435.036"},{"key":"ref13","first-page":"3567","article-title":"Learning piecewise Lipschitz functions in changing environments","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","volume":"108","author":"Balcan"},{"key":"ref14","first-page":"9684","article-title":"Improving online algorithms via ML predictions","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"31","author":"Purohit"},{"key":"ref15","first-page":"303","article-title":"Customizing ML predictions for online algorithms","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","volume":"1","author":"Anand"},{"key":"ref16","first-page":"31539","article-title":"Improved learning-augmented algorithms for the multi-option ski rental problem via best-possible competitive analysis","volume-title":"Proc. 40th Int. Conf. Mach. Learn","author":"Shin"},{"key":"ref17","first-page":"2319","article-title":"Online algorithms for rent-or-buy with expert advice","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Gollapudi"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3603719.3603731"},{"key":"ref20","first-page":"26563","article-title":"Sorting with predictions","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Bai"},{"key":"ref21","article-title":"Learning-based frequency estimation algorithms","volume-title":"Proc. Int. Conf. Learn. Represent","author":"Hsu"},{"key":"ref22","first-page":"2860","article-title":"Putting the \u2018learning\u2019 into learning-augmented algorithms for frequency estimation","volume-title":"Proc. 38th Int. Conf. Mach. Learn","volume":"139","author":"Du"},{"key":"ref23","first-page":"14387","article-title":"Improved frequency estimation algorithms with and without predictions","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Aamand"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977714.8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/81"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538296"},{"key":"ref27","first-page":"40832","article-title":"Bicriteria multidimensional mechanism design with side information","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Balcan"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3670865.3673586"},{"key":"ref29","first-page":"35240","article-title":"Incremental topological ordering and cycle detection with predictions","volume-title":"Proc. 41st Int. Conf. Mach. Learn","author":"McCauley"},{"key":"ref30","first-page":"18584","article-title":"Speeding up Bellman Ford via minimum violation permutations","volume-title":"Proc. 40th Int. Conf. Mach. Learn","volume":"202","author":"Lattanzi"},{"key":"ref31","first-page":"7231","article-title":"Predictive flows for faster Ford\u2013Fulkerson","volume-title":"Proc. 40th Int. Conf. Mach. Learn","author":"Davies"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.126"},{"key":"ref33","first-page":"24:1","article-title":"Learning-augmented maximum independent set","volume-title":"Proc. Approximation","author":"Braverman"},{"issue":"12","key":"ref34","first-page":"10833","article-title":"Data-driven competitive algorithms for online knapsack and set cover","volume-title":"Proc. AAAI Conf. Artif. Intell.","volume":"35","author":"Zeynali"},{"key":"ref35","first-page":"2733","article-title":"Online knapsack with frequency predictions","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"34","author":"Im"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/635"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR52026.2021.9481858"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-18367-6_6"},{"issue":"10","key":"ref39","first-page":"11989","article-title":"Learning-augmented algorithms for online TSP on the line","volume-title":"Proc. AAAI Conf. Artif. Intell","volume":"37","author":"Gouleakis"},{"key":"ref40","first-page":"2:1","article-title":"Online Time-Windows TSP with Predictions","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM)","volume":"317","author":"Chawla","year":"2024"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2023.100778"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467623"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/jpr.2023.61"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2022.0031"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196909"},{"key":"ref46","first-page":"13431","article-title":"Learning augmented binary search trees","volume-title":"Proc. 39th Int. Conf. Mach. Learn","author":"Lin"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.tcs.2021.04.015","article-title":"On the performance of learned data structures","volume":"871","author":"Ferragina","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"ref48","first-page":"58470","article-title":"Robust learning-augmented dictionaries","volume-title":"Proc. 41st Int. Conf. Mach. Learn","author":"Zeynali"},{"key":"ref49","first-page":"395","article-title":"Contract scheduling with predictions","volume-title":"Proc. AAAI Conf. Artif. Intell","volume":"77","author":"Angelopoulos"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/636"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451023"},{"key":"ref52","article-title":"Improved learning-augmented algorithms for k-means and k-medians clustering","volume-title":"Proc. 11th Int. Conf. Learn. Represent","author":"Nguyen"},{"key":"ref53","article-title":"Learning-augmented k-means clustering","volume-title":"Proc. Int. Conf. Learn. Represent","author":"Ergun"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/267460.267475"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.4"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3548774"},{"key":"ref57","first-page":"9588","article-title":"Parsimonious learning-augmented caching","volume-title":"Proc. 39th Int. Conf. Mach. Learn","author":"Im"},{"key":"ref58","article-title":"Algorithms for caching and MTS with reduced number of predictions","volume-title":"Proc. 12th Int. Conf. Learn. Represent","author":"Sadek"},{"key":"ref59","first-page":"952","article-title":"Paging with succinct predictions","volume-title":"Proc. 40th Int. Conf. Mach. Learn","author":"Antoniadis"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3582689"},{"key":"ref61","article-title":"Robustifying learning-augmented caching efficiently without compromising 1-consistency","volume-title":"Proc. 39th Annu. Conf. Neural Inf. Process. Syst","author":"Chen"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00064"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451036"},{"key":"ref64","first-page":"2013","article-title":"Generalization bounds for data-driven numerical linear algebra","volume-title":"Proc. 35th Conf. Learn. Theory","author":"Bartlett"},{"key":"ref65","first-page":"1","article-title":"Improved generalization bound and learning of sparsity patterns for data-driven low-rank approximation","volume-title":"Proc. 26th Int. Conf. Artif. Intell. Statist","author":"Sakaue"},{"key":"ref66","first-page":"12825","article-title":"Generalization bound and learning methods for data-driven projections in linear programming","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Oki"},{"key":"ref67","first-page":"1540","article-title":"Learning complexity of simulated annealing","volume-title":"Proc. 24th Int. Conf. Artif. Intell. Statist","author":"Blum"},{"key":"ref68","article-title":"Learning to link","volume-title":"Proc. Int. Conf. Learn. Represent","author":"Balcan"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3637840"},{"key":"ref70","first-page":"33890","article-title":"Structural analysis of branch-and-cut and the learnability of gomory mixed integer cuts","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Balcan"},{"key":"ref71","first-page":"213","article-title":"Learning-theoretic foundations of algorithm configuration for combinatorial partitioning problems","volume-title":"Proc. Conf. Learn. Theory","author":"Balcan"},{"key":"ref72","first-page":"2889","article-title":"Sample complexity of learning heuristic functions for greedy-best-first and A* search","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"35","author":"Oki"},{"key":"ref73","first-page":"10641","article-title":"Data-driven clustering via parameterized Lloyd\u2019s families","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"31","author":"Balcan"},{"key":"ref74","first-page":"27769","article-title":"Provably tuning the ElasticNet across instances","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Balcan"},{"key":"ref75","first-page":"80066","article-title":"New bounds for hyperparameter tuning of regression problems across instances","volume-title":"Proc. Adv. Neural Inf. Process. Syst.s","author":"Balcan"},{"issue":"1","key":"ref76","first-page":"262","article-title":"Learning theory and algorithms for revenue optimization in second price auctions with reserve","volume-title":"Proc. 31st Int. Conf. Mach. Learn","volume":"32","author":"Mohri"},{"key":"ref77","first-page":"2083","article-title":"Sample complexity of automated mechanism design","volume-title":"Proc. Adv. Neural Inf. Process. Syst","author":"Balcan"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.54"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1145\/3439722"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28650-9_4"},{"key":"ref81","first-page":"1015","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","volume-title":"Proc. 27th Int. Conf. Int. Conf. Mach. Learn","author":"Srinivas"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/CISS50987.2021.9400292"},{"key":"ref83","first-page":"6909","article-title":"Weighted Gaussian process bandits for non-stationary environments","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Deng"},{"issue":"4","key":"ref84","doi-asserted-by":"crossref","first-page":"451","DOI":"10.2307\/3008764","article-title":"The combination of forecasts","volume":"20","author":"Bates","year":"1969","journal-title":"OR"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.132"},{"key":"ref86","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"24","author":"Abbasi-Yadkori"},{"key":"ref87","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Agrawal"},{"key":"ref88","first-page":"586","article-title":"Parametric bandits: The generalized linear case","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"23","author":"Filippi"},{"key":"ref89","volume-title":"The 2nd Cache Replacement Championship","year":"2017"},{"key":"ref90","first-page":"6237","article-title":"An imitation learning approach for cache replacement","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","volume":"1","author":"Liu"},{"key":"ref91","first-page":"5998","article-title":"Attention is all you need","volume-title":"Proc. Adv. Neural Inf. Process. Syst","volume":"30","author":"Vaswani"},{"key":"ref92","article-title":"Bidirectional attention flow for machine comprehension","volume-title":"Proc. Int. Conf. Learn. Represent","author":"Seo"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1007\/b106715"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11552614.pdf?arnumber=11552614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T19:43:36Z","timestamp":1781293416000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11552614\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":93,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3700257","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}