Paper Abstract and Keywords |
Presentation |
2018-03-05 14:25
Analysis of Polynomial-time Learnability with Membership Queries Mikito Nanashima (Tokyo Inst. of Tech.) COMP2017-49 |
Abstract |
(in Japanese) |
(See Japanese page) |
(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) |
(in English) |
computational learning theory / PAC learning / query learning / encryption / signature / / / |
Reference Info. |
IEICE Tech. Rep., vol. 117, no. 474, COMP2017-49, pp. 21-26, March 2018. |
Paper # |
COMP2017-49 |
Date of Issue |
2018-02-26 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2017-49 |
Conference Information |
Committee |
COMP |
Conference Date |
2018-03-05 - 2018-03-05 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Osaka Prefecture Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2018-03-COMP |
Language |
Japanese |
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 |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Mikito Nanashima |
1st Author's Affiliation |
Tokyo Institute of Technology (Tokyo Inst. of Tech.) |
2nd Author's Name |
|
2nd Author's Affiliation |
() |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2018-03-05 14:25:00 |
Presentation Time |
25 minutes |
Registration for |
COMP |
Paper # |
COMP2017-49 |
Volume (vol) |
vol.117 |
Number (no) |
no.474 |
Page |
pp.21-26 |
#Pages |
6 |
Date of Issue |
2018-02-26 (COMP) |
|