Analysis of two gradient-based algorithms for on-line regression
type: Item
instance of: scholarly article
title: Analysis of two gradient-based algorithms for on-line regression
zbMATH Open document ID: 0961.68148
author: Nicolò Cesa-Bianchi
published in: Journal of Computer and System Sciences
publication date: 2000-03-19T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1417879
zbMATH Keywords: gradient descent
zbMATH Keywords: exponentiated gradient
Wikidata QID: Q59538608
MaRDI profile type: Publication
full work available at URL: jcss.1999.1635
OpenAlex ID: W2033547792
cites work: How to use expert advice
cites work: Q4023085
cites work: Q4881152
cites work: Universal prediction of individual sequences
cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Exponentiated gradient versus gradient descent for linear predictors
cites work: Relative loss bounds for multidimensional regression problems
cites work: Q4013545
cites work: On-line learning of linear functions
cites work: The weighted majority algorithm
cites work: Convergence of stochastic processes
cites work: A game of prediction with expert advice
cites work: A decision-theoretic extension of stochastic complexity and its applications to learning
DOI: 10.1006/JCSS.1999.1635
description: scientific article; zbMATH DE number 1417879