- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper studies finite Brownian RKHSs relevant to the VBKL and BKL models, studying its properties, interpolation in such space, optimization paths, and equivalent coordinate systems. The article then checks some of the theoretical results empirically.
Critical strengths
- The problem of optimization in RKHSs and equivalent description of optimization problem is an important task.
- The article contains experimental results in order to back-up some of the theoretical claims.
Critical weaknesses
The quality of the writing is very low, making it difficult to properly assess the contribution of the article. The following list highlights some of the most critical weaknesses of the present article.
- The paper motivation and challenges are not properly stated or mentioned at any point in the article. More importantly, the results introduced in this article are not properly motivated nor discussed in relation with previous work. This makes it extremely difficult to navigate the results and assess the quality of the contributions in the manuscript.
- With the current wording, the work seems to be incremental; in particular, the paper studies a discretization of the RKHS of a Brownian kernel that is known (Corollary 2) to be interpolation between nodes. Interpolation in RKHSs have been widely studied in the literature (Bitzer and Steinwart, 2026).
- Some of the notations and properties introduced in this article are not properly defined. More importantly, this issue is present even when listing the contributions of the paper: a) the nodal, increment, and block DCT-VIII coordinates are not properly defined as to what they are, nor motivated as to why one may be interested on them, b) is not introduced nor defined as to what it is, and is only defined through the very complex formula in (3), and c) the Adam optimizer plays an important role for the contribution and it is not introduced in the text nor the challenges overcame with Proposition 5.
- The paper centers around the use of the Brownian RKHS for BKLs and VBKLs, yet, these models are not introduced, defined nor motivated.
References
Bitzer, M., Steinwart, I. Spectral Representations of Interpolation Spaces of Reproducing Kernel Hilbert Spaces. Constr Approx (2026). https://doi.org/10.1007/s00365-026-09781-4
Questions for authors
Q1. What is the motivation for the present article? Which problems does it tackle and why are those problems important to the ML community?
Q2. What are BKLs and VBKLs? Why are they important?
Q3. What is the relation to other results in interpolation in RKHSs? Why are these results different?
Q4. What are the challenges this article had to overcome in order to derive the theoretical results?
Q5. Why are equivalent description of the coordinate systems important?
3 comments
Response to DbX6 (2/2): interpolation, technical scope and notation
Q3: interpolation. We agree that nodal RKHS interpolation and minimum-energy interpolation are established tools, not new discoveries here. Bitzer and Steinwart study real interpolation spaces and their spectral representations. Our nodal interpolation matches function values on a finite grid. These are related RKHS subjects but different uses of "interpolation"; we will distinguish them and credit the literature explicitly.
In the anchored Brownian setting, nodal interpolation is the orthogonal projection onto the span of kernel sections at non-anchor grid nodes. This establishes the common represented space and norm. It does not determine an optimizer trajectory. A general linear parameterization changes the Euclidean metric, and standard Adam can distinguish orthogonal bases within that metric. Our additional grid-node result concerns an entire compatible Adam trajectory, including minibatching, not merely the existence of a minimum-energy minimizer. It is not asserted for arbitrary off-grid data.
Q4: technical steps. The original analysis consistently aligns the anchor, grid ordering, inverse maps and energy scaling. In particular, fixes both the increment preconditioner and the penalty conversion. We do not portray this as a new general reparameterization principle, nor the conditioning argument as a mechanism unique to Brownian increments.
The additional Brownian-specific steps are the bound on identical evaluation-column groups, exact transport of both Adam moments with the finite-epsilon normalization, and historical refinement when jointly trained internal inputs move. Preserving current fitted values alone does not preserve upstream derivatives; the joint proof therefore preserves the whole profile. Its useful count requires evaluation-plus-radial gradients. The first-step criterion separately optimizes each basis's scalar step, removing that particular tuning confound, but gives no universal or persistent ranking. Complete proofs and the boundary cases are retained in Response Supplement S1-S2.
Q5 and notation. Equivalent descriptions are the control that separates a change in the learning algorithm from a change in the model. Nodal parameters are grid values; increment parameters are neighboring differences; spectral parameters are orthogonal-basis coefficients. Diagonalizing the energy is distinct from whitening it.
We will define at first use for an SPD Hessian and introduce Adam through its coordinatewise first and second gradient moments. Nodal and unwhitened-spectral GD/SGD agree after mapping; increments and scaled-whitened spectral GD/SGD also agree. Adam need not agree within these orthogonal pairs. This is why equal function spaces and equal conditioning are insufficient to identify the adaptive algorithm.
All statements retain their original initialization, objective, penalty and update conditions. Singular empirical covariance is allowed where stated; no empirical inverse is introduced. Extra normalization, projection and nonsmooth derivative conventions must be matched. The actual Salinas forward normalization, the original E2 penalized updates and the new Adam diagnostics are kept separate. We will use this distinction to organize the revised exposition more clearly.
I acknowledge the authors' response. I believe the paper is still very unclear in all aspects and highly question the relevance of all of its results.
Hence, I will maintain the score.
Response to DbX6 (1/2): motivation and BKL/VBKL
Thank you for recognizing the importance of optimization in equivalent RKHS descriptions and the role of the experiments. We agree that the motivating question and contribution boundaries should be apparent before the detailed formalism.
Q1: motivation. Learnable nonlinear profiles can be regularized through their derivative energy rather than through the Euclidean length of an arbitrary coefficient vector. Once a profile is implemented on an anchored grid, its nodal values, increments and spectral coefficients encode the same piecewise-linear function. A change in training behavior need not represent a more expressive model, a better approximation space or a different intrinsic regularizer.
Our question is which changes preserve the algorithm and which alter it despite preserving that represented problem. The metric controls mapped GD/SGD; coordinatewise Adam may additionally distinguish bases after the metric and Hessian spectrum are matched. Scaled spectral whitening is therefore an essential control, not an inferior version of spectral coordinates.
The practical consequences are exact regularization and step-size conversions, a controlled comparison of finite implementations, and the new grouped-replay and grid-node minimum-energy results. The latter were developed during the rebuttal. Compatible initialization is required for useful fixed-input compression; the joint-training extension has an evaluation-plus-radial gradient condition and can require all original coordinates. No predictive superiority or measured runtime speedup is claimed.
Q2: definitions and relevance. Brownian Kernel Ladders build successive integral RKHSs using $ k_{\ell+1}(x,x')=\int k_B(u(x),u(x'))\,d\mu_\ell(u),\qquad k_B(a,b)=\frac{|a|+|b|-|a-b|}{2}, $ with support functions drawn from the preceding representation. Variation Brownian Kernel Ladders first compose normalized Brownian profiles into paths, then form signed-measure mixtures of completed paths with total-variation complexity. They do not take a variation hull at every intermediate layer.
The shared building block is a learnable profile satisfying f(0)=0 and ∣f∣HB2=∫∣f′(t)∣2,dt. Its piecewise-linear realization has exact energy $ \sum_j\frac{(f(t_{j+1})-f(t_j))^2}{t_{j+1}-t_j}. $ This provides a directly interpretable functional regularizer with a finite computational implementation. Our paper asks how these finite components should be represented during optimization; the coordinate results do not require adopting either entire ladder framework. We will introduce the models and this connection earlier, while establishing this paper's contribution through its own optimizer statements rather than through companion-paper depth or statistical guarantees.