arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.09013stat.MLcs.LGmath.OC
收藏

无约束在线学习中的人工约束和Lipschitz提示

Artificial Constraints and Lipschitz Hints for Unconstrained Online Learning

Google(谷歌(公司))

Ashok Cutkosky

摘要:

我们提供的算法,保证遗憾$R_T(u)\le \tilde O(G\|u\|^3 + G(\|u\|+1)\sqrt{T})$或$R_T(u)\le \tilde O(G\|u\|^3T^{1/3} + GT^{1/3}+ G\|u\|\sqrt{T})$的在线凸优化与$G$ -Lipschitz损失的任何比较点$u$没有先验知识的$G$或$\|u\|$。以前的算法免除了$O(\|u\|^3)$长期在这些参数中的一个或两个的知识为代价,而下限表明,一些额外的惩罚项超过$G\|u\|\sqrt{T}$是必要的。以前的惩罚是指数的,而我们的界限是多项式的所有数量。此外,给定一个已知的界限$\|u\|\le D$,我们同样的技术允许我们设计最佳地适应$\|u\|$的未知值的算法,而不需要$G$的知识。

英文摘要:

We provide algorithms that guarantee regret $R_T(u)\le \tilde O(G\|u\|^3 + G(\|u\|+1)\sqrt{T})$ or $R_T(u)\le \tilde O(G\|u\|^3T^{1/3} + GT^{1/3}+ G\|u\|\sqrt{T})$ for online convex optimization with $G$-Lipschitz losses for any comparison point $u$ without prior knowledge of either $G$ or $\|u\|$. Previous algorithms dispense with the $O(\|u\|^3)$ term at the expense of knowledge of one or both of these parameters, while a lower bound shows that some additional penalty term over $G\|u\|\sqrt{T}$ is necessary. Previous penalties were exponential while our bounds are polynomial in all quantities. Further, given a known bound $\|u\|\le D$, our same techniques allow us to design algorithms that adapt optimally to the unknown value of $\|u\|$ without requiring knowledge of $G$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