mlsanityData to 14 Oct 2026

Latent Code-Based Fusion: A Volterra Neural Network Approach

arXiv 2104.04829 ↗First posted 10 Apr 2021cs.CV cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose a deep structure encoder using the recently introduced Volterra Neural Networks (VNNs) to seek a latent representation of multi-modal data whose features are jointly captured by a union of subspaces. The so-called self-representation embedding of the latent codes leads to a simplified fusion which is driven by a similarly constructed decoding. The Volterra Filter architecture achieved reduction in parameter complexity is primarily due to controlled non-linearities being introduced by the higher-order convolutions in contrast to generalized activation functions. Experimental results on two different datasets have shown a significant improvement in the clustering performance for VNNs auto-encoder over conventional Convolutional Neural Networks (CNNs) auto-encoder. In addition, we also show that the proposed approach demonstrates a much-improved sample complexity over CNN-based auto-encoder with a superb robust classification performance.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 29 references that are in the map. First posted on arXiv 10 Apr 2021.

Builds on

8 of 29 references.

References · 8

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2014Going Deeper with Convolutionscited by 4,241
  3. 2017Non-linear Convolution Filters for CNN-based Learningcited by 38
  4. 2018Deep Multimodal Subspace Clustering Networkscited by 31
  5. 2018Cross-Modality Distillation: A case for Conditional Generative Adversarial Networkscited by 11
  6. 2019Volterra Neural Networks (VNNs)cited by 5
  7. 2020Robust Group Subspace Recovery: A New Approach for Multi-Modality Data Fusioncited by 3
  8. 2018Decision Level Fusion: An Event Driven Approachcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

2 papers.