{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1361699996366399360.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1214/11-aos894"}},{"identifier":{"@type":"URI","@value":"https://projecteuclid.org/download/pdfview_1/euclid.aos/1322663459"}}],"dc:title":[{"@value":"Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1381699996366399361","@type":"Researcher","foaf:name":[{"@value":"Vladimir Koltchinskii"}]},{"@id":"https://cir.nii.ac.jp/crid/1381699996366399360","@type":"Researcher","foaf:name":[{"@value":"Karim Lounici"}]},{"@id":"https://cir.nii.ac.jp/crid/1381699996366399362","@type":"Researcher","foaf:name":[{"@value":"Alexandre B. Tsybakov"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"00905364"}],"prism:publicationName":[{"@value":"The Annals of Statistics"}],"dc:publisher":[{"@value":"Institute of Mathematical Statistics"}],"prism:publicationDate":"2011-10-01","prism:volume":"39","prism:number":"5","prism:startingPage":"2302"},"reviewed":"false","url":[{"@id":"https://projecteuclid.org/download/pdfview_1/euclid.aos/1322663459"}],"createdAt":"2011-12-01","modifiedAt":"2021-04-05","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360005515095507968","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Hierarchical Convex Optimization by the Hybrid Steepest Descent Method with Proximal Splitting Operators—Enhancements of SVM and Lasso"}]},{"@id":"https://cir.nii.ac.jp/crid/1360021391864397184","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Adapting to General Quadratic Loss via Singular Value Shrinkage"}]},{"@id":"https://cir.nii.ac.jp/crid/1360290617609786624","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Bayesian singular value regularization via a cumulative shrinkage process"}]},{"@id":"https://cir.nii.ac.jp/crid/1360580232400896896","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Tensor Recovery via $*_L$-Spectral $k$-Support Norm"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848661785374080","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Ridge-type regularization method for questionnaire data analysis"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593758166016","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Matrix completion based on Gaussian parameterized belief propagation"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861705570597760","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"An Online Semi-Definite Programming with a Generalized Log-Determinant Regularizer and Its Applications"}]},{"@id":"https://cir.nii.ac.jp/crid/1390845712966153728","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Online Linear Optimization with the Log-Determinant Regularizer"}]},{"@id":"https://cir.nii.ac.jp/crid/1390845712979357952","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Tighter Generalization Bounds for Matrix Completion Via Factorization Into Constrained Matrices"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1214/11-aos894"},{"@type":"CROSSREF","@value":"10.1007/978-3-030-25939-6_16_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"},{"@type":"CROSSREF","@value":"10.1587/transinf.2017edp7317_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"},{"@type":"CROSSREF","@value":"10.1109/tit.2023.3344649_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"},{"@type":"CROSSREF","@value":"10.1080/03610926.2020.1843055_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"},{"@type":"CROSSREF","@value":"10.1109/jstsp.2021.3058763_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"},{"@type":"CROSSREF","@value":"10.1186/s40736-016-0024-x_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"},{"@type":"CROSSREF","@value":"10.1587/transinf.2017edp7339_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"},{"@type":"CROSSREF","@value":"10.1088/1742-5468/ac21c9_references_DOI_PamjagTPWZh1DncxEWRWJt624IM"},{"@type":"CROSSREF","@value":"10.3390/math10071055_references_DOI_AcerjDkVXQ2yIkPOQ4wy4R4dFUI"}]}