scientific article; zbMATH DE number 7359392
From MaRDI portal
Publication:4993325
DOI10.4230/LIPIcs.ITCS.2018.55zbMath1462.68086MaRDI QIDQ4993325
Publication date: 15 June 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Optimal detection of sparse principal components in high dimension
- A decision-theoretic generalization of on-line learning and an application to boosting
- Property testing and its connection to learning and approximation
- Agnostically Learning Halfspaces
- Relations between average case complexity and approximation complexity
- Computational limitations on learning from examples
- 10.1162/153244303321897690
- Computational Sample Complexity
- Strongly refuting random CSPs below the spectral threshold
- Computational and statistical tradeoffs via convex relaxation
- From average case complexity to improper learning complexity
- Complexity theoretic limitations on learning halfspaces
This page was built for publication:
