No article text was recorded for this version.
non-convex optimization gap (convexity assumption)
Version 1 of 136 papers37 conceptsfrozen 2026-10-04
Papers in this version
- Blog: FedNew: A Communication-Efficient and Privacy-Preserving Newton-Type Method for Federated Learning
- Blog: Sharper Generalization Guarantees for Asynchronous SGD: Beyond Lipschitzness, Smoothness and Data Homogeneity
- Blog: Linear Convergent Decentralized Optimization with Compression
- Blog: Distributed Conjugate Gradient Method via Conjugate Direction Tracking
- Blog: Byzantine Resilient Distributed Multi-Task Learning
- Blog: A Primal-Dual Algorithm for Faster Distributionally Robust Optimization
- Blog: Stochastic Alternating Direction Method of Multipliers for Byzantine-Robust Distributed Learning
- Blog: On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond
- Blog: Approximate Byzantine Fault-Tolerance in Distributed Optimization
- Blog: Communication Compression for Decentralized Learning With Operator Splitting Methods
- Blog: Supervised Learning Under Distributed Features
- Blog: Don't Compress Gradients in Random Reshuffling: Compress Gradient Differences
- Blog: Federated Learning in the Sky: Joint Power Allocation and Scheduling with UAV Swarms
- Blog: EF-BV: A Unified Theory of Error Feedback and Variance Reduction Mechanisms for Biased and Unbiased Compression in Distributed Optimization
- Blog: Communication-Efficient Distributed Optimization in Networks with Gradient Tracking and Variance Reduction
- Blog: Correlated Quantization for Distributed Mean Estimation and Optimization
- Blog: Federated Composite Optimization
- Blog: Boosting Fairness and Robustness in Over-the-Air Federated Learning
- Blog: Coupling-based Convergence Diagnostic and Stepsize Scheme for Stochastic Gradient Descent
- Blog: On Randomized Distributed Coordinate Descent with Quantized Updates
- Blog: Federated Learning for 6G: Applications, Challenges, and Opportunities
- Blog: Differentially Private Decentralized Learning with Random Walks
- Blog: Differential Error Feedback for Communication-Efficient Decentralized Optimization
- Blog: Multi-Agent Adversarial Training Using Diffusion Learning
- Blog: Network Newton
- Blog: SLowcalSGD : Slow Query Points Improve Local-SGD for Stochastic Convex Optimization
- Blog: When Edge Meets Learning: Adaptive Control for Resource-Constrained Distributed Machine Learning
- Blog: Mirror and Preconditioned Gradient Descent in Wasserstein Space
- Blog: A Unified Theory of SGD: Variance Reduction, Sampling, Quantization and Coordinate Descent
- Blog: A Collaborative Learning Framework via Federated Meta-Learning
- Blog: Nested Distributed Gradient Methods with Stochastic Computation Errors
- Blog: Tighter Theory for Local SGD on Identical and Heterogeneous Data
- Blog: DQ-SGD: Dynamic Quantization in SGD for Communication-Efficient Distributed Learning
- Blog: Agnostic Learning with Multiple Objectives
- Blog: Network Gradient Descent Algorithm for Decentralized Federated Learning
- Blog: Convergence guarantees for a class of non-convex and non-smooth optimization problems
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_non_convex_optimization_gap_convexity_as_4d7efd07,
title = {non-convex optimization gap (convexity assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-optimization-gap-convexity-assumption/rdr_4d7efd07cb9449eeb4a453f607933601},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_non_convex_optimization_gap_convexity_as_4d7efd07_v1,
title = {non-convex optimization gap (convexity assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-optimization-gap-convexity-assumption/rdr_4d7efd07cb9449eeb4a453f607933601/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}