{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:14:38Z","timestamp":1730200478173,"version":"3.28.0"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,17]]},"DOI":"10.1109\/bigdata55660.2022.10020649","type":"proceedings-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T14:35:23Z","timestamp":1674743723000},"page":"5845-5854","source":"Crossref","is-referenced-by-count":0,"title":["Robust Stochastic Bandit algorithms to defend against Oracle attack using Sample Dropout"],"prefix":"10.1109","author":[{"given":"Jayanth","family":"Yetukuri","sequence":"first","affiliation":[{"name":"University of California,Santa Cruz,CA,USA"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"University of California,Santa Cruz,CA,USA"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.10.315"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1049\/cit2.12028"},{"key":"ref15","first-page":"99","article-title":"Detecting Click Fraud in Online Advertising: A Data Mining Approach","volume":"15","author":"oentaryo","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref14","article-title":"Explaining and Harnessing Adversarial Examples","author":"goodfellow","year":"2015","journal-title":"International Conference on Learning Representations"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5758-5"},{"key":"ref11","first-page":"14362","article-title":"Adversarial Attacks on Linear Contextual Bandits","volume":"33","author":"garcelon","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2886017"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5821"},{"key":"ref16","article-title":"Algorithms for multi-armed bandit problems","volume":"1","author":"kuleshov","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref18","first-page":"11838","article-title":"Theoretical evidence for adversarial robustness through randomization","author":"pinot","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref51","first-page":"467","article-title":"An Optimal Algorithm for Stochastic and Adversarial Bandits","volume":"89","author":"zimmert","year":"0"},{"key":"ref50","first-page":"1287","article-title":"One Practical Algorithm for Both Stochastic and Adversarial Bandits","volume":"32","author":"seldin","year":"0"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.20"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref48","first-page":"8","article-title":"Online Learning: Theory, Algorithms, and Applications","author":"shalev-shwartz","year":"2007"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1561\/9781601986276"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref41","first-page":"59","article-title":"Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation","author":"maron","year":"1994","journal-title":"Advances in neural information processing systems"},{"key":"ref44","first-page":"767","article-title":"Cascading Bandits:´ Learning to Rank in the Cascade Model","volume":"37","author":"kveton","year":"2015","journal-title":"Proceedings of the 32Nd International Conference on International Conference on Machine Learning"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2532128"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"ref7","first-page":"1345","article-title":"Multi-armed bandit algorithms for crowdsourcing systems with online estimation of workers’ ability","author":"rangi","year":"2018","journal-title":"Proc of International Conference on Autonomous Agents and Multiagent Systems"},{"key":"ref9","first-page":"1929","article-title":"Dropout: A Simple Way to Prevent Neural Networks from Overfitting","volume":"15","author":"srivastava","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053495"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20777"},{"key":"ref6","first-page":"1022","article-title":"Provable non-convex phase retrieval with outliers: Median truncatedwirtinger flow","author":"zhang","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref5","article-title":"Intriguing properties of neural networks","author":"szegedy","year":"2014","journal-title":"International Conference on Learning Representations"},{"article-title":"A Survey on Practical Applications of MultiArmed and Contextual Bandits","year":"2019","author":"bouneffouf","key":"ref40"},{"key":"ref35","first-page":"1186","article-title":"Adversarial Vulnerability for Any Classifier","author":"fawzi","year":"2018","journal-title":"Proceedings of the 32Nd International Conference on Neural Information Processing Systems"},{"key":"ref34","first-page":"10408","article-title":"Functional Adversarial Attacks","volume":"32","author":"laidlaw","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2046684.2046692"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10994-011-5268-1","article-title":"Robustness and Generalization","volume":"86","author":"xu","year":"2012","journal-title":"Mach Learn"},{"key":"ref31","first-page":"5429","article-title":"Adversarial Online Learning with noise","author":"resler","year":"2019","journal-title":"Proceedings of the 36th International Conference on Machine Learning"},{"key":"ref30","article-title":"Contextual multi-armed bandits for causal marketing","author":"sawant","year":"2018","journal-title":"Proceedings of the 35th International Conference on Machine Learning"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000068","article-title":"Aleksandrs Slivkins Introduction to Multi-Armed Bandits","volume":"12","year":"2019","journal-title":"Foundations and Trends\ufffd in Machine Learning"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.36"},{"key":"ref2","article-title":"Analysis of classifiers’ robustness to adversarial perturbations","author":"fawzi","year":"2015","journal-title":"Machine Learning"},{"key":"ref1","first-page":"3644","article-title":"Adversarial Attacks on Stochastic Bandits","author":"jun","year":"2018","journal-title":"Proceedings of the 32Nd International Conference on Neural Information Processing Systems"},{"article-title":"Bandits with adversarial scaling","year":"2020","author":"lykouris","key":"ref39"},{"key":"ref38","first-page":"485","article-title":"Contextual Multi-Armed Bandits","volume":"9","author":"lu","year":"0"},{"article-title":"Prior Convictions: Black-Box Adversarial Attacks with Bandits and Priors","year":"0","author":"andrew ilyas","key":"ref24"},{"key":"ref23","first-page":"4042","article-title":"Data poisoning attacks on stochastic bandits","author":"liu","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref26","first-page":"116","article-title":"An algorithm with nearly optimal pseudoregret for both stochastic and adversarial bandits","author":"auer","year":"2016","journal-title":"Proceedings Of The Conference On Learning Theory(COLT)"},{"key":"ref25","first-page":"1562","article-title":"Better Algorithms for Stochastic Bandits with Adversarial Corruptions","author":"gupta","year":"2019","journal-title":"Proceedings Of The Conference On Learning Theory(COLT)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"ref28","article-title":"Others Adversarial bandits with corruptions: Regret lower bound and no-regret algorithm","volume":"33","author":"hajiesmaili","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref27","first-page":"1723","article-title":"Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization","author":"scarlett","year":"2017","journal-title":"Proceedings Of The Conference On Learning Theory(COLT)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492488"}],"event":{"name":"2022 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2022,12,17]]},"location":"Osaka, Japan","end":{"date-parts":[[2022,12,20]]}},"container-title":["2022 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10020192\/10020156\/10020649.pdf?arnumber=10020649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T17:11:49Z","timestamp":1676913109000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10020649\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/bigdata55660.2022.10020649","relation":{},"subject":[],"published":{"date-parts":[[2022,12,17]]}}}