A Uniform Lower Bound on Weights of Perceptrons
From MaRDI portal
Publication:3503644
DOI10.1007/978-3-540-79709-8_27zbMath1142.94400OpenAlexW1569748117MaRDI QIDQ3503644
Publication date: 5 June 2008
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_27
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Weights of exact threshold functions ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Breaking the Minsky--Papert Barrier for Constant-Depth Circuits ⋮ A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ Unnamed Item ⋮ Degree-uniform lower bound on the weights of polynomials with given sign function
This page was built for publication: A Uniform Lower Bound on Weights of Perceptrons
