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.
Finite unrolling alone gives no regularization convergence or risk guarantee
Statement
Let and let be the point-valued map obtained by an initialization followed by defined, fixed-parameter update maps on an admissible input . This finite definition does not imply that the iterates of an underlying infinite recurrence converge: even the repeated scalar update is defined at every finite depth from , while diverges.
For the risk comparison, fix a nonempty Borel input space for every parameter under consideration, and restrict each deployed map to . For squared reconstruction loss on the signal space, let be a nonempty finite training set with and , , and let be its empirical joint law. The training-law risk is , where is the expected loss of the Borel point rule under the joint input-target law . At a shifted input , the forward residual is , and for a test probability law on the test risk is when this expectation is defined. No bound on either quantity follows from a bound on alone: for every there is a one-sample scalar training law with zero training-law risk and a shifted scalar operator with forward residual and squared test risk both greater than .
For a recurrence , a fixed point at parameter is a state satisfying . If the initialization and update maps are continuously differentiable in their state and trainable-parameter variables on open neighborhoods of their visited inputs, automatic differentiation through the deployed graph computes the derivative of that finite map. For a piecewise- primitive, assume each visited input lies strictly inside one declared branch, with its branch label fixed on an open neighborhood; at a branch boundary or ambiguous branch selection no derivative is asserted by the automatic-differentiation procedure. The derivative is that of the finite map and is not replaced by the derivative of a limiting fixed point. In particular, for with , , and , each finite iterate has zero fixed-point residual while its parameter derivative differs from the exact fixed-point derivative.
Statement references
Monga, Li, and Eldar, full unrolling survey and conditional LISTA convergence results
Gregor and LeCun, fixed-depth LISTA and its training loss
Clason, exact Landweber convergence and early stopping hypotheses
Zheng et al., dataset-scoped out-of-distribution experiments
Daras et al., finite-computation and method-specific asymptotic limits
The finite unrolled map and layer convention.
Borel point-estimator and finite learned-update interface.
Facts & Assumptions
Given: A depth- architecture with all updates defined at the selected input; for the derivative clause, a continuously differentiable initialization and recurrence in state and parameter variables on open neighborhoods and a finite number of defined iterates, with each piecewise- primitive evaluated strictly inside one declared branch whose label is fixed on an open neighborhood of every visited input; for the risk clause, a common nonempty Borel input space for every compared parameter, training inputs in with signal targets in , shifted inputs in , and test laws on .
Unrolled regularization architecture: the deployed map is the finite composition of its initialization and the listed update maps.
Differentiate a finite fixed-point iteration as a finite composed map: the procedure differentiates the specified finite -step map and does not substitute the derivative of an exact fixed point.
Learned inverse estimators and reconstruction targets: a finite unrolled learned update has a Borel initialization, Borel layer maps, and point-valued output; a point reconstruction rule is Borel.
Inverse reconstruction risk under train and test laws: a point rule's risk under a joint input-target law is the extended nonnegative loss integral, and distinct train and test laws impose no inequality between risks.
A continuous map has Borel preimages of Borel sets: a continuous map between topological spaces has Borel preimages of Borel sets.
Forward mode computes the exact directional derivative of the real-arithmetic graph: forward mode returns the directional derivative of the finite scalar-output graph on a fixed strict branch.
Proof
Fix an admissible . By the definition of the update maps, . If , then applying the next defined update gives . Induction through yields the stated finite composition. Its Borel point-rule convention is the interface in [F3].
For the repeated scalar update , induction gives and whenever . Thus every finite prefix is defined, but as . Finite evaluability alone therefore does not imply convergence of an infinite continuation.
Under the differentiability and strict-branch assumptions in the Given clause, [F2] forms, for each output coordinate, the finite graph of the -step recurrence and calls forward mode in each parameter-coordinate direction. By [F6], every returned tangent is the corresponding directional derivative of that finite scalar-output graph. Assembling these entries gives the Jacobian of the finite recurrence, not the derivative of a limiting fixed point.
To check the zero-residual boundary, fix and set , , and . At , the recurrence gives for every finite , so the fixed-point residual is zero. The exact fixed point satisfies , and therefore .
Use the scalar architecture with declared domain containing and every for , zero initialization, identity update block, and one layer parameter . Choose the deployed parameter . Its one-layer formula is , so .
The map is continuous and hence Borel by [F5], so it is a point reconstruction rule by [F3]. On the singleton training law , [F4] gives .
Differentiating the finite recurrence gives and . Induction yields for each . Since , although the finite residual in step 1.4 is zero. Thus even contraction and zero finite residual do not identify the finite-map derivative with the fixed-point derivative.
For any shifted scalar operator with and , the same learned parameter gives . Its forward residual is , and [F4] gives squared risk under the test law . Both tend to as , while the training-law risk from step 2.1 remains zero. Given any , choosing sufficiently large makes both quantities exceed , proving the claimed absence of a uniform residual or test-risk bound from training risk alone.
Depends on
- Differentiate a finite fixed-point iteration as a finite composed map
- Inverse reconstruction risk under train and test laws
- Learned inverse estimators and reconstruction targets
- Unrolled regularization architecture
- A continuous map has Borel preimages of Borel sets
- Forward mode computes the exact directional derivative of the real-arithmetic graph
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Vishal Monga, Yuelong Li, and Yonina C. Eldar, Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing (standard reference, not scraped)
- Karol Gregor and Yann LeCun, Learning Fast Approximations of Sparse Coding (standard reference, not scraped)
- Christian Clason, Regularization of Inverse Problems, full lecture notes (standard reference, not scraped)
- Hongkai Zheng et al., InverseBench: Benchmarking Plug-and-Play Diffusion Priors for Inverse Problems in Physical Sciences (standard reference, not scraped)
- Giannis Daras et al., A Survey on Diffusion Models for Inverse Problems (standard reference, not scraped)