A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
From MaRDI portal
Publication:3440259
DOI10.1137/S0895480103426765zbMath1115.68092MaRDI QIDQ3440259
Publication date: 22 May 2007
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Computational learning theory (68Q32) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (4)
Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight Approximation of Halfspaces ⋮ Improved approximation of linear threshold functions ⋮ The inverse Shapley value problem ⋮ Testing (Subclasses of) Halfspaces
This page was built for publication: A Bound on the Precision Required to Estimate a Boolean Perceptron from Its Average Satisfying Assignment
