Cover Image

Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Boche, Holger, Fono, Adalbert, Kutyniok, Gitta
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Artificial Intelligence Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization
by: Boche, Holger, et al.
Published: (2024)

Complexity Theory meets Ordinary Differential Equations
by: Fono, Adalbert, et al.
Published: (2026)

Turing meets Moore-Penrose: Computing the Pseudoinverse on Turing Machines
by: Boche, Holger, et al.
Published: (2022)

Inverse Problems Are Solvable on Real Number Signal Processing Hardware
by: Boche, Holger, et al.
Published: (2022)

Time to Spike? Understanding the Representational Power of Spiking Neural Networks in Discrete Time
by: Nguyen, Duc Anh, et al.
Published: (2025)

Sustainable AI: Mathematical Foundations of Spiking Neural Networks
by: Fono, Adalbert, et al.
Published: (2025)

Expressivity of Spiking Neural Networks
by: Singh, Manjot, et al.
Published: (2023)

Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers
by: Huang, Zekai, et al.
Published: (2025)

Mathematical Formalism for Memory Compression in Selective State Space Models
by: Bhat, Siddhanth
Published: (2024)

Algorithmic causal structure emerging through compression
by: Wendong, Liang, et al.
Published: (2025)

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
by: Pedramfar, Mohammad, et al.
Published: (2024)

Modern Hopfield Networks Require Chain-of-Thought to Solve $\mathsf{NC}^1$-Hard Problems
by: Cao, Yang, et al.
Published: (2024)

Provably Overwhelming Transformer Models with Designed Inputs
by: Stambler, Lev, et al.
Published: (2025)

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

The Price of Robustness: Stable Classifiers Need Overparameterization
by: von Berg, Jonas, et al.
Published: (2026)

Theoretical Constraints on the Expressive Power of $\mathsf{RoPE}$-based Tensor Attention Transformers
by: Li, Xiaoyu, et al.
Published: (2024)

Learning to Think from Multiple Thinkers
by: Joshi, Nirmit, et al.
Published: (2026)

A Theory of Learning with Autoregressive Chain of Thought
by: Joshi, Nirmit, et al.
Published: (2025)

Prior Knowledge Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methods
by: Blum, Avrim, et al.
Published: (2025)

Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent
by: Chen, Bo, et al.
Published: (2025)

Have Large Language Models Learned to Reason? A Characterization via 3-SAT Phase Transition
by: Hazra, Rishi, et al.
Published: (2025)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
by: Fioravantes, Foivos, et al.
Published: (2024)

Learning Tree Pattern Transformations
by: Neider, Daniel, et al.
Published: (2024)

Position: Scaling LLM Agents Requires Asymptotic Analysis with LLM Primitives
by: Meyerson, Elliot, et al.
Published: (2025)

Fast Approximation Algorithm for Non-Monotone DR-submodular Maximization under Size Constraint
by: Tran, Tan D., et al.
Published: (2025)

Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models
by: Hu, Jerry Yao-Chieh, et al.
Published: (2024)

Lossless Model Compression via Joint Low-Rank Factorization Optimization
by: Zhang, Boyang, et al.
Published: (2024)

Looped ReLU MLPs May Be All You Need as Practical Programmable Computers
by: Liang, Yingyu, et al.
Published: (2024)

A Provable Expressiveness Hierarchy in Hybrid Linear-Full Attention
by: Ye, Xiaowei, et al.
Published: (2026)

On the Expressive Power and Limitations of Multi-Layer SSMs
by: Zubić, Nikola, et al.
Published: (2026)

Limitations on Accurate, Trusted, Human-level Reasoning
by: Panigrahy, Rina, et al.
Published: (2025)

When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
by: Li, Chenyang, et al.
Published: (2025)

A Unified Approach for Maximizing Continuous DR-submodular Functions
by: Pedramfar, Mohammad, et al.
Published: (2023)

How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers
by: Wang, Xiao
Published: (2026)

A Quantitative Definition of Intelligence
by: Choi, Kang-Sin
Published: (2026)

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

ParFam -- (Neural Guided) Symbolic Regression Based on Continuous Global Optimization
by: Scholl, Philipp, et al.
Published: (2023)

Near-Optimal Learning and Planning in Separated Latent MDPs
by: Chen, Fan, et al.
Published: (2024)

Symbolic Recovery of Differential Equations: The Identifiability Problem
by: Scholl, Philipp, et al.
Published: (2022)

Nearest Neighbor CCP-Based Molecular Sequence Analysis
by: Ali, Sarwan, et al.
Published: (2024)