The average sensitivity of an intersection of half spaces

DOI10.1186/S40687-014-0013-6zbMATH Open1349.68150OpenAlexW2568004999WikidataQ59400398 ScholiaQ59400398MaRDI QIDQ347457FDOQ347457

Authors: Daniel M. Kane 

Publication date: 30 November 2016

Published in: Research in the Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s40687-014-0013-6

Recommendations

• The average sensitivity of an intersection of half spaces
• Improved Lower Bounds for Learning Intersections of Halfspaces
• Unconditional lower bounds for learning intersections of halfspaces
• A random-sampling-based algorithm for learning intersections of halfspaces
• Bounding the sensitivity of polynomial threshold functions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Random convex sets and integral geometry (aspects of convex geometry) (52A22) Computer-aided design (modeling of curves and surfaces) (65D17) Combinatorial complexity of geometric structures (52C45)

Cites Work

• Spectral properties of threshold functions
• Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
• An invariance principle for polytopes
• Agnostically Learning Halfspaces

Cited In (3)

• Maximal surface area of polytopes with respect to log-concave rotation invariant measures
• The average sensitivity of an intersection of half spaces
• Approximating Boolean functions with depth-2 circuits

This page was built for publication: The average sensitivity of an intersection of half spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347457)