arXiv (All)
open access
Personalized Projected Ascent for Federated Stackelberg Optimization
Federated minimax problems, such as distributionally robust optimization and adversarial training, include an inner maximization variable built from each client's local data. These variables differ in meaning and dimension from one client to the next, so averaging them across clients, as standard fe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bayesian Optimization with Rich Auxiliary Information via LLMs#1014031
- Solving Finite-sum Coupled Compositional Optimization via Multi-block-Single-probe Estimator#1109694
- Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds#1116072
- Can Adaptive Gradient Methods Converge under Heavy-Tailed Noise? A Case Study of AdaGrad#200482
- CRAD: Class-wise Reliability-Aware Distillation for Decentralized Heterogeneous Federated Learning#819894
Record · ID 1356631
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive