메뉴 건너뛰기




Volumn 5, Issue , 2011, Pages 1161-1183

Rank penalized estimators for high-dimensional matrices

Author keywords

Low rank matrix estimation; Matrix completion; Recovery of the rank; Statistical learning

Indexed keywords


EID: 84859835859     PISSN: 19357524     EISSN: None     Source Type: Journal    
DOI: 10.1214/11-EJS637     Document Type: Article
Times cited : (45)

References (17)
  • 1
    • 55149088329 scopus 로고    scopus 로고
    • Convex multi-task feature learning
    • Argyriou, A., Evgeniou, T. and Pontil, M. (2008) Convex multi-task feature learning. Mach. Learn., 73, 243-272.
    • (2008) Mach. Learn , vol.73 , pp. 243-272
    • Argyriou, A.1    Evgeniou, T.2    Pontil, M.3
  • 4
    • 46249124832 scopus 로고    scopus 로고
    • Consistency of trace norm minimization
    • MR2417263
    • Bach, F.R. (2008) Consistency of trace norm minimization. J. Mach. Learn. Res., 9, 1019-1048. MR2417263.
    • (2008) J. Mach. Learn. Res , vol.9 , pp. 1019-1048
    • Bach, F.R.1
  • 5
    • 82655182661 scopus 로고    scopus 로고
    • Optimal selection of reduced rank estimators of high-dimensional matrices
    • Bunea, F., She, Y. and Wegkamp, M. (2011) Optimal selection of reduced rank estimators of high-dimensional matrices. Annals of Statistics, 39, 1282-1309.
    • (2011) Annals of Statistics , vol.39 , pp. 1282-1309
    • Bunea, F.1    She, Y.2    Wegkamp, M.3
  • 7
    • 84859851440 scopus 로고    scopus 로고
    • Tight oracle bounds for lowrank matrix recovery from a minimal number of random measurements
    • Candés, E.J. and Plan, Y. (2010) Tight oracle bounds for lowrank matrix recovery from a minimal number of random measurements. ArXiv:1001.0339.
    • (2010) ArXiv , vol.1001 , pp. 0339
    • Candés, E.J.1    Plan, Y.2
  • 8
    • 71049116435 scopus 로고    scopus 로고
    • Exact matrix completion via convex optimization
    • MR2565240
    • Candés, E.J. and Recht, B. (2009) Exact matrix completion via convex optimization. Fondations of Computational Mathematics, 9(6), 717-772. MR2565240.
    • (2009) Fondations of Computational Mathematics , vol.9 , Issue.6 , pp. 717-772
    • Candés, E.J.1    Recht, B.2
  • 10
  • 11
    • 79951886985 scopus 로고    scopus 로고
    • Recovering low-rank matrices from few coefficients in any basis
    • MR2815834
    • Gross, D. Recovering low-rank matrices from few coefficients in any basis.(2011). IEEE Transactions, 57(3), 1548-1566. MR2815834.
    • (2011) IEEE Transactions , vol.57 , Issue.3 , pp. 1548-1566
    • Gross, D.1
  • 14
    • 79952934740 scopus 로고    scopus 로고
    • Estimation of (near) lowrank matrices with noise and high-dimensional scaling
    • Negahban, S. and Wainwright, M.J. (2011). Estimation of (near) lowrank matrices with noise and high-dimensional scaling. Annals of Statistics, 39, 1069-1097.
    • (2011) Annals of Statistics , vol.39 , pp. 1069-1097
    • Negahban, S.1    Wainwright, M.J.2
  • 17
    • 79952902758 scopus 로고    scopus 로고
    • Estimation of High-Dimensional Low-Rank Matrices
    • Rohde, A. and Tsybakov, A. (2011) Estimation of High-Dimensional Low-Rank Matrices. Annals of Statistics, 39, 887-930.
    • (2011) Annals of Statistics , vol.39 , pp. 887-930
    • Rohde, A.1    Tsybakov, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.