## Abstract

Improvements in computational and experimental capabilities are rapidly increasing the amount of scientific data that are routinely generated. In applications that are constrained by memory and computational intensity, excessively large datasets may hinder scientific discovery, making data reduction a critical component of data-driven methods. Datasets are growing in two directions: the number of data points and their dimensionality. Whereas dimension reduction typically aims at describing each data sample on lower-dimensional space, the focus here is on reducing the number of data points. A strategy is proposed to select data points such that they uniformly span the phase-space of the data. The algorithm proposed relies on estimating the probability map of the data and using it to construct an acceptance probability. An iterative method is used to accurately estimate the probability of the rare data points when only a small subset of the dataset is used to construct the probability map. Instead of binning the phase-space to estimate the probability map, its functional form is approximated with a normalizing flow. Therefore, the method naturally extends to high-dimensional datasets. The proposed framework is demonstrated as a viable pathway to enable data-efficient machine learning when abundant data are available.

Original language | American English |
---|---|

Article number | e11 |

Number of pages | 28 |

Journal | Data-Centric Engineering |

Volume | 4 |

Issue number | 7 |

DOIs | |

State | Published - 25 Apr 2023 |

### Bibliographical note

See NREL/JA-2C00-81433 for preprint## NREL Publication Number

- NREL/JA-2C00-86434

## Keywords

- Data reduction
- instance selection
- normalizing flows