{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:44:47Z","timestamp":1782798287882,"version":"3.54.5"},"reference-count":56,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001747","name":"Hong Kong Baptist University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001747","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/infocom59046.2026.11571315","type":"proceedings-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:38:15Z","timestamp":1782761895000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["Near-Optimal Online Learning with Non-Stochastic and Unbounded Erroneous Feedback"],"prefix":"10.1109","author":[{"given":"Dacheng","family":"Wen","sequence":"first","affiliation":[{"name":"Hong Kong Baptist University,Department of Interactive Media,Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yupeng","family":"Li","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University,Department of Interactive Media,Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francis C.M.","family":"Lau","sequence":"additional","affiliation":[{"name":"The University of Hong Kong,Department of Computer Science,Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tian","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Normal University,Institute of Artificial Intelligence and Future Networks,Zhuhai,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Chen","sequence":"additional","affiliation":[{"name":"Fudan University,College of Computer Science and Artificial Intelligence,China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume-title":"Proc. of ICML","author":"Zinkevich"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-040620-035329"},{"key":"ref3","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. of ICLR","author":"Kingma"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM52122.2024.10621317"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485906"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2022.3174140"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2022.3169180"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2017.1600826"},{"key":"ref9","article-title":"Adversarial online learning with noise","volume-title":"Proc. of ICML","author":"Resler"},{"key":"ref10","article-title":"Stochastic linear bandits robust to adversarial attacks","volume-title":"Proc. of AISTATS","author":"Bogunovic"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref12","article-title":"Online learning with unknown constraints","volume-title":"Proc. of ICML","author":"Sridharan"},{"key":"ref13","article-title":"Online learning in the random-order model","volume-title":"Proc. of ICML","author":"Bernasconi"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044691"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3087268"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SECON58729.2023.10287496"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2024.3392361"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939778"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619637"},{"key":"ref20","article-title":"Adversarial attacks on stochastic bandits","volume-title":"Proc. of NeurIPS","author":"Jun"},{"key":"ref21","article-title":"Adversarial attacks on adversarial bandits","volume-title":"Proc. of ICLR","author":"Ma"},{"key":"ref22","article-title":"Data poisoning attacks on stochastic bandits","volume-title":"Proc. of ICML","author":"Liu"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5821"},{"key":"ref24","article-title":"Noregret learning in games with noisy feedback: Faster rates and adaptivity via learning rate separation","volume-title":"Proc. of NeurIPS","author":"Hsieh"},{"key":"ref25","article-title":"Robust and private stochastic linear bandits","volume-title":"Proc. of ICML","author":"Charisopoulos"},{"key":"ref26","article-title":"Online learning in bandits with predicted context","volume-title":"Proc. of AISTATS","author":"Guo"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"ref28","article-title":"Better algorithms for stochastic bandits with adversarial corruptions","volume-title":"Proc. of COLT","author":"Gupta"},{"key":"ref29","article-title":"Adversarial bandits with corruptions: Regret lower bound and no-regret algorithm","volume-title":"Proc. of NeurIPS","author":"Hajiesmaili"},{"key":"ref30","article-title":"Bias-robust bayesian optimization via dueling bandits","volume-title":"Proc. of ICML","author":"Kirschner"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1739"},{"key":"ref32","article-title":"Robust stochastic linear contextual bandits under adversarial attacks","volume-title":"Proc. of AISTATS","author":"Ding"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.52202\/068431-2508"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0479"},{"key":"ref35","doi-asserted-by":"crossref","DOI":"10.52202\/075280-1445","article-title":"Online corrupted user detection and regret minimization","volume-title":"Proc. of NeurIPS","author":"Wang"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.52202\/079017-0765"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.52202\/079017-0612"},{"key":"ref38","article-title":"Adversarial attacks on combinatorial multi-armed bandits","volume-title":"Proc. of ICML","author":"Balasubramanian"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044618"},{"key":"ref40","article-title":"Online learning with noisy side observations","volume-title":"Proc. of AISTATS","author":"Koc\u00e1k"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5758-5"},{"key":"ref42","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. of NeurIPS","author":"Blanchard"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.014.2300054"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS60910.2024.00020"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.52202\/079017-1279"},{"key":"ref46","article-title":"Efficient contextual bandits with uninformed feedback graphs","volume-title":"Proc. of ICML","author":"Zhang"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.52202\/079017-0959"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.52202\/079017-3561"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.52202\/079017-0236"},{"key":"ref50","first-page":"9530","article-title":"Online linear optimization with many hints","volume":"33","author":"Bhaskara","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref51","article-title":"Online learning with bounded recall","volume-title":"Proc. of ICML","author":"Schneider"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2158673"},{"key":"ref53","article-title":"Learning general halfspaces with adversarial label noise via online gradient descent","volume-title":"Proc. of ICML","author":"Diakonikolas"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2914030"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2881008"},{"key":"ref56","article-title":"Stochastic multi-armed-bandit problem with non-stationary rewards","volume-title":"Proc. of NeurIPS","author":"Besbes"}],"event":{"name":"IEEE INFOCOM 2026 - IEEE Conference on Computer Communications","location":"Tokyo, Japan","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["IEEE INFOCOM 2026 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11571071\/11571169\/11571315.pdf?arnumber=11571315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:15:45Z","timestamp":1782796545000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11571315\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/infocom59046.2026.11571315","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}