Deep Haar Scattering Networks
Not on the map. Why?
Abstract (arXiv)
An orthogonal Haar scattering transform is a deep network, computed with a hierarchy of additions, subtractions and absolute values, over pairs of coefficients. It provides a simple mathematical model for unsupervised deep network learning. It implements non-linear contractions, which are optimized for classification, with an unsupervised pair matching algorithm, of polynomial complexity. A structured Haar scattering over graph data computes permutation invariant representations of groups of connected points in the graph. If the graph connectivity is unknown, unsupervised Haar pair learning can provide a consistent estimation of connected dyadic groups of points. Classification results are given on image data bases, defined on regular grids or graphs, with a connectivity which may be known or unknown.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Sep 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 0; 2025: 1.
5 papers.
- 2021Multiresolution Equivariant Graph Variational Autoencodercited by 20
- 2022Continuous Generative Neural Networks: A Wavelet-Based Architecture in Function Spacescited by 6
- 2022Wavelet Regularization Benefits Adversarial Trainingcited by 3
- 2023Multiscale Hodge Scattering Networks for Data Analysiscited by 1
- 2025The Maximal Overlap Discrete Wavelet Scattering Transform and Its Application in Classification Taskscited by 1
- 2025The Maximal Overlap Discrete Wavelet Scattering Transform and Its Application in Classification Tasks23 May 2025
- 2023Multiscale Hodge Scattering Networks for Data Analysis17 Nov 2023
- 2022Wavelet Regularization Benefits Adversarial Training8 Jun 2022
- 2022Continuous Generative Neural Networks: A Wavelet-Based Architecture in Function Spaces29 May 2022
- 2021Multiresolution Equivariant Graph Variational Autoencoder2 Jun 2021