Some connections between learning and optimization

被引：0
|
作者：
Anthony, M [1 ]
机构：
[1] Univ London London Sch Econ & Polit Sci, Dept Math, London WC2A 2AE, England
来源：
DISCRETE APPLIED MATHEMATICS | 2004年 / 144卷 / 1-2期
关键词：
learning; computational complexity of learning; optimization;
D O I：
10.1016/j.dam.2004.06.005
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
This article is a brief exposition of some of the important links between machine learning and combinatorial optimization. We explain how efficient 'learnability' in standard probabilistic models of learning is linked to the existence of efficient randomized algorithms for certain natural combinatorial optimization problems, and we discuss the complexity of some of these optimization problems. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：17 / 26
页数：10
相关论文
共 50 条
12345