scientific article
From MaRDI portal
Publication:3093360
zbMath1222.68087MaRDI QIDQ3093360
Adam R. Klivans, Rocco A. Servedio
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v7/klivans06a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (13)
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits ⋮ Breaking the Minsky--Papert Barrier for Constant-Depth Circuits ⋮ The Power of Asymmetry in 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 Short List of Equalities Induces Large Sign-Rank ⋮ A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ ⋮ Unnamed Item ⋮ Classification with guaranteed probability of error ⋮ Learning customized and optimized lists of rules with mathematical programming ⋮ Improved learning of \(k\)-parities ⋮ On the fusion of threshold classifiers for categorization and dimensionality reduction ⋮ Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ ⋮ Unnamed Item
This page was built for publication:
