Deep Transfer Tensor Factorization for Multi-View Learning

• URL: http://arxiv.org/abs/2302.06133v1
• Date: Mon, 13 Feb 2023 06:41:23 GMT
• Title: Deep Transfer Tensor Factorization for Multi-View Learning
• Abstract summary: This paper studies the data sparsity problem in multiview learning. We propose a generic architecture of deep transfer tensor factorization (DTTF) Experimental results on real-world datasets demonstrate that our DTTF schemes outperform state-of-the-art methods on multi-view rating predictions.
• Score: 0.2062593640149623
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper studies the data sparsity problem in multi-view learning. To solve data sparsity problem in multiview ratings, we propose a generic architecture of deep transfer tensor factorization (DTTF) by integrating deep learning and cross-domain tensor factorization, where the side information is embedded to provide effective compensation for the tensor sparsity. Then we exhibit instantiation of our architecture by combining stacked denoising autoencoder (SDAE) and CANDECOMP/ PARAFAC (CP) tensor factorization in both source and target domains, where the side information of both users and items is tightly coupled with the sparse multi-view ratings and the latent factors are learned based on the joint optimization. We tightly couple the multi-view ratings and the side information to improve cross-domain tensor factorization based recommendations. Experimental results on real-world datasets demonstrate that our DTTF schemes outperform state-of-the-art methods on multi-view rating predictions.

Related papers

• Personalized Federated Learning with Heat-Kernel Enhanced Tensorized Multi-View Clustering [2.538209532048867]
  We present a robust personalized learning framework for multi-view fuzzy c-means clustering.<n>Our approach integrates heat- kernel coefficients adapted from quantum field theory with Tucker decomposition and canonical polyadic decomposition.
  arXiv  Detail & Related papers  (2025-09-19T15:45:02Z)
• Joint Tensor and Inter-View Low-Rank Recovery for Incomplete Multiview Clustering [35.261304932451544]
  This paper proposes a novel joint tensor and inter-view low-rank Recovery (JTIV-LRR) for incomplete multiview clustering. It achieves significant improvements in clustering accuracy and robustness compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-03-04T09:50:59Z)
• Federated Low-Rank Tensor Estimation for Multimodal Image Reconstruction [9.075990246977891]
  We present a federated image reconstruction method that applies Tucker decomposition, incorporating joint factorization and randomized sketching to manage large-scale, multimodal data. Numerical results demonstrate that our method achieves superior reconstruction quality and communication compression compared to existing approaches.
  arXiv  Detail & Related papers  (2025-02-04T23:02:46Z)
• Fast Disentangled Slim Tensor Learning for Multi-view Clustering [28.950845031752927]
  We propose a new approach termed fast Disdentangle Slim Learning (DSTL) for multi-view clustering. To alleviate the negative influence of feature redundancy, inspired by robust PCA, DSTL disentangles the latent low-dimensional representation into a semantic-unrelated part and a semantic-related part for each view. Our proposed model is computationally efficient and can be solved effectively.
  arXiv  Detail & Related papers  (2024-11-12T09:57:53Z)
• A Framework for Fine-Tuning LLMs using Heterogeneous Feedback [69.51729152929413]
  We present a framework for fine-tuning large language models (LLMs) using heterogeneous feedback. First, we combine the heterogeneous feedback data into a single supervision format, compatible with methods like SFT and RLHF. Next, given this unified feedback dataset, we extract a high-quality and diverse subset to obtain performance increases.
  arXiv  Detail & Related papers  (2024-08-05T23:20:32Z)
• Adaptively Topological Tensor Network for Multi-view Subspace Clustering [36.790637575875635]
  Multi-view subspace clustering uses learned self-representation tensors to exploit low rank information. A pre-defined tensor decomposition may not fully exploit low rank information for a certain dataset. We propose the adaptively topological tensor network (ATTN) by determining the edge ranks from the structural information of the self-representation tensor.
  arXiv  Detail & Related papers  (2023-05-01T08:28:33Z)
• Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
  We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF) Our model directly considers the between-view relationship and exploits the between-view complementary information. In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
  arXiv  Detail & Related papers  (2023-03-29T14:54:19Z)
• Learning with Multigraph Convolutional Filters [153.20329791008095]
  We introduce multigraph convolutional neural networks (MGNNs) as stacked and layered structures where information is processed according to an MSP model. We also develop a procedure for tractable computation of filter coefficients in the MGNNs and a low cost method to reduce the dimensionality of the information transferred between layers.
  arXiv  Detail & Related papers  (2022-10-28T17:00:50Z)
• Coupled Support Tensor Machine Classification for Multimodal Neuroimaging Data [28.705764174771936]
  A Coupled Support Machine (C-STM) is built upon the latent factors estimated from the Advanced Coupled Matrix Factorization (ACMTF) C-STM combines individual and shared latent factors with multiple kernels and estimates a maximal-margin for coupled matrix tensor data. The classification risk of C-STM is shown to converge to the optimal Bayes risk, making it a statistically consistent rule.
  arXiv  Detail & Related papers  (2022-01-19T16:13:09Z)
• Deep Relational Metric Learning [84.95793654872399]
  This paper presents a deep relational metric learning framework for image clustering and retrieval. We learn an ensemble of features that characterizes an image from different aspects to model both interclass and intraclass distributions. Experiments on the widely-used CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate that our framework improves existing deep metric learning methods and achieves very competitive results.
  arXiv  Detail & Related papers  (2021-08-23T09:31:18Z)
• Tensor-based Intrinsic Subspace Representation Learning for Multi-view Clustering [18.0093330816895]
  We propose a novel-based Intrinsic Subspace Representation (TISRL) for multi-view clustering in this paper. It can be seen that specific information contained in different views is fully investigated by the rank preserving decomposition. Experimental results on nine common used real-world multi-view datasets illustrate the superiority of TISRL.
  arXiv  Detail & Related papers  (2020-10-19T03:36:18Z)
• Siloed Federated Learning for Multi-Centric Histopathology Datasets [0.17842332554022694]
  This paper proposes a novel federated learning approach for deep learning architectures in the medical domain. Local-statistic batch normalization (BN) layers are introduced, resulting in collaboratively-trained, yet center-specific models. We benchmark the proposed method on the classification of tumorous histopathology image patches extracted from the Camelyon16 and Camelyon17 datasets.
  arXiv  Detail & Related papers  (2020-08-17T15:49:30Z)
• Out-of-distribution Generalization via Partial Feature Decorrelation [72.96261704851683]
  We present a novel Partial Feature Decorrelation Learning (PFDL) algorithm, which jointly optimize a feature decomposition network and the target image classification model. The experiments on real-world datasets demonstrate that our method can improve the backbone model's accuracy on OOD image classification datasets.
  arXiv  Detail & Related papers  (2020-07-30T05:48:48Z)
• Sequential Hierarchical Learning with Distribution Transformation for Image Super-Resolution [83.70890515772456]
  We build a sequential hierarchical learning super-resolution network (SHSR) for effective image SR. We consider the inter-scale correlations of features, and devise a sequential multi-scale block (SMB) to progressively explore the hierarchical information. Experiment results show SHSR achieves superior quantitative performance and visual quality to state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-07-19T01:35:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.