Pith. sign in

REVIEW 3 major objections 6 minor 80 references

Latent Tensor Factorization with Nonlinear PID Control for Missing Data Recovery in Non-Intrusive Load Monitoring

T0 review · 3 major / 6 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Nonlinear PID error feedback makes tensor factorization fill missing smart-meter readings faster and more accurately than five baselines.

desk verdict A competent combination of nonlinear PID and PSO in CP tensor factorization for NILM imputation; the internal evidence is credible, but the 'state-of-the-art' claim outruns an experiment suite with only random masks and adjacent-domain baselines. read the letter →

arxiv 2504.13483 v1 pith:OQC65FV4 submitted 2025-04-18 cs.LG

Yiran Wang , Tangtang Xie , Hao Wu This is my paper · ORCID
classification cs.LG
keywords non-intrusiveloadmonitoringmissingdatarecoverylatentfactorizationoftensorsnonlinearPIDcontrollerparticleswarmoptimizationtensorcompletionsmartgridstochasticgradientdescent
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that missing entries in non-intrusive load monitoring data can be recovered more accurately and far faster if the standard tensor-factorization update is driven by a nonlinear PID controller rather than by the raw current error. The proposed NPIL model arranges household power measurements as a third-order tensor, factors it by canonical polyadic decomposition, and in each stochastic gradient descent step replaces the instantaneous residual with a PID-style error that combines proportional, accumulated-integral, and derivative terms under nonlinear gains. Particle swarm optimization tunes the nine controller gains on a validation split before training. On the iAWE and UK-DALE datasets at 5%, 10%, and 15% observed density, the paper reports lower RMSE and MAE than five comparison baselines, with RMSE converging in about five iterations on UK-DALE at 15% density and total runtime near ten seconds on iAWE. This matters because fast, accurate imputation of missing smart-meter readings is a practical precondition for reliable demand response and appliance-level monitoring.

What carries the argument

The central machinery is a nonlinear PID controller used as an error-refinement rule inside stochastic gradient descent for CP tensor factorization. In the objective of Eq. (8), the raw learning residual $e_{ijk}=y_{ijk}-\hat{y}_{ijk}$ is replaced by $\tilde{e}_{ijk}$ from Eq. (10), so the update rules in Eq. (11) for the latent factor matrices and bias vectors carry past information through the integral term, anticipate changes through the derivative term, and modulate both through sech and exponential gain functions. The nonlinear gains let the controller respond differently to large and small errors, and particle swarm optimization pre-tunes the nine gain parameters on a validation split rather than by hand. This error-refinement step is what the paper identifies as the cause of the faster convergence and improved accuracy reported in Section IV.

What would settle it

Run NPIL on UK-DALE at 15% density with entries missing in contiguous blocks, for example all three measurement channels absent for several consecutive hours to mimic sensor dropout, and compare against M3; if RMSE degrades to baseline levels or the training curve oscillates, the claim that the method recovers missing NILM data under sensor failure over-generalizes.

Watch

Extended reading notes

Core claim

The paper's central claim is that replacing the instantaneous SGD error with a nonlinear PID-adjusted error yields a latent tensor factorization model, called NPIL, that converges faster and predicts missing non-intrusive load monitoring entries more accurately than five comparison baselines. The adjusted error $\tilde{e}_{ijk}$ in Eq. (10) combines a proportional term $K_{P1}+K_{P2}(1-\operatorname{sech}(K_{P3}e))$, an integral term $K_{I1}\operatorname{sech}(K_{I2}e)\sum_{h=0}^{t-1}e^{(h)}$, and a derivative term scaled by $K_{D1}+K_{D2}/(1+\exp(K_{D3}e+K_{D4}))$, and these gains are pre-tuned by particle swarm optimization on a validation split. On iAWE at 15% density, NPIL reaches RMSE 0.0256 and MAE 0.0185, which the paper reports as 5.19% and 7.04% lower than the best baseline M3 and 31.73% and 28.29% lower than M4. On UK-DALE at 15% density, RMSE converges in roughly five iterations and MAE in roughly three, and time cost on iAWE is about 10.21 seconds. The same qualitative conclusion is drawn at 10% and 5% density, where NPIL's error grows only mildly while comparison baselines degrade sharply.

Load-bearing premise

The load-bearing premise is that the gain-tuned nonlinear PID update stays stable and converges quickly on the tested random-missingness cases, because the paper gives no proof of convergence or stability for the modified SGD rule and does not test the structured gaps that sensor failures actually produce.

Editorial extensions

If this is right

  • At 5% observed density, NPIL's RMSE on iAWE rises only from 0.0256 to 0.0263, while M5's RMSE rises from 0.0342 to 0.0868, so the method remains accurate under extreme sparsity.
  • Because RMSE converges in about five iterations on UK-DALE at 15% density, retraining on newly arriving smart-meter data can be nearly real-time rather than requiring hundreds of iterations.
  • On iAWE at 15% density, NPIL's reported runtime of 10.21 seconds is about 97.7% less than M2, 95.5% less than M3, 73.2% less than M4, and 26.5% less than M5.
  • The same PSO-tuned gain ranges work across two datasets and three missingness levels without manual retuning, so the gain adaptation is a practical part of the method, not a one-off calibration.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An untested extension is to apply the same nonlinear PID error substitution to other tensor decomposition families, such as Tucker or graph-regularized factorizations, since the error-refinement rule does not depend on the canonical polyadic decomposition form; the paper only demonstrates it inside CP-based tensor factorization.
  • The experiments create random missing entries, whereas the stated motivation of sensor failure typically produces contiguous blocks of missing readings; whether the integral accumulation helps or destabilizes under block-missing structure is an open empirical question the paper does not address.
  • If the convergence speed persists in an online setting, the model could be embedded in a streaming smart-meter pipeline that imputes gaps as they appear; the paper reports batch experiments only, so this is an extrapolation.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper proposes NPIL, a nonlinear PID-incorporated latent factorization of tensors model for recovering missing NILM data. The model replaces the raw instantaneous error in an SGD-based tensor factorization with a nonlinear PID-adjusted error that includes an integral term over past errors and sech/exp gain nonlinearities, and it tunes the nine PID gains with particle swarm optimization. Experiments on iAWE and UK-DALE at 95%, 90%, and 85% missing rates compare NPIL with five baselines and report lower RMSE and MAE, faster convergence, and lower time cost. The claims are empirical: the central contribution is a modified SGD update with PSO-based gain adaptation, and the evaluation is a benchmark study against adjacent-domain tensor and QoS models under random missingness.

