The average sensitivity of an intersection of half spaces

DOI10.1145/2591796.2591798MaRDI QIDQ5259578zbMATH OpenOpenAlexFDO

Authors Daniel M. Kane

Publication date 26 June 2015

Published in Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.2987

zbMATH Keywords

learning theorynoise sensitivitylinear threshold function

Mathematics Subject Classification ID

Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: We prove new bounds on the average sensitivity of the indicator function of an intersection of $k$ halfspaces. In particular, we prove the optimal bound of $O(sqrtnlog(k))$. This generalizes a result of Nazarov, who proved the analogous result in the Gaussian case, and improves upon a result of Harsha, Klivans and Meka. Furthermore, our result has implications for the runtime required to learn intersections of halfspaces.

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

Cites work

• scientific article; zbMATH DE number 5485440 (Why is no real title available?)
• scientific article; zbMATH DE number 5485574 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
• Bounds on the sample complexity for private learning and private data release
• Characterizing the sample complexity of private learners
• Collusion-secure fingerprinting for digital data
• Differential privacy and the fat-shattering dimension of linear queries
• Efficient algorithms for privately releasing marginals via convex relaxations
• Faster algorithms for privately releasing marginals
• Faster private release of marginals on small databases
• Interactive privacy via the median mechanism
• Iterative Constructions and Private Data Release
• Lower bounds in differential privacy
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• On the complexity of differentially private data release, efficient algorithms and hardness results
• On the geometry of differential privacy
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Theory of Cryptography

Cited in

(3)

• Fooling Polytopes
• Approximating the Noise Sensitivity of a Monotone Boolean Function
• The average sensitivity of an intersection of half spaces

Describes a project that uses

Uses Software

• SuLQ

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 Q5259578)