arXiv (All)
open access
Sparse Data Augmentation for Optimization with Provable Guarantees
In nonconvex optimization problems arising in geometric machine learning, data augmentation is commonly used to promote invariance by averaging empirical losses over transformations of the data. Computing the fully augmented objective, however, requires access to every element of the transformation
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
- An Adaptive Augmented Lagrangian Method for Deterministic and Stochastic Nonconvex Optimization#780975
- An Adaptive Augmented Lagrangian Method for Deterministic and Stochastic Nonconvex Optimization#779600
- Totoro$^+$: An Adaptive and Scalable Edge Federated Learning System#229472
- Experimental data reuploading with provable enhanced learning capabilities.#3733
- Bridging Machine Learning and Electron Density Theory with Adaptive Real-Space Integration#609499
Record · ID 1013678
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