Researchers have developed polynomial-time algorithms for learning positive ReLU networks, specifically addressing scenarios with standard Gaussian inputs. The algorithms achieve polynomial sample and real-arithmetic complexity without requiring separation or conditioning assumptions on hidden directions. The work combines implicit Hermite moments, orthogonal tensor-train compression, and a direction decoder to bound the probability of returning a direction far from any atom. This research also establishes projective direction recovery and confidence amplification with sample complexity proportional to the logarithm of the reciprocal failure probability. AI
IMPACT Advances theoretical understanding of neural network learning capabilities.
RANK_REASON Academic paper on a theoretical machine learning topic. [lever_c_demoted from research: ic=1 ai=1.0]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →