返回
Competitive Normalized Least-Squares Regression
DOI:10.1109/TNNLS.2020.3009777.png)
摘要
En 中文
Online learning has witnessed an increasing interest over the recent past due to its low computational requirements and its relevance to a broad range of streaming applications. In this brief, we focus on online regularized regression. We propose a novel efficient online regression algorithm, called online normalized least-squares (ONLS). We perform theoretical analysis by comparing the total loss of ONLS against the normalized gradient descent (NGD) algorithm and the best off-line LS predictor. We show, in particular, that ONLS allows for a better bias-variance tradeoff than those state-of-the-art gradient descent-based LS algorithms as well as a better control on the level of shrinkage of the features toward the null. Finally, we conduct an empirical study to illustrate the great performance of ONLS against some state-of-the-art algorithms using real-world data.
Keyword:
Prediction algorithms
Approximation algorithms
Protocols
Learning systems
Covariance matrices
Time complexity
Stability analysis
Competitive analysis
least-squares
prediction
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
Disentangling in vivo the effects of iron content and atrophy on the ageing human brain
NeuroImage
IF0
X chromosome number causes sex differences in gene expression in adult mouse striatumX染色体数目导致成年小鼠纹状体基因表达的性别差异

