VIP内容
简介： 机器学习是从数据和经验中学习的算法研究。 它被广泛应用于从医学到广告，从军事到行人的各种应用领域。 CIML是一组入门资料，涵盖了现代机器学习的大多数主要方面（监督学习，无监督学习，大幅度方法，概率建模，学习理论等）。 它的重点是具有严格主干的广泛应用。 一个子集可以用于本科课程； 研究生课程可能涵盖全部材料，然后再覆盖一些。
作者介绍： Hal Daumé III，教授，他曾担任Perotto教授职位，他现在Microsoft Research NYC的机器学习小组中。 研究方向是自然语言处理。
大纲介绍：
- 前言
- 决策树
- Limits of Learning
- 近邻算法
- 感知机
- 联系
- 边缘分类
- 线性模型
- 偏差
- 概率模型
- 神经网络
- 核函数
- 学习理论
- Ensemble 方法
- 高效学习
- 无监督学习
- 期望最大化
- 结构预测
- 模仿学习
- 后记
下载链接： https://pan.baidu.com/s/1QwSGTioJxDCRvlkBqcJr_A
提取码：fwbq
成为VIP会员查看完整内容
热门内容
最新内容
The classical Perceptron algorithm provides a simple and elegant procedure for learning a linear classifier. In each step, the algorithm observes the sample's position and label and may update the current predictor accordingly. In presence of strategic agents, however, the classifier may not be able to observe the true position but a position where the agent pretends to be in order to be classified desirably. Unlike the original setting with perfect knowledge of positions, in this situation the Perceptron algorithm fails to achieve its guarantees, and we illustrate examples with the predictor oscillating between two solutions forever, never reaching a perfect classifier even though one exists. Our main contribution is providing a modified Perceptron-style algorithm which finds a classifier in presence of strategic agents with both $\ell_2$ and weighted $\ell_1$ manipulation costs. In our baseline model, knowledge of the manipulation costs is assumed. In our most general model, we relax this assumption and provide an algorithm which learns and refines both the classifier and its cost estimates to achieve good mistake bounds even when manipulation costs are unknown.
最新论文
The classical Perceptron algorithm provides a simple and elegant procedure for learning a linear classifier. In each step, the algorithm observes the sample's position and label and may update the current predictor accordingly. In presence of strategic agents, however, the classifier may not be able to observe the true position but a position where the agent pretends to be in order to be classified desirably. Unlike the original setting with perfect knowledge of positions, in this situation the Perceptron algorithm fails to achieve its guarantees, and we illustrate examples with the predictor oscillating between two solutions forever, never reaching a perfect classifier even though one exists. Our main contribution is providing a modified Perceptron-style algorithm which finds a classifier in presence of strategic agents with both $\ell_2$ and weighted $\ell_1$ manipulation costs. In our baseline model, knowledge of the manipulation costs is assumed. In our most general model, we relax this assumption and provide an algorithm which learns and refines both the classifier and its cost estimates to achieve good mistake bounds even when manipulation costs are unknown.
