{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:40:07Z","timestamp":1745966407088,"version":"3.40.4"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030461324"},{"type":"electronic","value":"9783030461331"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-46133-1_6","type":"book-chapter","created":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T07:08:58Z","timestamp":1588230538000},"page":"86-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Engineered Empirical Bernstein Bound"],"prefix":"10.1007","author":[{"given":"Mark A.","family":"Burgess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Archie C.","family":"Chapman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"6_CR1","unstructured":"Agarwal, A., Dekel, O., Xiao, L.: Optimal algorithms for online convex optimization with multi-point bandit feedback. In: 23rd Annual Conference Learning Theory (COLT 2010) (2010)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data Mining: The Textbook, chap. Outlier analysis","author":"CC Aggarwal","year":"2015","unstructured":"Aggarwal, C.C.: Data Mining: The Textbook, chap. Outlier analysis, pp. 237\u2013263. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14142-8"},{"key":"6_CR3","unstructured":"Audibert, J.Y., Bubeck, S.: Minimax policies for adversarial and stochastic bandits. In: 22nd Annual Conference Learning Theory (COLT 2009) (2009)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-75225-7_15","volume-title":"Algorithmic Learning Theory","author":"J-Y Audibert","year":"2007","unstructured":"Audibert, J.-Y., Munos, R., Szepesv\u00e1ri, C.: Tuning bandit algorithms in stochastic environments. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 150\u2013165. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75225-7_15"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"31","author":"P Auer","year":"2003","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: The non-stochasticmulti-armed bandit problem. SIAM J. Comput. 31(1), 48\u201377 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"297","key":"6_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/01621459.1962.10482149","volume":"57","author":"G Bennett","year":"1962","unstructured":"Bennett, G.: Probability inequalities for the sum of independent random variables. J. Am. Stat. Assoc. 57(297), 33\u201345 (1962)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s10986-008-0003-8","volume":"48","author":"V Bentkus","year":"2008","unstructured":"Bentkus, V., Ju\u0161kevi\u010dius, T.: Bounds for tail probabilities of martingales using skewness and kurtosis. Lith. Math. J. 48(1), 30\u201337 (2008)","journal-title":"Lith. Math. J."},{"key":"6_CR9","series-title":"SpringerBriefs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22099-4","volume-title":"Concentration Inequalities for Sums and Martingales","author":"B Bercu","year":"2015","unstructured":"Bercu, B., Delyon, B., Rio, E.: Concentration Inequalities for Sums and Martingales. SM. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22099-4"},{"key":"6_CR10","first-page":"38","volume":"1","author":"SN Bernstein","year":"1924","unstructured":"Bernstein, S.N.: On a modification of Chebyshev\u2019s inequality and of the error formula of Laplace. Uchenye Zapiski Nauch. Issled. Kaf. Ukraine Sect. Math. 1, 38\u201348 (1924)","journal-title":"Uchenye Zapiski Nauch. Issled. Kaf. Ukraine Sect. Math."},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"15883","DOI":"10.1109\/ACCESS.2017.2735378","volume":"5","author":"M Bhaduri","year":"2017","unstructured":"Bhaduri, M., Zhan, J., Chiu, C., Zhan, F.: A novel online and non-parametric approach for drift detection in big data. IEEE Access 5, 15883\u201315892 (2017)","journal-title":"IEEE Access"},{"key":"6_CR12","first-page":"309","volume":"37","author":"IJ Bienaym\u00e9","year":"1853","unstructured":"Bienaym\u00e9, I.J.: Consid\u00e9rations \u00e0l\u2019appui de la d\u00e9couverte de Laplace. Comptes Rendus de l\u2019Acad\u00e9mie des Sci. 37, 309\u2013324 (1853)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sci."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-28650-9_9","volume-title":"Advanced Lectures on Machine Learning","author":"S Boucheron","year":"2004","unstructured":"Boucheron, S., Lugosi, G., Bousquet, O.: Concentration inequalities. In: Bousquet, O., von Luxburg, U., R\u00e4tsch, G. (eds.) ML -2003. LNCS (LNAI), vol. 3176, pp. 208\u2013240. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28650-9_9"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1214\/aop\/1055425791","volume":"31","author":"S Boucheron","year":"2003","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration inequalities using the entropy method. Ann. Prob. 31(3), 1583\u20131614 (2003)","journal-title":"Ann. Prob."},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2006)"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1214\/aos\/1176345462","volume":"9","author":"B Efron","year":"1981","unstructured":"Efron, B., Stein, C.: The jackknife estimate of variance. Ann. Stat. 9(3), 586\u2013596 (1981)","journal-title":"Ann. Stat."},{"key":"6_CR17","unstructured":"Flaxman, A., Kalai, A., McMahan, B.: Online convex optimization in the bandit setting: gradient descent without a gradient. In: Proceedings of 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 385\u2013394 (2005)"},{"issue":"301","key":"6_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Kifer, D., Ben-David, S., Gehrke, J.: Detecting change in data streams. In: Proceedings of 30th International Conference Very Large Data Bases (VLDB 2004), pp. 180\u2013191 (2004)","DOI":"10.1016\/B978-012088469-8.50019-X"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"T Lai","year":"1985","unstructured":"Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4\u201322 (1985)","journal-title":"Adv. Appl. Math."},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/rsa.20105","volume":"29","author":"A Maurer","year":"2006","unstructured":"Maurer, A.: Concentration inequalities for functions of independent variables. Rand. Struct. Algorithms 29(2), 121\u2013138 (2006)","journal-title":"Rand. Struct. Algorithms"},{"key":"6_CR22","unstructured":"Maurer, A., Pontil, M.: Empirical Bernstein bounds and sample variance penalization. stat. In: Proceedings of the 22nd Annual Conference Learning Theory (COLT 2009), June 2009"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Mnih, V., Szepesv\u00e1ri, C., Audibert, J.Y.: Empirical Bernstein stopping. In: Proceedings 25th International Conference Machine Learning (ICML 2008), pp. 672\u2013679 (2008)","DOI":"10.1145\/1390156.1390241"},{"issue":"1","key":"6_CR24","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1214\/12-AIHP495","volume":"50","author":"I Pinelis","year":"2014","unstructured":"Pinelis, I.: On the Bennett-Hoeffding inequality. Annales de i\u2019Institut Henri Poincar\u00e9 - Probabilit\u00e9s et Statistiques 50(1), 15\u201327 (2014)","journal-title":"Annales de i\u2019Institut Henri Poincar\u00e9 - Probabilit\u00e9s et Statistiques"},{"issue":"2","key":"6_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s12204-012-1261-5","volume":"17","author":"MZ Rehman","year":"2012","unstructured":"Rehman, M.Z., Li, T., Li, T.: Exploiting empirical variance for data stream classification. J. Shanghai Jiaotong Univ. (Sci.) 17(2), 245\u2013250 (2012)","journal-title":"J. Shanghai Jiaotong Univ. (Sci.)"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"55","author":"H Robbins","year":"1952","unstructured":"Robbins, H.: Some aspects of the sequential design of experiments. Bull. AMS 55, 527\u2013535 (1952)","journal-title":"Bull. AMS"},{"issue":"3","key":"6_CR27","doi-asserted-by":"publisher","first-page":"355","DOI":"10.7153\/jmi-04-32","volume":"4","author":"R Sharma","year":"2010","unstructured":"Sharma, R., Gupta, M., Kapoor, G.: Some better bounds on the variance with applications. J. Math. Inequalities 4(3), 355\u2013363 (2010)","journal-title":"J. Math. Inequalities"},{"issue":"1","key":"6_CR28","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02699376","volume":"81","author":"M Talagrand","year":"1995","unstructured":"Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publications Math\u00e9matiques de l\u2019Institut des Hautes \u00c9tudes Scientifiques 81(1), 73\u2013205 (1995)","journal-title":"Publications Math\u00e9matiques de l\u2019Institut des Hautes \u00c9tudes Scientifiques"},{"issue":"4","key":"6_CR29","first-page":"689","volume":"31","author":"M Talagrand","year":"1995","unstructured":"Talagrand, M.: The missing factor in Hoeffding\u2019s inequalities. Annales de l\u2019Institut Henri Poincare Prob. Stat. 31(4), 689\u2013702 (1995)","journal-title":"Annales de l\u2019Institut Henri Poincare Prob. Stat."},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Thomas, P.S., Theocharous, G., Ghavamzadeh, M.: High-confidence off-policy evaluation. In: Proceedings of 29th AAAI Conference Artificial Intelligence (AAAI 2015), pp. 3000\u20133006 (2015)","DOI":"10.1609\/aaai.v29i1.9541"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Tran-Thanh, L., Chapman, A.C., Rogers, A., Jennings, N.R.: Knapsack based optimal policies for budget-limited multi-armed bandits. In: Proceedings of 26th AAAI Conference Artificial Intelligence (AAAI 2012), pp. 1134\u20131140 (2012)","DOI":"10.1609\/aaai.v26i1.8279"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46133-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:05:34Z","timestamp":1745964334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46133-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461324","9783030461331"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46133-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"733","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"130","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.04","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}