scientific article; zbMATH DE number 67631
From MaRDI portal
Publication:4013552
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
Cited in
(64)- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property
- An energy complexity model for algorithms
- Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- Learning nested concept classes with limited storage
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Modules of topological spaces, applications to homotopy limits and \(E_ \infty\) structures
- An equational approach to secure multi-party computation
- Evasiveness through a circuit lens (extended abstract)
- Runtime guarantees for regression problems
- Properties and applications of Boolean function composition
- Resource-based corruptions and the combinatorics of hidden diversity
- Reachability in graph timelines
- Time hierarchies for sampling distributions
- Welfare maximization and the supermodular degree
- dp-rank and forbidden configurations
- Teaching and Compressing for Low VC-Dimension
- scientific article; zbMATH DE number 67609 (Why is no real title available?)
- 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
- Is privacy compatible with truthfulness?
- Sorting noisy data with partial information
- Space-bounded communication complexity
- A characterization of approximation resistance for even \(k\)-partite CSPs
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Stronger methods of making quantum interactive proofs perfectly complete
- Approaching utopia, strong truthfulness and externality-resistant mechanisms
- New affine-invariant codes from lifting
- On the possibilities and limitations of pseudodeterministic algorithms
- Learnability of DNF with representation-specific queries
- Catch them if you can
- Results on learnability and the Vapnik-Chervonenkis dimension
- On the power of many one-bit provers
- Making evolution rigorous: the error threshold
- Barriers in cryptography with weak, correlated and leaky sources
- Sample Compression Schemes for Balls in Graphs
- \(H\)-wise independence
- Streaming computations with a loquacious prover
- Trial and error: A new approach to space-bounded learning
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- Publicly verifiable proofs of sequential work
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- Shifting: one-inclusion mistake bounds and sample compression
- Competing provers protocols for circuit evaluation
- Characterizing the sample complexity of private learners
- Massive online teaching to bounded learners
- Pseudo-partitions, transversality and locality, a combinatorial characterization for the space measure in algebraic proof systems
- General lower bounds on the query complexity within the exact learning model
- scientific article; zbMATH DE number 7561527 (Why is no real title available?)
- The garden-hose model
- Can theories be tested?
- Low-weight halfspaces for sparse boolean vectors
- Sparse extractor families for all the entropy
- Towards an optimal query efficient PCP?
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- On the convergence of the Hegselmann-Krause system
- Some new maximum VC classes
- Robust optimization in the presence of uncertainty
- Adversary lower bound for the \(k\)-sum problem
- A new PAC bound for intersection-closed concept classes
- The functions of finite support: a canonical learning problem
- scientific article; zbMATH DE number 67808 (Why is no real title available?)
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)
