Linear programming with online learning
详细信息查看全文 | 推荐本文 |
摘要
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies are obtained through Vovk's aggregating algorithm which combines recommendations from a given strategy pool. We establish an average-performance bound for the resulting solution sequence.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700