- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the approximation and statistical costs of unknown coordinates. For two-block Besov classes, it derives an exact resolution-dependent metric and characterizes the transition in representation entropy. In a separate Gaussian-design active-subspace model, it establishes matching local entropy bounds and the minimax rate $R_n^\star\asymp n^{-2s/(2s+k)} +\frac{m}{n}\log(1+n/m), \qquad m=k(d-k)=o(n),$ with constants independent of the ambient dimension. Numerical experiments check the geometric formulas and illustrate representation uncertainty in regression.
Critical strengths
The statistical rate distinguishes the known-subspace estimation term from the additional cost associated with an unknown subspace. It also identifies regimes where the latter becomes dominant as the ambient dimension grows, providing useful insight into the limitations of low-dimensional structure.
Critical weaknesses
The motivation for choosing Besov classes could be explained more intuitively. For readers unfamiliar with this framework, the connection between these regularity assumptions and the underlying problem of learning unknown smooth coordinates is difficult to assess.
Questions for authors
Why are Besov classes particularly suitable for studying this problem? Could the authors explain what properties of the target functions these assumptions represent, why they are reasonable, and which aspects of the analysis specifically rely on this choice? A brief comparison with more familiar smoothness assumptions would help clarify the modeling motivation.
3 comments
Thank you for the reply. I will keep my score.
Thank you for taking the time to consider our response. We appreciate your constructive feedback on the motivation and presentation of the regularity assumptions, as well as your continued support for our work.
Thank you. We have expanded the Introduction to explain what the regularity assumption means before using it in the rate.
A familiar starting point. For q=2, the statistical link space B2,2s(Rk) is the Sobolev space Hs(Rk), with equivalent norms. For example, when k=s=1, the function and its first derivative are square-integrable. The unknown-coordinate question therefore already arises under a standard Sobolev assumption.
Why use the multiscale description? Besov regularity controls how much detail a function can have at successive resolutions: p=2 measures its integrated energy, s controls fine-scale decay, and q combines contributions across scales. This is particularly useful here because a small overall signal can still contain a narrow feature that is sensitive to direction. Our localized witnesses make that precise: their width is of order R−1 and their Gaussian L2 norm is of order R−s, yet they distinguish subspaces at angular scale R−1 (Proposition 4).
The condition s>k/2 gives boundedness and Hölder control. Importantly, the threshold depends on the intrinsic dimension k, rather than the ambient dimension d. It lets us translate a change in subspace into a change in prediction.
Where does the proof use these properties? Link entropy gives the smoothness-dependent estimation term (Appendix E). Boundedness and Hölder continuity control comparisons across subspaces and support the upper bound (Appendix F). Shrinking witnesses supply the local packing behind the logarithmic representation term (Proposition 4; Appendix G). The separate geometric model uses multiscale comparisons to determine which frame differences become visible at a given accuracy (Theorem 1; Appendix B).
Thus Sobolev gives a familiar special case, Hölder describes the pointwise control we use, and Besov makes the relevant scale structure explicit. Appendix D fixes the norm convention. For fixed admissible parameters, equivalent norm choices affect constants rather than the stated rate exponents; likewise, q affects constants rather than the displayed exponents.