arXiv (All)
open access
Learning Positive Linear Combinations of ReLUs in Fully Polynomial Time
We study the fundamental problem of PAC learning positive linear combinations of $k$ arbitrary ReLU activations on $\mathbb{R}^d$ with respect to the Gaussian distribution, in $L_2$ loss. We give the first fully-polynomial time algorithm for this learning task. Specifically, our algorithm draws $\ma
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
- Learning Positive Linear Combinations of ReLUs in Fully Polynomial Time#1442343
- Deriving Approximate Message Passing from the Convex Gaussian Min-Max Theorem#1342543
- The inductive bias of ReLU networks on orthogonally separable data#449033
- The Gaussian Latent Machine: Efficient Prior and Posterior Sampling for Inverse Problems#144295
- Min-Max Grassmannian Optimization for Online Subspace Tracking#1062880
Record · ID 1448455
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