First Fully Polynomial-Time Algorithm Learns Positive ReLU Combinations
This story is from 2026-10-26. It is preserved in the archive; the latest stories are on the live feed.
Researchers give the first fully polynomial-time PAC algorithm for learning positive linear combinations of k ReLUs under Gaussian inputs in L2 loss. It uses polynomial samples and time in dimension, k, and inverse error, unlike prior methods requiring super-polynomial time or strong conditioning a…
Read the full story at DEV Community — Machine Learning ↗
Timeline · 1 report
- 2026-10-26 06:59 · DEV Community — Machine Learning
First Fully Polynomial-Time Algorithm Learns Positive ReLU Combinations