arXiv (All)
open access
A Robust Perceptron Cycling Theorem and Applications
The classical perceptron cycling theorem of Block and Levin \cite{BlockLevin1970} bounds correction sequences whose selected updates come from a finite set and have nonpositive inner product with the current state. We prove a robust variant for additive trajectories $z_{k+1}=z_k+u_k$, for all intege
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
- On the NP-Hardness of Unconstrained Static Output Feedback Stabilization#1143329
- Polynomial growth of Bohnenblust--Hille constants on the Hamming cube#1000377
- Geometric convergence and state-space decompositions for stochastic gradient descent markov chains#669032
- The Maximal Robust Positively Invariant Set for Linear Difference Inclusions#1144466
- Partial Results on Hankel Determinants and the Corresponding J-Fractions of a Sequence Related to Bernoulli Numbers#973452
Record · ID 1012530
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