Agnostic Learning by Refuting
arXiv: Learning, 2017.
Abstract:
The sample complexity of learning a Boolean-valued function class is precisely characterized by its Rademacher complexity. This has little bearing, however, on the sample complexity of emph{efficient} agnostic learning. We introduce emph{refutation complexity}, a natural computational analog of Rademacher complexity of a Boolean concept c...More
Code:
Data:
Upload PDF
1.Your uploaded documents will be check within 24h, and coins will be credited to your account.
2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.
3.10 coins will be exchanged for 1 yuan.
?
￥
Upload a single paper
for 5 coins
Wechat's Red Packet
?
￥
Upload 50 articles
for 280 coins
Wechat's Red Packet
?
￥
Upload 200 articles
for 1200 coins
Wechat's Red Packet
?
￥
Upload 500 articles
for 3000 coins
Wechat's Red Packet
?
￥
Upload 1000 articles
for 7000 coins
Wechat's Red Packet
Tags
Comments