Resumen
The challenge of classification at the network edge is that due to limited computational resources, the edge must transmit the data to a server for processing. However, the communication constraints at the edge necessitate that these devices compress data before transmission. The question this paper aims to answer is how to efficiently compress and transmit this information in order to achieve timely and accurate edge classification. To that end, we develop scheduling algorithms that optimize age of information (AoI) and classification accuracy. Our analysis reveals that in scenarios with multiple available compression levels, an algorithm that selects at most two compression levels can achieve good theoretical performance guarantees. Numerical results indicate that double-level compression algorithms yield near-optimal performance, suggesting that for many classification tasks, numerous compression levels are unnecessary - only two are sufficient, significantly reducing the storage demands on devices and simplifying the overall system design.
| Idioma original | English |
|---|---|
| Título de la publicación alojada | MobiHoc 2025 - Proceedings of the 2025 International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing. |
| Páginas | 301-310 |
| Número de páginas | 10 |
| ISBN (versión digital) | 9798400713538 |
| DOI | |
| Estado | Published - oct 23 2025 |
| Evento | 26th International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, MobiHoc 2025 - Houston, United States Duración: oct 27 2025 → oct 30 2025 |
Serie de la publicación
| Nombre | MobiHoc 2025 - Proceedings of the 2025 International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing. |
|---|
Conference
| Conference | 26th International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, MobiHoc 2025 |
|---|---|
| País/Territorio | United States |
| Ciudad | Houston |
| Período | 10/27/25 → 10/30/25 |
Nota bibliográfica
Publisher Copyright:© 2025 Copyright held by the owner/author(s).
Financiación
This work has been supported in part by NSF grants NSF AI Institute (AI-EDGE) CNS-2112471, CNS-2106933, CNS-2106932, CNS2106679, CNS-2312836, CNS-2007231, CNS-1955535, and CNS-1901057, by the Office of Naval Research under Grant N00014- 19-1-2621 and N00014-24-1-2729., by Army Research Office under Grants W911NF-21-1-0244 and W911NF-24-1-0103, and was sponsored by the Army Research Laboratory and was accomplished under Cooperative Agreement Number W911NF-23-2-0225. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein
| Financiadores | Número del financiador |
|---|---|
| National Science Foundation Arctic Social Science Program | CNS-1955535, CNS-1901057, CNS-2112471, CNS-2007231, CNS-2312836, CNS-2106932, CNS2106679, CNS-2106933 |
| Office of Naval Research Naval Academy | N00014- 19-1-2621 |
| DEVCOM Army Research Laboratory | W911NF-23-2-0225 |
| Army Research Office | W911NF-24-1-0103, W911NF-21-1-0244 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
- Artificial Intelligence
- Computer Science Applications
- Hardware and Architecture
Huella
Profundice en los temas de investigación de 'Two Levels Are All You Need: Simplifying Data Compression for Timely Edge Classification'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver