Tensor completion with noisy side information

DOI10.1007/S10994-023-06338-5MaRDI QIDQ6053809

Dimitris J. Bertsimas, Colin Pawlowski

Publication date: 24 October 2023

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

tensor completionlow-rankgenomic data3-dimensional dataanti-cancer drug screens

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Applications of statistics to biology and medical sciences; meta analysis (62P10) Learning and adaptive systems in artificial intelligence (68T05) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Tensor factorization using auxiliary information
• Exact matrix completion via convex optimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Convex Coupled Matrix and Tensor Completion
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Low-rank matrix completion using alternating minimization

This page was built for publication: Tensor completion with noisy side information