Copertina

How Does Machine Learning Manage Complexity?

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Fortnow, Lance
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Machine Learning Computational Complexity 68Q15, 68T05 (Primary) 94A17, 94A60, 68Q30 (Secondary) F.1.1; I.2.6
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Energy-Efficient Information Representation in MNIST Classification Using Biologically Inspired Learning
di: Stricker, Patrick, et al.
Pubblicazione: (2026)

Adaptive Greedy Rejection Sampling
di: Flamich, Gergely, et al.
Pubblicazione: (2023)

Greedy Poisson Rejection Sampling
di: Flamich, Gergely
Pubblicazione: (2023)

From CRUD to Autonomous Agents: Formal Validation and Zero-Trust Security for Semantic Gateways in AI-Native Enterprise Systems
di: Peyrano, Ignacio
Pubblicazione: (2026)

On the Low Weight Polynomial Multiple Problem
di: Ţiplea, Ferucio Laurenţiu, et al.
Pubblicazione: (2024)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
di: Huseynzade, Rafig
Pubblicazione: (2025)

The Serial Scaling Hypothesis
di: Liu, Yuxi, et al.
Pubblicazione: (2025)

Semantic Variational Bayes Based on Semantic Information G Theory for Solving Latent Variables
di: Lu, Chenguang
Pubblicazione: (2024)

Conserved active information
di: Chen, Yanchen, et al.
Pubblicazione: (2025)

Composable Post-Quantum Security for FADEC-Coupled Dual-Spool Turbofan Cyber-Physical Systems
di: Alpay, Faruk, et al.
Pubblicazione: (2026)

A Semantic Generalization of Shannon's Information Theory and Applications
di: Lu, Chenguang
Pubblicazione: (2025)

Formal Models and Convergence Analysis for Context-Aware Security Verification
di: Chaudhary, Ayush
Pubblicazione: (2025)

Laws of Learning Dynamics and the Core of Learners
di: Jung, Inkee, et al.
Pubblicazione: (2026)

Bandwidth-Efficient Multi-Agent Communication through Information Bottleneck and Vector Quantization
di: Farooq, Ahmad, et al.
Pubblicazione: (2026)

Seed-Induced Uniqueness in Transformer Models: Subspace Alignment Governs Subliminal Transfer
di: Okatan, Ayşe Selin, et al.
Pubblicazione: (2025)

The Geometric Mechanics of Contrastive Representation Learning: Alignment Potentials, Entropic Dispersion, and Cross-modal Divergence
di: Cai, Yichao, et al.
Pubblicazione: (2026)

The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
di: Frydrych, Piotr
Pubblicazione: (2026)

Computational Complexity of Physical Counting
di: Simas, Tristan
Pubblicazione: (2026)

A Monad-Based Clause Architecture for Artificial Age Score (AAS) in Large Language Models
di: Kayadibi, Seyma Yaman
Pubblicazione: (2025)

From Statistical Disclosure Control to Fair AI: Navigating Fundamental Tradeoffs in Differential Privacy
di: Watson, Adriana
Pubblicazione: (2026)

Grothendieck Topologies and Sheaf-Theoretic Foundations of Cryptographic Security: Attacker Models and $Σ$-Protocols as the First Step
di: Inoué, Takao
Pubblicazione: (2026)

Generalisations of Matrix Partitions : Complexity and Obstructions
di: Barsukov, Alexey, et al.
Pubblicazione: (2021)

On the Whitney Extension-Interpolation-Alignment problem for almost isometries with small distortion in $\Bbb R^D$
di: Damelin, S. B, et al.
Pubblicazione: (2014)

On Smooth Whitney Extensions of almost isometries with small distortion, Interpolation and Alignment in $\Bbb R^D$-Part 1
di: Damelin, S. B., et al.
Pubblicazione: (2014)

STACHE: Local Black-Box Explanations for Reinforcement Learning Policies
di: Elashkin, Andrew, et al.
Pubblicazione: (2025)

Mastering NIM and Impartial Games with Weak Neural Networks: An AlphaZero-inspired Multi-Frame Approach
di: Riis, Søren
Pubblicazione: (2024)

Computational Hardness of Reinforcement Learning with Partial $q^π$-Realizability
di: Karimi, Shayan, et al.
Pubblicazione: (2025)

On the Whitney distortion extension problem for $C^m(\mathbb R^n)$ and $C^{\infty}(\mathbb R^n)$ and its applications to interpolation and alignment of data in $\mathbb R^n$
di: Damelin, S. B, et al.
Pubblicazione: (2015)

Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
di: Datta, Swarnalipa, et al.
Pubblicazione: (2026)

Keys in the Weights: Transformer Authentication Using Model-Bound Latent Representations
di: Okatan, Ayşe S., et al.
Pubblicazione: (2025)

Completeness classes in algebraic complexity theory
di: Bürgisser, Peter
Pubblicazione: (2024)

A Fiber Criterion for Representation Identifiability in Supervised Learning
di: Sevetlidis, Vasileios
Pubblicazione: (2026)

Clone What You Can't Steal: Black-Box LLM Replication via Logit Leakage and Distillation
di: Gharami, Kanchon, et al.
Pubblicazione: (2025)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
di: Shalunov, Yakov
Pubblicazione: (2023)

There Are No Post-Quantum Weakly Pseudo-Free Families in Any Nontrivial Variety of Expanded Groups
di: Anokhin, Mikhail
Pubblicazione: (2023)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
di: Ye, Lixi
Pubblicazione: (2026)

Binarized Neural Networks Converge Toward Algorithmic Simplicity: Empirical Support for the Learning-as-Compression Hypothesis
di: Sakabe, Eduardo Y., et al.
Pubblicazione: (2025)

Verifiable Fine-Tuning for LLMs: Zero-Knowledge Training Proofs Bound to Data Provenance and Policy
di: Akgul, Hasan, et al.
Pubblicazione: (2025)

The Complexity of Iterated Reversible Computation
di: Eppstein, David
Pubblicazione: (2021)

A BMO theorem for $ε$ distorted diffeomorphisms from $\mathbb R^D$ to $\mathbb R^D$ with applications to manifolds of speech and sound
di: Fefferman, C., et al.
Pubblicazione: (2016)