- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LRDR, a Lyapunov-regularized representation learning method for event data classification. The model combines a pretrained ResNet-34 semantic branch with a learnable grouped CCNN branch. During training, it computes a directional finite-time Lyapunov growth rate and regularizes it through perturbation invariance, class separation, and stable-range constraints.
Critical strengths
(1) The model combines learnable dynamics with pretrained semantic features and clearly separates the training and inference paths, so the stability regularization does not introduce additional FTLE-specific computation at inference time. (2) The paper provides augmentation-only and feature-invariance controls with matched backbones, preprocessing, and training protocols. It also evaluates the three Lyapunov loss terms separately, which helps identify the sources of the observed gains. (3) The appendix provides detailed descriptions of the state update, tangent-vector propagation, loss coefficients, and training schedule.
Critical weaknesses
(1) Appendix A.2 correctly states that Eq. 42 measures the growth rate along a single propagated direction, and Eq. 43 also clearly shows that this quantity does not exceed the maximum finite-time growth rate. However, the perturbation bound in Appendix A.3 uses maximum growth rates over different time intervals and also includes an input-sensitivity term and perturbations of the encoded features. Constraining the growth rate along one fixed initial direction does not directly imply control over these quantities. (2) The periodic condition in Eq. 56 of Appendix B does not directly imply Eq. 57, because the final update generally depends on the threshold state at the previous time step rather than on the initial state. Eq. 65 gives a nonzero internal state at time zero, which conflicts with the zero initialization stated earlier, and its denominator is inconsistent with Eqs. 70 and 71. Eq. 69 uses the derivative sign of the equilibrium-condition equation to determine the stability of the discrete system, but the required Jacobian analysis of the state update is not provided. (3) In Table 3, LRDR improves the mean perturbed accuracy over Aug-only and Feature Inv by 0.38 and 0.31 percentage points, respectively. However, its relative performance drop is 2.08%, which is higher than the 1.81% and 1.92% of these two controls. The paper therefore needs to distinguish more clearly between improving clean and perturbed accuracy and reducing sensitivity to perturbations. (4) Section 4.4 states that LRDR improves the mean perturbed accuracy over ACDF by 1.79 percentage points, but the values 83.96 and 81.17 in Table 3 differ by 2.79 percentage points. The text should be checked.
Questions for authors
(1) What is the empirical relationship between the growth rate along a fixed tangent-vector direction and the maximum growth rate used in the perturbation bound in the appendix? Can the paper compare these two quantities on representative test samples, together with the actual trajectory changes caused by input perturbations? (2) Please check Eqs. 57, 65, and 69 in Appendix B and clarify the parameter conditions under which the periodic and chaotic behavior claims hold. (3) How exactly does the rate perturbation modify the timestamps and observation window? If the events are rebinned according to each sample's own duration, does the perturbation still change the model input? Do the other perturbations involve timestamp clipping or reordering? (4) How does a temporal aggregation method perform when it uses the same paired augmentation and feature regularization but does not use nonlinear dynamics?