图 书 馆
二元矩阵分解Matrix factorization with binary components |
|
| 课程网址: | http://videolectures.net/machine_slawski_binary_components/ |
| 主讲教师: | Martin Slawski |
| 开课单位: | 萨尔大学 |
| 开课时间: | 2014-11-07 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Motivated by an application in computational biology, we consider constrained low-rank matrix factorization problems with {0,1}-constraints on one of the factors. In addition to the the non-convexity shared with more general matrix factorization schemes, our problem is further complicated by a combinatorial constraint set of size 2m⋅r, where m is the dimension of the data points and r the rank of the factorization. Despite apparent intractability, we provide −in the line of recent work on non-negative matrix factorization by Arora et al.(2012)− an algorithm that provably recovers the underlying factorization in the exact case with operations of the order O(mr2r+mnr) in the worst case. To obtain that result, we invoke theory centered around a fundamental result in combinatorics, the Littlewood-Offord lemma. |
| 关 键 词: | 计算生物学; 矩阵分解; 因子分解 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2022-12-20：chenjy |
| 最后编审: | 2023-05-11：chenjy |
| 阅读次数: | 22 |