Image de couverture de livre

Explaining Decisions in ML Models: a Parameterized Complexity Analysis

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ordyniak, Sebastian, Paesani, Giacomo, Rychlicki, Mateusz, Szeider, Stefan
Format:	Preprint
Publié:	2024
Sujets:	Artificial Intelligence Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Explaining Decisions in ML Models: a Parameterized Complexity Analysis (Part I)
par: Ordyniak, Sebastian, et autres
Publié: (2025)

Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach
par: Eriksson, Leif, et autres
Publié: (2026)

Solving Quantified Boolean Formulas with Few Existential Variables
par: Eriksson, Leif, et autres
Publié: (2024)

Compilation and Fast Model Counting beyond CNF
par: de Colnet, Alexis, et autres
Publié: (2025)

Parameterized Complexity Of Representing Models Of MSO Formulas
par: Kučera, Petr, et autres
Publié: (2026)

On the Parameterized Complexity of Min-Sum-Radii
par: Kumar, Pankaj, et autres
Publié: (2026)

A Tight Subexponential-time Algorithm for Two-Page Book Embedding
par: Ganian, Robert, et autres
Publié: (2024)

The Parameterized Complexity of Computing the VC-Dimension
par: Foucaud, Florent, et autres
Publié: (2025)

A Structural Complexity Analysis of Hierarchical Task Network Planning
par: Brand, Cornelius, et autres
Publié: (2024)

On the Complexity of Identification in Linear Structural Causal Models
par: Dörfler, Julian, et autres
Publié: (2024)

Complexity Results of Persuasion
par: Grastien, Alban
Publié: (2025)

Value Iteration with Guessing for Markov Chains and Markov Decision Processes
par: Chatterjee, Krishnendu, et autres
Publié: (2025)

Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations
par: Goertzel, Ben, et autres
Publié: (2026)

Complexity of Scheduling Charging in the Smart Grid
par: de Weerdt, Mathijs, et autres
Publié: (2017)

Over the Edge of Chaos? Excess Complexity as a Roadblock to Artificial General Intelligence
par: Susnjak, Teo, et autres
Publié: (2024)

The Complexity of Symmetry Breaking Beyond Lex-Leader
par: Anders, Markus, et autres
Publié: (2024)

Epistemic Logic Programs: Non-Ground and Counting Complexity
par: Eiter, Thomas, et autres
Publié: (2025)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
par: Banik, Aritra, et autres
Publié: (2025)

From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
par: Dörfler, Julian, et autres
Publié: (2024)

Barriers to Complexity-Theoretic Proofs that "AGI" Using Machine Learning is Impossible
par: Guerzhoy, Michael
Publié: (2024)

Strongly Polynomial Time Complexity of Policy Iteration for $L_\infty$ Robust MDPs
par: Asadi, Ali, et autres
Publié: (2026)

An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
par: Fargier, Hélène, et autres
Publié: (2021)

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
par: Karmakar, Pratik, et autres
Publié: (2024)

Probabilistic Explanations for Linear Models
par: Subercaseaux, Bernardo, et autres
Publié: (2024)

Circuit Complexity Bounds for Visual Autoregressive Model
par: Ke, Yekun, et autres
Publié: (2025)

LLM Self-Explanations Fail Semantic Invariance
par: Szeider, Stefan
Publié: (2026)

Hardness of Random Reordered Encodings of Parity for Resolution and CDCL
par: Chew, Leroy, et autres
Publié: (2024)

BigO(Bench) -- Can LLMs Generate Code with Controlled Time and Space Complexity?
par: Chambon, Pierre, et autres
Publié: (2025)

Computational Irreducibility as the Foundation of Agency: A Formal Model Connecting Undecidability to Autonomous Behavior in Complex Systems
par: Azadi, Poria
Publié: (2025)

Complexity of Faceted Explanations in Propositional Abduction
par: Schmidt, Johannes, et autres
Publié: (2025)

The Computational Complexity of Circuit Discovery for Inner Interpretability
par: Adolfi, Federico, et autres
Publié: (2024)

Linear Equations with Min and Max Operators: Computational Complexity
par: Chatterjee, Krishnendu, et autres
Publié: (2024)

PBLean: Pseudo-Boolean Proof Certificates for Lean 4
par: Szeider, Stefan
Publié: (2026)

Data Complexity in Expressive Description Logics With Path Expressions
par: Bednarczyk, Bartosz
Publié: (2024)

ASP-Bench: From Natural Language to Logic Programs
par: Szeider, Stefan
Publié: (2026)

The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity
par: Chen, Yifang, et autres
Publié: (2024)

Small unsatisfiable $k$-CNFs with bounded literal occurrence
par: Zhang, Tianwei, et autres
Publié: (2024)

MCP-Solver: Integrating Language Models with Constraint Programming Systems
par: Szeider, Stefan
Publié: (2024)

The Computational Complexity of Satisfiability in State Space Models
par: Alsmann, Eric, et autres
Publié: (2025)

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
par: Li, Xiaoyu, et autres
Publié: (2025)