{"type":"ScholarlyArticle","title":"Bounding the Family-Wise Error Rate in Local Causal Discovery Using Rademacher Averages (Extended Abstract)","authors":[{"name":"Dario Simionato","slug":"dario-simionato","given":"Dario","family":"Simionato","affiliation":"University of Padua , Padua , Italy"},{"name":"Fabio Vandin","slug":"fabio-vandin","given":"Fabio","family":"Vandin","affiliation":"University of Padua , Padua , Italy"}],"abstract":"Causal discovery from observational data provides candidate causal relationships that need to be validated with ad-hoc experiments. Such experiments usually require major resources, and suitable techniques should therefore be applied to identify candidate relations while limiting false positives.\r\nLocal causal discovery provides a detailed overview of the variables influencing a target, and it focuses on two sets of variables. The first one, the Parent-Children set, comprises all the elements that are direct causes of the target or that are its direct consequences, while the second one, called the Markov boundary, is the minimal set of variables for the optimal prediction of the target.\r\nIn this paper we present RAveL, the first suite of algorithms for local causal discovery providing rigorous guarantees on false discoveries. Our algorithms exploit Rademacher averages, a key concept in statistical learning theory, to account for the multiple-hypothesis testing problem in high-dimensional scenarios. Moreover, we prove that state-of-the-art approaches cannot be adapted for the task due to their strong and untestable assumptions, and we complement our analyses with extensive experiments, on synthetic and real-world data.","doi":"10.24963/ijcai.2023/726","url":"https://ijcai.org/proceedings/2023/726","pdf":"https://ijcai.org/proceedings/2023/0726.pdf","markdown":"https://ijcai.org/proceedings/2023/726.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/726","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Sister Conferences Best Papers","track":"Sister Conferences Best Papers","number":726,"pages":{"first":6492,"last":6497},"keywords":["Sister Conferences Best Papers: Data Mining"],"videos":[],"references":[{"position":1,"raw":"[Bartlett and Mendelson, 2002] Peter L Bartlett and Shahar Mendelson. Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learn- ing Research, 3(Nov):463-482, 2002.","title":"Rademacher and gaussian complexities: Risk bounds and structural results","authors":"Mendelson ; Bartlett, L Peter, Shahar Bartlett, Mendelson","year":"2002","venue":"Journal of Machine Learning Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Benjamini and Hochberg, 1995] Yoav Benjamini and Yosef Hochberg. Controlling the false discovery rate: a prac- tical and powerful approach to multiple testing. Journal of the Royal statistical society: series B (Methodological), 57(1):289-300, 1995.","title":"Controlling the false discovery rate: a practical and powerful approach to multiple testing","authors":"Hochberg ; ] Yoav Benjamini, Yosef Benjamini, Hochberg","year":"1995","venue":"Journal of the Royal statistical society: series B (Methodological)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bonferroni, 1936] Carlo Bonferroni. Teoria statistica delle classi e calcolo delle probabilita. Pubblicazioni del R Is- tituto Superiore di Scienze Economiche e Commericiali di Firenze, 8:3-62, 1936.","title":"Teoria statistica delle classi e calcolo delle probabilita","authors":"Carlo Bonferroni","year":"1936","venue":"Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commericiali di Firenze","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Harrison Jr and Rubinfeld, 1978] David Harrison Jr and Daniel L Rubinfeld. Hedonic housing prices and the de- mand for clean air. Journal of environmental economics and management, 5(1):81-102, 1978.","title":"Hedonic housing prices and the demand for clean air","authors":"Harrison Jr, Rubinfeld, David Harrison, Daniel L Rubinfeld","year":"1978","venue":"Journal of environmental economics and management","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Koltchinskii and Panchenko, 2000] Vladimir Koltchin- skii and Dmitriy Panchenko. Rademacher processes and bounding the risk of function learning. In High dimensional probability II, pages 443-457. Springer, 2000.","title":"Rademacher processes and bounding the risk of function learning","authors":"Vladimir Koltchinskii, Dmitriy Panchenko","year":"2000","venue":"High dimensional probability II","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ma and Tourani, 2020] Sisi Ma and Roshan Tourani. Pre- dictive and causal implications of using shapley value for model interpretation. In Proceedings of the 2020 KDD Workshop on Causal Discovery, pages 23-38. PMLR, 2020.","title":"Sisi Ma and Roshan Tourani. Predictive and causal implications of using shapley value for model interpretation","authors":"Tourani Ma","year":"2020","venue":"Proceedings of the 2020 KDD Workshop on Causal Discovery","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Mitzenmacher and Upfal, 2017] Michael Mitzenmacher and Eli Upfal. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press, 2017.","title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","authors":"Michael Mitzenmacher, Eli Upfal","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Neapolitan and others, 2004] Richard E Neapolitan et al. Learning bayesian networks, volume 38. Pearson Prentice Hall Upper Saddle River, 2004.","title":"Learning bayesian networks","authors":"Richard E Neapolitan","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Pearl, 2009] Judea Pearl. Causality: models, reasoning and inference. Cambridge University Press, 2 edition, 2009.","title":"Judea Pearl. Causality: models, reasoning and inference","authors":"Pearl","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Pe'er, 2005] Dana Pe'er. Bayesian network analysis of signaling networks: a primer. Science's STKE, 2005(281):pl4-pl4, 2005.","title":"Dana Pe'er. Bayesian network analysis of signaling networks: a primer","authors":"Pe'er","year":"2005","venue":"Science's STKE","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Pellegrina et al., 2019] Leonardo Pellegrina, Matteo Riondato, and Fabio Vandin. Hypothesis Testing and Statistically-sound Pattern Mining. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 3215-3216, 2019.","title":"Hypothesis Testing and Statistically-sound Pattern Mining","authors":"Leonardo Pellegrina, Matteo Riondato, Fabio Vandin","year":"2019","venue":"Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Pellegrina et al., 2020] Leonardo Pellegrina, Cyrus Cousins, Fabio Vandin, and Matteo Riondato. Mcrapper: Monte-carlo rademacher averages for poset families and approximate pattern mining. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 2165-2174, 2020.","title":"Matteo Riondato. Mcrapper: Monte-carlo rademacher averages for poset families and approximate pattern mining","authors":"Pellegrina","year":"2020","venue":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Peña et al., 2007a] Jose M. Peña, Roland Nilsson, Johan Björkegren, and Jesper Tegnér. Towards scalable and data efficient learning of Markov boundaries. International Journal of Approximate Reasoning, 45(2):211-232, 2007.","title":"Towards scalable and data efficient learning of Markov boundaries","authors":"Peña","year":"2007","venue":"International Journal of Approximate Reasoning","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Pena et al., 2007b] Jose M Pena, Roland Nilsson, Johan Björkegren, and Jesper Tegnér. Towards scalable and data efficient learning of markov boundaries. International Journal of Approximate Reasoning, 45(2):211-232, 2007.","title":"Towards scalable and data efficient learning of markov boundaries","authors":"Pena","year":"2007","venue":"International Journal of Approximate Reasoning","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Riondato and Upfal, 2015] Matteo Riondato and Eli Upfal. Mining frequent itemsets through progressive sampling with rademacher averages. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 1005-1014, 2015.","title":"Matteo Riondato and Eli Upfal. Mining frequent itemsets through progressive sampling with rademacher averages","authors":"Upfal Riondato","year":"2015","venue":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Sachs et al., 2005] Karen Sachs, Omar Perez, Dana Pe'er, Douglas A Lauffenburger, and Garry P Nolan. Causal protein-signaling networks derived from multiparameter single-cell data. Science, 308(5721):523-529, 2005.","title":"Causal protein-signaling networks derived from multiparameter single-cell data","authors":"Karen Sachs, Omar Perez, Dana Pe'er, Douglas A Lauffenburger, Garry P Nolan","year":"2005","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Santoro et al., 2020] Diego Santoro, Andrea Tonon, and Fabio Vandin. Mining sequential patterns with vc- dimension and rademacher complexity. Algorithms, 13(5):123, 2020.","title":"Mining sequential patterns with vcdimension and rademacher complexity","authors":"Santoro","year":"2020","venue":"Algorithms","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Shah and Peters, 2020] Rajen D Shah and Jonas Peters. The hardness of conditional independence testing and the gen- eralised covariance measure. The Annals of Statistics, 48(3):1514-1538, 2020.","title":"The hardness of conditional independence testing and the generalised covariance measure","authors":"D Rajen, Jonas Shah, Peters","year":"2020","venue":"The Annals of Statistics","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Simionato and Vandin, 2023] Dario Simionato and Fabio Vandin. Bounding the family-wise error rate in local causal discovery using rademacher averages. In Machine Learning and Knowledge Discovery in Databases: Euro- pean Conference, ECML PKDD 2022, Grenoble, France, September 19-23, 2022, Proceedings, Part V, pages 255- 271. Springer, 2023.","title":"Bounding the family-wise error rate in local causal discovery using rademacher averages","authors":"Dario Simionato, Fabio Vandin","year":"2022","venue":"Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2022","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Spirtes et al., 2000] Peter Spirtes, Clark N Glymour, Richard Scheines, and David Heckerman. Causation, prediction, and search. MIT press, 2000.","title":"Causation, prediction, and search","authors":"Peter Spirtes, Richard Clark N Glymour, David Scheines, Heckerman","year":"2000","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Tsamardinos and Aliferis, 2003] Ioannis Tsamardinos and Constantin F Aliferis. Towards principled feature selec- tion: Relevancy, filters and wrappers. In International Workshop on Artificial Intelligence and Statistics, pages 300-307. PMLR, 2003.","title":"Towards principled feature selection: Relevancy, filters and wrappers","authors":"Ioannis Tsamardinos, Constantin F Aliferis","year":"2003","venue":"International Workshop on Artificial Intelligence and Statistics","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Tsamardinos and Brown, 2008] Ioannis Tsamardinos and Laura E Brown. Bounding the false discovery rate in local bayesian network learning. In AAAI, pages 1100-1105, 2008.","title":"Bounding the false discovery rate in local bayesian network learning","authors":"Ioannis Tsamardinos, Laura E Brown","year":"2008","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Tsamardinos et al., 2003a] Ioannis Tsamardinos, Con- stantin F Aliferis, and Alexander Statnikov. Time and sample efficient discovery of markov blankets and direct causal relations. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 673-678, 2003.","title":"Ioannis Tsamardinos, Constantin F Aliferis, and Alexander Statnikov. Time and sample efficient discovery of markov blankets and direct causal relations","authors":"Tsamardinos","year":"2003","venue":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Tsamardinos et al., 2003b] Ioannis Tsamardinos, Con- stantin F Aliferis, Alexander R Statnikov, and Er Stat- nikov. Algorithms for large scale markov blanket discovery. In FLAIRS conference, volume 2, pages 376-380.","title":"Ioannis Tsamardinos, Constantin F Aliferis, Alexander R Statnikov, and Er Statnikov. Algorithms for large scale markov blanket discovery","authors":"Tsamardinos","year":"2003","venue":"FLAIRS conference","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"St. Augustine, FL, 2003.","title":null,"authors":"St, F L Augustine","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Velikova et al., 2014] Marina Velikova, Josien Terwisscha van Scheltinga, Peter JF Lucas, and Marc Spaanderman. Exploiting causal functional relationships in bayesian net- work modelling for personalised healthcare. International Journal of Approximate Reasoning, 55(1):59-73, 2014.","title":"Exploiting causal functional relationships in bayesian network modelling for personalised healthcare","authors":"Velikova","year":"2014","venue":"International Journal of Approximate Reasoning","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}