- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes GB-LSR, a local spectral decoding framework for arbitrary-scale image super-resolution. The method represents local image content using Fourier basis functions and predicts the corresponding coefficients from convolutional features, with a learnable global bandwidth parameter controlling the frequency range. The authors further investigate a variant that removes local ensemble operations to improve inference efficiency. Experiments evaluate reconstruction quality, computational efficiency, bandwidth sensitivity, and boundary continuity across multiple benchmarks.
Critical strengths
1.The proposed framework offers a relatively simple approach to continuous image representation without relying on expensive per-query MLP evaluations. The analysis of local ensemble removal also provides useful insights into the trade-off between inference efficiency and reconstruction continuity.
2.The authors investigate several important design choices, including bandwidth initialization, spectral representation capacity, and local ensemble operations. The inclusion of negative results and boundary discontinuity measurements is particularly valuable, as it helps clarify the practical limitations of the proposed framework.
Critical weaknesses
- The central methodological contribution is insufficiently differentiated from existing spectral decoding approaches.
The proposed framework builds upon established ideas in local spectral representations, particularly the use of predicted Fourier coefficients for continuous image reconstruction. Its main distinguishing feature appears to be the introduction of a learnable global bandwidth parameter. However, the experimental evidence does not convincingly demonstrate that learning this parameter provides a meaningful advantage over appropriately selected fixed bandwidths.
In fact, the paper's own ablations indicate that fixed bandwidth configurations can achieve nearly identical reconstruction quality. Furthermore, the learnable bandwidth exhibits sensitivity to initialization, raising additional questions about its practical robustness and optimization benefits. Importantly, the arbitrary-scale super-resolution experiments do not include a sufficiently controlled comparison between learned and fixed bandwidths under otherwise identical conditions.
Consequently, it remains unclear whether the proposed learnable bandwidth constitutes a substantive methodological advance or primarily replaces a manually selected hyperparameter with an additional trainable scalar. This is a fundamental concern because the learnable bandwidth is presented as one of the paper's central contributions.
- The claimed efficiency advantages are not convincingly attributable to the proposed methodological innovations.
A substantial portion of the reported inference acceleration comes from removing local ensemble operations, rather than from a demonstrated advantage of the learnable bandwidth mechanism itself. Although the resulting efficiency improvements are practically relevant, the paper does not establish whether similar gains could be achieved by applying the same modification to existing local spectral decoding methods.
Moreover, comparisons with closely related approaches involve differences in encoder architectures, representation capacities, and training configurations, making it difficult to isolate the contribution of the proposed decoder. The default configuration also does not demonstrate a particularly compelling quality-efficiency advantage over strong existing alternatives.
As a result, the paper provides useful empirical observations about architectural simplification, but the evidence remains insufficient to establish that the proposed framework offers a distinct and meaningful improvement over existing spectral representations.
Questions for authors
-
What is the concrete advantage of learning the global bandwidth rather than using an appropriately selected fixed bandwidth? The current ablations suggest that fixed bandwidth configurations can achieve nearly identical reconstruction quality, while the learned parameter remains sensitive to initialization. Could the authors provide a strictly controlled comparison between learned and fixed bandwidths in the arbitrary-scale super-resolution setting, and clarify what meaningful benefit the learnable formulation provides in terms of reconstruction quality, robustness, or optimization?
-
Can the authors demonstrate that the reported efficiency improvements arise from the proposed framework rather than from removing local ensemble operations? In particular, could the authors compare against an existing local spectral decoding approach under matched encoder architectures, representation capacities, and training conditions, with both methods trained without local ensemble operations? Such a comparison would be important for establishing whether the proposed method provides an advantage beyond architectural simplification.
2 comments
Thank you for the additional experiments. However, I do not think the new results resolve my main concerns. Instead, they further highlight the limitations of the proposed contribution.
-
Limited value of learnable bandwidth. Neither in the ASR setting nor in the matched OPE-SR setting does the learned bandwidth demonstrate a clear advantage over a properly selected fixed value. The authors also acknowledge that bandwidth learning is merely an optional calibration mechanism and remains sensitive to initialization. Therefore, the central methodological contribution is still insufficiently justified.
-
Efficiency gains are not convincingly attributable to the proposed method. The authors acknowledge that the original speedup largely comes from removing the local ensemble. Furthermore, the separable raster renderer is essentially an implementation-level optimization that can also be applied to OPE-SR. The matched experiments show nearly identical inference latency between OPE-style and GB-LSR decoders when the local ensemble is retained. Thus, the reported efficiency improvements do not establish a distinctive advantage of the proposed spectral representation itself.
Overall, the additional experiments mainly validate existing design choices and implementation optimizations, rather than demonstrating a substantive benefit from learning the global bandwidth. The fundamental questions regarding methodological novelty and the distinct contribution beyond existing local spectral representations remain unresolved. Therefore, I prefer to maintain my original rating of 2 (Weak Reject).
Response to Reviewer 6ojy
We thank the reviewer. We ran both requested controls after submission.
Q2. Matched comparisons without the local ensemble. (a) Matched OPE-SR/GB-LSR comparison (Appendix A.4.2). All four configurations use a 64-channel RDN encoder, a 3x3 coefficient head and OPE-SR's seven normalized modes per axis. At bandwidth 0.5, the decoder is OPE-SR's, under our training setup and initialization. Released OPE-SR-RDN has 147 encoder channels; submitted GB-LSR has 16 modes per axis and a 1x1 head. Normalized renderers match on identical coefficient maps at 0.5; GB-LSR's unnormalized basis needs diagonal coefficient rescaling. We crossed fixed 0.5 versus learning from 0.5 with ensemble on/off in training and evaluation, matching initial weights and data streams within each of three seeds. Mean PSNR-Y equally weights Set5, Set14, B100, Urban100 and DIV2K validation (all 100 images) at x2/x3/x4. Intervals are 95% paired t intervals over seeds:
At x1, an identity diagnostic, ensemble removal lowers mean PSNR-Y by 1.0 dB at fixed 0.5 and 2.8 dB when learning from 0.5. In a separate H200 x4 timing run using the separable raster renderer, geometric-mean latency ratios over Set14/B100/Urban100 are 0.953 end to end and 0.522 for the decoder alone when removing the ensemble at fixed 0.5. Learned/fixed end-to-end latency with the ensemble is 1.001.
(b) LTE ensemble control (Appendix A.4.3). We retrained LTE-RDN with and without the ensemble using its official code, matched initial weights and data streams, and three paired seeds. No-ensemble minus ensemble is -0.005 dB (-0.023 to +0.013) at x2/x3/x4, inconclusive. It is -0.016 dB at x1.25/x1.5/x1.75/x2.5/x3.5 (-0.028 to -0.003) and at x6/x8 (-0.031 to -0.002), averaging the same five datasets. At x1 both models nearly reconstruct the input (an identity diagnostic).
Without the ensemble, LTE has boundary jumps in every tested dataset and seed; at x4, the mean step-corrected jump J(1e-3) is 0.4476 versus 0.0348 gray levels on a 0-255 scale (Table 15). Ensemble removal also causes jumps in (a). In a separate H200 x4 timing run, ensemble removal multiplies LTE's end-to-end latency by 0.4615 (seed range 0.4614-0.4617; geometric mean as in (a)), versus 0.953 for the OPE-style raster decoder in (a). These effects depend on the implementations. In this run, GB-LSR's raster renderer with the ensemble is 1.59x faster than LTE without it. The submitted model's additional speedup came largely from ensemble removal; bandwidth learning does not accelerate inference.
Speed attribution and quality trade-off. In separate H200 x4 timings, the separable raster renderer keeps the ensemble and is 3.59x, 3.48x and 2.91x faster end to end than released LIIF-, LTE- and SRNO-RDN (same geometric mean; Appendix A.4.4). These are dense-raster timings at batch 1. On the same released OPE-SR-RDN weights, it gives a 2.14x speedup over OPE-SR's renderer. This is an implementation improvement for both methods. In (a), fixed-0.5 OPE-style and submitted GB-LSR models, both with the ensemble, have nearly identical end-to-end latency (OPE-style/GB-LSR ratio 0.9998). GB-LSR still has lower in-distribution PSNR-Y and worse mean LPIPS than LIIF-, LTE- and SRNO-RDN (Section 5.1; Figure 2).
Q1. Controlled learned-versus-fixed ASR. With three paired seeds and only trainability changed at each start, learned minus fixed for mean PSNR-Y over those five datasets at x2/x3/x4 is +0.007 dB (95% paired t CI -0.021 to +0.034) from 1.0 and -0.002 dB (-0.029 to +0.025) from 0.5; neither benefit nor equivalence is established.
After these studies, we specified a five-value search before the new runs, including the observed mean learned endpoint 0.882. It selected 0.882 on DIV2K 0801-0850. On fresh paired seeds 3-5, reporting on DIV2K 0851-0900 plus Set5, Set14, B100 and Urban100, fixed minus learned-from-1.0 is -0.003 dB (-0.013 to +0.008) at x2/x3/x4, equivalent within ±0.02 dB for this mean. Both DIV2K halves were previously evaluated. At the pre-specified x1.125/x1.375/x2.25/x2.75/x3.25/x3.75, the five-dataset mean is -0.015 dB (-0.076 to +0.045), inconclusive. Learning remains initialization-sensitive. The revision describes learning as optional joint calibration, without claiming accuracy, robustness or optimization superiority over the selected fixed value (Section 5.3; Appendix A.4.1). The contribution is joint learning of one bandwidth shared across patches and images, plus the native reconstruction study; the renderer is reported separately.