arXiv (All)
open access
On the VC Dimension of Autoregressive Linear Threshold Functions
Linear threshold functions (LTFs) are a canonical class of Boolean predictors. In the autoregressive setting, the same LTF reads the most recent $d$ bits, generates the next bit, and returns the bit produced after $T$ steps. While the one-step class has VC dimension $d$, for general $T$ the counting
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Recency Forcing: Bridging the Long-Horizon Gap in Autoregressive Video Generation#1014317
- The Generative Shortfall: a comparative analysis of autoregressive vs. extractive architectures in ABSA.#1267284
- From Zipf's Law to Neural Scaling through Heaps' Law and Hilberg's Hypothesis#984951
- Self-Generated Feedback Destabilizes Test-Time Training: A Causal Decomposition of Long-Horizon Adaptation#1201089
- The Gate at the Big Bang: Collapse, Admissibility, and the Minimal State of the Early Universe#733416
Record · ID 1468574
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive