atlas

Research map / Learning theory and algorithms / Sample complexity

Preference-Based Batch and Sequential Teaching: Towards a Unified View of Models

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: PAC learnability theory · 17 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Allow preference functions to depend on the candidate, version space, and current hypothesisSequential teaching · Finite hypothesis classesteaching complexity: O(VCD(ℋ, 𝒳)^2) -> O(VCD(ℋ, 𝒳))Helped
Use version-space-dependent preferences instead of a global orderingBatch teaching · Warmuth hypothesis classteaching dimension: 3 -> 2Helped
Use version-space-dependent preferences instead of a global orderingBatch teaching · Example hypothesis class (Appendix)teaching dimension: 2 -> 1Helped
Use sequential local preferences rather than version-space-dependent batch preferencesTeaching models · Some hypothesis classesteaching complexityMixed
Use local preferences instead of version-space-dependent preferencesTeaching models · Power-set class with k=7teaching dimension: ≥ 4 -> ≤ 3Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy