{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:30:34Z","timestamp":1757622634853,"version":"3.44.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030865191"},{"type":"electronic","value":"9783030865207"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86520-7_11","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T15:25:48Z","timestamp":1631201148000},"page":"167-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-bounding Majority Vote Learning Algorithms by the Direct Minimization of a Tight PAC-Bayesian C-Bound"],"prefix":"10.1007","author":[{"given":"Paul","family":"Viallard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Germain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilie","family":"Morvant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"issue":"9","key":"11_CR1","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1007\/s10994-020-05902-7","volume":"109","author":"B Bauvin","year":"2020","unstructured":"Bauvin, B., Capponi, C., Roy, J., Laviolette, F.: Fast greedy C-bound minimization with guarantees. Mach. Learn. 109(9), 1945\u20131986 (2020). https:\/\/doi.org\/10.1007\/s10994-020-05902-7","journal-title":"Mach. Learn."},{"issue":"1\u20132","key":"11_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10994-014-5462-z","volume":"97","author":"A Bellet","year":"2014","unstructured":"Bellet, A., Habrard, A., Morvant, E., Sebban, M.: Learning a priori constrained weighted majority votes. Mach. Learn. 97(1\u20132), 129\u2013154 (2014). https:\/\/doi.org\/10.1007\/s10994-014-5462-z","journal-title":"Mach. Learn."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Boser, B., Guyon, I., Vapnik, V.: A training algorithm for optimal margin classifiers. In: COLT (1992)","DOI":"10.1145\/130385.130401"},{"key":"11_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123\u2013140 (1996). https:\/\/doi.org\/10.1007\/BF00058655","journal-title":"Mach. Learn."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995). https:\/\/doi.org\/10.1007\/BF00994018","journal-title":"Mach. Learn."},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1137\/0114053","volume":"14","author":"J Danskin","year":"1966","unstructured":"Danskin, J.: The theory of max-min, with applications. SIAM J. Appl. Math. 14(4), 641\u2013664 (1966)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"11_CR9","first-page":"2909","volume":"17","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 17(1), 2909\u20132913 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45014-9_1","volume-title":"Multiple Classifier Systems","author":"TG Dietterich","year":"2000","unstructured":"Dietterich, T.G.: Ensemble methods in machine learning. In: Kittler, J., Roli, F. (eds.) MCS 2000. LNCS, vol. 1857, pp. 1\u201315. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45014-9_1"},{"key":"11_CR11","unstructured":"Dziugaite, G.K., Roy, D.: Computing nonvacuous generalization bounds for deep (stochastic) neural networks with many more parameters than training data. In: UAI (2017)"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Freund, Y.: Self bounding learning algorithms. In: COLT (1998)","DOI":"10.1145\/279943.279993"},{"key":"11_CR13","unstructured":"Freund, Y., Schapire, R.: Experiments with a new boosting algorithm. In: ICML (1996)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Germain, P., Lacasse, A., Laviolette, F., Marchand, M.: PAC-Bayesian learning of linear classifiers. In: ICML (2009)","DOI":"10.1145\/1553374.1553419"},{"key":"11_CR15","unstructured":"Germain, P., Lacasse, A., Laviolette, F., Marchand, M., Roy, J.: Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm. J. Mach. Learn. Res. (2015)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization, pp. 155\u2013210. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/0-387-30528-9_7"},{"key":"11_CR17","unstructured":"Kervadec, H., Dolz, J., Yuan, J., Desrosiers, C., Granger, E., Ayed, I.B.: Constrained Deep Networks: Lagrangian Optimization via Log-Barrier Extensions. CoRR abs\/1904.04205 (2019)"},{"key":"11_CR18","unstructured":"Kingma, D., Ba, J.: Adam: a method for stochastic optimization. In: ICLR (2015)"},{"key":"11_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/9781118914564","volume-title":"Combining Pattern Classifiers: Methods and Algorithms","author":"L Kuncheva","year":"2014","unstructured":"Kuncheva, L.: Combining Pattern Classifiers: Methods and Algorithms. Wiley, Hoboken (2014)"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Lacasse, A., Laviolette, F., Marchand, M., Germain, P., Usunier, N.: PAC-Bayes bounds for the risk of the majority vote and the variance of the gibbs classifier. In: NIPS (2006)","DOI":"10.7551\/mitpress\/7503.003.0101"},{"key":"11_CR21","unstructured":"Langford, J., Shawe-Taylor, J.: PAC-Bayes & margins. In: NIPS (2002)"},{"issue":"8","key":"11_CR22","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1007\/s10994-019-05803-4","volume":"108","author":"SS Lorenzen","year":"2019","unstructured":"Lorenzen, S.S., Igel, C., Seldin, Y.: On PAC-Bayesian bounds for random forests. Mach. Learn. 108(8), 1503\u20131522 (2019). https:\/\/doi.org\/10.1007\/s10994-019-05803-4","journal-title":"Mach. Learn."},{"key":"11_CR23","unstructured":"Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: ICLR (2018)"},{"key":"11_CR24","unstructured":"Masegosa, A., Lorenzen, S.S., Igel, C., Seldin, Y.: Second order PAC-Bayesian bounds for the weighted majority vote. In: NeurIPS (2020)"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1023\/A:1007618624809","volume":"37","author":"D McAllester","year":"1999","unstructured":"McAllester, D.: Some PAC-Bayesian theorems. Mach. Learn. 37(3), 355\u2013363 (1999). https:\/\/doi.org\/10.1023\/A:1007618624809","journal-title":"Mach. Learn."},{"issue":"1","key":"11_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021840411064","volume":"51","author":"D McAllester","year":"2003","unstructured":"McAllester, D.: PAC-Bayesian stochastic model selection. Mach. Learn. 51(1), 5\u201321 (2003). https:\/\/doi.org\/10.1023\/A:1021840411064","journal-title":"Mach. Learn."},{"key":"11_CR27","unstructured":"Orabona, F., Tommasi, T.: Training deep networks without learning rates through coin betting. In: NIPS (2017)"},{"issue":"1","key":"11_CR28","first-page":"3507","volume":"13","author":"E Parrado-Hern\u00e1ndez","year":"2012","unstructured":"Parrado-Hern\u00e1ndez, E., Ambroladze, A., Shawe-Taylor, J., Sun, S.: PAC-Bayes bounds with data dependent priors. J. Mach. Learn. Res. 13(1), 3507\u20133531 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR29","unstructured":"Paszke, A., et al.: PyTorch: an imperative style, high-performance deep learning library. In: NeurIPS (2019)"},{"key":"11_CR30","unstructured":"Reeb, D., Doerr, A., Gerwinn, S., Rakitsch, B.: Learning Gaussian processes by minimizing PAC-Bayesian generalization bounds. In: NeurIPS (2018)"},{"key":"11_CR31","unstructured":"Roy, J., Laviolette, F., Marchand, M.: From PAC-Bayes bounds to quadratic programs for majority votes. In: ICML (2011)"},{"key":"11_CR32","unstructured":"Roy, J., Marchand, M., Laviolette, F.: A column generation bound minimization approach with PAC-Bayesian generalization guarantees. In: AISTATS (2016)"},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1162\/153244303765208377","volume":"3","author":"M Seeger","year":"2002","unstructured":"Seeger, M.: PAC-Bayesian generalisation error bounds for gaussian process classification. J. Mach. Learn. Res. 3, 233\u2013269 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Shawe-Taylor, J., Williamson, R.: A PAC analysis of a Bayesian estimator. In: COLT (1997)","DOI":"10.1145\/267460.267466"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86520-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T22:03:53Z","timestamp":1757369033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86520-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865191","9783030865207"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86520-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 September 2021","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":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"869","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":"210","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":"24% - 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-4","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":"3-9","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":"The conference was held online due to the COVID-19 pandemic.","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)"}}]}}