arXiv AI
Jul 3
Algebraic Model Counting for Global Analysis of Optimal Decision Trees
arXiv:2607. 02069v1 Announce Type: new Abstract: Ensuring model reliability in Explainable AI requires a global assessment of the hypothesis space.
Algebraic Model Counting for Global Analysis of Optimal Decision Trees
Ensuring model reliability in Explainable AI requires a global assessment of the hypothesis space. We propose a formal framework for the exhaustive analysis of optimal and near-optimal decision trees, called Algebraic Decision Tree Counting (ADTC).
Related stories
arXiv Machine Learning
Jun 5
Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach
arXiv:2605. 13830v2 Announce Type: replace-cross Abstract: Decision tree ensembles (DTE) are a popular model for a wide range of AI classification tasks, used in multiple safety critical domains, and hence verifying properties on these models has been an active topic of study over the last decade.
arXiv Machine Learning
Aug 6
ArborEnum: Decision Tree Rashomon Sets over Continuous Features
arXiv:2608. 04310v1 Announce Type: new Abstract: The Rashomon effect describes the phenomenon that many models can achieve nearly equivalent performance on the same learning task, with significant ramifications for robustness, feature importance, and customizability.
arXiv Machine Learning
Aug 6
Data-Aware and Scalable Sensitivity Analysis for Decision Tree Ensembles
arXiv:2602. 07453v2 Announce Type: replace Abstract: Decision tree ensembles are widely used in critical domains, making robustness and sensitivity analysis essential to their trustworthiness.
arXiv Machine Learning
Aug 31
Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests
The paper presents a probabilistic symbolic regression framework that models mathematical expressions as ensembles of symbolic trees, using a regularizing prior to control complexity and an Occam’s window-based posterior to capture uncertainty across plausible models. It provides theoretical guarantees on posterior concentration, including near‑parametric rates when an exact finite formula exists and oracle results under misspecification. Empirical results show the method outperforms state‑of‑the‑art competitors in predictive accuracy, symbolic complexity, and structural recovery on benchmark scientific equations and a materials discovery task.
arXiv AI
2d ago
Auto-Formalizing Neuro-Symbolic Predictors
arXiv:2610.01519v1 Announce Type: cross Abstract: Neuro-Symbolic (NeSy) predictors incorporate prior knowledge into the prediction process of neural networks, ensuring that outputs satisfy specified...
arXiv Machine Learning
Aug 4
Local Shapley: Model-Induced Locality and Optimal Reuse in Data Valuation
arXiv:2603. 03672v2 Announce Type: replace Abstract: The Shapley value provides a principled foundation for data valuation, but exact computation is #P-hard due to the exponential coalition space.
arXiv Machine Learning
Sep 18
The Output-Space Hypothesis: Enumerative Equivalence Checking for Tensor Programs
arXiv:2609. 19611v1 Announce Type: cross Abstract: Tensor programs, as used in deep learning models, are a prime target for optimization, as small performance improvements can have a large impact across training or inference workloads.
arXiv Machine Learning
Jul 1
Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again
arXiv:2606. 30995v1 Announce Type: new Abstract: Recent work has shown that well-optimized individual decision trees can match complex black box models in some settings, primarily in noisy domains.
arXiv Machine Learning
Jul 27
Breaking the Data Barrier in Learning Symbolic Computation: A Case Study on Variable Ordering Suggestion for Cylindrical Algebraic Decomposition
arXiv:2601. 13731v2 Announce Type: replace-cross Abstract: Symbolic computation, powered by modern computer algebra systems, has important applications in mathematical reasoning through exact deep computations.
arXiv AI
Jun 17
Decidable By Construction: Design-Time Verification for Trustworthy AI
arXiv:2603. 25414v4 Announce Type: replace-cross Abstract: A prevailing assumption in machine learning is that model correctness must be enforced after the fact.
arXiv AI
Jul 7
RLIE: Rule Generation with Logistic Regression, Iterative Refinement, and Evaluation for Large Language Models
arXiv:2510. 19698v3 Announce Type: replace Abstract: Large Language Models (LLMs) can propose rules in natural language, sidestepping the need for a predefined predicate space in traditional rule learning.