scientific article; zbMATH DE number 67625
From MaRDI portal
Publication:4013545
zbMATH Open0752.68066MaRDI QIDQ4013545FDOQ4013545
Authors: Nicholas Littlestone 
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
Cited In (73)
- Title not available (Why is that?)
- Improved learning of \(k\)-parities
- On-line learning in parity machines
- Sorting noisy data with partial information
- On the possibilities and limitations of pseudodeterministic algorithms
- Structural results about exact learning with unspecified attribute values
- Optimality of SVM: novel proofs and tighter bounds
- Offline to online conversion
- The garden-hose model
- Evasiveness through a circuit lens (extended abstract)
- 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
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- Streaming computations with a loquacious prover
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Pseudo-partitions, transversality and locality, a combinatorial characterization for the space measure in algebraic proof systems
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Tractability of batch to sequential conversion
- Analysis of two gradient-based algorithms for on-line regression
- Approaching utopia, strong truthfulness and externality-resistant mechanisms
- Exploiting random walks for learning
- Agnostic learning of geometric patterns
- New affine-invariant codes from lifting
- Making evolution rigorous: the error threshold
- An energy complexity model for algorithms
- Title not available (Why is that?)
- On the power of many one-bit provers
- Structural online learning
- Learning to assign degrees of belief in relational domains
- Reachability in graph timelines
- Massive online teaching to bounded learners
- On-line learning of linear functions
- Learning commutative deterministic finite state automata in polynomial time
- Learnability of DNF with representation-specific queries
- Robust logics
- Competing provers protocols for circuit evaluation
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- On the convergence of the Hegselmann-Krause system
- Welfare maximization and the supermodular degree
- Efficient learning with virtual threshold gates
- Characterizing the sample complexity of private learners
- PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification
- Stronger methods of making quantum interactive proofs perfectly complete
- Learning hurdles for sleeping experts
- On approximating weighted sums with exponentially many terms
- Catch them if you can
- Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
- An equational approach to secure multi-party computation
- Halfspace learning, linear programming, and nonmalicious distributions
- Learning with discrete multivalued neurons
- A characterization of approximation resistance for even \(k\)-partite CSPs
- Can theories be tested?
- Low-weight halfspaces for sparse boolean vectors
- Sparse extractor families for all the entropy
- Towards an optimal query efficient PCP?
- Robust optimization in the presence of uncertainty
- Efficient algorithms for online decision problems
- Runtime guarantees for regression problems
- Barriers in cryptography with weak, correlated and leaky sources
- An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
- Is privacy compatible with truthfulness?
- Learning parities in the mistake-bound model
- Resource-based corruptions and the combinatorics of hidden diversity
- Efficient online and batch learning using forward backward splitting
- Publicly verifiable proofs of sequential work
- \(H\)-wise independence
- Knows what it knows: a framework for self-aware learning
- Properties and applications of Boolean function composition
- Time hierarchies for sampling distributions
- Adversary lower bound for the \(k\)-sum problem
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 Q4013545)
