{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:19:01Z","timestamp":1743020341139,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031605963"},{"type":"electronic","value":"9783031605970"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60597-0_19","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"293-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Don\u2019t Explain Noise: Robust Counterfactuals for\u00a0Randomized Ensembles"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9868-4804","authenticated-orcid":false,"given":"Alexandre","family":"Forel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-4947","authenticated-orcid":false,"given":"Axel","family":"Parmentier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5183-8485","authenticated-orcid":false,"given":"Thibaut","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"issue":"2","key":"19_CR1","first-page":"119","volume":"52","author":"A Agresti","year":"1998","unstructured":"Agresti, A., Coull, B.A.: Approximate is better than \u201cexact\u2019\u2019 for interval estimation of binomial proportions. Am. Stat. 52(2), 119\u2013126 (1998)","journal-title":"Am. Stat."},{"key":"19_CR2","unstructured":"Amos, B., Xu, L., Kolter, J.Z.: Input convex neural networks. In: International Conference on Machine Learning, pp. 146\u2013155. PMLR (2017)"},{"key":"19_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-030-61609-0_28","volume-title":"Artificial Neural Networks and Machine Learning\u2013ICANN 2020","author":"A Artelt","year":"2020","unstructured":"Artelt, A., Hammer, B.: Convex density constraints for computing plausible counterfactual explanations. In: Farka\u0161, I., Masulli, P., Wermter, S. (eds.) ICANN 2020. LNCS, vol. 12396, pp. 353\u2013365. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61609-0_28"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s11749-016-0481-7","volume":"25","author":"G Biau","year":"2016","unstructured":"Biau, G., Scornet, E.: A random forest guided tour. Test 25(2), 197\u2013227 (2016)","journal-title":"Test"},{"issue":"1","key":"19_CR5","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)","journal-title":"Mach. Learn."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1214\/ss\/1009213286","volume":"16","author":"LD Brown","year":"2001","unstructured":"Brown, L.D., Cai, T.T., DasGupta, A.: Interval estimation for a binomial proportion. Stat. Sci. 16(2), 101\u2013133 (2001)","journal-title":"Stat. Sci."},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1214\/aos\/1031689014","volume":"30","author":"P B\u00fchlmann","year":"2002","unstructured":"B\u00fchlmann, P., Yu, B.: Analyzing bagging. Ann. Stat. 30(4), 927\u2013961 (2002)","journal-title":"Ann. Stat."},{"key":"19_CR8","unstructured":"Bui, N., Nguyen, D., Nguyen, V.A.: Counterfactual plans under distributional ambiguity. In: International Conference on Learning Representations (2022)"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/07069821X","volume":"19","author":"MC Campi","year":"2008","unstructured":"Campi, M.C., Garatti, S.: The exact feasibility of randomized solutions of uncertain convex programs. SIAM J. Optim. 19(3), 1211\u20131230 (2008)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1287\/opre.11.1.18","volume":"11","author":"A Charnes","year":"1963","unstructured":"Charnes, A., Cooper, W.W.: Deterministic equivalents for optimizing and satisficing under chance constraints. Oper. Res. 11(1), 18\u201339 (1963)","journal-title":"Oper. Res."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Cui, Z., Chen, W., He, Y., Chen, Y.: Optimal action extraction for random forests and boosted trees. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 179\u2013188 (2015)","DOI":"10.1145\/2783258.2783281"},{"issue":"1","key":"19_CR12","first-page":"201","volume":"25","author":"JA De Loera","year":"2018","unstructured":"De Loera, J.A., La Haye, R.N., Oliveros, D., Rold\u00e1n-Pensado, E.: Chance-constrained convex mixed-integer optimization and beyond: two sampling algorithms within $$S$$-optimization. J. Convex Anal. 25(1), 201\u2013218 (2018)","journal-title":"J. Convex Anal."},{"key":"19_CR13","unstructured":"Dutta, S., Long, J., Mishra, S., Tilli, C., Magazzeni, D.: Robust counterfactual explanations for tree-based ensembles. In: International Conference on Machine Learning, pp. 5742\u20135756. PMLR (2022)"},{"key":"19_CR14","unstructured":"Grinsztajn, L., Oyallon, E., Varoquaux, G.: Why do tree-based models still outperform deep learning on typical tabular data? In: Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (2022)"},{"key":"19_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.H.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, vol. 2. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-21606-5"},{"key":"19_CR16","unstructured":"Hsu, H., Calmon, F.D.P.: Rashomon capacity: a metric for predictive multiplicity in classification. In: Advances in Neural Information Processing Systems (2022)"},{"key":"19_CR17","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: On relating explanations and adversarial examples. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Kanamori, K., Takagi, T., Kobayashi, K., Arimura, H.: DACE: distribution-aware counterfactual explanation by mixed-integer linear optimization. In: International Joint Conference on Artificial Intelligence, pp. 2855\u20132862 (2020)","DOI":"10.24963\/ijcai.2020\/395"},{"issue":"5","key":"19_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3527848","volume":"55","author":"AH Karimi","year":"2022","unstructured":"Karimi, A.H., Barthe, G., Sch\u00f6lkopf, B., Valera, I.: A survey of algorithmic recourse: contrastive explanations and consequential recommendations. ACM Comput. Surv. 55(5), 1\u201329 (2022)","journal-title":"ACM Comput. Surv."},{"key":"19_CR20","unstructured":"Lakshminarayanan, B., Pritzel, A., Blundell, C.: Simple and scalable predictive uncertainty estimation using deep ensembles. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Laugel, T., Lesot, M.J., Marsala, C., Renard, X., Detyniecki, M.: The dangers of post-hoc interpretability: unjustified counterfactual explanations. In: International Joint Conference on Artificial Intelligence, pp. 2801\u20132807 (2019)","DOI":"10.24963\/ijcai.2019\/388"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Liu, F.T., Ting, K.M., Zhou, Z.H.: Isolation forest. In: Eighth IEEE International Conference on Data Mining, pp. 413\u2013422. IEEE (2008)","DOI":"10.1109\/ICDM.2008.17"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Lucic, A., Oosterhuis, H., Haned, H., de\u00a0Rijke, M.: Focus: Flexible optimizable counterfactual explanations for tree ensembles. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 5, pp. 5313\u20135322 (2022)","DOI":"10.1609\/aaai.v36i5.20468"},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142(2), 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"19_CR26","unstructured":"Parmentier, A., Vidal, T.: Optimal counterfactual explanations in tree ensembles. In: International Conference on Machine Learning, pp. 8422\u20138431. PMLR (2021)"},{"key":"19_CR27","unstructured":"Pawelczyk, M., Agarwal, C., Joshi, S., Upadhyay, S., Lakkaraju, H.: Exploring counterfactual explanations through the lens of adversarial examples: a theoretical and empirical analysis. In: International Conference on Artificial Intelligence and Statistics, pp. 4574\u20134594. PMLR (2022)"},{"key":"19_CR28","unstructured":"Rawal, K., Kamar, E., Lakkaraju, H.: Can i still trust you?: Understanding the impact of distribution shifts on algorithmic recourses. arXiv preprint arXiv:2012.11788 (2020)"},{"issue":"4","key":"19_CR29","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1249","volume":"8","author":"O Sagi","year":"2018","unstructured":"Sagi, O., Rokach, L.: Ensemble learning: a survey. Wiley Interdisc. Rev. Data Min. Knowl. Disc. 8(4), e1249 (2018)","journal-title":"Wiley Interdisc. Rev. Data Min. Knowl. Disc."},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on stochastic programming: modeling and theory. SIAM (2014)","DOI":"10.1137\/1.9781611973433"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Tolomei, G., Silvestri, F., Haines, A., Lalmas, M.: Interpretable predictions of tree-based ensembles via actionable feature tweaking. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 465\u2013474 (2017)","DOI":"10.1145\/3097983.3098039"},{"key":"19_CR32","unstructured":"Upadhyay, S., Joshi, S., Lakkaraju, H.: Towards robust and reliable algorithmic recourse. In: Advances in Neural Information Processing Systems (2021)"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Conference on Fairness, Accountability, and Transparency, pp. 10\u201319 (2019)","DOI":"10.1145\/3287560.3287566"},{"key":"19_CR34","unstructured":"Verma, S., Dickerson, J., Hines, K.: Counterfactual explanations for machine learning: a review. arXiv preprint arXiv:2010.10596 (2020)"},{"key":"19_CR35","first-page":"841","volume":"31","author":"S Wachter","year":"2017","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the GDPR. Harvard J. Law Technol. 31, 841 (2017)","journal-title":"Harvard J. Law Technol."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60597-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:07:04Z","timestamp":1716818824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","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":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}