File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.4310/CMS.2018.v16.n5.a08
- Scopus: eid_2-s2.0-85059263251
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Regularized semi-supervised least squares regression with dependent samples
Title | Regularized semi-supervised least squares regression with dependent samples |
---|---|
Authors | |
Keywords | Semi-supervised learning Regularization Non-iid sampling Least squares regression |
Issue Date | 2018 |
Citation | Communications in Mathematical Sciences, 2018, v. 16, n. 5, p. 1347-1360 How to Cite? |
Abstract | © 2018 International Press. In this paper, we study regularized semi-supervised least squares regression with dependent samples. We analyze the regularized algorithm based on reproducing kernel Hilbert spaces, and show, with the use of unlabelled data that the regularized least squares algorithm can achieve the nearly minimax optimal learning rate with a logarithmic term for dependent samples. Our new results are better than existing results in the literature. |
Persistent Identifier | http://hdl.handle.net/10722/276625 |
ISSN | 2023 Impact Factor: 1.2 2023 SCImago Journal Rankings: 0.756 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tong, Hongzhi | - |
dc.contributor.author | Ng, Michael | - |
dc.date.accessioned | 2019-09-18T08:34:10Z | - |
dc.date.available | 2019-09-18T08:34:10Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Communications in Mathematical Sciences, 2018, v. 16, n. 5, p. 1347-1360 | - |
dc.identifier.issn | 1539-6746 | - |
dc.identifier.uri | http://hdl.handle.net/10722/276625 | - |
dc.description.abstract | © 2018 International Press. In this paper, we study regularized semi-supervised least squares regression with dependent samples. We analyze the regularized algorithm based on reproducing kernel Hilbert spaces, and show, with the use of unlabelled data that the regularized least squares algorithm can achieve the nearly minimax optimal learning rate with a logarithmic term for dependent samples. Our new results are better than existing results in the literature. | - |
dc.language | eng | - |
dc.relation.ispartof | Communications in Mathematical Sciences | - |
dc.subject | Semi-supervised learning | - |
dc.subject | Regularization | - |
dc.subject | Non-iid sampling | - |
dc.subject | Least squares regression | - |
dc.title | Regularized semi-supervised least squares regression with dependent samples | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.4310/CMS.2018.v16.n5.a08 | - |
dc.identifier.scopus | eid_2-s2.0-85059263251 | - |
dc.identifier.volume | 16 | - |
dc.identifier.issue | 5 | - |
dc.identifier.spage | 1347 | - |
dc.identifier.epage | 1360 | - |
dc.identifier.eissn | 1945-0796 | - |
dc.identifier.issnl | 1539-6746 | - |