Significance. If the empirical claims hold, NPIL is a practically useful method for random-missingness high-sparsity tensor imputation: it reports consistent RMSE/MAE improvements over the included baselines, degrades only mildly as density drops from 15% to 5%, and converges in very few iterations. The paper's internal arithmetic is consistent, and the use of two public datasets with 15 repeated runs is a strength. However, the headline claim of surpassing 'state-of-the-art models' for NILM missing-data recovery is not yet established: the baseline set is narrow and the missingness regime is limited. The novelty relative to prior nonlinear PID-incorporated SGD for latent factor analysis also needs clearer positioning. With rescoped claims or additional experiments, the core idea would be a reasonable contribution to tensor-based data imputation.

major comments (3)
  1. [Section IV.A and IV.B (TABLE III, baseline list)] The headline claim that NPIL 'surpasses state-of-the-art models' for NILM missing-data recovery is not supported by the comparison design. Section IV.A creates only random missing scenarios, whereas the motivating failure mode (sensor failure, Section I) typically produces structured or block-wise missingness. Section IV.B compares NPIL with five baselines (M1-M5) from tensor factorization, QoS prediction, and fake-news detection; none is a NILM-specific imputer, and no deep sequence imputation method (e.g., LSTM-, Transformer-, or BRITS-based) is included. The reported gains therefore establish superiority only over a restricted baseline set under random masks. Please either add NILM-specific and structured-missingness experiments or explicitly scope the claim to the tested regime.
  2. [Section III.A, Eqs. (10)-(11)] The convergence and accuracy claims rest on the nonlinear PID-adjusted error update, but the paper provides no convergence or stability analysis for the modified SGD recursion, which includes an accumulated integral term and sech/exp gain nonlinearities. The '5 iterations' convergence observation (Section IV.B b) is empirical and demonstrated only for the PSO-searched gain ranges in TABLE II. Because the integral accumulation can in principle cause oscillation or divergence under other missingness patterns, densities, or datasets, please provide either a formal stability/convergence argument or an empirical robustness study over structured missingness and gain perturbations.
  3. [Section IV.B b) and TABLE IV] The convergence-rate comparison is ambiguous because the iteration counts are not directly comparable across models. The text states that each NPIL iteration includes Q PSO sub-iterations, so a comparison in terms of iterations to convergence (5 iterations for M6 on D2-15%) conflates algorithmic epochs with wall-clock time. The time-cost results in TABLE IV are the appropriate basis for the efficiency claim and should be presented as the primary evidence; otherwise, please report wall-clock convergence curves for all models.
minor comments (6)
  1. [Section IV.B c)] The sentence '26.49%lower than M5’s 13.89s, M6 incurs significant time costs' is garbled and self-contradictory; please rephrase and correct the table reference (TABLE II vs TABLE IV).
  2. [Section IV.A and Fig. 3] The text refers to 'Fig. 4' and 'TABLE Ⅱ' for training curves and time costs, but the figure is captioned Fig. 3 and time costs are in TABLE IV.
  3. [Eq. (13)] The fitness function in Eq. (13) is typeset unclearly, and the quantities p=u=0.5 are not defined; please rewrite (13) in standard notation and define all symbols.
  4. [Section II.B, Eq. (4)] The nonlinear gain forms are introduced without justification; they should be described as heuristic gain-shaping functions, and any boundedness or positivity constraints needed for stable updates should be stated.
  5. [TABLE III] No statistical significance tests are reported for the differences in TABLE III; given the small margins over M3, please add a paired test or confidence intervals.
  6. [Section IV.A] The explanation of the 8:1:1 split into training, test, and validation sets is ambiguous: it should state whether the split is over observed entries or over the full tensor, and how the random missing masks interact with the split.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: NPIL's accuracy and convergence claims rest on held-out benchmark comparisons against external models, not on reduction to fitted inputs or self-citation.

full rationale

NPIL's claimed derivation chain is an explicit algorithmic modification of SGD: define the CP/LFT predictor (Eqs. 1-2), replace the raw residual e_ijk with the nonlinear PID-adjusted error e~_ijk (Eq. 10), substitute that adjusted error into the SGD update (Eq. 11), and tune the nine gain parameters by PSO on a validation split (Eqs. 12-15). None of these steps defines the predicted test entries in terms of the fitted gains or of the target values by construction. Reported RMSE/MAE are computed on a held-out test split (Section IV.A, 8:1:1 split) and compared with external baselines M1-M5 on the public iAWE and UK-DALE datasets, so the central accuracy and convergence claims are empirical benchmark results rather than consequences of the definitions. The paper does cite prior PID-LFT work, including likely same-group work ([46]-[49], [54]), but those citations are background motivation, not load-bearing proof of NPIL's superiority; the experimental comparisons carry that claim. The PSO-based gain adaptation on validation splits is standard model selection and does not make the held-out test error a renamed fit. Concerns that the comparison set contains no NILM-specific imputer or that only random missing masks were tested are scope and correctness limitations, not circularity.

