图 书 馆
学习浅单调公式的下限和硬度放大Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas |
|
| 课程网址: | http://videolectures.net/colt2011_lee_formulas/ |
| 主讲教师: | Homin K. Lee |
| 开课单位: | 德克萨斯大学 |
| 开课时间: | 2011-08-02 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Much work has been done on learning various classes of “simple” monotone functions under the uniform distribution. In this paper we give the first unconditional lower bounds for learning problems of this sort by showing that polynomial-time algorithms cannot learn shallow monotone Boolean formulas under the uniform distribution in the well-studied Statistical Query (SQ) model. We introduce a new approach to understanding the learnability of “simple” monotone functions that is based on a recent characterization of Strong SQ learnability by Simon (2007) Using the characterization we first show that depth-3 monotone formulas of size no(1) cannot be learned by any polynomial-time SQ algorithm to accuracy 1 |
| 关 键 词: | 计算机科学; 机器学习; 单调公式 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-06-08：yumf |
| 阅读次数: | 57 |