Two-Sided Convolutional Perceptron
Descriptions may be stale. Consult the linked Lean sources.
Two-Sided Convolutional Perceptron
We study strict separation of vectors
Write
Our assumptions:
Assumption 1 (Parameter regime). The background
bounds
Assumption 2 (Two-sided background and defect
separation). There exist scalars
For a query
Our formulation is algorithm-specific: we analyze the two-sided
convolutional perceptron with cyclic sample queries and a fixed step
size
Results
Samples
| Result | Oracle complexity | Novelty | Limitations |
|---|---|---|---|
| (1) TwoSidedConvolutionalPerceptronAcceleration (Ours) (review) | |||
| (2) Read-and-solve (elementary derived bound) | (1): No established improvement in problem-class complexity. Analyzes jointly learned filter dynamics; (2) lies outside the permitted family. | (1): Higher query cost;
needs |
|
| (3) Fixed-filter perceptron, derived bound (Novikoff 1962) | (1): No established improvement in complexity. New analysis of coupled filter/weight dynamics; (3) freezes the filter outside the permitted family. | (1): Extra |
|
| (4) Two-sample QPA (Tyurin 2026), Theorem 5.1 | (1): Method-specific
analysis for |
(1) does not cover
(4)’s dataset or generic perturbed starts; uses
margin-tuned step |
Abbr: