Skip to content

mfair: Matrix Factorization with Auxiliary Information in R

License

Unknown, MIT licenses found

Licenses found

Unknown
LICENSE
MIT
LICENSE.md
Notifications You must be signed in to change notification settings

YangLabHKUST/mfair

Folders and files

NameName
Last commit message
Last commit date

Latest commit

07ae9ad · Apr 21, 2025
May 14, 2023
Apr 21, 2025
Sep 30, 2023
Sep 20, 2023
Jan 25, 2025
Apr 17, 2025
Dec 17, 2023
Mar 8, 2023
Apr 18, 2025
Oct 30, 2023
Mar 8, 2023
May 16, 2023
Apr 14, 2025
Mar 8, 2023
Mar 8, 2023
Apr 17, 2025
Apr 19, 2025
Apr 19, 2025
May 15, 2023
May 14, 2023
Apr 14, 2025
Apr 14, 2025

Repository files navigation

mfair: Matrix Factorization with Auxiliary Information in R

DOI GitHub repo size GitHub commit activity Hits GitHub Repo stars GitHub forks

The R package mfair implements the methods based on the paper MFAI: A scalable Bayesian matrix factorization approach to leveraging auxiliary information. MFAI integrates gradient boosted trees in the probabilistic matrix factorization framework to leverage auxiliary information effectively and adaptively.

Note: Two years later, I realized there are a bunch of areas for improvement in my code. Taking memory management as an example, using functions like c(), append(), cbind(), or rbind() to dynamically grow variables is not recommended, especially with large datasets. A more efficient approach is to pre-allocate memory if the output size is known. If you don’t know the size, a good way is to store outputs in a list. You can merge them afterwards using functions like lapply() and do.call(). For more details, please refer to Advanced R Chapter 24 Improving performance or Advanced R Course Chapter 5 Performance.

Installation

For a quick start, you can install the development version of mfair from GitHub with:

# install.packages("devtools")
devtools::install_github("YangLabHKUST/mfair")

For more illustration and examples, you can alternatively use:

# install.packages("devtools")
devtools::install_github("YangLabHKUST/mfair", build_vignettes = TRUE)

to build vignettes simultaneously. Please note that it can take a few more minutes.

Examples

  • This is a basic example which shows you how to solve a common problem:
set.seed(20230306)
library(mfair)

# Simulate data
# Set the data dimension and rank
N <- 100
M <- 200
K_true <- 2L

# Set the proportion of variance explained (PVE)
PVE_Z <- 0.9
PVE_Y <- 0.5

# Generate auxiliary information X
X1 <- runif(N, min = -10, max = 10)
X2 <- runif(N, min = -10, max = 10)
X <- cbind(X1, X2)

# F(X)
FX1 <- X1 / 2 - X2
FX2 <- (X1^2 - X2^2 + 2 * X1 * X2) / 10
FX <- cbind(FX1, FX2)

# Generate the factor matrix Z (= F(X) + noise)
sig1_sq <- var(FX1) * (1 / PVE_Z - 1)
Z1 <- FX1 + rnorm(n = N, mean = 0, sd = sqrt(sig1_sq))
sig2_sq <- var(FX2) * (1 / PVE_Z - 1)
Z2 <- FX2 + rnorm(n = N, mean = 0, sd = sqrt(sig2_sq))
Z <- cbind(Z1, Z2)

# Generate the loading matrix W
W <- matrix(rnorm(M * K_true), nrow = M, ncol = K_true)

# Generate the main data matrix Y_obs (= Y + noise)
Y <- Z %*% t(W)
Y_var <- var(as.vector(Y))
epsilon_sq <- Y_var * (1 / PVE_Y - 1)
Y_obs <- Y + matrix(
  rnorm(N * M,
    mean = 0,
    sd = sqrt(epsilon_sq)
  ),
  nrow = N, ncol = M
)

# Create MFAIR object
mfairObject <- createMFAIR(Y_obs, as.data.frame(X), K_max = K_true)
#> The main data matrix Y is completely observed!
#> The main data matrix Y has been centered with mean = 0.196418181646673!

# Fit the MFAI model
mfairObject <- fitGreedy(mfairObject, sf_para = list(verbose_loop = FALSE))
#> Set K_max = 2!
#> Initialize the parameters of Factor 1......
#> After 2 iterations Stage 1 ends!
#> After 77 iterations Stage 2 ends!
#> Factor 1 retained!
#> Initialize the parameters of Factor 2......
#> After 2 iterations Stage 1 ends!
#> After 78 iterations Stage 2 ends!
#> Factor 2 retained!

