MétaCan
Menu
Back to cohort
Record W4384575270 · doi:10.23952/asvao.5.2023.2.07

Federated learning on Riemannian manifolds

2023· article· en· W4384575270 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueApplied Set-Valued Analysis and Optimization · 2023
Typearticle
Languageen
FieldComputer Science
TopicStochastic Gradient Optimization Techniques
Canadian institutionsnot available
FundersUniversity of California, DavisRice UniversityNational Science Foundation
KeywordsConvergence (economics)Rate of convergenceSmart phoneComputer scienceRiemannian geometryMathematicsMachine learningMathematical optimizationPure mathematicsEconomicsTelecommunications

Abstract

fetched live from OpenAlex

Federated learning (FL) has found many important applications in smart-phone-APP based machine learning applications.Although many algorithms have been studied for FL, to the best of our knowledge, algorithms for FL with nonconvex constraints have not been studied.This paper studies FL over Riemannian manifolds, which finds important applications such as federated PCA and federated kPCA.We propose a Riemannian federated SVRG (RFedSVRG) method to solve federated optimization over Riemannian manifolds.We analyze its convergence rate under different scenarios.Numerical experiments are conducted to compare RFedSVRG with the Riemannian counterparts of FedAvg and FedProx.We observed from the numerical experiments that the advantages of RFedSVRG are significant.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.859
Threshold uncertainty score0.811

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.005
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.247
Teacher spread0.232 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it