Sciweavers

417 search results - page 7 / 84
» Generalization Bounds for Some Ordinal Regression Algorithms
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
DIS
2005
Springer
14 years 27 days ago
Practical Algorithms for Pattern Based Linear Regression
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masa...
COLT
1999
Springer
13 years 11 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
FSS
2007
117views more  FSS 2007»
13 years 7 months ago
Multiple regression with fuzzy data
In this paper, we propose an iterative algorithm for multiple regression with fuzzy variables.While using the standard least-squares criterion as a performance index, we pose the ...
Andrzej Bargiela, Witold Pedrycz, Tomoharu Nakashi...
COLT
2004
Springer
13 years 11 months ago
Oracle Bounds and Exact Algorithm for Dyadic Classification Trees
This paper introduces a new method using dyadic decision trees for estimating a classification or a regression function in a multiclass classification problem. The estimator is bas...
Gilles Blanchard, Christin Schäfer, Yves Roze...