Assumptions & free parameters 6 free parameters · 4 assumptions · 0 invented entities

The NPIL model depends on roughly a dozen settings: grid-searched learning rate η and regularization λ, hand-set rank R=20, nine NPID gain parameters fitted by PSO on validation splits, PSO meta-parameters from prior work, and unspecified velocity bounds. None of these is derived from theory, so the convergence and accuracy claims are empirical properties of a tuned system, not of the update rule per se. The background axiomatic load is standard for the field: CP rank-20 completeness, random missingness, and the transfer of control-theory gain forms to gradient descent.

free parameters (6)
  • learning rate η = 0.002 (D1), 0.004 (D2)
    Grid-searched on one experimental run per dataset (Section IV.A.3); scales every latent factor update in Eq. (11).
  • regularization coefficient λ = 0.01
    Grid-searched; weights the Tikhonov and bias penalties in Eq. (8).
  • tensor rank R = 20
    Chosen a priori with no sensitivity analysis (Section IV.A.1); the approximation capacity of the CP model depends on it.
  • nine NPID gains Kp1..Kp3, Ki1..Ki2, Kd1..Kd4 = Table II ranges; exact values not reported
    Fitted by PSO on the validation split (Eqs. 13-21); these nine numbers directly determine update magnitudes and the convergence behavior on which the central claims rest.
  • PSO meta-parameters Q, c1, c2, w = Q=5, c1=c2=2.0, w=0.729
    Taken from previous studies [78-80]; they control how well the gain search finds good parameters.
  • velocity constraint m and bounds s, v = not specified
    Appear in Eq. (15) but numerical values are not given, so a full replication is impossible from the text.
assumptions (4)
  • domain assumption The NILM tensor admits a good rank-20 CP decomposition (Eq. 2).
    The entire imputation is the CP fit; no rank search or decomposition error analysis is provided (Section II.A).
  • domain assumption Missing data are missing completely at random.
    Experiments generate 'random missing scenarios' at 85-95% missing rates (Section IV.A.1); sensor-failure missingness, the stated motivation, is often structured and untested.
  • domain assumption Tikhonov regularization and linear bias vectors improve generalization for this data.
    Adopted from [65-68] into Eq. (8) without dataset-specific justification.
  • ad hoc to paper The control-theory nonlinear gain forms (sech and exp mappings of Eq. 4) are valid and stable as gradient-scaling functions.
    Taken from [54]; the paper provides no stability or convergence analysis for these specific nonlinear gains inside SGD (Sections II.B and III.A).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Latent Tensor Factorization with Nonlinear PID Control for Missing Data Recovery in Non-Intrusive Load Monitoring." pith.science (2026). https://pith.science/paper/OQC65FV4

@misc{pith2026250413483,
  author       = {Pith},
  title        = {Pith review of: Latent Tensor Factorization with Nonlinear PID Control for Missing Data Recovery in Non-Intrusive Load Monitoring},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OQC65FV4}},
  note         = {Machine review of arXiv:2504.13483}
}
read the original abstract

Non-Intrusive Load Monitoring (NILM) has emerged as a key smart grid technology, identifying electrical device and providing detailed energy consumption data for precise demand response management. Nevertheless, NILM data suffers from missing values due to inescapable factors like sensor failure, leading to inaccuracies in non-intrusive load monitoring. A stochastic gradient descent (SGD)-based latent factorization of tensors model has proven to be effective in estimating missing data, however, it updates a latent factor solely based on the current stochastic gradient, without considering past information, which leads to slow convergence of anLFT model. To address this issue, this paper proposes a Nonlinear Proportional-integral-derivative (PID)-Incorporated Latent factorization of tensors (NPIL) model with two-fold ideas: a) rebuilding the instant learning error according to the principle of a nonlinear PID controller, thus, the past update information is efficiently incorporated into the learning scheme, and b) implementing gain parameter adaptation by utilizing particle swarm optimization (PSO) algorithm, hence, the model computational efficiency is effectively improved. Experimental results on real-world NILM datasets demonstrate that the proposed NPIL model surpasses state-of-the-art models in convergence rate and accuracy when predicting the missing NILM data.

Figures

Figures reproduced from arXiv: 2504.13483 by the authors.

Figure 1
Figure 1. NILM Data to third-order HDI Tensor Motived by these discoveries, this paper designs a nonlinear PID-Incorporated LFT model (NPIL) for effectively and efficiently recover missing NILM data. It rebuilds the instant learning error via incorporating the past update information into the learning scheme according to the principle of a nonlinear PID controller. Moreover, the PSO algorithm is adopted to implement gain para… view at source ↗
Figure 2
Figure 2. Latent factorization of HDI tensor Y B. NPID Controller The nonlinear PID controller is an extension of the PID controller, designed to handle some nonlinear systems [58]. The standard form of the NPID controller can be represented as: ( ) ( ) ( ) ( ) ( ) () 1 0 t t t h t t p I D h e K e K e K e e − = = + + −  (3) where t represents the time point of the NPID controller, hence e (t) represents the control error at … view at source ↗
Figure 3
Figure 3. Training curves of M1-M6 on D1/D2 a) M6 demonstrates high prediction accuracy. As shown in TABLE Ⅰ, On the D1 with a density of 15%, M6 achieves RMSE of 0.0256 and MAE of 0.0185, reducing these by 31.73% and 28.29% vs. M4. Compared to M3, NPIL's RMSE and MAE are lower by 5.19% and 7.04%, respectively. Notably, as D1's data density decreased from 15% to 5%, NPIL's RMSE increased only slightly from 0.0256 to 0.0263 (2… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

