Abnormal Local Clustering in Federated Learning

Jihwan Won

RECORD

Abnormal Local Clustering in Federated Learning

Jihwan Won

Machine Learning · Submitted 26 Aug 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In a federated classification model, this method divided locals into normal and abnormal.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗

Cite ▾

Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,507 input tokens.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.06 · human participants 0.10 · controlled comparison 0.07 · randomized assignment 0.02 · states quantitative result 0.04 · compares with prior results 0.06 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; show every role.

Federated learning is a model for privacy without revealing private data by transfer models instead of personal and private data from local client devices. While, in the global model, it's crucial to recognize each local data is normal. This paper suggests one method to separate normal locals and abnormal locals by Euclidean similarity clustering of vectors extracted by inputting dummy data in local models. In a federated classification model, this method divided locals into normal and abnormal.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#	sentence	role	the authors' own work	states the main conclusion	strength
s0	Federated learning is a model for privacy without revealing private data by transfer models instead of personal and private data from local client devices.	background 1.00	0.05	0.03	asserted 1.00
s1	While, in the global model, it's crucial to recognize each local data is normal.	background 0.89	0.06	0.04	asserted 0.95
s2	This paper suggests one method to separate normal locals and abnormal locals by Euclidean similarity clustering of vectors extracted by inputting dummy data in local models.	method 0.86	0.82	0.32	hedged possibility 0.98
s3	In a federated classification model, this method divided locals into normal and abnormal.	result 0.91	0.86	0.35	asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.76.

What was examined, and what was not

sources read

arXiv listing abstract v1

not examined

full text
figures and tables
references and citing sentences
relations to other papers

levels run

P abstract

not run

S sections
T body sentences
C citations
R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper

Original abstract

Federated learning is a model for privacy without revealing private data by transfer models instead of personal and private data from local client devices. While, in the global model, it's crucial to recognize each local data is normal. This paper suggests one method to separate normal locals and abnormal locals by Euclidean similarity clustering of vectors extracted by inputting dummy data in local models. In a federated classification model, this method divided locals into normal and abnormal.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.