- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes DPAL, a dual-PID-driven adaptive latent factorization method for reconstructing highly incomplete non-intrusive load monitoring (NILM) data. Built upon CP tensor factorization, DPAL introduces nonlinear PID-based reconstruction-error regulation, incremental PID-based learning-rate adjustment, and fuzzy logic-based online controller tuning. The paper also provides conditional coordinate-wise convergence and gradient-boundedness analyses. Experiments on three real-world NILM datasets, under three observation densities, report improvements in RMSE and MAE over seven tensor factorization or completion baselines. Additional ablations examine the contributions of the two PID controllers and fuzzy adaptation.
Critical strengths
-
DPAL achieves the lowest reported mean RMSE and MAE across all nine experimental settings on three real-world NILM datasets. The results suggest that the proposed optimization strategy may improve tensor reconstruction under severe data incompleteness.
-
The method addresses optimization challenges in incomplete tensor factorization and integrates error regulation with adaptive learning-rate adjustment. The paper includes ablations of both PID controllers and fuzzy adaptation, providing initial evidence of their complementary empirical effects.
Critical weaknesses
-
The experiments lack comparisons with Adam, RMSProp, momentum SGD, and existing PID-based optimizers under the same tensor factorization framework. Consequently, it remains unclear whether the reported improvements originate from the proposed dual-PID design rather than standard adaptive optimization techniques.
-
The learning-rate update in Eq. (12) does not explicitly guarantee positive learning rates, while the nonlinear PID controller in Eq. (8) accumulates historical errors without an explicit anti-windup mechanism in Algorithm 1. These omissions raise concerns about the stability of the proposed optimization procedure.
-
The convergence analysis primarily concerns coordinate-wise SGD with fixed regularization and diminishing positive step sizes, rather than the complete DPAL algorithm with adaptive PID controllers and dynamically varying regularization. Therefore, the theoretical results do not directly establish the convergence of the proposed method.
-
The missing-data generation and normalization procedures are inadequately specified. Moreover, the efficiency comparison unfairly contrasts online adaptation with the total cost of manual grid search, while the separately reported RMSE and MAE training times lack a clear explanation.
Questions for authors
See Weaknesses
4 comments
Response to Weakness 2: Learning-Rate Bounds and NPID Stability
Weaknesses 2: The learning-rate update in Eq. (12) does not explicitly guarantee positive learning rates, while the nonlinear PID controller in Eq. (8) accumulates historical errors without an explicit anti-windup mechanism in Algorithm 1. These omissions raise concerns about the stability of the proposed optimization procedure.
Response: We thank the reviewer for raising these important concerns regarding optimization stability. We have clarified the implemented learning-rate constraints and controller-state handling in the revised manuscript, and added experimental evidence to evaluate the numerical stability of DPAL.
-
Positive and bounded learning rates. To ensure that the learning rate remains positive and bounded, DPAL applies a projection after each IPID update:
This operation guarantees that the learning rate remains within throughout training. We have explicitly incorporated this projection into Eq. (12) and Algorithm 1. The initialization and controller settings are further detailed in Appendices A.2 and A.4.
-
NPID integral behavior and numerical stability. The IPID controller employs an integral-separation strategy to regulate learning-rate adjustments. The NPID controller, however, does not explicitly clip its accumulated integral or impose a hard upper bound on the nonlinear amplification . To examine its practical stability, we recorded the maximum absolute NPID integral, maximum nonlinear amplification, learning-rate boundary-hit frequencies, and numerical-failure frequency across 20 independent runs. As shown below, no numerical failures occurred in any of the tested settings, and the observed integral and amplification values remained finite. These empirical observations characterize the tested training trajectories rather than establish unconditional stability guarantees.
-
Sensitivity to learning-rate bounds. We further evaluated three learning-rate intervals on UK-DALE at 5% observation density while keeping the other settings unchanged. As shown in the second table, all three DPAL variants achieve lower mean RMSE and MAE than the fixed-learning-rate NPL baseline. The RMSE values remain close across different intervals, although the learning-rate boundary-hit frequencies vary substantially. These results demonstrate that DPAL maintains consistent reconstruction performance under the tested learning-rate constraints. Additional stability statistics are reported in Appendix B.5.
Observed numerical-stability statistics at 5% observation density.
| Dataset | LR Bounds | Max NPID Integral | Max cosh | Lower Hit | Upper Hit | Failed Runs |
|---|---|---|---|---|---|---|
| iAWE | 0.001–0.010 | 3.134 | 1.134 | 68.2% | 19.9% | 0/20 |
| UK-DALE | 0.001–0.010 | 5.054 | 1.121 | 64.6% | 16.3% | 0/20 |
| MORED | 0.001–0.010 | 3.695 | 1.156 | 3.1% | 0.0% | 0/20 |
Note: The NPID integral is not clipped. The reported maxima are empirical observations from the tested runs.
Learning-rate clipping sensitivity on UK-DALE at 5% observation density (mean ± SD).
| Variant | LR Bounds | RMSE | MAE | Lower Hit | Upper Hit |
|---|---|---|---|---|---|
| NPL (Fixed LR) | — | 0.02480 ± 0.00010 | 0.01830 ± 0.00010 | — | — |
| DPAL-Tight | [0.002, 0.008] | 0.02476 ± 0.00009 | 0.01812 ± 0.00006 | 73.5% | 20.1% |
| DPAL (Original) | [0.001, 0.010] | 0.02470 ± 0.00006 | 0.01800 ± 0.000007 | 64.6% | 16.3% |
| DPAL-Wide | [0.0005, 0.015] | 0.02474 ± 0.00008 | 0.01808 ± 0.00005 | 45.2% | 9.7% |
Response to Weakness 3: Scope of Convergence Analysis
Weaknesses 3: The convergence analysis primarily concerns coordinate-wise SGD with fixed regularization and diminishing positive step sizes, rather than the complete DPAL algorithm with adaptive PID controllers and dynamically varying regularization. Therefore, the theoretical results do not directly establish the convergence of the proposed method.
Response: We thank the reviewer for pointing out the distinction between the theoretical convergence conditions and the complete DPAL algorithm. We agree that the current analysis does not establish convergence of the fully adaptive DPAL procedure. To clarify the scope of our theoretical contributions, we have revised Section 3.5, Appendix C, and the Conclusion to explicitly distinguish the following results and their assumptions.
-
Conditional coordinate-wise convergence. Appendix C establishes an expected suboptimality rate for the underlying scalar-coordinate SGD update, with all other factor and bias coordinates held fixed. This result requires fixed regularization , coordinate-wise smoothness and strong convexity, unbiased stochastic gradients with bounded second moments, and a positive diminishing learning-rate schedule. These conditions support convergence of the coordinate-wise optimization problem, but do not establish joint convergence of the nonconvex tensor factorization objective.
-
Conditional boundedness of NPID-regulated gradients. We separately analyze the NPID-regulated coordinate gradients under bounded factor states, reconstruction errors, controller gains, nonlinear amplification, and accumulated integral states. Under these assumptions, the regulated gradients remain bounded. However, this result does not establish that the PID-regulated update is an unbiased stochastic gradient of the original objective. Therefore, the coordinate-SGD convergence rate cannot be directly extended to the complete PID-controlled algorithm.
-
Relationship to the implemented DPAL algorithm. In the actual implementation, learning-rate projection ensures positive and bounded IPID learning rates, but does not guarantee that they diminish over iterations. Furthermore, fuzzy inference dynamically adjusts regularization, while the accumulated NPID integral is not explicitly bounded. Consequently, the complete DPAL algorithm does not necessarily satisfy the assumptions of the coordinate-wise convergence analysis. We have explicitly clarified these limitations in the revised manuscript. The theoretical results are presented as conditional convergence and gradient-boundedness analyses, rather than a convergence guarantee for the complete adaptive DPAL algorithm.
Response to Weakness 4: Data Protocol, Normalization, and Efficiency Comparisons
Weaknesses 4: The missing-data generation and normalization procedures are inadequately specified. Moreover, the efficiency comparison unfairly contrasts online adaptation with the total cost of manual grid search, while the separately reported RMSE and MAE training times lack a clear explanation.
Response: We thank the reviewer for these constructive comments regarding experimental reproducibility and computational efficiency. We have clarified the data preprocessing and missingness protocols, distinguished per-fit training time from cumulative hyperparameter-search cost, and explained the metric-specific timing measurements in the revised manuscript.
-
Data preprocessing and normalization. All compared methods use the same pointwise logarithmic transformation, . The tensors are organized along three axes: sampling time, measurement channel, and monitoring day. Appendix A.1 now provides the data sources, selected houses, recording periods, tensor dimensions, preprocessing procedures, and experimental settings to ensure reproducibility.
-
Missing-data generation and evaluation protocol. Tube-wise sampling first constructs the retained observation pool at the specified observation density. Its entries are subsequently divided into training, validation, and test sets using an 8:1:1 ratio. The main experiments evaluate randomly held-out entries within this pool, rather than the entirely removed tubes. To further evaluate structured missingness, we conducted separate experiments on UK-DALE using measurement-axis tubes and contiguous all-channel gaps , where . These test regions are completely excluded from training and validation, and reconstruction errors are calculated only at test coordinates with available ground truth. The results below demonstrate that DPAL achieves lower RMSE and MAE than NPIL across all four evaluation settings. Detailed protocols are provided in Appendices A.1 and B.2.
-
Clarification of training-time measurements. Validation data determine model selection, early stopping, and checkpoint selection. The separately reported RMSE Time and MAE Time represent the cumulative training times from initialization to the checkpoints achieving the best corresponding validation metrics. These times may differ because the optimal RMSE and MAE checkpoints can occur at different iterations. We additionally report , defined as the first time a method reaches the selected SGD reference's best validation-RMSE threshold on the same data partition. This provides a common-error criterion for comparing optimization efficiency, independent of each method's final accuracy.
-
Separation of fitting and tuning costs. We have revised the efficiency analysis to distinguish individual model-fitting time from cumulative hyperparameter-search time. DPAL-M requires repeated fixed-configuration training runs, whereas DPAL employs a predefined fuzzy-rule base shared across all datasets without additional dataset-specific rule-calibration searches. The online fuzzy interpolation overhead is included in DPAL's training time. As shown in the second table, DPAL-M can achieve slightly shorter individual fitting times, while its cumulative search cost is substantially higher. We therefore attribute the overall cost difference to repeated configuration searches rather than claiming uniform per-fit acceleration. The computational timing comparison does not include the human effort involved in designing the predefined fuzzy rules. Complete timing details are provided in Appendix B.6.
Main-protocol and structured-outage comparisons on UK-DALE at 5% observation density (mean ± SD).
| Missing Pattern | DPAL RMSE | NPIL RMSE | DPAL MAE | NPIL MAE | Test Entries |
|---|---|---|---|---|---|
| Main protocol (random test entries) | 0.02470 ± 0.00006 | 0.02502 ± 0.00008 | 0.01800 ± 0.000007 | 0.01825 ± 0.00010 | 36,288 |
| Measurement tube | 0.02682 ± 0.00016 | 0.02703 ± 0.00019 | 0.01884 ± 0.00012 | 0.01923 ± 0.00015 | 36,288 |
| 600-point gap | 0.02778 ± 0.00023 | 0.02855 ± 0.00028 | 0.02183 ± 0.00017 | 0.02226 ± 0.00021 | 37,296 |
| 3600-point gap | 0.02610 ± 0.00031 | 0.02786 ± 0.00037 | 0.02099 ± 0.00024 | 0.02206 ± 0.00029 | 42,666 |
Per-fit checkpoint time, cumulative search cost, and common-error time at 5% observation density (seconds).
| Dataset | DPAL RMSE Time | DPAL-M RMSE Time | DPAL-M Search Total | DPAL | DPAL-M |
|---|---|---|---|---|---|
| iAWE | 2.99 | 2.78 | 232.87 | 0.75 | 0.82 |
| UK-DALE | 2.88 | 2.39 | 251.83 | 0.62 | 0.59 |
| MORED | 0.36 | 0.41 | 19.76 | 0.04 | 0.06 |
Response to Weakness 1: Optimizer Comparisons
Weaknesses1: The experiments lack comparisons with Adam, RMSProp, momentum SGD, and existing PID-based optimizers under the same tensor factorization framework. Consequently, it remains unclear whether the reported improvements originate from the proposed dual-PID design rather than standard adaptive optimization techniques.
Response: We thank the reviewer for highlighting the importance of direct optimizer comparisons. To clarify whether the improvements arise from the proposed dual-PID mechanism rather than conventional adaptive optimization, we have added the following experiments and explanations.
Matched conventional-optimizer controls. We added SGD, Momentum SGD, Adam, and RMSProp using the same rank-20 biased-CP reconstruction structure, transformed inputs, observation masks, retained-entry splits, initialization, test coordinates, and entry-wise updates. Each conventional optimizer is independently selected by validation RMSE using the same candidate-count budget and regularization grid. DPAL retains fuzzy-adaptive regularization, while these controls use selected fixed regularization. The detailed configurations and selection procedures are provided in Appendix A.3.
Direct PID comparisons and adaptation details. We further compared DPAL with full NPIL, which retains nonlinear PID error regulation and PSO-based gain adaptation, and FPS-CP, which explicitly adapts the existing matrix-based fuzzy PID method to three-factor CP learning. These methods are evaluated under the common data protocol. Their implementation adaptations and selection procedures are reported in Appendix A.3. These comparisons complement the conventional-optimizer controls without assuming identical tuning budgets across different methods.
Accuracy evidence and controller contributions. The following table reports RMSE with standard deviations at 5% observation density. DPAL achieves the lowest mean RMSE across all three datasets. Compared with Adam, the strongest tested conventional optimizer, DPAL reduces RMSE by 4.01%, 5.36%, and 2.71% on iAWE, UK-DALE, and MORED, respectively. Furthermore, SLF removes both controllers under the shared component-ablation settings and is distinct from the independently tuned SGD baseline. The SLF/NPL/IPL/DPAL ablations in Appendix B.3 examine the individual contributions of the two feedback loops, while complete comparisons with related PID methods are provided in Appendix B.1.
RMSE comparison at 5% observation density (mean ± SD).