mlsanityData to 14 Oct 2026

Hyperparameter Learning for Latent Factorization of Tensors for Representation Learning to Large-scale Dynamic Weighted Directed Network

arXiv 2606.09880 ↗First posted 3 Jun 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Large-scale dynamic weighted directed networks (DWDNs) are widely used to model time-varying interactions among nodes. Latent factorization of tensors (LFT) extracts target knowledge from DWDNs via low-rank embedding. However, similar to many machine learning models, the performance of LFT heavily depends on the selection of hyperparameters. In practice, these parameters are often tuned manually or through grid search, which requires significant computational resources and human effort. Motivated by this challenge, this paper proposes an automated hyperparameter optimization framework based on Differential Evolution (DE) for LFT (DE-LFT). The proposed method integrates DE into the training process of the LFT model to automatically learn optimal regularization parameters λ1, λ2 and λ3. As a result, the model can adaptively search the hyperparameter space and improve prediction accuracy. Experimental results on four real-world datasets demonstrate that the proposed approach achieves lower MAE and RMSE compared with manually tuned baselines while reducing the need for extensive parameter tuning.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 50 references that are in the map. First posted on arXiv 3 Jun 2026.

Builds on

2 of 50 references.

References · 2

  1. 2024Mini-Hes: A Parallelizable Second-order Latent Factor Analysis Modelcited by 2
  2. 2025Concept Factorization via Self-Representation and Adaptive Graph Structure Learningcited by 2

Built on by

Not cited yet.