# Prediction based on the low-rank approximation
Y_hat <- predict(mfairObject)
#> The main data matrix Y has no missing entries!

# Root-mean-square-error
sqrt(mean((Y_obs - Y_hat)^2))
#> [1] 11.04169

# Predicted/true matrix variance ratio
var(as.vector(Y_hat)) / var(as.vector(Y_obs))
#> [1] 0.466571

# Prediction/noise variance ratio
var(as.vector(Y_hat)) / var(as.vector(Y_obs - Y_hat))
#> [1] 0.9493455
  • mfair can also handle the matrix with missing entries:
# Split the data into the training set and test set
n_all <- N * M
training_ratio <- 0.5
train_set <- sample(1:n_all, n_all * training_ratio, replace = FALSE)
Y_train <- Y_test <- Y_obs
Y_train[-train_set] <- NA
Y_test[train_set] <- NA

# Create MFAIR object
mfairObject <- createMFAIR(Y_train, as.data.frame(X), Y_sparse = TRUE, K_max = K_true)
#> The main data matrix Y has 50% missing entries!
#> The main data matrix Y has been transferred to the sparse mode!
#> The main data matrix Y has been centered with mean = 0.0364079914822442!

# Fit the MFAI model
mfairObject <- fitGreedy(mfairObject, sf_para = list(verbose_loop = FALSE))
#> Set K_max = 2!
#> Initialize the parameters of Factor 1......
#> After 2 iterations Stage 1 ends!
#> After 99 iterations Stage 2 ends!
#> Factor 1 retained!
#> Initialize the parameters of Factor 2......
#> After 2 iterations Stage 1 ends!
#> After 68 iterations Stage 2 ends!
#> Factor 2 retained!

# Prediction based on the low-rank approximation
Y_hat <- predict(mfairObject)

# Root-mean-square-error
sqrt(mean((Y_test - Y_hat)^2, na.rm = TRUE))
#> [1] 11.6532

# Predicted/true matrix variance ratio
var(as.vector(Y_hat), na.rm = TRUE) / var(as.vector(Y_obs), na.rm = TRUE)
#> [1] 0.4505973

# Prediction/noise variance ratio
var(as.vector(Y_hat), na.rm = TRUE) / var(as.vector(Y_obs - Y_hat), na.rm = TRUE)
#> [1] 0.8830444
  • Empirically, the backfitting algorithm can further improve the performance:
# Refine the MFAI model with the backfitting algorithm
mfairObject <- fitBack(
  mfairObject,
  verbose_bf_inner = FALSE,
  sf_para = list(verbose_sf = FALSE, verbose_loop = FALSE)
)
#> Iteration: 1, relative difference of model parameters: 0.2827721.
#> Iteration: 2, relative difference of model parameters: 0.05223744.
#> Iteration: 3, relative difference of model parameters: 0.07034077.
#> Iteration: 4, relative difference of model parameters: 0.08374642.
#> Iteration: 5, relative difference of model parameters: 0.009833483.

# Prediction based on the low-rank approximation
Y_hat <- predict(mfairObject)

# Root-mean-square-error
sqrt(mean((Y_test - Y_hat)^2, na.rm = TRUE))
#> [1] 11.63093

# Predicted/true matrix variance ratio
var(as.vector(Y_hat), na.rm = TRUE) / var(as.vector(Y_obs), na.rm = TRUE)
#> [1] 0.4697753

# Prediction/noise variance ratio
var(as.vector(Y_hat), na.rm = TRUE) / var(as.vector(Y_obs - Y_hat), na.rm = TRUE)
#> [1] 0.9254147
vignette("ml100k")
vignette("neocortex")
  • For more documentation and examples, please visit our package website.

Citing our work

If you find the mfair package or any of the source code in this repository useful for your work, please cite:

Wang, Z., Zhang, F., Zheng, C., Hu, X., Cai, M., & Yang, C. (2024). MFAI: A Scalable Bayesian Matrix Factorization Approach to Leveraging Auxiliary Information. Journal of Computational and Graphical Statistics, 33(4), 1339–1349. https://doi.org/10.1080/10618600.2024.2319160

Development

The R package mfair is developed and maintained by Zhiwei Wang.

Contact

Please feel free to contact Zhiwei Wang, Prof. Mingxuan Cai, or Prof. Can Yang if any inquiries.