- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
In the paper "Scaling Universality: A Framework for Function Representations," the authors introduce scaling universality, a framework for studying the representational capacity of function classes subject to input and output scaling constraints. The central idea is that a bounded function class can represent a broader class of functions through appropriate rescaling. The authors formalize this idea by requiring that representations exist for all sufficiently large output scales, allowing these guarantees to extend through operations such as addition and composition. They establish closure properties for this framework and apply it to quantum signal processing, proving exact scaling universality for real polynomials and approximate scaling universality for multivariate continuous functions.
Critical strengths
The paper provides a systematic mathematical treatment of scaling constraints in function representations. The authors establish closure properties under several elementary operations and connect these results to a concrete quantum computing formulation. The theoretical development is detailed, with proofs supporting the main claims, although I cannot independently assess their correctness. The mathematical analysis, particularly the quantum signal processing results, is outside my primary area of expertise.
Critical weaknesses
-
My main concern is that I do not understand what problem the proposed framework ultimately resolves. At its core, scaling universality allows a bounded function class to represent functions of arbitrary magnitude by introducing an external scaling factor. The authors then establish that these representations preserve certain properties under addition and composition. While this is a reasonable mathematical construction, it is unclear what we learn from these guarantees that could not already be established through standard normalization arguments or existing universal approximation results.
The authors motivate the framework through physical constraints on computational primitives, but the analysis ultimately concerns the existence of representations under arbitrary output rescaling. I would like to see a more concrete explanation of what limitation this resolves and why it matters.
-
The paper does not include empirical results or numerical examples. I do not consider experiments strictly necessary for a theoretical paper, but a simple demonstration of how the scaling threshold behaves for representative functions or composed architectures would help motivate the framework. As written, the practical implications of the theoretical results remain unclear.
Questions for authors
-
What concrete limitation of existing universal approximation theory does scaling universality resolve? Can the authors provide an example where this framework establishes a result that would not follow from conventional normalization or approximation arguments?
-
What does the scaling threshold tell us about a representation? How does it change with polynomial degree, function complexity, or composition depth, and does it provide useful information about the resulting representation?
-
What is the main new insight from applying this framework to quantum signal processing? Does it establish previously unknown representational capabilities, or primarily provide a different formulation of existing results?