80 extracted references · 79 canonical work pages

  1. [47]

    Proportional-integral-derivative-incorporated latent factorization of tensors for large-scale dynamic network analysis,

    H. Wu, Y. Xia, and X. Luo, “Proportional-integral-derivative-incorporated latent factorization of tensors for large-scale dynamic network analysis,” in Proc. China Autom. Congr. (CAC), Beijing, China, 2021, pp. 2980–2984

    work page 2021

  2. [48]

    A PID-incorporated latent factorization of tensors approach to dynamically weighted directed network analysis,

    H. Wu et al., “A PID-incorporated latent factorization of tensors approach to dynamically weighted directed network analysis,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 3, pp. 533–546, Mar. 2022

    work page 2022

  3. [54]

    A nonlinear PID-incorporated adaptive stochastic gradient descent algorithm for latent factor analysis,

    J. Li et al., “A nonlinear PID-incorporated adaptive stochastic gradient descent algorithm for latent factor analysis,” IEEE Trans. Autom. Sci. Eng., pp. 1–15, 2023

    work page 2023

  4. [34]

    Efficient representation to dynamic QoS data via momentum -incorporated biased nonnegative and adaptive latent factorization of tensors,

    M. Chen and H. Wu, “Efficient representation to dynamic QoS data via momentum -incorporated biased nonnegative and adaptive latent factorization of tensors,” in Proc. Int. Conf. Cyber-Phys. Soc. Intell. (ICCSI), Beijing, China, 2021, pp. 1–6

    work page 2021

  5. [73]

    Position-transitional particle swarm optimization-incorporated latent factor analysis,

    X. Luo, Y. Yuan, S. Chen, N. Zeng, and Z. Wang, “Position-transitional particle swarm optimization-incorporated latent factor analysis,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 8, pp. 3958–3970, Aug. 2022

    work page 2022

  6. [80]

    Hierarchical particle swarm optimization-incorporated latent factor analysis for large-scale incomplete matrices,

    J. Chen, X. Luo, and M. Zhou, “Hierarchical particle swarm optimization-incorporated latent factor analysis for large-scale incomplete matrices,” IEEE Trans. Big Data, vol. 8, no. 6, pp. 1524–1536, Dec. 2022

    work page 2022

  7. [1]

    Non-intrusive load monitoring: A review,

    P. A. Schirmer and I. Mporas, “Non-intrusive load monitoring: A review,” IEEE Trans. Smart Grid, vol. 14, no. 1, pp. 769–784, 2023

    work page 2023

  8. [2]

    A weighted kNN approach to estimate missing values,

    S. Sen, M. N. Das, and R. Chatterjee, “A weighted kNN approach to estimate missing values,” in 2016 3rd International Conference on Signal Processing and Integrated Networks (SPIN), 2016, pp. 210–214

    work page 2016

