Image de couverture de livre

Algorithmic causal structure emerging through compression

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wendong, Liang, Buchholz, Simon, Schölkopf, Bernhard
Format:	Preprint
Publié:	2025
Sujets:	Machine Learning Artificial Intelligence Computational Complexity Information Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The Agent Capability Problem: Predicting Solvability Through Information-Theoretic Bounds
par: Lutati, Shahar
Publié: (2025)

Exponential quantum advantage in processing massive classical data
par: Zhao, Haimeng, et autres
Publié: (2026)

Counterfactual reasoning: an analysis of in-context emergence
par: Miller, Moritz, et autres
Publié: (2025)

Learning Interpretable Concepts: Unifying Causal Representation Learning and Foundation Models
par: Rajendran, Goutham, et autres
Publié: (2024)

Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement
par: Boche, Holger, et autres
Publié: (2024)

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

Neural Algorithmic Reasoning for Hypergraphs with Looped Transformers
par: Huang, Zekai, et autres
Publié: (2025)

Near-Optimal Learning and Planning in Separated Latent MDPs
par: Chen, Fan, et autres
Publié: (2024)

Efficient Algorithm for Sparse Fourier Transform of Generalized $q$-ary Functions
par: Tsui, Darin, et autres
Publié: (2025)

Causal Component Analysis
par: Wendong, Liang, et autres
Publié: (2023)

Learning from Equivalence Queries, Revisited
par: Braverman, Mark, et autres
Publié: (2026)

Polynomial-Time Optimal Group Selection via the Double-Commutator Eigenvalue Problem
par: Thornton, Mitchell A.
Publié: (2026)

Quantifying intrinsic causal contributions via structure preserving interventions
par: Janzing, Dominik, et autres
Publié: (2020)

The Algorithmic Regulator
par: Ruffini, Giulio
Publié: (2025)

When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
par: Li, Chenyang, et autres
Publié: (2025)

Looped ReLU MLPs May Be All You Need as Practical Programmable Computers
par: Liang, Yingyu, et autres
Publié: (2024)

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

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
par: Lou, Mengqi, et autres
Publié: (2025)

The Optimal Approximation Factor in Density Estimation
par: Bousquet, Olivier, et autres
Publié: (2019)

Infinite Time Turing Machines and their Applications
par: Weerawarana, Rukmal, et autres
Publié: (2025)

Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization
par: Pedramfar, Mohammad, et autres
Publié: (2024)

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

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

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

Theoretical Constraints on the Expressive Power of $\mathsf{RoPE}$-based Tensor Attention Transformers
par: Li, Xiaoyu, et autres
Publié: (2024)

Have Large Language Models Learned to Reason? A Characterization via 3-SAT Phase Transition
par: Hazra, Rishi, et autres
Publié: (2025)

A Theory of Learning with Autoregressive Chain of Thought
par: Joshi, Nirmit, et autres
Publié: (2025)

Provable Failure of Language Models in Learning Majority Boolean Logic via Gradient Descent
par: Chen, Bo, et autres
Publié: (2025)

Provably Overwhelming Transformer Models with Designed Inputs
par: Stambler, Lev, et autres
Publié: (2025)

Limitations on Accurate, Trusted, Human-level Reasoning
par: Panigrahy, Rina, et autres
Publié: (2025)

Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models
par: Hu, Jerry Yao-Chieh, et autres
Publié: (2024)

Lossless Model Compression via Joint Low-Rank Factorization Optimization
par: Zhang, Boyang, et autres
Publié: (2024)

Learning to Think from Multiple Thinkers
par: Joshi, Nirmit, et autres
Publié: (2026)

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

On the Expressive Power and Limitations of Multi-Layer SSMs
par: Zubić, Nikola, et autres
Publié: (2026)

Mathematical Formalism for Memory Compression in Selective State Space Models
par: Bhat, Siddhanth
Publié: (2024)

A Unified Approach for Maximizing Continuous DR-submodular Functions
par: Pedramfar, Mohammad, et autres
Publié: (2023)

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

A Quantitative Definition of Intelligence
par: Choi, Kang-Sin
Publié: (2026)

Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding
par: Chen, Yifang, et autres
Publié: (2025)