Simple, fast, and flexible framework for matrix completion with infinite width neural networks

Abstract

Matrix completion is a fundamental problem in machine learning that arises in various applications. We envision that our infinite width neural network framework for matrix completion will be easily deployable and produce strong baselines for a wide range of applications at limited computational costs. We demonstrate the flexibility of our framework through competitive results on virtual drug screening and image inpainting/reconstruction. Simplicity and speed are showcased by the fact that most results in this work require only a central processing unit and commodity hardware. Through its connection to semisupervised learning, our framework provides a principled approach for matrix completion that can be easily applied to problems well beyond those of image completion and virtual drug screening considered in this paper.

Document Details

Document Type
Pub Defense Publication
Publication Date
Apr 11, 2022
Source ID
10.1073/pnas.2115064119

Entities

People

  • Adityanarayanan Radhakrishnan
  • Caroline Uhler
  • George Stefanakis
  • Mikhail A. Belkin

Organizations

  • Massachusetts Institute of Technology
  • National Science Foundation
  • Office of Naval Research
  • Simons Foundation
  • University of California, San Diego

Tags

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Neural Network Machine Learning.
  • Systems Analysis and Design

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Neural Networks