2944 search results - page 182 / 589 » Improving Bound Propagation |
ESANN
2001
13 years 11 months ago
2001
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
NIPS
2000
13 years 11 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
IJSYSC
1998
13 years 10 months ago
1998
This paper presents a new analysis and design method for model reference adaptive control(MRAC) with arbitrary bounded input nonlinearities. The adaptive algorithm ensures that th...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
SIAMDM
2010
13 years 5 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...