Cited in
(64)- Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
- Stochastic gradients for large-scale tensor decomposition
- Flexible low-rank statistical modeling with missing data and side information
- Low-rank matrix approximation in the infinity norm
- Rank regularized estimation of approximate factor models
- Sharper bounds for regularized data fitting
- On a Problem of Weighted Low-Rank Approximation of Matrices
- A nonmonotone alternating updating method for a class of matrix factorization problems
- Bayesian mean-parameterized nonnegative binary matrix factorization
- Kurdyka-Łojasiewicz exponent via inf-projection
- Collective matrix completion
- A nonlinear matrix decomposition for mining the zeros of sparse data
- Signal Decomposition Using Masked Proximal Operators
- Bootstrap-based regularization for low-rank matrix estimation
- Dynamic assortment personalization in high dimensions
- Exponential-Family Embedding With Application to Cell Developmental Trajectories for Single-Cell RNA-Seq Data
- Non-convex matrix completion and related problems via strong duality
- SONIC: social network analysis with influencers and communities
- Embedding Learning
- Hyperparameter optimization for recommender systems through Bayesian optimization
- PoiClaClu
- LMaFit
- softImpute
- SPECTRODE
- LIBMF
- denoiseR
- fastFM
- KELLER
- NCVX
- MMCA
- Pyglrm
- Condor
- ePCA
- hctsa
- FROSTT
- ROCKET
- OptShrink
- OBOE
- SVDMAN
- MSCRA_rankmin
- Imputation and low-rank estimation with missing not at random data
- Adapting regularized low-rank models for parallel architectures
- Decentralized dictionary learning over time-varying digraphs
- Generalized SURE for optimal shrinkage of singular values in low-rank matrix denoising
- Leveraging mixed and incomplete outcomes via reduced-rank modeling
- A survey on deep matrix factorizations
- Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods
- Generalized canonical polyadic tensor decomposition
- Structured latent factor analysis for large-scale data: identifiability, estimability, and their implications
- Enhanced image approximation using shifted rank-1 reconstruction
- ProximalOperators.jl
- Low-rank matrix denoising for count data using unbiased Kullback-Leibler risk estimation
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints
- Linear algebra and optimization for machine learning. A textbook
- Multiple correspondence analysis and the multilogit bilinear model
- Main effects and interactions in mixed and incomplete data frames
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- Acceptable set topic modeling
- Smoothing partially exact penalty function of biconvex programming
- Why Are Big Data Matrices Approximately Low Rank?
- An objective penalty function method for biconvex programming
- \(e\)PCA: high dimensional exponential family PCA
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- Dimensionality reduction for binary data through the projection of natural parameters
This page was built for software: LowRankModels
