{"total":44,"rows":[{"id":"2104.02466","title":"A Review of Formal Methods applied to Machine Learning","created":"2021-04-06","cited_by_count":33,"area":null},{"id":"2102.07048","title":"Connecting Interpretability and Robustness in Decision Trees through Separation","created":"2021-02-14","cited_by_count":16,"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":"2105.11363","title":"Learning Security Classifiers with Verified Global Robustness Properties","created":"2021-05-24","cited_by_count":14,"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":"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":"2205.13909","title":"(De-)Randomized Smoothing for Decision Stump Ensembles","created":"2022-05-27","cited_by_count":5,"area":null},{"id":"2209.13179","title":"Explainable Global Fairness Verification of Tree-Based Classifiers","created":"2022-09-27","cited_by_count":5,"area":null},{"id":"2212.05380","title":"Mitigating Adversarial Gray-Box Attacks Against Phishing Detectors","created":"2022-12-11","cited_by_count":5,"area":null},{"id":"2101.00909","title":"Fair Training of Decision Tree Classifiers","created":"2021-01-04","cited_by_count":4,"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":"2111.12197","title":"Fixed Points in Cyber Space: Rethinking Optimal Evasion Attacks in the Age of AI-NIDS","created":"2021-11-23","cited_by_count":3,"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":"2207.07208","title":"Provably Adversarially Robust Nearest Prototype Classifiers","created":"2022-07-14","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":"2602.07453","title":"Data-Aware and Scalable Sensitivity Analysis for Decision Tree Ensembles","created":"2026-02-07","cited_by_count":2,"area":null},{"id":"2304.02497","title":"Hyper-parameter Tuning for Adversarially Robust Models","created":"2023-04-05","cited_by_count":1,"area":null},{"id":"2306.04064","title":"Transferable Adversarial Robustness for Categorical Data via Universal Robust Embeddings","created":"2023-06-06","cited_by_count":1,"area":null},{"id":"2306.04252","title":"Adversarial Sample Detection Through Neural Network Transport Dynamics","created":"2023-06-07","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":"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":"2512.19935","title":"Conditional Adversarial Fragility in Financial Machine Learning under Macroeconomic Stress","created":"2025-12-22","cited_by_count":1,"area":null},{"id":"2203.09792","title":"AdIoTack: Quantifying and Refining Resilience of Decision Tree Ensemble Inference Models against Adversarial Volumetric Attacks on IoT Networks","created":"2022-03-18","cited_by_count":0,"area":null},{"id":"2204.00103","title":"Scalable Whitebox Attacks on Tree-based Models","created":"2022-03-31","cited_by_count":0,"area":null},{"id":"2206.13083","title":"Adversarial Example Detection in Deployed Tree Ensembles","created":"2022-06-27","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.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":"2509.22850","title":"Boundary on the Table: Efficient Black-Box Decision-Based Attacks for Structured Data","created":"2025-09-26","cited_by_count":0,"area":null},{"id":"2511.21799","title":"The Double-Edged Nature of the Rashomon Set for Trustworthy Machine Learning","created":"2025-11-26","cited_by_count":0,"area":null},{"id":"2512.15780","title":"Adversarial Robustness in Financial Machine Learning: Defenses, Economic Impact, and Governance Evidence","created":"2025-12-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":"2605.13830","title":"Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2605.28068","title":"PINE: Pruning Boosted Tree Ensembles with Conformal In-Distribution Prediction Equivalence","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2609.03707","title":"Counterfactual Routing Using Integer Programming with Constraint Generation","created":"2026-09-03","cited_by_count":0,"area":null},{"id":"2610.01282","title":"Trustworthy Data- and ML-Ops for Intelligent Transportation Systems and Logistics","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}