paper-with-me

Papers

ATD: Augmenting CP Tensor Decomposition by Self Supervision

2021-06-15 · Chaoqi Yang, Cheng Qian, Navjot Singh, Cao Xiao, M Brandon Westover, Edgar Solomonik, Jimeng Sun

Tensor decompositions are powerful tools for dimensionality reduction and feature interpretation of multidimensional data such as signals. Existing tensor decomposition objectives (e.g., Frobenius norm) are designed for fitting raw data under statistical assumptions, which may not align with downstream classification tasks. In practice, raw input tensors can contain irrelevant information while data augmentation techniques may be used to smooth out class-irrelevant noise in samples. This paper addresses the above challenges by proposing augmented tensor decomposition (ATD), which effectively incorporates data augmentations and self-supervised learning (SSL) to boost downstream classification. To address the non-convexity of the new augmented objective, we develop an iterative method that enables the optimization to follow an alternating least squares (ALS) fashion. We evaluate our proposed ATD on multiple datasets. It can achieve 0.8% - 2.5% accuracy gain over tensor-based baselines. Also, our ATD model shows comparable or better performance (e.g., up to 15% in accuracy) over self-supervised and autoencoder baselines while using less than 5% of learnable parameters of these baseline models

📄 PDF Abstract BibTeX arXiv:2106.07900

Code (1)

ycq091044/atd 공식 구현 pytorch

Tasks

Data AugmentationDimensionality ReductionSelf-Supervised LearningStochastic OptimizationTensor Decomposition

Similar Papers 제목 키워드 기반

Decomposition of linear tensor transformations

2023-09-14 · Claudio Turchetti

One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this p…

Tensor Decomposition

ReDepth Anything: Test-Time Depth Refinement via Self-Supervised Re-lighting

2025-12-19 · Ananta R. Bhattarai, Helge Rhodin arxiv

Monocular depth estimation remains challenging, as foundation models such as Depth Anything V2 (DA-V2) struggle with real-world images that are far from the training distribution. We introduce Re-Depth Anything, a test-t…

Monocular Depth Estimation

Hyperspectral Image Recovery Constrained by Multi-Granularity Non-Local Self-Similarity Priors

2025-08-02 · Zhuoran Peng, Yiqing Shen arxiv

Hyperspectral image (HSI) recovery, as an upstream image processing task, holds significant importance for downstream tasks such as classification, segmentation, and detection. In recent years, HSI recovery methods based…

Tensor Decomposition of Large-scale Clinical EEGs Reveals Interpretable Patterns of Brain Physiology

2022-11-24 · Teja Gupta, Neeraj Wagh, Samarth Rawal, Brent Berry 외

Identifying abnormal patterns in electroencephalography (EEG) remains the cornerstone of diagnosing several neurological diseases. The current clinical EEG review process relies heavily on expert visual review, which is …

EEGElectroencephalogram (EEG)Representation LearningTensor Decomposition

Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions

2019-08-12 · Jeffrey M. Dudek, Leonardo Dueñas-Osorio, Moshe Y. Vardi

Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduction from constrained counting to the pr…

Tensor Networks