- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper studies approximation of continuous measure-to-measure operators, which is a timely topic in machine learning and computational mathematics. It develops approximators based on classical measure quantization, covering, and partition of unity arguments. The results are worst case over Wasserstein-2 compact sets and qualitative only. They hold both for state spaces \R^d as well as Hilbert spaces; the latter setting is handled via projection arguments. The paper is complemented by three numerical experiments on nonlinear measure-to-measure operators where estimators not following the theory are learned from a collection of empirical measure labeled pairs. Comparisons to baselines are also given.
Critical strengths
The choices and setup for the three numerical experiments are very interesting and highly non-trivial. These could be benchmarks for future work in this area. I really like the exit time example.
Critical weaknesses
The main weakness is that the approximation theory seems to just be done for approximation sake, and is not relevant to practical methods. The authors acknowledge this several times. However, it feels like the approximation results are halfway through an interesting proof, then the authors just stop at an intermediate step and call that the approximator. For example, the covering mixture approximation could be further approximated by the practical architectures used in the numerics, or by e.g., transformers or graph NNs. Without the additional connection to new or existing architectures for measure-to-measure maps, the theory becomes a less interesting exercise in metric space approximation theory, which is well understood.
Overall, this makes the paper feel incomplete and not ready for publication.
Another weakness is the heavy AI use. The paper displays extremely prevalent use of AI to write long passages of text. While readable, it is unnatural and sometimes confusing. The paper would be much improved if human input could push the boundaries of the theory further to architectures that are actually implementable.
The actual implemented method is not much better than the MLP baseline, which is another minor weakness
Questions for authors
On the top of page 4, it says "Two kinds of input statistics are needed" regarding the bounded continuous test functions and second moment. Is this necessary and sufficient? Or only sufficient?