Almost optimal adaptive proper learning polynomials
From MaRDI portal
Cites work
- A theory of the learnable
- Algorithmic and analysis techniques in property testing
- Applying Coding Theory to Sparse Interpolation
- Constructive proofs of concentration bounds
- Efficient sample extractors for juntas with applications
- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
- Introduction to Property Testing
- Learning functions represented as multiplicity automata
- Learning sparse multivariate polynomials over a field with queries and counterexamples.
- Near log-convexity of measured heat in (discrete) time and consequences
- On learning multivariate polynomials under the uniform distribution
- On Learning Ring-Sum-Expansions
- On Optimal Learning Algorithms for Multiplicity Automata
- On PAC learning algorithms for rich Boolean function classes
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Property testing. Current research and surveys
- Queries and concept learning
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- Robust Characterizations of Polynomials with Applications to Program Testing
- Self-testing/correcting with applications to numerical problems
- Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
This page was built for publication: Almost optimal adaptive proper learning polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7444395)