- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposed a novel way to learn the integral with supervision without numerically computing it. The key idea is to use the divergence theorem to construct an integral that sums to 0 so that matching the integrand will requires the network to turn a learnable constant to the integral result.
The method is novel to the best of my knowledge. The read out of the integral is very efficient, since it will be a single parameter.
The validation is not complete. The author's claim that only two methods can perform all families of parametric integral is not correct. Li et. al. 2024 has demonstrated how to use antiderivative method to perform automatic integration in none-axis-aligned domain in their section 4.1. Moreover, even with this claim being correct, many application domains the paper validated on are axis-aligned, yet the authors failed to provide comparison with the antiderivative methods on those domains.
Critical strengths
The method is novel to the best of my knowledge. There are some unique advantage of the methods. For example, reading out the integrand could be very efficient.
Critical weaknesses
Validation is incomplete. Lack of critical baselines. The validation also fails to show the unique advantage of the method. Neither did the writing address that.
Questions for authors
L210-212 "Since the firstcomponent integrates to zero by construction, fitting fΘ to f directly learns c≈I, which can be read off after training without numerical integration." Is there any mathematical proof that minimizing this loss will lead to c that approximates I?
Response to Reviewer xAe1
We thank the reviewer for recognizing the novelty of our method and the efficiency of reading out the integral directly, as well as for identifying the correction needed in our related-work discussion.
W1. Claim about Li et al. (2024). Li et al. (Section 4.1) indeed extend antiderivative-based integration to non-axis-aligned domains through a change of variables. We agree with the reviewer and have corrected our discussion in Section 2 and Table 1 accordingly. We now distinguish the methods by their derivative requirements. Antiderivative-based methods require successive differentiation along every integration dimension, resulting in a derivative order that grows with the dimension. Additionally, at inference, they require network evaluations at all 2d corners of the domain for every query. In contrast, our method requires only first-order derivatives, irrespective of the integration dimension (Section 3.2, Table 1), and answers each query with a single network evaluation.
W2. Missing comparison with antiderivative methods. We have added the requested comparison in new experiments (Fig. 6, Appendix A.3). Under the same protocol as all other methods, our method achieves the lowest error on the Fourier transform and the highest PSNR on bilateral filtering and rendering at every budget. The antiderivative baseline is the strongest baseline at small budgets on bilateral filtering and rendering. On rendering, it attains higher SSIM and lower LPIPS up to 512 evaluations per iteration, and our method leads on all metrics from 1,024 on. The remaining applications are still training, and we will include them and move this comparison into Section 4 in the final version.
A second new experiment (Fig. 7, Appendix A.3) evaluates the neural control variate of Li et al., which on the unit hypercube is the antiderivative baseline with residual sampling at inference. Each residual sample costs an integrand evaluation and an additional network evaluation. Without residual samples, its MSE is 25 times higher than ours on the Fourier transform. At matched accuracy, it needs about 200 times as many evaluations per query as our method on bilateral filtering and about 8,000 times as many on the Fourier transform.
W3. "The validation also fails to show the unique advantage of the method. Neither did the writing address that." We agree that the efficient read-out the reviewer highlights is a unique advantage, in addition to learning the integral from integrand supervision alone. The revision now states this in Section 2 and Section 4.3 and validates it in Appendix A.3 and A.4. Our method answers every query with a single evaluation of the integral field. Antiderivative methods instead evaluate the network at all 2d corners of the domain per query and require derivatives of order d during training. Neural control variates do not return the integral directly. They estimate the residual by Monte Carlo sampling for every query, and each sample requires an integrand evaluation and an additional network evaluation. Three new results demonstrate our advantage. Fig. 6 shows that our method achieves the lowest error on the Fourier transform and the highest PSNR on bilateral filtering and rendering at every budget (W2). Fig. 7 shows that a neural control variate needs about 200 times as many evaluations per query to match our accuracy on bilateral filtering and about 8,000 times as many on the Fourier transform. Appendix A.4 shows that, for rendering, the training cost is recovered within about half of a single frame.
Q1. Is there a mathematical proof that minimizing the loss gives c≈I? Yes. We prove the stronger result that c=I is the exact, unique minimizer of the population loss (Appendix A.1, The integral is the unique minimizer). Since the divergence term integrates to zero, the loss separates into a field-fitting term and (c−I)2. Thus, for any fixed field, the unique minimizing constant is the true integral I. Finite-sample optimization approximates this population optimum.