← Search

Hailin Wang

8 accepted papers

2026

Fast Guaranteed Robust Local-Smooth Principal Component Separation

AAAI 2026technical

Leveraging intrinsic data priors is critical for effective data recovery. However, existing approaches often struggle to achieve theoretical guarantees, strong performance, and computational efficiency simultaneously. In this paper, we introduce a novel Representative Coefficient Correlated Total Va

Cited by 0SourcePDFScholar
2025

Fast Guaranteed Tensor Recovery with Adaptive Tensor Nuclear Norm

IJCAI 2025

Real-world datasets like multi-spectral images and videos are naturally represented as tensors. However, limitations in data acquisition often lead to corrupted or incomplete tensor data, making tensor recovery a critical challenge. Solving this problem requires exploiting inherent structural patter

2025

Label Distribution Learning with Biased Annotations Assisted by Multi-Label Learning

IJCAI 2025

Multi-label learning (MLL) has gained attention for its ability to represent real-world data. Label Distribution Learning (LDL), an extension of MLL to learning from label distributions, faces challenges in collecting accurate label distributions. To address the issue of biased annotations, based on

Cited by 0SourcePDFScholar
2025

RankMatch: A Novel Approach to Semi-Supervised Label Distribution Learning Leveraging Rank Correlation between Labels

NeurIPS 2025poster

Pseudo label based semi-supervised learning (SSL) for single-label and multi-label classification tasks has been extensively studied; however, semi-supervised label distribution learning (SSLDL) remains a largely unexplored area. Existing SSL methods fail in SSLDL because the pseudo-labels they ge…

Cited by 0SourceScholar
2023

Preconditioning Matters: Fast Global Convergence of Non-convex Matrix Factorization via Scaled Gradient Descent

NeurIPS 2023poster

Low-rank matrix factorization (LRMF) is a canonical problem in non-convex optimization, the objective function to be minimized is non-convex and even non-smooth, which makes the global convergence guarantee of gradient-based algorithm quite challenging. Recent work made a breakthrough on proving tha…

Cited by 15SourcePDFScholar
2023

Tensor Compressive Sensing Fused Low-Rankness and Local-Smoothness

AAAI 2023technical

A plethora of previous studies indicates that making full use of multifarious intrinsic properties of primordial data is a valid pathway to recover original images from their degraded observations. Typically, both low-rankness and local-smoothness broadly exist in real-world tensor data such as hype…

2022

Robust High-Order Tensor Recovery Via Nonconvex Low-Rank Approximation

ICASSP 2022accepted

The latest tensor recovery methods based on tensor Singular Value Decomposition (t-SVD) mainly utilize the tensor nuclear norm (TNN) as a convex surrogate of the rank function. However, TNN minimization treats each rank component equally and tends to over-shrink the dominant ones, thereby usually le…

Cited by 0SourceScholar
2020

Estimating Structural Missing Values Via Low-Tubal-Rank Tensor Completion

ICASSP 2020accepted

The recently proposed Tensor Nuclear Norm (TNN) minimization has been widely used for tensor completion. However, previous works didn’t consider the structural difference between the observed data and missing data, which widely exists in many applications. In this paper, we propose to incorporate a…

Cited by 0SourceScholar