paper-with-me

Papers

Matrix Completion in the Unit Hypercube via Structured Matrix Factorization

2019-05-30 · Emanuele Bugliarello, Swayambhoo Jain, Vineeth Rakesh

Several complex tasks that arise in organizations can be simplified by mapping them into a matrix completion problem. In this paper, we address a key challenge faced by our company: predicting the efficiency of artists in rendering visual effects (VFX) in film shots. We tackle this challenge by using a two-fold approach: first, we transform this task into a constrained matrix completion problem with entries bounded in the unit interval [0, 1]; second, we propose two novel matrix factorization models that leverage our knowledge of the VFX environment. Our first approach, expertise matrix factorization (EMF), is an interpretable method that structures the latent factors as weighted user-item interplay. The second one, survival matrix factorization (SMF), is instead a probabilistic model for the underlying process defining employees' efficiencies. We show the effectiveness of our proposed models by extensive numerical tests on our VFX dataset and two additional datasets with values that are also bounded in the [0, 1] interval.

📄 PDF Abstract BibTeX arXiv:1905.12881

Code (1)

e-bug/unit-mf 공식 구현

Tasks

Matrix Completion

Similar Papers 제목 키워드 기반

Matrix Completion on Graphs

2014-08-07 · Vassilis Kalofolias, Xavier Bresson, Michael Bronstein, Pierre Vandergheynst

The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption…

Collaborative FilteringMatrix CompletionMissing ValuesRecommendation Systems

Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube

2015-06-09 · Tselil Schramm, Benjamin Weitz

We give an algorithm for completing an order-$m$ symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the proble…

Low-Rank Matrix CompletionMatrix Completion

Spectral Compressed Sensing via Structured Matrix Completion

2013-04-16 · Yuxin Chen, Yuejie Chi

The paper studies the problem of recovering a spectrally sparse object from a small number of time domain samples. Specifically, the object of interest with ambient dimension $n$ is assumed to be a mixture of $r$ complex…

compressed sensingMatrix CompletionSuper-Resolution

Structured low-rank matrix completion for forecasting in time series analysis

2018-02-22 · Jonathan Gillard, Konstantin Usevich

In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values…

Low-Rank Matrix CompletionMatrix CompletionMissing ValuesTime Series+1

Structured Matrix Completion with Applications to Genomic Data Integration

2015-04-08 · Tianxi Cai, T. Tony Cai, Anru Zhang

Matrix completion has attracted significant recent attention in many fields including statistics, applied mathematics and electrical engineering. Current literature on matrix completion focuses primarily on independent s…

Data IntegrationElectrical EngineeringMatrix Completion