- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
To deal with functional data with phase variation, the paper proposes a network architecture with the following features: (1) a functional layer to map the multi-dimensional function into a multi-dimensional vector ; (2) use one MLP branch to learn an amplitutde-related vecor , and another MLP branch to learn a phase-related vecor ; (3) the vector after transformation is used basis-expansion coefficients to construct the multi-dimensional function , and the vecor after MLP transformation is used to construct the warping function w. The network is trained by minimizing the reconstruction error between the original x and the reconstruction f(w).
Critical strengths
None
Critical weaknesses
Overall, the paper's technical contribution appears incremental, primarily combining an existing functional autoencoder with a monotone warping decoder. The central claim of amplitude-phase disentanglement is not adequately established.
(1) The architecture implicitly assumes that the finite-dimensional projection vector preserves sufficient information to recover both amplitude and phase. However, the authors do not establish under what assumptions this is possible, particularly for complex warping functions. Information discarded by the projection cannot be recovered by subsequent network layers.
(2) There is no guarantee that the two branches will learn amplitude and phase separately. Why the amplitude branch will lean the amplitude information only, and the phase branch lean the phase information only? The training objective (i.e., reconstruction loss) can not help disentangle the phase from the amplitude. Even a global minimum of the reconstruction loss need not identify the intended decomposition. Moreover, learning the warping function involves non-convex optimization, and the authors provide no guarantee that the estimated warp is close to the true one.
(3) Although the implementatio subtracts the maximum network output before exponentiation to prevent overflow, the normalized exponential in Eq. (8) may still produce highly concentrated warp densities. These can yield nearly flat regions, steep local transitions, and poorly conditioned gradients.
(4) In Theorem 1, the amplitude recovery bound depends on both reconstruction error and . Training directly minimizes the former, but the theorem provides no guarantee that the latter is small. Moreover, generally cannot be evaluated without knowing the true warp. The result therefore describes amplitude recovery conditional on accurate registration, rather than establishing that the proposed method achieves it. Simply verifying that the inequality holds does not establish accurate recovery.
(5) The functional layer does not explicitly control redundancy among the learned functional weights. Multiple filters could capture similar dominat modes of variation, reducing the effective dimension of the projection vector .
Questions for authors
The concerns above may be challenging to resolve fully, the following issues in the numerical evaluation are more straightforward and must be addressed.
(1) Some benchmark methods do not explicitly account for phase variation, so improvements over them may reflect the benefit of accommodating temporal deformation rather than successful amplitude-phase separation. Although alignment-aware baselines are included, a registration-then-autoencoding pipeline would help establish the value of the proposed joint architecture. For example, a clear baseline is elastic registration + a functional autoencoder. The Tucker, Wu, and Srivastava paper (reviewed in the introduction) is also a strong baseline.
(2) The simulation provides a limited assessment of amplitude-phase separation. The reported three metrics do not directly establish accurate amplitude and phase recovery. The warping functions in Fig. 3 belong to a one-parameter exponential family and are globally convex/concave. Increasing the parameter range changes deformation severity but not the complexity of the family. Moreover, Fig 3 compares leading PCAs, rather than subject-level amplitude recoverty. Comparing clustering performance using , , and does not establish that these codes selectively represent amplitude and phase.