mlsanityData to 7 Oct 2026

Adaptive Latent Factor Analysis via Generalized Momentum-Incorporated Particle Swarm Optimization

arXiv 2208.02423 ↗First posted 4 Aug 2022cs.NE cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Stochastic gradient descent (SGD) algorithm is an effective learning strategy to build a latent factor analysis (LFA) model on a high-dimensional and incomplete (HDI) matrix. A particle swarm optimization (PSO) algorithm is commonly adopted to make an SGD-based LFA model's hyper-parameters, i.e, learning rate and regularization coefficient, self-adaptation. However, a standard PSO algorithm may suffer from accuracy loss caused by premature convergence. To address this issue, this paper incorporates more historical information into each particle's evolutionary process for avoiding premature convergence following the principle of a generalized-momentum (GM) method, thereby innovatively achieving a novel GM-incorporated PSO (GM-PSO). With it, a GM-PSO-based LFA (GMPL) model is further achieved to implement efficient self-adaptation of hyper-parameters. The experimental results on three HDI matrices demonstrate that the GMPL model achieves a higher prediction accuracy for missing data estimation in industrial applications.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 3 of its 51 references that are in the map. First posted on arXiv 4 Aug 2022.

Builds on

3 of 51 references.

References · 3

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019LambdaOpt: Learn to Regularize Recommender Models in Finer Levelscited by 14
  3. 2017Representation Learning and Pairwise Ranking for Implicit Feedback in Recommendation Systemscited by 11

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.