scientific article
From MaRDI portal
Publication:4013552
zbMATH Open0747.68041MaRDI QIDQ4013552FDOQ4013552
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
- Results on learnability and the Vapnik-Chervonenkis dimension
- Trial and error: A new approach to space-bounded learning
- VC Dimension Bounds for Analytic Algebraic Computations
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
- Learnability and the Vapnik-Chervonenkis dimension
concept learninglearning from examplesVapnik-Chervonenkis (VC) dimensionspace-bounded learning algorithm
Cited In (64)
- The functions of finite support: a canonical learning problem
- Title not available (Why is that?)
- Sorting noisy data with partial information
- On the possibilities and limitations of pseudodeterministic algorithms
- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property
- Teaching and Compressing for Low VC-Dimension
- Sample Compression Schemes for Balls in Graphs
- The garden-hose model
- H-wise independence
- Differentially private data analysis of social networks via restricted sensitivity
- On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
- On the power of nonuniformity in proofs of security
- Space-bounded communication complexity
- On the power of conditional samples in distribution testing
- Properties and applications of boolean function composition
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- Adversary lower bound for the k-sum problem
- Streaming computations with a loquacious prover
- Learning nested concept classes with limited storage
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- General lower bounds on the query complexity within the exact learning model
- Some new maximum VC classes
- Results on learnability and the Vapnik-Chervonenkis dimension
- Trial and error: A new approach to space-bounded learning
- New affine-invariant codes from lifting
- An energy complexity model for algorithms
- Evasiveness through a circuit lens
- On the power of many one-bit provers
- Learning and incentives in user-generated content
- Reachability in graph timelines
- Massive online teaching to bounded learners
- Learnability of DNF with representation-specific queries
- Competing provers protocols for circuit evaluation
- On the convergence of the Hegselmann-Krause system
- Welfare maximization and the supermodular degree
- Title not available (Why is that?)
- Characterizing the sample complexity of private learners
- Pseudo-partitions, transversality and locality
- Learning mixtures of spherical gaussians
- Stronger methods of making quantum interactive proofs perfectly complete
- Catch them if you can
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Approaching utopia
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
- An equational approach to secure multi-party computation
- Can theories be tested?
- Low-weight halfspaces for sparse boolean vectors
- Making evolution rigorous
- Sparse extractor families for all the entropy
- Towards an optimal query efficient PCP?
- Robust optimization in the presence of uncertainty
- dp-rank and forbidden configurations
- Modules of topological spaces, applications to homotopy limits and \(E_ \infty\) structures
- Runtime guarantees for regression problems
- Barriers in cryptography with weak, correlated and leaky sources
- Is privacy compatible with truthfulness?
- Title not available (Why is that?)
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
- Resource-based corruptions and the combinatorics of hidden diversity
- Publicly verifiable proofs of sequential work
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Time hierarchies for sampling distributions
- A characterization of approximation resistance for even k-partite CSPs
- Shifting: one-inclusion mistake bounds and sample compression
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013552)
