activity
20142022
most citedTensor Decomposition for Signal Processing and Machine Learning

1.7k citations · 3.1k across the 23 of their papers we have counts for

collaborators

23 papers

cs.LG2022★ 16 cited

Adaptive Learning for the Resource-Constrained Classification Problem

Danit Shifman Abukasis, Izack Cohen, Xiaochen Xian +2

Resource-constrained classification tasks are common in real-world applications such as allocating tests for disease diagnosis, hiring decisions when filling a limited number of po…

cs.LG2022★ 1 cited

JULIA: Joint Multi-linear and Nonlinear Identification for Tensor Completion

Cheng Qian, Kejun Huang, Lucas Glass +2

Tensor completion aims at imputing missing entries from a partially observed tensor. Existing tensor completion methods often assume either multi-linear or nonlinear relationships…

eess.SP2020★ 34 cited

Computing Large-Scale Matrix and Tensor Decomposition with Structured Factors: A Unified Nonconvex Optimization Perspective

Xiao Fu, Nico Vervliet, Lieven De Lathauwer +2

The proposed article aims at offering a comprehensive tutorial for the computational aspects of structured matrix and tensor factorization. Unlike existing tutorials that mainly fo…

eess.SP2019★ 2 cited

Hyperspectral Super-resolution: A Coupled Nonnegative Block-term Tensor Decomposition Approach

Guoyong Zhang, Xiao Fu, Kejun Huang +1

Hyperspectral super-resolution (HSR) aims at fusing a hyperspectral image (HSI) and a multispectral image (MSI) to produce a super-resolution image (SRI). Recently, a coupled tenso…

cs.LG2019★ 17 cited

Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithms

Shahana Ibrahim, Xiao Fu, Nikos Kargas +1

The data deluge comes with high demands for data labeling. Crowdsourcing (or, more generally, ensemble learning) techniques aim to produce accurate labels via integrating noisy, no…

math.OC2019★ 5 cited

SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problems

Songtao Lu, Meisam Razaviyayn, Bo Yang +2

This paper proposes low-complexity algorithms for finding approximate second-order stationary points (SOSPs) of problems with smooth non-convex objective and linear constraints. Wh…