DeepAI AI Chat
Log In Sign Up

Learning Tensor Latent Features

10/10/2018
by   Sung-En Chang, et al.
0

We study the problem of learning latent feature models (LFMs) for tensor data commonly observed in science and engineering such as hyperspectral imagery. However, the problem is challenging not only due to the non-convex formulation, the combinatorial nature of the constraints in LFMs, but also the high-order correlations in the data. In this work, we formulate a tensor latent feature learning problem by representing the data as a mixture of high-order latent features and binary codes, which are memory efficient and easy to interpret. To make the learning tractable, we propose a novel optimization procedure, Binary matching pursuit (BMP), that iteratively searches for binary bases via a MAXCUT-like boolean quadratic solver. Such a procedure is guaranteed to achieve an? suboptimal solution in O(1/ϵ) greedy steps, resulting in a trade-off between accuracy and sparsity. When evaluated on both synthetic and real datasets, our experiments show superior performance over baseline methods.

READ FULL TEXT
12/18/2020

Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit

High-order clustering aims to identify heterogeneous substructure in mul...
07/31/2020

Geometric All-Way Boolean Tensor Decomposition

Boolean tensor has been broadly utilized in representing high dimensiona...
01/29/2018

Sparse and Low-rank Tensor Estimation via Cubic Sketchings

In this paper, we propose a general framework for sparse and low-rank te...
03/17/2023

Non-convex approaches for low-rank tensor completion under tubal sampling

Tensor completion is an important problem in modern data analysis. In th...
06/20/2020

Exact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraint

We study the problem of efficient exact partitioning of the hypergraphs ...
10/26/2021

Defensive Tensorization

We propose defensive tensorization, an adversarial defence technique tha...
06/11/2020

Robust Multi-object Matching via Iterative Reweighting of the Graph Connection Laplacian

We propose an efficient and robust iterative solution to the multi-objec...