{"total":32,"rows":[{"id":"2104.06172","title":"On the Computational Intelligibility of Boolean Classifiers","created":"2021-04-13","cited_by_count":40,"area":null},{"id":"2104.02466","title":"A Review of Formal Methods applied to Machine Learning","created":"2021-04-06","cited_by_count":33,"area":null},{"id":"2111.09961","title":"A Review of Adversarial Attack and Defense for Classification Methods","created":"2021-11-18","cited_by_count":29,"area":null},{"id":"2111.05391","title":"Statistical Perspectives on Reliability of Artificial Intelligence Systems","created":"2021-11-09","cited_by_count":10,"area":null},{"id":"2211.01498","title":"On the Safety of Interpretable Machine Learning: A Maximum Deviation Approach","created":"2022-11-02","cited_by_count":7,"area":null},{"id":"2108.06898","title":"Neural-to-Tree Policy Distillation with Policy Improvement Criterion","created":"2021-08-16","cited_by_count":5,"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":"2304.13761","title":"Enhancing Robustness of Gradient-Boosted Decision Trees through One-Hot Encoding and Regularization","created":"2023-04-26","cited_by_count":4,"area":null},{"id":"2402.11168","title":"Trust Regions for Explanations via Black-Box Probabilistic Certification","created":"2024-02-17","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":"2312.16364","title":"Robustness Verification for Knowledge-Based Logic of Risky Driving Scenes","created":"2023-12-27","cited_by_count":3,"area":null},{"id":"2510.21292","title":"Additive Models Explained: A Computational Complexity Approach","created":"2025-10-24","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":"2309.08228","title":"Ensuring Topological Data-Structure Preservation under Autoencoder Compression due to Latent Space Regularization in Gauss--Legendre nodes","created":"2023-09-15","cited_by_count":2,"area":null},{"id":"2602.07453","title":"Data-Aware and Scalable Sensitivity Analysis for Decision Tree Ensembles","created":"2026-02-07","cited_by_count":2,"area":null},{"id":"2202.12512","title":"MUC-driven Feature Importance Measurement and Adversarial Analysis for Random Forest","created":"2022-02-25","cited_by_count":1,"area":null},{"id":"2303.09271","title":"Finding Minimum-Cost Explanations for Predictions made by Tree Ensembles","created":"2023-03-16","cited_by_count":1,"area":null},{"id":"2402.08586","title":"Faster Repeated Evasion Attacks in Tree Ensembles","created":"2024-02-13","cited_by_count":1,"area":null},{"id":"2410.11000","title":"Generating Global and Local Explanations for Tree-Ensemble Learning Methods by Answer Set Programming","created":"2024-10-14","cited_by_count":1,"area":null},{"id":"2605.06278","title":"PACE: Prune-And-Compress Ensemble Models","created":"2026-05-07","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":"2208.10354","title":"Quantifying probabilistic robustness of tree-based classifiers against natural distortions","created":"2022-08-22","cited_by_count":0,"area":null},{"id":"2210.16451","title":"Robust Boosting Forests with Richer Deep Feature Hierarchy","created":"2022-10-29","cited_by_count":0,"area":null},{"id":"2308.05575","title":"Symmetry Defense Against XGBoost Adversarial Perturbation Attacks","created":"2023-08-10","cited_by_count":0,"area":null},{"id":"2309.08945","title":"Inverse classification with logistic and softmax classifiers: efficient optimization","created":"2023-09-16","cited_by_count":0,"area":null},{"id":"2402.04892","title":"Probabilistic ML Verification via Weighted Model Integration","created":"2024-02-07","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},{"id":"2512.16386","title":"Quantitative Verification of Fairness in Tree Ensembles","created":"2025-12-18","cited_by_count":0,"area":null},{"id":"2603.16983","title":"Formal verification of tree-based machine learning models for lateral spreading","created":"2026-03-17","cited_by_count":0,"area":null},{"id":"2606.18853","title":"Kernel of Partition Paths: A Unified Representation for Tree Ensembles","created":"2026-06-17","cited_by_count":0,"area":null}],"next_cursor":null}