Copertina

Limitations on Accurate, Trusted, Human-level Reasoning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Panigrahy, Rina, Sharan, Vatsal
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Artificial Intelligence Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Latent Concept Disentanglement in Transformer-based Language Models
di: Hong, Guan Zhe, et al.
Pubblicazione: (2025)

A Measure-Theoretic Analysis of Reasoning: Structural Generalization and Approximation Limits
di: Zhang, Yuyang, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

A Complexity Map of Probabilistic Reasoning for Neurosymbolic Classification Techniques
di: Ledaguenel, Arthur, et al.
Pubblicazione: (2024)

NPHardEval: Dynamic Benchmark on Reasoning Ability of Large Language Models via Complexity Classes
di: Fan, Lizhou, et al.
Pubblicazione: (2023)

Transformer Encoder Satisfiability: Complexity and Impact on Formal Reasoning
di: Sälzer, Marco, et al.
Pubblicazione: (2024)

Efficient Convex Optimization Requires Superlinear Memory
di: Marsden, Annie, et al.
Pubblicazione: (2022)

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

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

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

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

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

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

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

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

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

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

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

Mathematical Algorithm Design for Deep Learning under Societal and Judicial Constraints: The Algorithmic Transparency Requirement
di: Boche, Holger, et al.
Pubblicazione: (2024)

A Quantitative Definition of Intelligence
di: Choi, Kang-Sin
Pubblicazione: (2026)

On Computational Limits of FlowAR Models: Expressivity and Efficiency
di: Cao, Yang, et al.
Pubblicazione: (2025)

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

A Implies B: Circuit Analysis in LLMs for Propositional Logical Reasoning
di: Hong, Guan Zhe, et al.
Pubblicazione: (2024)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
di: Nagda, Ansh, et al.
Pubblicazione: (2025)

Learning Tree Pattern Transformations
di: Neider, Daniel, et al.
Pubblicazione: (2024)

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

Transductive Learning Is Compact
di: Asilis, Julian, et al.
Pubblicazione: (2024)

The Alignment Trap: Complexity Barriers
di: Yao, Jasper
Pubblicazione: (2025)

Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding
di: Chen, Yifang, et al.
Pubblicazione: (2025)

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

RoPE Attention Can Be Trained in Almost Linear Time
di: Cao, Yang, et al.
Pubblicazione: (2024)

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

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

Demystifying the unreasonable effectiveness of online alignment methods
di: Kang, Enoch Hyunwook
Pubblicazione: (2026)

Circuit Complexity Bounds for RoPE-based Transformer Architecture
di: Chen, Bo, et al.
Pubblicazione: (2024)