Teaching Randomized Learners
From MaRDI portal
Recommendations
Cited in
(51)- A model of interactive teaching
- A recent result about random metric spaces explains why all of us have similar learning potential
- Massive online teaching to bounded learners
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Low-weight halfspaces for sparse boolean vectors
- Learnability of DNF with representation-specific queries
- Can theories be tested?
- Making evolution rigorous: the error threshold
- 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 (extended abstract)
- 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, strong truthfulness and externality-resistant mechanisms
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- 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, a combinatorial characterization for the space measure in algebraic proof systems
- Competing provers protocols for circuit evaluation
- Catch them if you can
- Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
- 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
- Teaching Memoryless Randomized Learners Without Feedback
- Recent Developments in Algorithmic Teaching
- Algorithmic Learning Theory
- Teaching randomized learners with feedback
This page was built for publication: Teaching Randomized Learners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307571)
