An efficient algorithm for decomposing a vector into two vectors with a small uniform norm

DOI10.1134/s0001434623110755MaRDI QIDQ6194322

D. G. Romskii, Boris S. Kashin

Publication date: 19 March 2024

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmdiameterfederated learning

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52)

Cites Work

• How to generate random matrices from the classical compact groups
• Greedy Approximation
• DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
• Uncertainty Principles and Vector Quantization
• Breaking the Communication-Privacy-Accuracy Trilemma

This page was built for publication: An efficient algorithm for decomposing a vector into two vectors with a small uniform norm