# Hierarchical Data Reduction and Learning

**Authors:** Prashant Shekhar, Abani Patra

arXiv: 1906.11426 · 2019-10-23

## TL;DR

This paper introduces a hierarchical learning method for creating sparse data representations that effectively reduce data size while maintaining accuracy, with proven stability and convergence properties across various datasets.

## Contribution

It presents a novel hierarchical approach for data reduction that guarantees stability, convergence, and efficient data reconstruction, applicable to diverse datasets.

## Key findings

- Effective data reduction for synthetic and real datasets
- Accurate data reconstruction with minimized prediction error
- Stable and convergent approximation process

## Abstract

This paper describes a hierarchical learning strategy for generating sparse representations of multivariate datasets. The hierarchy arises from approximation spaces considered at successively finer scales. A detailed analysis of stability, convergence and behavior of error functionals associated with the approximations are presented, along with a well chosen set of applications. Results show the performance of the approach as a data reduction mechanism for both synthetic (univariate and multivariate) and real datasets (geospatial and numerical model outcomes). The sparse representation generated is shown to efficiently reconstruct data and minimize error in prediction.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1906.11426/full.md

## Figures

14 figures with captions in the complete paper: https://tomesphere.com/paper/1906.11426/full.md

## References

26 references — full list in the complete paper: https://tomesphere.com/paper/1906.11426/full.md

---
Source: https://tomesphere.com/paper/1906.11426