Composable Core-sets for Diversity Approximation on Multi-Dataset Streams

08/10/2023
by   Stephanie Wang, et al.
0

Core-sets refer to subsets of data that maximize some function that is commonly a diversity or group requirement. These subsets are used in place of the original data to accomplish a given task with comparable or even enhanced performance if biases are removed. Composable core-sets are core-sets with the property that subsets of the core set can be unioned together to obtain an approximation for the original data; lending themselves to be used for streamed or distributed data. Recent work has focused on the use of core-sets for training machine learning models. Preceding solutions such as CRAIG have been proven to approximate gradient descent while providing a reduced training time. In this paper, we introduce a core-set construction algorithm for constructing composable core-sets to summarize streamed data for use in active learning environments. If combined with techniques such as CRAIG and heuristics to enhance construction speed, composable core-sets could be used for real time training of models when the amount of sensor data is large. We provide empirical analysis by considering extrapolated data for the runtime of such a brute force algorithm. This algorithm is then analyzed for efficiency through averaged empirical regression and key results and improvements are suggested for further research on the topic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2019

Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm

"Composable core-sets" are an efficient framework for solving optimizati...
research
06/26/2019

Selection Via Proxy: Efficient Data Selection For Deep Learning

Data selection methods such as active learning and core-set selection ar...
research
06/10/2022

In Defense of Core-set: A Density-aware Core-set Selection for Active Learning

Active learning enables the efficient construction of a labeled dataset ...
research
05/18/2019

On greedy heuristics for computing D-efficient saturated subsets

Let F be a set consisting of n real vectors of dimension m ≤ n. For any ...
research
10/24/2019

Preventing Adversarial Use of Datasets through Fair Core-Set Construction

We propose improving the privacy properties of a dataset by publishing o...
research
05/29/2019

Less is More: An Exploration of Data Redundancy with Active Dataset Subsampling

Deep Neural Networks (DNNs) often rely on very large datasets for traini...
research
10/04/2022

TripleE: Easy Domain Generalization via Episodic Replay

Learning how to generalize the model to unseen domains is an important a...

Please sign up or login with your details

Forgot password? Click here to reset