Pith. Sign in

RECORD

Robust softmax aggregation on blockchain based federated learning with convergence guarantee

Cryptography and Security · Submitted 13 Nov 2023

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

The authors' main claim Our comprehensive experiments show that our framework outperforms existing robust aggregation algorithms in various settings by large margins.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2311.07027 (version 2)
Pith IDRWBYJTQA, Pith's permanent record of this paper and its review
CitationDiego Klabjan, Huiyu Wu. "Robust softmax aggregation on blockchain based federated learning with convergence guarantee." arXiv:2311.07027 (2023). https://pith.science/paper/RWBYJTQA
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, 4,966 input tokens.

What the abstract itself states, as probabilities: claims first 0.12 · states limitation 0.14 · human participants 0.07 · controlled comparison 0.67 · randomized assignment 0.02 · states quantitative result 0.08 · compares with prior results 0.95 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

Blockchain based federated learning is a distributed learning scheme that allows model training without participants sharing their local data sets, where the blockchain components eliminate the need for a trusted central server compared to traditional Federated Learning algorithms. In this paper we propose a softmax aggregation blockchain based federated learning framework. First, we propose a new blockchain based federated learning architecture that utilizes the well-tested proof-of-stake consensus mechanism on an existing blockchain network to select validators and miners to aggregate the participants' updates and compute the blocks. Second, to ensure the robustness of the aggregation process, we design a novel softmax aggregation method based on approximated population loss values that relies on our specific blockchain architecture. Additionally, we show our softmax aggregation technique converges to the global minimum in the convex setting with non-restricting assumptions. Our comprehensive experiments show that our framework outperforms existing robust aggregation algorithms in various settings by large margins.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Blockchain based federated learning is a distributed learning scheme that allows model training without participants sharing their local data sets, where the blockchain components eliminate the need for a trusted central server compared to traditional Federated Learning algorithms. background 1.00 0.05 0.03 asserted 1.00
s1 In this paper we propose a softmax aggregation blockchain based federated learning framework. contribution 1.00 0.86 0.07 asserted 0.96
s2 First, we propose a new blockchain based federated learning architecture that utilizes the well-tested proof-of-stake consensus mechanism on an existing blockchain network to select validators and miners to aggregate the participants' updates and compute the blocks. method 0.71 0.85 0.05 asserted 1.00
s3 Second, to ensure the robustness of the aggregation process, we design a novel softmax aggregation method based on approximated population loss values that relies on our specific blockchain architecture. method 0.54 0.95 0.08 asserted 1.00
s4 Additionally, we show our softmax aggregation technique converges to the global minimum in the convex setting with non-restricting assumptions. result 0.62 0.94 0.18 asserted 1.00
s5 Our comprehensive experiments show that our framework outperforms existing robust aggregation algorithms in various settings by large margins. result 1.00 0.96 0.72 asserted 1.00

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

What was examined, and what was not

sources read
  • arXiv listing abstract v2
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

Blockchain based federated learning is a distributed learning scheme that allows model training without participants sharing their local data sets, where the blockchain components eliminate the need for a trusted central server compared to traditional Federated Learning algorithms. In this paper we propose a softmax aggregation blockchain based federated learning framework. First, we propose a new blockchain based federated learning architecture that utilizes the well-tested proof-of-stake consensus mechanism on an existing blockchain network to select validators and miners to aggregate the participants' updates and compute the blocks. Second, to ensure the robustness of the aggregation process, we design a novel softmax aggregation method based on approximated population loss values that relies on our specific blockchain architecture. Additionally, we show our softmax aggregation technique converges to the global minimum in the convex setting with non-restricting assumptions. Our comprehensive experiments show that our framework outperforms existing robust aggregation algorithms in various settings by large margins.

Human review
References
How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Discussion

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