Non-Asymptotic Performance of Social Machine Learning Under Limited Data
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910518941319168 |
|---|---|
| author | Hu, Ping Bordignon, Virginia Kayaalp, Mert Sayed, Ali H. |
| author_facet | Hu, Ping Bordignon, Virginia Kayaalp, Mert Sayed, Ali H. |
| contents | This paper studies the probability of error associated with the social machine learning framework, which involves an independent training phase followed by a cooperative decision-making phase over a graph. This framework addresses the problem of classifying a stream of unlabeled data in a distributed manner. In this work, we examine the classification task with limited observations during the decision-making phase, which requires a non-asymptotic performance analysis. We establish a condition for consistent training and derive an upper bound on the probability of error for classification. The results clarify the dependence on the statistical properties of the data and the combination policy used over the graph. They also establish the exponential decay of the probability of error with respect to the number of unlabeled samples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_09397 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Non-Asymptotic Performance of Social Machine Learning Under Limited Data Hu, Ping Bordignon, Virginia Kayaalp, Mert Sayed, Ali H. Machine Learning Multiagent Systems Signal Processing This paper studies the probability of error associated with the social machine learning framework, which involves an independent training phase followed by a cooperative decision-making phase over a graph. This framework addresses the problem of classifying a stream of unlabeled data in a distributed manner. In this work, we examine the classification task with limited observations during the decision-making phase, which requires a non-asymptotic performance analysis. We establish a condition for consistent training and derive an upper bound on the probability of error for classification. The results clarify the dependence on the statistical properties of the data and the combination policy used over the graph. They also establish the exponential decay of the probability of error with respect to the number of unlabeled samples. |
| title | Non-Asymptotic Performance of Social Machine Learning Under Limited Data |
| topic | Machine Learning Multiagent Systems Signal Processing |
| url | https://arxiv.org/abs/2306.09397 |