agnostic learningaverage sensitivitycontingency tablesinvariance principleslimit theoremsnoise sensitivitypolytopespseudorandom generators
Computational aspects related to convexity (52B55) Central limit and other weak theorems (60F05) Contingency tables (62H17) Random number generation in numerical analysis (65C10) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Recommendations
- An invariance principle for polytopes
- The invariator principle in convex geometry
- scientific article; zbMATH DE number 3868122
- Assigning invariant polynomials over polytopes
- Invariance of Hironaka's characteristic polyhedron
- Applications of new affine invariant for polytopes
- Rigidity and polynomial invariants of convex polytopes
- Buchstaber invariant of simple polytopes
- scientific article; zbMATH DE number 17712
- Invariant polytopes of linear systems
Cited in
(10)- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- An invariance property for frameworks in Euclidean space
- scientific article; zbMATH DE number 3868122 (Why is no real title available?)
- The average sensitivity of an intersection of half spaces
- Buchstaber invariant of simple polytopes
- Pseudorandom generators for combinatorial checkerboards
- The invariator principle in convex geometry
- An invariance principle for polytopes
- The polyhedral Lagrange principle
- Testing distributional assumptions of learning algorithms
This page was built for publication: An invariance principle for polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875181)