Sciweavers

1652 search results - page 192 / 331
» Matching Vector Codes
Sort
View
NIPS
2008
15 years 1 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
66
Voted
CORR
2008
Springer
64views Education» more  CORR 2008»
14 years 11 months ago
Linearly Parameterized Bandits
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
Paat Rusmevichientong, John N. Tsitsiklis
FUIN
2002
107views more  FUIN 2002»
14 years 11 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
SIAMDM
2000
103views more  SIAMDM 2000»
14 years 11 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
IJDAR
2010
164views more  IJDAR 2010»
14 years 9 months ago
Distance-based classification of handwritten symbols
We study online classification of isolated handwritten symbols using distance measures on spaces of curves. We compare three distance-based measures on a vector space representatio...
Oleg Golubitsky, Stephen M. Watt