arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.00690cs.LGcs.AIstat.ML
收藏

Improved Bilevel Model:有理论保证的快速最优算法

Improved Bilevel Model: Fast and Optimal Algorithm with Theoretical Guarantee

University of Pittsburgh(匹兹堡大学);Nanjing University of Information Science & Technology(南京信息工程大学);JD Finance America Corporation(京东金融美国公司)

Junyi Li, Bin Gu, Heng Huang

摘要:

由于许多机器学习问题的层次结构,二层规划近年来变得越来越重要,然而,其内部问题和外部问题之间的复杂关联使得其求解极具挑战性。虽然基于自动微分的几种直观算法已经被提出并在一些应用中取得了成功,但对于双层模型的最优求解却没有给予太多的关注。是否存在一个更好的提法仍然是一个悬而未决的问题。在本文中,我们提出了一种改进的双层模型,收敛速度更快,更好地相比,目前的配方。我们提供了两个任务的理论保证和评估结果:数据超清洗和超表示学习。实证结果表明,我们的模型优于目前的双层模型有很大的差距。\emph{This is a concurrent work with \citet{liu2020generic} and we submitted to ICML 2020. Now we put it on the arxiv for record.}

英文摘要:

Due to the hierarchical structure of many machine learning problems, bilevel programming is becoming more and more important recently, however, the complicated correlation between the inner and outer problem makes it extremely challenging to solve. Although several intuitive algorithms based on the automatic differentiation have been proposed and obtained success in some applications, not much attention has been paid to finding the optimal formulation of the bilevel model. Whether there exists a better formulation is still an open problem. In this paper, we propose an improved bilevel model which converges faster and better compared to the current formulation. We provide theoretical guarantee and evaluation results over two tasks: Data Hyper-Cleaning and Hyper Representation Learning. The empirical results show that our model outperforms the current bilevel model with a great margin. \emph{This is a concurrent work with \citet{liu2020generic} and we submitted to ICML 2020. Now we put it on the arxiv for record.}

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

↑