Show all 80 references
  1. [3]

    Learning-based adaptive imputation method with kNN algorithm for missing power data

    M. Kim, S. Park, J. Lee, Y. Joo, and J. K. Choi, “Learning-based adaptive imputation method with kNN algorithm for missing power data”, Energies, vol. 10, p. 1668, 2017

    2017

  2. [4]

    Processing incomplete k nearest neighbor search,

    X. Miao, Y. Gao, G. Chen, B. Zheng, and H. Cui, “Processing incomplete k nearest neighbor search,” IEEE Trans. Fuzzy Syst., vol. 24, no. 6, pp. 1349–1363, 2016

    2016

  3. [5]

    Highly accurate manipulator calibration via extended Kalman filter-incorporated residual neural network,

    W. Yang, S. Li, Z. Li, and X. L uo, “Highly accurate manipulator calibration via extended Kalman filter-incorporated residual neural network,” IEEE Trans. Ind. Inform., vol. 19, no. 11, pp. 10831–10841, Nov. 2023

    2023

  4. [6]

    Modified RNN for solving comprehensive Sylvester equation with TDOA application,

    J. Yan, L. Jin, X. Luo, and S. Li, “Modified RNN for solving comprehensive Sylvester equation with TDOA application,” IEEE Trans. Neural Netw. Learn. Syst., vol. 35, no. 9, pp. 12553–12563, Sep. 2024,

    2024

  5. [7]

    RNN for repetitive motion generation of redundant robot manipulators: An orthogonal projection-based scheme,

    Z. Xie, L. Jin, X. Luo, Z. Sun, and M. Liu, “RNN for repetitive motion generation of redundant robot manipulators: An orthogonal projection-based scheme,” IEEE Trans. Neural Netw. Learn. Syst., vol. 33, no. 2, pp. 615–628, Feb. 2022

    2022

  6. [8]

    Electric load forecasting in smart grids using long-short-term-memory based recurrent neural network,

    J. Zheng, C. Xu, Z. Zhang, and X. Li, “Electric load forecasting in smart grids using long-short-term-memory based recurrent neural network,” in 2017 51st Annual Conference on Information Sciences and Systems (CISS), 2017, pp. 1–6

    2017

  7. [9]

    Short-term residential load forecasting based on LSTM recurrent neural network,

    W. Kong, Z. Y. Dong, Y. Jia, D. J. Hill, Y. Xu, and Y. Zhang, “Short-term residential load forecasting based on LSTM recurrent neural network,” IEEE Trans. Smart Grid, vol. 10, no. 1, pp. 841–851, 2019

    2019

  8. [10]

    A double -space and double-norm ensembled latent factor model for highly accurate Web service QoS prediction,

    D. Wu, P. Zhang, Y. He, and X. Luo, “A double -space and double-norm ensembled latent factor model for highly accurate Web service QoS prediction,” IEEE Trans. Serv. Comput., vol. 16, no. 2, pp. 802–814, Mar.–Apr. 2023

    2023

  9. [11]

    A distributed adaptive second-order latent factor analysis model,

    J. Wang, W. Li, and X. Luo, “A distributed adaptive second-order latent factor analysis model,” IEEE/CAA J. Autom. Sinica, vol. 11, no. 11, pp. 2343–2345, Nov. 2024

    2024

  10. [12]

    A prediction-sampling-based multilayer-structured latent factor model for accurate representation to high-dimensional and sparse data,

    D. Wu, X. Luo, Y. He, and M. Zhou, “A prediction-sampling-based multilayer-structured latent factor model for accurate representation to high-dimensional and sparse data,” IEEE Trans. Neural Netw. Learn. Syst., vol. 35, no. 3, pp. 3845–3858, Mar. 2024

    2024

  11. [13]

    An alternating-direction-method of multipliers -incorporated approach to symmetric non -negative latent factor analysis,

    X. Luo, Y. Zhong, Z. Wang, and M. Li, “An alternating-direction-method of multipliers -incorporated approach to symmetric non -negative latent factor analysis,” IEEE Trans. Neural Netw. Learn. Syst., vol. 34, no. 8, pp. 4826–4840, Aug. 2023

    2023

  12. [14]

    A graph-incorporated latent factor analysis model for high-dimensional and sparse data,

    D. Wu, Y. He, and X. Luo, “A graph-incorporated latent factor analysis model for high-dimensional and sparse data,” IEEE Trans. Emerg. Top. Comput., vol. 11, no. 4, pp. 907–917, Oct.–Dec. 2023

    2023

  13. [15]

    A momentum-accelerated Hessian-vector-based latent factor analysis model,

    W. Li, X. Luo, H. Yuan, and M. Zhou, “A momentum-accelerated Hessian-vector-based latent factor analysis model,” IEEE Trans. Serv. Comput., vol. 16, no. 2, pp. 830–844, Mar.–Apr. 2023

    2023

  14. [16]

    A Differential Evolution-Enhanced Position-Transitional Approach to Latent Factor Analysis,

    J. Chen, R. Wang, D. Wu, and X. Luo, “A Differential Evolution-Enhanced Position-Transitional Approach to Latent Factor Analysis,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 7, no. 2, pp. 389–401, Apr. 2023

    2023

  15. [17]

    A Kalman-filter-incorporated latent factor analysis model for temporally dynamic sparse data,

    Y. Yuan, X. Luo, M. Shang, and Z. Wang, “A Kalman-filter-incorporated latent factor analysis model for temporally dynamic sparse data, ” IEEE Trans. Cybern., vol. 53, no. 9, pp. 5788–5801, Sep. 2023

    2023

  16. [18]

    MMLF: Multi-metric latent feature analysis for high-dimensional and incomplete data,

    D. Wu, P. Zhang, Y. He, and X. Luo, “MMLF: Multi-metric latent feature analysis for high-dimensional and incomplete data,” IEEE Trans. Serv. Comput., vol. 17, no. 2, pp. 575–588, Mar.–Apr. 2024

    2024

  17. [19]

    Two-stream graph convolutional network-incorporated latent feature analysis,

    F. Bi, T. He, Y. Xie, and X. Luo, “Two-stream graph convolutional network-incorporated latent feature analysis,” IEEE Trans. Serv. Comput., vol. 16, no. 4, pp. 3027-3042, Jul.-Aug. 2023

    2023

  18. [20]

    Fast and accurate non-negative latent factor analysis of high-dimensional and sparse matrices in recommender systems,

    X. Luo, Y. Zhou, Z. Liu, and M. Zhou, “Fast and accurate non-negative latent factor analysis of high-dimensional and sparse matrices in recommender systems,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 4, pp. 3897–3911, Apr. 2023

    2023

  19. [21]

    Learning spatiotemporal latent factors of traffic via regularized tensor factorization: Imputing missing values and forecasting,

    A. Baggag, S. Abbar, A. Sh arma et al., “Learning spatiotemporal latent factors of traffic via regularized tensor factorization: Imputing missing values and forecasting,” IEEE Trans. Knowl. Data Eng., vol. 33, no. 6, pp. 2573–2587, 2019

    2019

  20. [22]

    MNL: A highly-efficient model for large-scale dynamic weighted directed network representation,

    M. Chen, C. He, and X. Luo, “MNL: A highly-efficient model for large-scale dynamic weighted directed network representation,” IEEE Trans. Big Data, vol. 9, no. 3, pp. 889–903, Jun. 2023

    2023

  21. [23]

    Latent factorization of tensors in hyperbolic space for spatiotemporal traffic dat a imputation,

    H. Wu, L. Yang, and Z. Zhang, “Latent factorization of tensors in hyperbolic space for spatiotemporal traffic dat a imputation,” IEEE/CAA J. Autom. Sinica, 2024

    2024

  22. [24]

    HRST-LR: A Hessian regularization spatio-temporal low rank algorithm for traffic data imputation,

    X. Xu, M. Lin, X. Luo, and Z. Xu, “HRST-LR: A Hessian regularization spatio-temporal low rank algorithm for traffic data imputation,” IEEE Trans. Intell. Transp. Syst., vol. 24, no. 10, pp. 11001–11017, Oct. 2023

    2023

  23. [25]

    Biased collective latent factorization of tensors with transfer learning for dynamic QoS data predicting,

    J. Dong, Y. Song, M. Li, et al., “Biased collective latent factorization of tensors with transfer learning for dynamic QoS data predicting,” Digit. Signal Process., vol. 146, p. 104360, 2024

    2024

  24. [28]

    Instance-frequency-weighted regularized, nonnegative and adaptive latent factorization of tensors for dynamic QoS analysis,

    H. Wu and X. Luo, “Instance-frequency-weighted regularized, nonnegative and adaptive latent factorization of tensors for dynamic QoS analysis,” Proc. IEEE Int. Conf. Web Services (ICWS), Chicago, IL, USA, 2021, pp. 560–568

    2021

  25. [29]

    Low-rank high-order tensor completion with applications in visual data,

    W. Qin, H. Wang, F. Zhang, J. Wang, X. Luo, and T. Huang, “Low-rank high-order tensor completion with applications in visual data,” IEEE Trans. Image Process., vol. 31, pp. 2433–2448, 2022

    2022

  26. [30]

    NT-DPTC: A non -negative temporal dimension preserved tensor completion model for missing traffic data imputation,

    H. Chen, M. Lin, J. Liu, H. Yang, C. Zhang, and Z. Xu, “NT-DPTC: A non -negative temporal dimension preserved tensor completion model for missing traffic data imputation,” Information Sciences., vol. 653, p. 119797, 2024

    2024

  27. [31]

    A novel tensor decomposition-based efficient detector for low-altitude aerial objects with knowledge distillation scheme,

    N. Zeng, X. Li, P. Wu, H. Li, and X. Luo, “A novel tensor decomposition-based efficient detector for low-altitude aerial objects with knowledge distillation scheme,” IEEE/CAA J. Autom. Sinica, vol. 11, no. 2, pp. 487–501, Feb. 2024

    2024

  28. [32]

    Spatiotemporal tensor completion for improved urban traffic imputation,

    A. Ben Said and A. Erradi, “Spatiotemporal tensor completion for improved urban traffic imputation, ” IEEE Trans. Intell. Transp. Syst., vol. 23, no. 7, pp. 6836–6849, 2022

    2022

  29. [33]

    Advancing non-negative latent factorization of tensors with diversified regularization schemes,

    H. Wu, X. Luo, and M. Zhou, “Advancing non-negative latent factorization of tensors with diversified regularization schemes,” IEEE Trans. Serv. Comput., vol. 15, no. 3, pp. 1334–1344, May–Jun. 2022

    2022

  30. [35]

    A fine-grained regularization scheme for non-negative latent factorization of high-dimensional and incomplete tensors,

    H. Wu, Y. Qiao, and X. Luo, “A fine-grained regularization scheme for non-negative latent factorization of high-dimensional and incomplete tensors,” IEEE Trans. Serv. Comput., vol. 17, no. 6, pp. 3006–3021, Nov.–Dec. 2024

    2024

  31. [36]

    Modularity maximization-incorporated nonnegative tensor RESCAL decomposition for dynamic community detection,

    H. Fang, Q. Wang, Q. Hu, and H. Wu, “Modularity maximization-incorporated nonnegative tensor RESCAL decomposition for dynamic community detection,” in Proc. IEEE Int. Conf. Syst., Man Cybern. (SMC), Kuching, Malaysia, 2024, pp. 1871–1876

    2024

  32. [37]

    A cauchy loss -incorporated nonnegative latent factorization of tensors model for spatiotemporal traffic data recovery,

    H. Wu and J. Mi, “A cauchy loss -incorporated nonnegative latent factorization of tensors model for spatiotemporal traffic data recovery,” Neurocomputing, 2025, Art. no. 129575

    2025

  33. [38]

    A novel approach to large -scale dynamically weighted directed network representation,

    X. Luo, H. Wu, Z. Wang, J. Wang, and D. Meng, “A novel approach to large -scale dynamically weighted directed network representation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 44, no. 12, pp. 9756–9773, Dec. 2022

    2022

  34. [39]

    H. Wu, X. Wu, and X. Luo, Dynamic network representation based on latent factorization of tensors. Singapore: Springer, 2023

    2023

  35. [40]

    Adjusting learning depth in nonnegative latent factorization of tensors for accurately modeling temporal patterns in dynamic QoS data,

    X. Luo, M. Chen, H. Wu, Z. Liu, H. Yuan, and M. Zhou, “Adjusting learning depth in nonnegative latent factorization of tensors for accurately modeling temporal patterns in dynamic QoS data,” IEEE Trans. Autom. Sci. Eng., vol. 18, no. 4, pp. 2142–2155, Oct. 2021

    2021

  36. [41]

    Parallel adaptive stochastic gradient descent algorithms for latent factor analysis of high -dimensional and incomplete industrial data,

    W. Qin, X. Luo, S. Li, and M. Zhou, “Parallel adaptive stochastic gradient descent algorithms for latent factor analysis of high -dimensional and incomplete industrial data,” IEEE Trans. Autom. Sci. Eng., vol. 21, no. 3, pp. 2716–2729, Jul. 2024

    2024

  37. [42]

    Expected tensor decomposition with stochastic gradient descent,

    T. Maehara, K. Hayashi, and K. Kawarabayashi, “Expected tensor decomposition with stochastic gradient descent,” Proc. AAAI Conf. Artif. Intell., 2016

    2016

  38. [43]

    Latent factor-based recommenders relying on extended stochastic gradient descent algorithms,

    X. Luo, D. Wang, M. Zhou, and H. Yuan, “Latent factor-based recommenders relying on extended stochastic gradient descent algorithms,” IEEE Trans. Syst., Man, Cybern.: Syst., vol. 51, no. 2, pp. 916–926, 2021

    2021

  39. [44]

    Large-scale and scalable latent factor analysis via distributed alternative stochastic gradient descent for recommender systems,

    X. Shi, Q. He, X. Luo, Y. Bai, and M. Shang, “Large-scale and scalable latent factor analysis via distributed alternative stochastic gradient descent for recommender systems,” IEEE Trans. Big Data, vol. 8, no. 2, pp. 420–431, Apr. 2022

    2022

  40. [45]

    Asynchronous parallel fuzzy stochastic gradient descent for high-dimensional incomplete data representation,

    W. Qin and X. Luo, “Asynchronous parallel fuzzy stochastic gradient descent for high-dimensional incomplete data representation,” IEEE Trans. Fuzzy Syst., vol. 32, no. 2, pp. 445–459, Feb. 2024

    2024

  41. [46]

    A proportional-integral-derivative-incorporated stochastic gradient descent-based latent factor analysis model,

    J. Li, Y. Yuan, T. Ruan, J. Chen, and X. Luo, “A proportional-integral-derivative-incorporated stochastic gradient descent-based latent factor analysis model,” Neurocomputing, vol. 427, pp. 29–39, 2021

    2021

  42. [49]

    A fuzzy PID-incorporated stochastic gradient descent algorithm for fast and accurate latent factor analysis,

    Y. Yuan, J. Li, and X. Luo, “A fuzzy PID-incorporated stochastic gradient descent algorithm for fast and accurate latent factor analysis,”IEEE Trans. Fuzzy Syst., vol. 32, no. 7, pp. 4049–4061, Jul. 2024

    2024

  43. [50]

    A PID controller approach for stochastic optimization of deep networks,

    W. An et al., “A PID controller approach for stochastic optimization of deep networks,” in Proc. IEEE/CVF Conf. Comput. Vis. Pattern Recognit. (CVPR) , Salt Lake City, UT, USA, 2018, pp. 8522–8531

    2018

  44. [51]

    Optimal PID design for load frequency control using QRAWCP approach,

    S. D. Hanwate and Y. V. Hote, “Optimal PID design for load frequency control using QRAWCP approach,” IFAC-PapersOnLine, vol. 51, no. 4, pp. 651–656, 2018

    2018

  45. [52]

    Rethinking the PID optimizer for stochastic optimization of deep networks,

    L. Shi, Y. Zhang, W. Wang, J. Cheng, and H. Lu, “Rethinking the PID optimizer for stochastic optimization of deep networks, ” Proc. IEEE Int. Conf. Multimedia Expo (ICME), pp. 1–6, 2020

    2020

  46. [53]

    Application of reinforcement learning-based adaptive PID controller for automatic generation control of multi-area power system,

    R. Muduli, D. Jena, and T. Moger, “Application of reinforcement learning-based adaptive PID controller for automatic generation control of multi-area power system,” IEEE Trans. Autom. Sci. Eng., vol. 22, pp. 1057–1068, 2025

    2025

  47. [55]

    HP -CSF: An GPU optimization method for CP decomposition of incomplete tensors,

    G. Liu and H. Wu, “HP -CSF: An GPU optimization method for CP decomposition of incomplete tensors,” in Proc. IFIP Int. Conf. Netw. Parallel Comput. (NPC), Singapore: Springer, 2024, pp. 77–90

    2024

  48. [56]

    A customized data fusion tensor approach for interval-wise missing network volume imputation,

    J. Xing, R. Liu, K. Anish, and Z. Liu, “A customized data fusion tensor approach for interval-wise missing network volume imputation,” IEEE Trans. Intell. Transp. Syst., vol. 24, no. 11, pp. 12107–12122, Nov. 2023

    2023

  49. [57]

    Neural latent factorization of tensors for dynamically weighted directed net works analysis,

    H. Wu, X. Luo, and M. Zhou, “Neural latent factorization of tensors for dynamically weighted directed net works analysis,” in Proc. IEEE Int. Conf. Syst., Man, Cybern. (SMC), Melbourne, Australia, 2021, pp. 3061–3066

    2021

  50. [58]

    Interpolation of missing data using nonlinear and chaotic system analysis,

    R. E. Amritkar and P. P. Kumar, “Interpolation of missing data using nonlinear and chaotic system analysis,” J. Geophys. Res., vol. 100, pp. 3149–3154, 1995

    1995

  51. [59]

    A data -characteristic-aware latent factor model for Web ser vices QoS prediction,

    D. Wu, X. Luo, M. Shang, Y. He, G. Wang, and X. Wu, “A data -characteristic-aware latent factor model for Web ser vices QoS prediction,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 6, pp. 2525–2538, Jun. 2022

    2022

  52. [60]

    A fast and inherently nonnegative latent factorization of tensors model for dynamic directed network representation,

    A. Zeng and H. Wu, “A fast and inherently nonnegative latent factorization of tensors model for dynamic directed network representation,” in Proc. Int. Conf. Comput. Support. Coop. Work Des. (CSCWD), Tianjin, China, 2024, pp. 2955–2960

    2024

  53. [61]

    Proximal alternating-direction-method-of-multipliers-incorporated nonnegative latent factor analysis,

    F. Bi, X. Luo, B. Shen, H. Dong, and Z. Wang, “Proximal alternating-direction-method-of-multipliers-incorporated nonnegative latent factor analysis, ” IEEE/CAA J. Autom. Sinica, vol. 10, no. 6, pp. 1388–1406, Jun. 2023

    2023

  54. [62]

    An adaptive divergence-based non-negative latent factor model,

    Y. Yuan, R. Wang, G. Yuan, and L. Xin, “An adaptive divergence-based non-negative latent factor model,” IEEE Trans. Syst., Man, Cybern., Syst., vol. 53, no. 10, pp. 6475–6487, Oct. 2023

    2023

  55. [63]

    A generalized Nesterov-accelerated second-order latent factor model for high-dimensional and incomplete data,

    W. Li, R. Wang, and X. Luo, “A generalized Nesterov-accelerated second-order latent factor model for high-dimensional and incomplete data,” IEEE Trans. Neural Netw. Learn. Syst., vol. 36, no. 1, pp. 1518–1532, Jan. 2025

    2025

  56. [64]

    Discovering hidden pattern in large-scale dynamically weighted directed network via latent factorization of tensors,

    H. Wu, X. Luo, and M. Zhou, “Discovering hidden pattern in large-scale dynamically weighted directed network via latent factorization of tensors,” in Proc. IEEE Int. Conf. Autom. Sci. Eng. (CASE), Lyon, France, 2021, pp. 1533–1538

    2021

  57. [65]

    Neulft: A novel approach to nonlinear canonical polyadic decomposition on high-dimensional incomplete tensors,

    X. Luo, H. Wu, and Z. Li, “Neulft: A novel approach to nonlinear canonical polyadic decomposition on high-dimensional incomplete tensors,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 6, pp. 6148–6166, Jun. 2023

    2023

  58. [66]

    Temporal pattern-aware QoS prediction via biased non-negative latent factorization of tensors,

    X. Luo et al., “Temporal pattern-aware QoS prediction via biased non-negative latent factorization of tensors,” IEEE Trans. Cybern., vol. 50, no. 5, pp. 1798– 1809, May 2020

    2020

  59. [67]

    Dynamically weighted directed network link prediction using tensor ring decomposition,

    Q. Wang and H. Wu, “Dynamically weighted directed network link prediction using tensor ring decomposition,” in Proc. Int. Conf. Comput. Support. Coop. Work Des. (CSCWD), Tianjin, China, 2024, pp. 2864–2869

    2024

  60. [68]

    Temporal pattern-aware QoS prediction by biased non-negative tucker factorization of tensors,

    P. Tang et al., “Temporal pattern-aware QoS prediction by biased non-negative tucker factorization of tensors,” Neurocomputing, vol. 582, Art. no. 127447, 2024

    2024

  61. [69]

    Adaptively-accelerated parallel stochastic gradient descent for high-dimensional and incomplete data representation learning,

    W. Qin, X. Luo, and M. Zhou, “Adaptively-accelerated parallel stochastic gradient descent for high-dimensional and incomplete data representation learning,” IEEE Trans. Big Data, vol. 10, no. 1, pp. 92–107, Feb. 2024

    2024

  62. [70]

    Pseudo gradient-adjusted particle swarm optimization for accurate adaptive latent factor analysis,

    X. Luo, J. Chen, Y. Yuan, and Z. Wang, “Pseudo gradient-adjusted particle swarm optimization for accurate adaptive latent factor analysis, ” IEEE Trans. Syst., Man, Cybern., Syst., vol. 54, no. 4, pp. 2213–2226, Apr. 2024

    2024

  63. [71]

    A novel switching delayed PSO algorithm for estimating unknown parameters of lateral flow immunoassay,

    N. Zeng, Z. Wang, H. Zhang, and F. E. Alsaadi, “A novel switching delayed PSO algorithm for estimating unknown parameters of lateral flow immunoassay,” Cognit. Comput., vol. 8, pp. 143–152, 2016

    2016

  64. [72]

    FCAN-MOPSO: An improved fuzzy-based graph clustering algorithm for complex networks with multiobjective particle swarm optimization,

    L. Hu, Y. Yang, Z. Tang, Y. He, and X. Luo, “FCAN-MOPSO: An improved fuzzy-based graph clustering algorithm for complex networks with multiobjective particle swarm optimization,” IEEE Trans. Fuzzy Syst., vol. 31, no. 10, pp. 3470–3484, Oct. 2023

    2023

  65. [74]

    Multi-dimensional QoS prediction for service recommendations,

    S. Wang et al., “Multi-dimensional QoS prediction for service recommendations,” IEEE Trans. Serv. Comput., vol. 12, no. 1, pp. 47–57, 2019

    2019

  66. [75]

    A tensor-based approach for the QoS evaluation in service-oriented environments,

    X. Su et al., “A tensor-based approach for the QoS evaluation in service-oriented environments,” IEEE Trans. Netw. Serv. Manag., vol. 18, no. 3, pp. 3843– 3857, 2021

    2021

  67. [76]

    Tensor factorization with sparse and graph regularization for fake news detection on social networks,

    H. Che et al., “Tensor factorization with sparse and graph regularization for fake news detection on social networks,” IEEE Trans. Comput. Soc. Syst., pp. 1– 11, 2023

    2023

  68. [77]

    Outlier-resilient web service QoS prediction,

    F. Ye et al., “Outlier-resilient web service QoS prediction,” in Proc. Web Conf. (WWW), 2021

    2021

  69. [78]

    Orthogonal learning particle swarm optimization,

    Z.-H. Zhan et al., “Orthogonal learning particle swarm optimization,” IEEE Trans. Evol. Comput., vol. 15, no. 6, pp. 832–847, 2011

    2011

  70. [79]

    Two-stage multi-swarm particle swarm pptimizer for unconstrained and constrained global optimization,

    Q. Zhao and C. Li, “Two-stage multi-swarm particle swarm pptimizer for unconstrained and constrained global optimization,” IEEE Access, vol. 8, pp. 124905- 124927, 2020

    2020

  71. [81]

    It’s different: insights into home energy consumption in India,

    N. Batra et al., “It’s different: insights into home energy consumption in India,” in Proc. ACM Workshop Embed. Syst. Energy-Efficient Build., Nov. 2013

    2013

  72. [82]

    The UK-DALE dataset, domestic appliance-level electricity demand and whole-house demand from five UK homes,

    J. Kelly and W. Knottenbelt, “The UK-DALE dataset, domestic appliance-level electricity demand and whole-house demand from five UK homes,” Sci. Data, vol. 2, Art. no. 150007, 2015

    2015

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.