메뉴 건너뛰기




Volumn , Issue , 2009, Pages 649-656

Blockwise coordinate descent procedures for the multi-task Lasso, with applications to neural semantic basis discovery

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED FORM; COGNITIVE NEUROSCIENCES; COORDINATE DESCENT; EXISTING METHOD; LARGE-SCALE PROBLEM; NEURAL ACTIVATION; PENALIZED LEAST-SQUARES; STANDARD BASIS;

EID: 71149111015     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (154)

References (14)
  • 2
    • 36749019495 scopus 로고    scopus 로고
    • Recovery algorithms for vector valued data with joint sparsity constraints
    • Fornasier, M., & Rauhut, H. (2008). Recovery algorithms for vector valued data with joint sparsity constraints. SIAM Journal of Numerical Analysis, 46, 577-613.
    • (2008) SIAM Journal of Numerical Analysis , vol.46 , pp. 577-613
    • Fornasier, M.1    Rauhut, H.2
  • 4
    • 62549130467 scopus 로고    scopus 로고
    • Regularized paths for generalized linear models via coordinate descent
    • Technical report, Stanford University
    • Friedman, J. H., Hastie, T., & Tibshirani, R. (2008). Regularized paths for generalized linear models via coordinate descent. Technical report, Stanford University.
    • (2008)
    • Friedman, J.H.1    Hastie, T.2    Tibshirani, R.3
  • 8
    • 45749091592 scopus 로고    scopus 로고
    • Predicting human brain activity associated with the meanings of nouns
    • Mitchell, T., et al. (2008). Predicting human brain activity associated with the meanings of nouns. Science, 320, 1191-1195.
    • (2008) Science , vol.320 , pp. 1191-1195
    • Mitchell, T.1
  • 10
    • 0035533631 scopus 로고    scopus 로고
    • Convergence of a block coordinate descent method for nondifferentiable minimization
    • Tseng, P. (2001). Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of optimization theory and applications, 109, 475-494.
    • (2001) Journal of optimization theory and applications , vol.109 , pp. 475-494
    • Tseng, P.1
  • 12
    • 84863879353 scopus 로고    scopus 로고
    • Coordinate descent algorithms for lasso penalized regression
    • Wu, T. T., & Lange, K. (2008), Coordinate descent algorithms for lasso penalized regression. The Annals of Applied Statistics, 2, 224-244,
    • (2008) The Annals of Applied Statistics , vol.2 , pp. 224-244
    • Wu, T.T.1    Lange, K.2
  • 13
    • 70049094230 scopus 로고    scopus 로고
    • Technical Report CMU-LTI-06-006, Ph.D. thesis, Carnegie Mellon University
    • Zhang, J. (2006). A probabilistic framework for multitask learning (Technical Report CMU-LTI-06-006). Ph.D. thesis, Carnegie Mellon University.
    • (2006) A probabilistic framework for multitask learning
    • Zhang, J.1
  • 14
    • 34447335946 scopus 로고    scopus 로고
    • The grouped and hierarchical model selection through composite absolute penalties
    • to appear
    • Zhao, P., Rocha, G., & Yu, B. (2009). The grouped and hierarchical model selection through composite absolute penalties. The Annals of Statistics (to appear).
    • (2009) The Annals of Statistics
    • Zhao, P.1    Rocha, G.2    Yu, B.3


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