Image de couverture de livre

Probabilistic Explanations for Linear Models

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Subercaseaux, Bernardo, Arenas, Marcelo, Meel, Kuldeep S
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

Locally-Minimal Probabilistic Explanations
par: Izza, Yacine, et autres
Publié: (2023)

Probabilistic Generating Circuits -- Demystified
par: Agarwal, Sanyam, et autres
Publié: (2024)

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

Probabilistic and Causal Satisfiability: Constraining the Model
par: Bläser, Markus, et autres
Publié: (2025)

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

Model Counting in the Wild
par: Shaw, Arijit, et autres
Publié: (2024)

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

Towards Projected and Incremental Pseudo-Boolean Model Counting
par: Yang, Suwei, et autres
Publié: (2024)

On Probabilistic and Causal Reasoning with Summation Operators
par: Ibeling, Duligur, et autres
Publié: (2024)

A faster FPRAS for #NFA
par: Meel, Kuldeep S., et autres
Publié: (2023)

Near-Optimal Encodings of Cardinality Constraints
par: Krapivin, Andrew, et autres
Publié: (2026)

Total Variation Distance Meets Probabilistic Inference
par: Bhattacharyya, Arnab, et autres
Publié: (2023)

An ASP-Based Framework for MUSes
par: Kabir, Mohimenul, et autres
Publié: (2025)

Approximate SMT Counting Beyond Discrete Domains
par: Shaw, Arijit, et autres
Publié: (2025)

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
par: Ledaguenel, Arthur, et autres
Publié: (2024)

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

Total Variation Distance for Product Distributions is $\#\mathsf{P}$-Complete
par: Bhattacharyya, Arnab, et autres
Publié: (2024)

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

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

A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention
par: Ye, Xiaowei, et autres
Publié: (2026)

On Deciding the Data Complexity of Answering Linear Monadic Datalog Queries with LTL Operators(Extended Version)
par: Artale, Alessandro, et autres
Publié: (2025)

Counting and Sampling Traces in Regular Languages
par: de Colnet, Alexis, et autres
Publié: (2025)

Engineering an Exact Pseudo-Boolean Model Counter
par: Yang, Suwei, et autres
Publié: (2023)

A Uniform Language to Explain Decision Trees
par: Arenas, Marcelo, et autres
Publié: (2023)

RoPE Attention Can Be Trained in Almost Linear Time
par: Cao, Yang, et autres
Publié: (2024)

Automated Reencoding Meets Graph Theory
par: Przybocki, Benjamin, et autres
Publié: (2026)

Solving Multiagent Path Finding on Highly Centralized Networks
par: Fioravantes, Foivos, et autres
Publié: (2024)

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

CSPs with Few Alien Constraints
par: Jonsson, Peter, et autres
Publié: (2024)

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

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

ActionReasoningBench: Reasoning about Actions with and without Ramification Constraints
par: Handa, Divij, et autres
Publié: (2024)

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

Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal
par: Varma, Om Ramakisan, et autres
Publié: (2024)

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

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
par: Fioravantes, Foivos, 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)

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

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