arXiv:2608. 08674v1 Announce Type: new Abstract: In the operation of machine learning models, model update is a fundamental process that requires careful consideration of its impact on downstream decision-making.
arXiv:2606. 10347v1 Announce Type: new Abstract: Machine learning is increasingly used in critical domains, where both predictions and their associated confidence levels influence important decisions.
arXiv:2606. 04634v1 Announce Type: new Abstract: Trust in a decision-making system requires both safety guarantees and the ability to interpret and understand its behavior.
arXiv:2607. 09502v1 Announce Type: cross Abstract: Explaining machine-learning models is increasingly important for decision-making and consumer trust, yet it is widely believed to come at a cost: existing Explainable AI (XAI) methods suffer from a persistent accuracy-explainability trade-off.
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:2606. 18418v1 Announce Type: new Abstract: The increasing use of machine learning algorithms in social applications has raised concerns about fairness and transparency, leading to the development of counterfactual explanations.
arXiv:2607. 28170v1 Announce Type: new Abstract: Optimal decision trees (ODTs) are compact, interpretable machine learning models that globally optimize a given objective, but their scalability remains challenging.
ProToMEx is a new explainability framework that uses Probabilistic Topic Models to learn latent topics representing high‑level reasons behind a classifier’s decisions, moving beyond simple feature attribution. It provides both global and local explanations, revealing multiple co‑existing reasons for individual predictions. Empirical results show that ProToMEx achieves comparable fidelity to SHAP and LIME while being 30–40× faster on standard tabular and synthetic datasets.
arXiv:2605. 27618v2 Announce Type: replace Abstract: Despite the wide use of explainability techniques to attempt to understand the behavior of Artificial Intelligence (AI), the generated explanations may not always be reliable.
arXiv:2507. 22951v2 Announce Type: replace Abstract: Knowledge Graphs organize information as entity-relation-entity triples, enabling machine learning models to predict plausible missing triples in a task known as Knowledge Graph Completion (KGC).
The paper introduces a look‑ahead splitting rule for Classification and Regression Trees (CART) that evaluates candidate splits by the error reduction achieved after growing a conventional CART subtree beneath each split. To keep the method computationally feasible, a smart look‑ahead algorithm is proposed that learns downstream split values from node‑level features. Experiments on simulated data and two real datasets show that both full and smart look‑ahead methods outperform the standard greedy splitting strategy, especially in hierarchical or interaction‑driven scenarios.
arXiv:2503. 12902v4 Announce Type: replace Abstract: Model trees provide an appealing way to perform interpretable machine learning for both classification and regression problems.
Classification and regression trees are typically constructed using a greedy splitting rule that maximizes the immediate reduction in prediction error at each node. Although this strategy is computati...