메뉴 건너뛰기




Volumn , Issue , 2014, Pages 651-660

Understanding alternating minimization for matrix completion

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; NUMBER THEORY;

EID: 84920055127     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2014.75     Document Type: Conference Paper
Times cited : (238)

References (24)
  • 1
    • 49749086487 scopus 로고    scopus 로고
    • Scalable collaborative filtering with jointly derived neighborhood interpolation weights
    • R. M. Bell and Y. Koren, "Scalable collaborative filtering with jointly derived neighborhood interpolation weights," in ICDM. IEEE Computer Society, 2007, pp. 43-52.
    • (2007) ICDM. IEEE Computer Society , pp. 43-52
    • Bell, R.M.1    Koren, Y.2
  • 2
    • 67349112355 scopus 로고    scopus 로고
    • Rank-constrained solutions to linear matrix equations using powerfactorization
    • J. P. Haldar and D. Hernando, "Rank-constrained solutions to linear matrix equations using powerfactorization," IEEE Signal Process. Lett., vol. 16, no. 7, pp. 584-587, 2009.
    • (2009) IEEE Signal Process. Lett. , vol.16 , Issue.7 , pp. 584-587
    • Haldar, J.P.1    Hernando, D.2
  • 3
    • 85008044987 scopus 로고    scopus 로고
    • Matrix factorization techniques for recommender systems
    • Y. Koren, R. M. Bell, and C. Volinsky, "Matrix factorization techniques for recommender systems," IEEE Computer, vol. 42, no. 8, pp. 30-37, 2009.
    • (2009) IEEE Computer , vol.42 , Issue.8 , pp. 30-37
    • Koren, Y.1    Bell, R.M.2    Volinsky, C.3
  • 4
    • 71049116435 scopus 로고    scopus 로고
    • Exact matrix completion via convex optimization
    • December
    • E. J. Candes and B. Recht, "Exact matrix completion via convex optimization," Foundations of Computional Mathematics, vol. 9, pp. 717-772, December 2009.
    • (2009) Foundations of Computional Mathematics , vol.9 , pp. 717-772
    • Candes, E.J.1    Recht, B.2
  • 5
    • 84856009825 scopus 로고    scopus 로고
    • A simpler approach to matrix completion
    • B. Recht, "A simpler approach to matrix completion," Journal of Machine Learning Research, vol. 12, pp. 3413-3430, 2011.
    • (2011) Journal of Machine Learning Research , vol.12 , pp. 3413-3430
    • Recht, B.1
  • 7
    • 71149103464 scopus 로고    scopus 로고
    • An accelerated gradient method for trace norm minimization
    • S. Ji and J. Ye, "An accelerated gradient method for trace norm minimization," in Proc. 26th ICML. ACM, 2009, p. 58.
    • (2009) Proc. 26th ICML ACM , pp. 58
    • Ji, S.1    Ye, J.2
  • 8
    • 77956944781 scopus 로고    scopus 로고
    • Spectral regularization algorithms for learning large incomplete matrices
    • R. Mazumder, T. Hastie, and R. Tibshirani, "Spectral regularization algorithms for learning large incomplete matrices," Journal of Machine Learning Research, vol. 11, pp. 2287-2322, 2010.
    • (2010) Journal of Machine Learning Research , vol.11 , pp. 2287-2322
    • Mazumder, R.1    Hastie, T.2    Tibshirani, R.3
  • 9
    • 77956535889 scopus 로고    scopus 로고
    • A simple algorithm for nuclear norm regularized problems
    • M. Jaggi and M. Sulovsky, "A simple algorithm for nuclear norm regularized problems," in Proc. 27th ICML. ACM, 2010, pp. 471-478.
    • (2010) Proc. 27th ICML ACM , pp. 471-478
    • Jaggi, M.1    Sulovsky, M.2
  • 10
    • 84867135292 scopus 로고    scopus 로고
    • Efficient and practical stochastic subgradient descent for nuclear norm regularization
    • H. Avron, S. Kale, S. P. Kasiviswanathan, and V. Sindhwani, "Efficient and practical stochastic subgradient descent for nuclear norm regularization," in Proc. 29th ICML. ACM, 2012.
    • (2012) Proc. 29th ICML ACM
    • Avron, H.1    Kale, S.2    Kasiviswanathan, S.P.3    Sindhwani, V.4
  • 11
    • 84919790414 scopus 로고    scopus 로고
    • Nuclear norm minimization via active subspace selection
    • C.-J. Hsieh and P. A. Olsen, "Nuclear norm minimization via active subspace selection," in Proc. 31st ICML. ACM, 2014.
    • (2014) Proc. 31st ICML ACM
    • Hsieh, C.-J.1    Olsen, P.A.2
  • 14
    • 84886475845 scopus 로고    scopus 로고
    • Noisy matrix completion using alternating minimization
    • Springer
    • S. Gunasekar, A. Acharya, N. Gaur, and J. Ghosh, "Noisy matrix completion using alternating minimization," in Proc. ECML PKDD. Springer, 2013, pp. 194-209.
    • (2013) Proc. ECML PKDD , pp. 194-209
    • Gunasekar, S.1    Acharya, A.2    Gaur, N.3    Ghosh, J.4
  • 15
    • 84920010646 scopus 로고    scopus 로고
    • Computational limits for matrix completion
    • abs/1402.2331
    • M. Hardt, R. Meka, P. Raghavendra, and B. Weitz, "Computational limits for matrix completion," CoRR, vol. abs/1402.2331, 2014.
    • (2014) CoRR
    • Hardt, M.1    Meka, R.2    Raghavendra, P.3    Weitz, B.4
  • 16
    • 34247360062 scopus 로고    scopus 로고
    • Smoothed analysis of the condition numbers and growth factors of matrices
    • A. Sankar, D. A. Spielman, and S.-H. Teng, "Smoothed analysis of the condition numbers and growth factors of matrices," SIAM J. Matrix Analysis Applications, vol. 28, no. 2, pp. 446-476, 2006.
    • (2006) SIAM J. Matrix Analysis Applications , vol.28 , Issue.2 , pp. 446-476
    • Sankar, A.1    Spielman, D.A.2    Teng, S.-H.3
  • 19
    • 84880089568 scopus 로고    scopus 로고
    • Parallel stochastic gradient algorithms for large-scale matrix completion
    • B. Recht and C. Re, "Parallel stochastic gradient algorithms for large-scale matrix completion," Math. Program. Comput., vol. 5, no. 2, pp. 201-226, 2013.
    • (2013) Math. Program. Comput. , vol.5 , Issue.2 , pp. 201-226
    • Recht, B.1    Re, C.2
  • 20
    • 84867122248 scopus 로고    scopus 로고
    • Projection-free online learning
    • E. Hazan and S. Kale, "Projection-free online learning," in ICML. ACM, 2012.
    • (2012) ICML ACM
    • Hazan, E.1    Kale, S.2


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