A Two-Stage Data Selection Framework for Data-Efficient Model Training on Edge Devices
The demand for machine learning (ML) model training on edge devices is escalating due to data privacy and personalized service needs. However, we observe that current on-device model training is hampered by the under-utilization of on-device data, due to low training throughput, limited storage and diverse data importance. To improve data resource utilization, we propose a two-stage data selection framework {\sf Titan} to select the most important data batch from streaming data for model training with guaranteed efficiency and effectiveness. Specifically, in the first stage, {\sf Titan} filters out a candidate dataset with potentially high importance in a coarse-grained manner.In the second stage of fine-grained selection, we propose a theoretically optimal data selection strategy to identify the data batch with the highest model performance improvement to current training round. To further enhance time-and-resource efficiency, {\sf Titan} leverages a pipeline to co-execute data selection and model training, and avoids resource conflicts by exploiting idle computing resources. We evaluate {\sf Titan} on real-world edge devices and three representative edge computing tasks with diverse models and data modalities. Empirical results demonstrate that {\sf Titan} achieves up to $43\%$ reduction in training time and $6.2\%$ increase in final accuracy with minor system overhead, such as data processing delay, memory footprint and energy consumption.
Code (0)
등록된 구현이 없습니다.
Tasks
Edge-computingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Multi-stage Dynamic Selection for Cross-Project Defect Prediction
Cross-Project Defect Prediction (CPDP) involves building models using data from external projects, called training projects, to predict modules from the target project. However, traditional CPDP methods suffer from the d…
A novel feature selection framework for incomplete data
Feature selection on incomplete datasets is an exceptionally challenging task. Existing methods address this challenge by first employing imputation methods to complete the incomplete data and then conducting feature sel…
Feature Importancefeature selectionImputationMissing ValuesPSSCL: A progressive sample selection framework with contrastive loss designed for noisy labels
Large-scale image datasets frequently contain unavoidable noisy labels, resulting in overfitting in deep neural networks and declining performance. Most existing methods for learning from noisy labels operate as one-stag…
Image ClassificationLearning with noisy labelsKTV: Keyframes and Key Tokens Selection for Efficient Training-Free Video LLMs
Training-free video understanding leverages the strong image comprehension capabilities of pre-trained vision language models (VLMs) by treating a video as a sequence of static frames, thus obviating the need for costly …
Full Stage Learning to Rank: A Unified Framework for Multi-Stage Systems
The Probability Ranking Principle (PRP) has been considered as the foundational standard in the design of information retrieval (IR) systems. The principle requires an IR module's returned list of results to be ranked wi…
Information RetrievalLearning-To-RankRe-RankingRetrieval+1