LowRankModels
From MaRDI portal
Software:38721
No author found.
Source code repository: https://github.com/madeleineudell/LowRankModels.jl
Related Items (43)
Embedding Learning ⋮ Stochastic Gradients for Large-Scale Tensor Decomposition ⋮ Decentralized Dictionary Learning Over Time-Varying Digraphs ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data ⋮ A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Inertial alternating direction method of multipliers for non-convex non-smooth optimization ⋮ Multiple correspondence analysis and the multilogit bilinear model ⋮ Sharper Bounds for Regularized Data Fitting ⋮ Enhanced image approximation using shifted rank-1 reconstruction ⋮ A survey on deep matrix factorizations ⋮ SONIC: social network analysis with influencers and communities ⋮ Linear Algebra and Optimization for Machine Learning ⋮ Dimensionality reduction for binary data through the projection of natural parameters ⋮ Imputation and low-rank estimation with missing not at random data ⋮ Bayesian mean-parameterized nonnegative binary matrix factorization ⋮ Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods ⋮ \(e\)PCA: high dimensional exponential family PCA ⋮ Smoothing Partially Exact Penalty Function of Biconvex Programming ⋮ Adapting Regularized Low-Rank Models for Parallel Architectures ⋮ Unnamed Item ⋮ Low-rank matrix approximation in the infinity norm ⋮ Leveraging mixed and incomplete outcomes via reduced-rank modeling ⋮ Hyperparameter optimization for recommender systems through Bayesian optimization ⋮ Flexible low-rank statistical modeling with missing data and side information ⋮ Main effects and interactions in mixed and incomplete data frames ⋮ Generalized Canonical Polyadic Tensor Decomposition ⋮ An objective penalty function method for biconvex programming ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers ⋮ Dynamic Assortment Personalization in High Dimensions ⋮ Generalized SURE for optimal shrinkage of singular values in low-rank matrix denoising ⋮ Low-rank matrix denoising for count data using unbiased Kullback-Leibler risk estimation ⋮ Rank regularized estimation of approximate factor models ⋮ Acceptable set topic modeling ⋮ Structured Latent Factor Analysis for Large-scale Data: Identifiability, Estimability, and Their Implications ⋮ Exponential-Family Embedding With Application to Cell Developmental Trajectories for Single-Cell RNA-Seq Data ⋮ Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms ⋮ Signal Decomposition Using Masked Proximal Operators ⋮ Why Are Big Data Matrices Approximately Low Rank? ⋮ On a Problem of Weighted Low-Rank Approximation of Matrices
This page was built for software: LowRankModels
