How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Two clients with shifted least-squares optima
Example
Consider two one-observation scalar least-squares clients with data and , using loss . Their objectives are and , with local minimizers and . The equal-client objective has minimizer . Starting FedAvg from , using both clients, two full-gradient local steps of size , and server scale , gives the server model after one round.
Example references
Facts & Assumptions
Given: The two client data points and FedAvg parameters in the Example.
Fixed-design least-squares, ridge, lasso, group, and fused objectives: a one-observation scalar least-squares loss is .
Federated objectives and client sampling: the equal-client objective is the arithmetic mean of client objectives.
Federated averaging (FedAvg): with all clients selected, the server adds the mean of their local model differences when .
Verification
By [F1], client 1 has derivative and minimizer ; client 2 has derivative and minimizer . The equal-client derivative is , so its unique zero and minimizer is .
From , the two local trajectories are and . Averaging the two final local models gives .
Since , this one-round FedAvg output is not the minimizer of the equal-client objective, although the clients' optima are shifted in opposite directions.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.