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.
SOLIT oracle risk bound and spectral rates
Statement
Assume Countable Choice. Let be an injective compact Hilbert–Schmidt operator of infinite rank between separable real Hilbert spaces. Write , and list its positive eigenvalues with multiplicity as , where and . Observe the weak Gaussian experiment where is known and is centered and linear with covariance , and has independent standard-normal values on every finite orthonormal tuple.
Let be continuous and strictly increasing with . Assume is convex for , where is the inverse on the range of . For , define the source ball Assume . Let be an ordered filter indexed by , with an accumulation point of , such that for finite and every and , whenever , and
Define . Assume there is a continuous with , , and for some for every candidate .
Let be candidates in , with the initial candidate fixed independently of , and set and assume and for . Set . Fix a positive singular system with and , set and , and define as the limit with coordinates For , define the pairwise variance Let be the centered estimator difference, and for set For fixed , define for . Let be the smallest such that for every with , and set . Define as the smallest for which every pair satisfies and put . Write , , , and , so . Put , and for put If , define If , set . Then the unchanged pairwise-quantile selector satisfies the finite oracle inequality In particular, put Then and and a rate-oriented consequence is When the selected index is identically zero and its risk is exactly . When , the first term in both displayed oracle bounds is because ; when , the late-selection term vanishes. The bounds retain the pairwise quantiles in the stated rule.
For the rate conclusions as , assume additionally that . In both rate regimes let for , extend it by , take the natural logarithm, and assume the displayed satisfies the index-function, convexity, and filter-qualification hypotheses above; here either or .
If with , , and for some , then for some constant , If instead with , , and , assume also and for some ; then for some , The severe-rate assertion requires exactly ; the source does not establish adaptive-minimax optimality of the polynomial-smoothness severe rate. For spectral cut-off filters, the uniform geometric-variance candidate condition may fail when . When , both displayed rates simplify to .
Statement references
Gaussian series norm tails and fourth moments
Ordered filter, source index, qualification, and geometric-variance grid
The SOLIT selector and its two-index threshold
Risk decomposition, monotone bias, and pairwise variance bound
The positive-noise sequence model and minimum-norm coordinates
Weak Gaussian white-noise observations
Independent Gaussian coordinates of white noise
Spokoiny and Willrich, Bootstrap tuning in ordered model selection, Theorem 2.3 and Appendix A
Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §5.2
Facts & Assumptions
Given: Countable Choice, the weak experiment, all ordered-filter, source, surrogate, grid and selector hypotheses in the Statement, and the additional stated hypotheses when a rate is asserted.
The Axiom of Countable Choice () supplies the fixed countable spectral coordinates; the finite minima and the explicit integer choices below require no further choice.
Risk decomposition and monotone bias for ordered spectral filters gives , nonincreasing , the pairwise bias bound , and for .
SOLIT parameter choice on a geometric-variance grid supplies the unchanged pairwise-quantile acceptance rule and the smallest accepted index. The last candidate is always accepted.
Gaussian series norm tails and fourth moments gives , the norm-quantile bound , and the upper-tail inequality at that quantile for the given countable Gaussian coordinates.
Ordered spectral filters, source indices, and variance grids gives the nonnegative coordinate ordering, the geometric variance ratios, and source qualification. Spectral-index source balls for compact operators and Compact spectral filters, source conditions, and qualification identify the source multipliers.
Monotone convergence for the integral permits summation and integration of the nonnegative coordinate terms.
Holder's inequality for integrals, including the endpoint cases gives scalar Cauchy–Schwarz on the probability space, including for square-integrable nonnegative .
Minkowski's inequality for integrals, including gives the triangle inequality for scalar random variables; applied to Hilbert-valued errors through their norm functions, it is the mean-square triangle inequality.
Proof
Work in the supplied singular coordinates, and write , , and . By [F1] all these variables have finite second moments and . Each finite observed-data sum in [F2] is a measurable -valued random element. For each fixed candidate, its Cauchy set is a measurable event, since it is a countable combination of measurable pairwise-distance events; completeness of makes it the convergence event. Its limit on , extended by outside , is measurable as a pointwise limit into separable . Under the observation law, , so the pointwise construction in [F1] identifies this pointwise limit with the estimator almost surely; the finitely many candidates share a full-probability agreement event. Thus the finite comparison conditions are measurable, and [F2] ensures an accepted index exists. Hence is a measurable finite-valued index. Fix ; its defining condition gives whenever .
For later use, qualification gives . The filter bounds give and . With , splitting eigenvalues at and summing nonnegative terms therefore gives The equality follows by integrating each indicator ; [F5] justifies the interchange. Further , since .
The centered difference has coordinate variances . By nonnegative coordinate ordering their sum and supremum satisfy and . Applying [F3] to their squared weights gives Also the probability of exceeding the actual pairwise quantile is at most , including a degenerate difference. These are statements about the supplied normal sequence; no new infinite product law or general Gaussian concentration theorem is needed.
For the rates let and . The initial variance is with a fixed positive factor, and the geometric lower ratio implies . In the mild case put , and . In the severe case put , , and . In either case , , , and direct substitution gives . All implicit constants in the rest of the argument are independent of the truth in the fixed source ball and of sufficiently small .
On , acceptance gives when , and the difference is zero when equality holds. For , , so step 2.1 bounds every by . Minkowski's inequality in [F7], applied to the norm functions of the two Hilbert-valued errors, consequently bounds the early-selection contribution by . For , this uses the identically zero difference and hence .
For , the event implies rejection of . Its oracle bias bound from step 1.1 shows that a rejecting comparison with must satisfy . The union bound over such comparisons and the quantile-tail property from step 2.1 therefore give . Similarly implies rejection of , so . Here exactly.
Let be the first candidate with . For small , , so this index exists and . Step 1.2 implies . First : otherwise a subsequence bounded away from zero has bounded , contradicting . In the mild case the function is comparable to , so the last inequality and give . In the severe case it is comparable to . For any fixed , as ; since is decreasing for small positive arguments, choosing larger than the fixed comparison constant gives the same conclusion . Qualification and now give .
Scalar Cauchy–Schwarz [F6] and step 2.1 give . Summing gives a late selected-noise second moment at most . By [F1], the corresponding selected bias has mean-square norm at most . Minkowski's inequality [F7] thus bounds the late risk by . Alternatively, and give a late risk bound . Since , dropping the minimum in yields exactly . Together with step 3.1 these prove the first finite oracle inequality. If , both late sums are empty.
Put and choose a fixed nonnegative integer with . For small , , so the infinite candidate sequence has , , and . For every , monotone bias gives . The reverse triangle inequality for the square-summable noise coefficient vectors follows from [F7] with counting measure and gives . Thus and . If , the oracle property implies . Hence ; the case is immediate. In particular and .
Suppose and put . For one has for and for . The geometric variance lower ratio gives and , by summing the backward and forward geometric series from the respective last and first indices. Thus . Also and in the definition of prove its stated simpler bound. The inequality applied to the first late alternative in step 4.1 gives the rate-oriented oracle bound. If , the only index is zero, its risk equals , and all late sums vanish as stipulated.
In the mild case the stated lower variance bound gives . Combined with step 4.2 and , this yields . Therefore step 1.2 gives , because . It follows that for , while handles .
In the severe case put . If , then for small . If , the lower variance bound and give , so again . Hence , using exactly . Consequently in this case also, with as before.
By step 2.2, : when , has a strictly positive power of multiplied by a fixed logarithmic power; when and , . The rate-oriented oracle bound from step 5.1, together with , and the two rate estimates just proved, therefore gives the asserted uniform risk upper bound in each regime. Substituting the explicit expressions for from step 2.2 gives exactly the two displayed rates and their specializations. The severe proof uses at step 5.3 and asserts only the stated upper rate, preserving the given qualification and grid hypotheses. This completes both the finite oracle and rate conclusions.
Remarks
The finite oracle bound accounts explicitly for the number of pairwise comparisons. Its proof and the rate argument above use the specified pairwise selector throughout. The source's sharper displayed oracle constants are not used as a premise.
Depends on
- Ordered spectral filters, source indices, and variance grids
- SOLIT parameter choice on a geometric-variance grid
- Risk decomposition and monotone bias for ordered spectral filters
- Spectral-index source balls for compact operators
- Gaussian sequence inverse model
- Isonormal Gaussian white-noise inverse experiment
- White-noise spectral sequence representation
- Compact spectral filters, source conditions, and qualification
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Gaussian series norm tails and fourth moments
- Monotone convergence for the integral
- Holder's inequality for integrals, including the endpoint cases
- Minkowski's inequality for integrals, including $p = \infty$
Used by
Nothing in the library uses this result yet.
Cited to discharge well-definedness by SOLIT parameter choice on a geometric-variance grid.
Dependency tree · two levels
66 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
- Housen Li and Frank Werner, Adaptive minimax optimality in statistical inverse problems via SOLIT, Theorems 3.4, 3.8, 4.1 and 4.3 (standard reference, not scraped)
- Vladimir Spokoiny and Niklas Willrich, Bootstrap tuning in ordered model selection, Theorem 2.3 and Appendix A (standard reference, not scraped)
- Christian Clason, Regularization of Inverse Problems, complete lecture notes, Chapter 5 §5.2 (standard reference, not scraped)