How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Coordinate-free Fourier inverse maps have an odd-mesh risk floor
Example
Consider the complete original Fourier architecture and diagonal inverse question reproduced below. For every odd integer , every , and every admissible bounded parameter class with a measurable empirical minimizer, its risk satisfies The same bound holds for every measurable learner whose realized predictor belongs to the stated coordinate-free Fourier class, whether or not it minimizes empirical risk. On the other hand, the unrestricted risk tends to zero as for fixed , independently of . Thus no growth of can make this original architecture attain the vanishing unrestricted risk along an odd-mesh subsequence. This is a partial resolution: no complete joint bounded-class rate, or corresponding fixed positive even-mesh floor, is asserted. The original question is retained under Original question with explicit positive coordinate indices and empty-class conventions.
Example references
Original question
Let carry normalized Lebesgue measure and fix the real orthonormal Fourier basis Use this basis to identify the real Hilbert space with . Fix integers and parameters , and define The inverse map is . For , let retain the first Fourier coefficients and let append zero coordinates.
Fix a globally Lipschitz nonpolynomial function , called the activation. For , form the scalar input field . A pointwise affine lift , with and , creates channels. For fields with positive integer channel counts , apply an integer number of layers indexed by : Here acts coordinatewise, and are pointwise channel weights, and is a Fourier multiplier meaning , where is computed componentwise, with matrices satisfying and for for some integer cutoff . A pointwise affine output map gives a real scalar field, and the network output is . Let be the union of these maps over architectures whose depth, channel counts, Fourier cutoff, and number of real scalar parameters are each at most the integer , with every trainable parameter bounded in absolute value by . A parameter array used at mesh size is the same array at every other mesh size. For fixed , there are finitely many allowed architecture indices; equip their disjoint union of bounded real parameter boxes with its Borel structure.
Write for the Borel probability laws on a Borel set . For a Borel probability law on , draw independent training truths and observations with all noises independent, and write . A selector is Borel into the finite disjoint union of architecture indices and their bounded parameter boxes, and its realized map minimizes the empirical loss. For each with , assume there is at least one such selector that, from , returns a minimizer of over ; let be the set of all such selectors, and set it to when . At test time, draw an independent and , and define Use the convention , so an empty architecture class has infinite ERM risk. Also define by the same infimum over all Borel predictors from to , with . Determine matching minimax upper and lower rates for jointly in . In particular, characterize the joint growth regimes of and that separate statistical estimation, neural-operator approximation, and continuum truncation error, and determine when the bounded shared-parameter Fourier architecture attains the unrestricted rate .
Facts & Assumptions
Given: The original real Fourier basis , , and all higher complete cosine/sine pairs; the architecture has only constant pointwise channel weights and biases, Fourier multipliers and a scalar pointwise Lipschitz activation. Its parameters may depend on all training data but are fixed during test evaluation.
Translation is an isometry of , sends to for , and preserves each full two-dimensional cosine/sine frequency pair. The first-m-coordinate subspace is translation-invariant when is odd.
A vector with distribution is invariant under every orthogonal matrix: its density is a constant times , and orthogonal changes of variables preserve norm and volume.
by completing the square.
Verification
Given: The original architecture, training and test model, and [A1]–[A3].
Each Fourier multiplier commutes with translation because the kth translated Fourier coefficient is multiplied by the scalar , which commutes with its channel matrix. Every constant channel matrix, constant bias and coordinatewise scalar activation also commutes with translation. By induction through the lift, all layers and output map, the realized scalar output field is translation-equivariant. The layer fields are in : a globally Lipschitz activation has linear growth, the pointwise weights are finite and the finite Fourier multipliers are bounded. For odd , projection onto the first m coefficients commutes with translation by [A1]. Hence the zero-extended output map satisfies , where is the orthogonal translation matrix on the retained coefficients. This holds for every individual parameter array, also after data-dependent selection.
Put , choose and , and let . These truths lie in the ellipsoid because their weighted squared norms are at most . Their forward coefficient vectors are respectively and , related by . Conditional on any training sample, the test truth is still an independent equal-probability draw from these two values. Couple the corresponding test noises as and ; by [A2] both have the required law.
To see unrestricted vanishing without training, put . Output for and zero otherwise. Its risk for every truth is at most . It is a Borel predictor and is allowed in the unrestricted class. This proves the contrast with the positive odd-mesh architecture floor.
For fixed training data, let be its selected predictor. By step 1.1, . Translating the first output and truth preserves their norm. Consequently the conditional average of the two squared risks is , which is at least by [A3]. This lower bound is independent of the training sample. Integrating over it, taking the worst law and then the infimum over selectors proves the stated floor.
The mismatch arises because the diagonal inverse rescales the first cosine and sine by different factors and , while the coordinate-free architecture must respect translation between them. It is independent of finite training or parameter-size limitations. The proof deliberately uses odd so both the input noise law and retained output subspace are translation-invariant; it supplies no identical assertion for even , whose last frequency pair is incomplete.
Scope of the resolution
The odd-mesh consistency subquestion is answered negatively, and the unrestricted vanishing comparison is proved. The full requested joint N,m,S,B minimax rate is not resolved here; in particular even meshes break the complete-pair symmetry used by the lower bound, and different activations/parameter budgets may have distinct approximation behavior. This is not the EIT question: the generalized EIT architecture has coordinate/chart lifting, so this coordinate-free translation obstruction is not transferred to it.
Used by
Nothing in the library uses this result yet.
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Niklas Reinhardt, Sven Wang, and Jakob Zech, Statistical Learning Theory for Neural Operators, Journal of Machine Learning Research 27 (2026) (standard reference, not scraped)
- Maarten V. de Hoop, Nikola B. Kovachki, Matti Lassas, and Nicholas H. Nelsen, Extension and neural operator approximation of the electrical impedance tomography inverse map (2025) (standard reference, not scraped)
- Guillaume Bal, Introduction to Inverse Problems, E6901 Lecture Notes for 2011 course, full 132-page text (standard reference, not scraped)
- Nikola Kovachki et al., Neural Operator: Learning Maps Between Function Spaces With Applications to PDEs, Journal of Machine Learning Research 24 (2023) (standard reference, not scraped)