Researchers have revisited Valiant's original 1984 learnability model, which differs from the more common PAC learning model by allowing learners to issue membership queries and requiring hypotheses with no false positives. They established a new characterization for learnability in Valiant's model, showing it is strictly between PAC learning and a variant without queries. The study also presents the first algorithm for learning $d$-dimensional halfspaces within Valiant's framework, demonstrating their learnability with queries. AI
影响 Refines theoretical understanding of learnability, potentially influencing future algorithm design.
排序理由 Academic paper detailing theoretical computer science research.
AI 生成摘要 · Google Gemini · 来自 2 个来源。 我们如何撰写摘要 →
