aiqbench analysis
This paper introduces DE-LFT, an automated framework using Differential Evolution to optimize hyperparameters for latent factorization of tensors in large-scale dynamic networks. By replacing manual tuning or grid search with an adaptive search process, the method reduces computational overhead while improving prediction accuracy on real-world datasets. The approach addresses a common bottleneck in representation learning by streamlining the regularization parameter selection for time-varying interaction models.
Hyperparameter Learning for Latent Factorization of Tensors for Representation Learning to Large-scale Dynamic Weighted Directed Network
arXiv:2606.09880v1 Announce Type: new Abstract: 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 $\lambda_1$, $\lambda_2$ and $\lambda_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.
Abstract: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 $\lambda_1$, $\lambda_2$ and $\lambda_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.
Machine Learning (cs.LG)
arXiv:2606.09880 [cs.LG]
(or arXiv:2606.09880v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.09880 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 245 words
Related coverage
Staged Depth Training: A Representation Curriculum for PINNs
arXiv · Sep 28, 2026
Revisiting WEASEL 2.0: Reproduction, Sensitivity, and an Adaptive Ensemble-Size Rule
arXiv · Aug 20, 2026
BBOmix: A Tabular Benchmark for Hyperparameter Optimization of Unsupervised Biological Representation Learning
arXiv · Jun 5, 2026
Expressivity of IQP Feature-Map Quantum Kernels via Reproducing Kernel Hilbert Spaces
arXiv · Oct 19, 2026