Hacktoberfest 2026 : les issues que les mainteneurs ont marquées pour octobre, ouvertes et accessibles aux débutants. Parcourir les issues Hacktoberfest

Deeper guide: FL algorithms, FL setups, and worked sketches beyond MNIST

Ouverte
#240 0 commentaires 0 réactions 0 personnes assignées Voir sur GitHub

Les mainteneurs répondent en général sous 1 jour

Personne n'a encore pris cette issue.

Évaluation

Difficulté
5/5
Temps estimé
Plus d'une semaine
Accessibilité débutants
48/100
Type d'issue
Documentation
Clarté
Clairement spécifiée
Activité
Active
Stack technique
python
Domaine
documentation

Piste de recherche

Start with Documentation/public/what-can-be-trained.md and services.md, then inspect client.py and aggregator.py to map the listed algorithms and FL setups to the train → audit → aggregate loop. Keep tested behavior distinct from untested sketches, and cover evaluation beyond MNIST. Done when the companion page is linked from both existing pages and gives model owners the requested service map and two non-MNIST sketches.

Rédigé par le modèle d'indexation à partir du texte de l'issue.

Description

documentation good first issue

Related: issue No. 157, PR No. 189, P3-DOC1, P3-DOC4

Why this would help

Issue No. 157 produced Documentation/public/what-can-be-trained.md, merged in PR No. 189. That page deliberately stays short and separates what has been tested from what is only possible. The proposed outline on issue No. 157 also had deeper sections that weren't shipped. A model owner who already knows FL can't yet see how a particular algorithm or FL setup maps onto DIN's train → audit → aggregate loop, or what a non-MNIST task would look like in practice.

Suggested next step

Write a companion page for readers who want more detail, linked from what-can-be-trained.md and services.md. Keep the tested-vs-possible labeling the current page uses, and cover:

  • FL algorithms: how FedAvg, FedProx, FedOpt (FedAdam/FedYogi/FedAdagrad), SCAFFOLD, FedNova and q-FFL fit the GI loop, and which service file each one touches (client.py, aggregator.py). Also how Byzantine-robust aggregators (Krum, trimmed mean, coordinate-wise median) sit alongside auditor scoring.
  • FL setups: horizontal (the default), vertical (entity alignment, split-model services), heterogeneity-aware (HeteroFL/FjORD-style sub-models), personalized, and federated transfer learning. For each, what changes in the services.
  • Worked sketches, each clearly labeled as untested:
    • a FedLoRA/FedQLoRA LLM fine-tune where only adapter weights move through IPFS
    • a tabular regression model with its own scoring function
  • How results are evaluated beyond MNIST: choosing a held-out test set and a scoring function that fits the task, and how that relates to auditor/BlockFLow scoring.

Expected outcome

A model owner can see which service changes their algorithm or FL setup needs, and has at least two non-MNIST sketches to start from. Nothing untested is presented as supported.

Turning any of these sketches into a tested reference implementation is a separate task.

Langage dominant
Python
Étoiles
4
Forks
7
Merge moyen
3 j 4 h
PR mergées (30 j)
34

Préparer son environnement

Ce projet ne fournit ni conteneur de développement, ni Dockerfile, ni guide de contribution : l'installation est à votre charge. Commencez par son README, et consultez notre guide de la première contribution pour les étapes générales.

Par où commencer

  1. Lisez l'issue en entier, puis le guide de contribution du projet.
  2. Signalez en commentaire que vous la prenez — cela évite que deux personnes fassent le même travail.
  3. Forkez le dépôt et travaillez sur une branche.
  4. Ouvrez une pull request qui référence le numéro de l'issue.

Autres issues de InfiniteZeroFoundation/DevNet

Toutes les issues de InfiniteZeroFoundation/DevNet

Issues similaires

Plus d'issues Python

Recevez les nouvelles issues par e-mail

Un résumé court des issues GitHub adaptées aux débutants.