Sciweavers

107 search results - page 7 / 22
» General Loss Bounds for Universal Sequence Prediction
Sort
View
NIPS
1997
13 years 8 months ago
Relative Loss Bounds for Multidimensional Regression Problems
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
Jyrki Kivinen, Manfred K. Warmuth
ALT
2005
Springer
14 years 4 months ago
Mixture of Vector Experts
Abstract. We describe and analyze an algorithm for predicting a sequence of n-dimensional binary vectors based on a set of experts making vector predictions in [0, 1]n . We measure...
Matthew Henderson, John Shawe-Taylor, Janez Zerovn...
ALT
1999
Springer
13 years 11 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
CORR
2008
Springer
81views Education» more  CORR 2008»
13 years 7 months ago
Universal Denoising of Discrete-time Continuous-Amplitude Signals
We consider the problem of reconstructing a discrete-time continuous-amplitude signal corrupted by a known memoryless channel with a general output alphabet. We develop a sequence ...
Kamakshi Sivaramakrishnan, Tsachy Weissman
AI
1998
Springer
13 years 7 months ago
Worst-Case Analysis of the Perceptron and Exponentiated Update Algorithms
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
Tom Bylander