图 书 馆
张量分解的保证非凸学习算法Guaranteed Non-convex Learning Algorithms through Tensor Factorization |
|
| 课程网址: | http://videolectures.net/iclr2016_anandkumar_nonconvex_learning/ |
| 主讲教师: | Animashree Anandkumar |
| 开课单位: | 加利福尼亚大学 |
| 开课时间: | 2016-05-27 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Modern machine learning involves massive datasets of text, images, videos, biological data, and so on. Most learning tasks can be framed as optimization problems which turn out to be non-convex and NP-hard to solve. This hardness barrier can be overcome by: (i) focusing on conditions which make learning tractable, (ii) replacing the given optimization objective with better behaved ones, and (iii) exploiting non-obvious connections that abound in learning problems. I will discuss the above in the context of: (i) unsupervised learning of latent variable models and (ii) training multi-layer neural networks, through a novel framework involving spectral decomposition of moment matrices and tensors. Tensors are rich structures that can encode higher order relationships in data. Despite being non-convex, tensor decomposition can be solved optimally using simple iterative algorithms under mild conditions. In practice, tensor methods yield enormous gains both in running times and learning accuracy over traditional methods for training probabilistic models such as variational inference. These positive results demonstrate that many challenging learning tasks can be solved efficiently, both in theory and in practice. |
| 关 键 词: | 现代机器学习; 优化问题; 概率模型 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2022-11-18：chenjy |
| 最后编审: | 2022-11-18：chenjy |
| 阅读次数: | 25 |