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