{"total":22,"rows":[{"id":"2211.00541","title":"Logic-Based Explainability in Machine Learning","created":"2022-10-24","cited_by_count":48,"area":null},{"id":"2208.10605","title":"SoK: Explainable Machine Learning for Computer Security Applications","created":"2022-08-22","cited_by_count":20,"area":null},{"id":"2208.13058","title":"Adversarial Robustness for Tabular Data through Cost and Utility Awareness","created":"2022-08-27","cited_by_count":15,"area":null},{"id":"2203.04234","title":"Adaptative Perturbation Patterns: Realistic Adversarial Learning for Robust Intrusion Detection","created":"2022-03-08","cited_by_count":13,"area":null},{"id":"2109.03857","title":"Robust Optimal Classification Trees Against Adversarial Examples","created":"2021-09-08","cited_by_count":11,"area":null},{"id":"2301.13122","title":"Towards Adversarial Realism and Robust Learning for IoT Intrusion Detection and Classification","created":"2023-01-30","cited_by_count":10,"area":null},{"id":"2308.06819","title":"SoK: Realistic Adversarial Attacks and Defenses for Intelligent Network Intrusion Detection","created":"2023-08-13","cited_by_count":10,"area":null},{"id":"2406.01098","title":"Learning Decision Trees and Forests with Algorithmic Recourse","created":"2024-06-03","cited_by_count":7,"area":null},{"id":"2205.13909","title":"(De-)Randomized Smoothing for Decision Stump Ensembles","created":"2022-05-27","cited_by_count":5,"area":null},{"id":"2112.02705","title":"Beyond Robustness: Resilience Verification of Tree-Based Classifiers","created":"2021-12-05","cited_by_count":4,"area":null},{"id":"2308.12820","title":"Prediction without Preclusion: Recourse Verification with Reachable Sets","created":"2023-08-24","cited_by_count":4,"area":null},{"id":"2410.01580","title":"Learning-Augmented Robust Algorithmic Recourse","created":"2024-10-02","cited_by_count":4,"area":null},{"id":"2305.03626","title":"Verifiable Learning for Robust Tree Ensembles","created":"2023-05-05","cited_by_count":3,"area":null},{"id":"2509.21293","title":"Optimal Robust Recourse with $L^p$-Bounded Model Change","created":"2025-09-25","cited_by_count":3,"area":null},{"id":"2303.04811","title":"Naive Bayes Classifiers over Missing Data: Decision and Poisoning","created":"2023-03-08","cited_by_count":2,"area":null},{"id":"2310.17772","title":"Learning Optimal Classification Trees Robust to Distribution Shifts","created":"2023-10-26","cited_by_count":2,"area":null},{"id":"2312.09078","title":"Coevolutionary Algorithm for Building Robust Decision Trees under Minimax Regret","created":"2023-12-14","cited_by_count":2,"area":null},{"id":"2402.08586","title":"Faster Repeated Evasion Attacks in Tree Ensembles","created":"2024-02-13","cited_by_count":1,"area":null},{"id":"2412.13762","title":"Cultivating Archipelago of Forests: Evolving Robust Decision Trees through Island Coevolution","created":"2024-12-18","cited_by_count":1,"area":null},{"id":"2206.13083","title":"Adversarial Example Detection in Deployed Tree Ensembles","created":"2022-06-27","cited_by_count":0,"area":null},{"id":"2402.14988","title":"Verifiable Boosted Tree Ensembles","created":"2024-02-22","cited_by_count":0,"area":null},{"id":"2507.10048","title":"On the Efficiency of Training Robust Decision Trees","created":"2025-07-14","cited_by_count":0,"area":null}],"next_cursor":null}