paper-with-me

Papers

Generalized Low Rank Models

2014-10-01 · Madeleine Udell, Corinne Horn, Reza Zadeh, Stephen Boyd

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, $k$-means, $k$-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing entries across all data types simultaneously. It also admits a number of interesting interpretations of the low rank factors, which allow clustering of examples or of features. We propose several parallel algorithms for fitting generalized low rank models, and describe implementations and numerical results.

📄 PDF Abstract BibTeX arXiv:1410.0342

Code (1)

madeleineudell/LowRankModels.jl 공식 구현

Tasks

ClusteringDenoisingMatrix Completion

Methods 이 논문이 사용한 방법론

PCA Principle Components Analysis (PCA) is an unsupervised method primary used for dimensionality reduction within machine learning. PCA is calculated via a singular value…

Similar Papers 제목 키워드 기반

Primal-Dual Block Generalized Frank-Wolfe

2019-12-01 · NeurIPS 2019 12 · Qi Lei, Jiacheng Zhuo, Constantine Caramanis, Inderjit S. Dhillon 외

We propose a generalized variant of Frank-Wolfe algorithm for solving a class of sparse/low-rank optimization problems. Our formulation includes Elastic Net, regularized SVMs and phase retrieval as special cases. The pro…

Multi-class ClassificationRetrieval

Efficient Generalized Low-Rank Tensor Contextual Bandits

2023-11-03 · Qianxin Yi, Yiyang Yang, Shaojie Tang, Jiapeng Liu 외

In this paper, we aim to build a novel bandits algorithm that is capable of fully harnessing the power of multi-dimensional data and the inherent non-linearity of reward functions to provide high-usable and accountable d…

Decision MakingMulti-Armed Bandits

Probabilistic risk aversion for generalized rank-dependent functions

2022-09-07 · Ruodu Wang, Qinyu Wu

Probabilistic risk aversion, defined through quasi-convexity in probabilistic mixtures, is a common useful property in decision analysis. We study a general class of non-monotone mappings, called the generalized rank-dep…

Management

Exploration of Proximity Heuristics in Length Normalization

2017-01-05 · Pranav Agrawal

Ranking functions used in information retrieval are primarily used in the search engines and they are often adopted for various language processing applications. However, features used in the construction of ranking func…

Feature EngineeringInformation RetrievalRetrieval

Layer-wise Adaptive Graph Convolution Networks Using Generalized Pagerank

2021-08-24 · Kishan Wimalawarne, Taiji Suzuki

We investigate adaptive layer-wise graph convolution in deep GCN models. We propose AdaGPR to learn generalized Pageranks at each layer of a GCNII network to induce adaptive convolution. We show that the generalization b…

Generalization BoundsNode Classification