Online Improper Learning with an Approximation Oracle*
| 
121 | 
92 | 
0
Abstract
We study the following question: given an efficient approximation algorithm for an optimization problem, can we learn efficiently in the same setting? We give a formal affirmative answer to this question in the form of a reduction from online learning to offline approximate optimization using an efficient algorithm that guarantees near optimal regret. The algorithm is efficient in terms of the number of oracle calls to a given approximation oracle – it makes only logarithmically many such calls per iteration. This resolves an open question by Kalai and Vempala, and by Garber. Furthermore, our result applies to the more general improper learning problems.
还没有评论，说两句吧！
热门资源
Regularizing RNNs...
Recently, caption generation with an encoder-de...
The Variational S...
Unlike traditional images which do not offer in...
Deep Cross-media ...
Cross-media retrieval is a research hotspot in ...
Visual Reinforcem...
For an autonomous agent to fulfill a wide range...
Joint Pose and Ex...
Facial expression recognition (FER) is a challe...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
