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 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
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 AI
6d ago
Behavior and Representation in Open-Weight Large Language Models for Combinatorial Optimization: From Feature Extraction to Algorithm Selection
arXiv:2512. 13374v2 Announce Type: replace Abstract: Recent advances in Large Language Models (LLMs) open new perspectives for automation in optimization, yet little is known about whether their internal representations capture problem structure or algorithmic behavior.
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.
arXiv Machine Learning
6d ago
Computational Algebra with Attention: Transformer Oracles for Border Basis Algorithms
arXiv:2505. 23696v2 Announce Type: replace Abstract: Solving systems of polynomial equations, particularly those with finitely many solutions, is a crucial challenge across many scientific fields.
arXiv AI
Aug 11
Neurosymbolic Discovery of Algebraic Graph Constructions
arXiv:2608. 08118v1 Announce Type: new Abstract: There are several methods for searching for graphs with prescribed properties, such as SAT solvers and specialized generators.