首页> 外文会议>Annual conference on Neural Information Processing Systems >Minimax Optimal Alternating Minimization for Kernel Nonparametric Tensor Learning
【24h】

Minimax Optimal Alternating Minimization for Kernel Nonparametric Tensor Learning

机译:非最大张量学习的最小极大最优交替极小化

获取原文

摘要

We investigate the statistical performance and computational efficiency of the alternating minimization procedure for nonparametric tensor learning. Tensor modeling has been widely used for capturing the higher order relations between multimodal data sources. In addition to a linear model, a nonlinear tensor model has been received much attention recently because of its high flexibility. We consider an alternating minimization procedure for a general nonlinear model where the true function consists of components in a reproducing kernel Hilbert space (RKHS). In this paper, we show that the alternating minimization method achieves linear convergence as an optimization algorithm and that the generalization error of the resultant estimator yields the minimax optimality. We apply our algorithm to some multitask learning problems and show that the method actually shows favorable performances.
机译:我们调查非参数张量学习的交替最小化过程的统计性能和计算效率。张量建模已广泛用于捕获多峰数据源之间的高阶关系。除了线性模型之外,非线性张量模型由于其高度的灵活性最近也引起了很多关注。我们考虑一般非线性模型的交替最小化过程,其中真实函数由可再生内核希尔伯特空间(RKHS)中的组件组成。在本文中,我们证明了交替最小化方法作为一种优化算法可实现线性收敛,并且所得估计器的泛化误差产生了最小极大最优性。我们将算法应用于一些多任务学习问题,并表明该方法实际上表现出良好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号