:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bassan, Shahaf, Moshkovitz, Michal, Katz, Guy
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Computational Complexity
Online Access:	https://arxiv.org/abs/2510.21292
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hard to Explain: On the Computational Hardness of In-Distribution Model Interpretation
by: Amir, Guy, et al.
Published: (2024)

Local vs. Global Interpretability: A Computational Complexity Perspective
by: Bassan, Shahaf, et al.
Published: (2024)

Provably Explaining Neural Additive Models
by: Bassan, Shahaf, et al.
Published: (2026)

Unifying Formal Explanations: A Complexity-Theoretic Perspective
by: Bassan, Shahaf, et al.
Published: (2026)

What makes an Ensemble (Un) Interpretable?
by: Bassan, Shahaf, et al.
Published: (2025)

On the Computational Tractability of the (Many) Shapley Values
by: Marzouk, Reda, et al.
Published: (2025)

SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism
by: Marzouk, Reda, et al.
Published: (2025)

Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees
by: Hadad, Itamar, et al.
Published: (2026)

Explaining, Fast and Slow: Abstraction and Refinement of Provable Explanations
by: Bassan, Shahaf, et al.
Published: (2025)

Explain Yourself, Briefly! Self-Explaining Neural Networks with Concise Sufficient Reasons
by: Bassan, Shahaf, et al.
Published: (2025)

Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks
by: Boetius, David, et al.
Published: (2026)

A weak regularity lemma for polynomials
by: Moshkovitz, Guy, et al.
Published: (2025)

Slice rank and partition rank of the determinant
by: Lampert, Amichai, et al.
Published: (2025)

The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
by: Blanc, Guy, et al.
Published: (2024)

The Computational Complexity of Satisfiability in State Space Models
by: Alsmann, Eric, et al.
Published: (2025)

Computational-Statistical Tradeoffs from NP-hardness
by: Blanc, Guy, et al.
Published: (2025)

On the Computational Capability of Graph Neural Networks: A Circuit Complexity Bound Perspective
by: Li, Xiaoyu, et al.
Published: (2025)

Computational Complexity Evaluation of Neural Network Applications in Signal Processing
by: Freire, Pedro, et al.
Published: (2022)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
by: Hollender, Alexandros, et al.
Published: (2023)

The Computational Limits of State-Space Models and Mamba via the Lens of Circuit Complexity
by: Chen, Yifang, et al.
Published: (2024)

Models That Prove Their Own Correctness
by: Amit, Noga, et al.
Published: (2024)

FAME: Formal Abstract Minimal Explanation for Neural Networks
by: Boumazouza, Ryma, et al.
Published: (2026)

Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
by: Wein, Alexander S.
Published: (2025)

The Computational Complexity of Almost Stable Clustering with Penalties
by: Khodamoradi, Kamyar, et al.
Published: (2025)

The Fine-Grained Complexity of Gradient Computation for Training Large Language Models
by: Alman, Josh, et al.
Published: (2024)

On Computationally Efficient Multi-Class Calibration
by: Gopalan, Parikshit, et al.
Published: (2024)

On the Computational Hardness of Transformers
by: Saha, Barna, et al.
Published: (2026)

Fundamental Limits of Crystalline Equivariant Graph Neural Networks: A Circuit Complexity Perspective
by: Cao, Yang, et al.
Published: (2025)

Optimizing Computational-Statistical Runtime for Wasserstein Distance Estimation
by: Jacobs, Peter Matthew, et al.
Published: (2026)

Statistical and Computational Guarantees of Kernel Max-Sliced Wasserstein Distances
by: Wang, Jie, et al.
Published: (2024)

Adaptive and oblivious statistical adversaries are equivalent
by: Blanc, Guy, et al.
Published: (2024)

Necessary and Sufficient Oracles: Toward a Computational Taxonomy For Reinforcement Learning
by: Rohatgi, Dhruv, et al.
Published: (2025)

The Parameterized Complexity of Computing the VC-Dimension
by: Foucaud, Florent, et al.
Published: (2025)

On Computational Limits and Provably Efficient Criteria of Visual Autoregressive Models: A Fine-Grained Complexity Analysis
by: Ke, Yekun, et al.
Published: (2025)

Deep Learning as a Convex Paradigm of Computation: Minimizing Circuit Size with ResNets
by: Jacot, Arthur
Published: (2025)

Limits of Deep Learning: Sequence Modeling through the Lens of Complexity Theory
by: Zubić, Nikola, et al.
Published: (2024)

Circuit Complexity Bounds for Visual Autoregressive Model
by: Ke, Yekun, et al.
Published: (2025)

A Distributional-Lifting Theorem for PAC Learning
by: Blanc, Guy, et al.
Published: (2025)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
by: Ganian, Robert, et al.
Published: (2025)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
by: Thejaswi, Suhas, et al.
Published: (2024)