Presentation 2018-03-05
Analysis of Polynomial-time Learnability with Membership Queries
Mikito Nanashima,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We investigate the polynomial-time learnability by using examples and membership queries. Angluin and Kharitonov proved that various concept classes (e.g., Boolean formulae, NFAs) are not polynomial-time learnable in this learning model if there exists a public-key encryption scheme that has indistinguishable encryptions against chosen message attacks. We consider as a stronger learning model a posteriori query learning model, and show it to be indeed stronger than the above learning model if a one-way function exists. Nevertheless, we prove that the Boolean formula concept class is not polynomial-time learnable either in this learning model based on even a weaker encryption scheme.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) computational learning theory / PAC learning / query learning / encryption / signature
Paper # COMP2017-49
Date of Issue 2018-02-26 (COMP)

Conference Information
Committee COMP
Conference Date 2018/3/5(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Osaka Prefecture Univ.
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Hiro Ito(Univ. of Electro-Comm.)
Vice Chair Yushi Uno(Osaka Pref. Univ.)
Secretary Yushi Uno(Seikei Univ.)
Assistant

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Analysis of Polynomial-time Learnability with Membership Queries
Sub Title (in English)
Keyword(1) computational learning theory
Keyword(2) PAC learning
Keyword(3) query learning
Keyword(4) encryption
Keyword(5) signature
1st Author's Name Mikito Nanashima
1st Author's Affiliation Tokyo Institute of Technology(Tokyo Inst. of Tech.)
Date 2018-03-05
Paper # COMP2017-49
Volume (vol) vol.117
Number (no) COMP-474
Page pp.pp.21-26(COMP),
#Pages 6
Date of Issue 2018-02-26 (COMP)