Sciweavers

11814 search results - page 270 / 2363
» On Generalization by Neural Networks
Sort
View
COLT
2001
Springer
15 years 11 months ago
Rademacher and Gaussian Complexities: Risk Bounds and Structural Results
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
Peter L. Bartlett, Shahar Mendelson
ECIR
2007
Springer
15 years 8 months ago
Hierarchical Browsing of Video Key Frames
We propose an innovative, general purpose, method to the selection and hierarchical representation of key frames of a video sequence for video summarization. It is able to create a...
Gianluigi Ciocca, Raimondo Schettini
EMNLP
2006
15 years 8 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
TKDE
2008
123views more  TKDE 2008»
15 years 6 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko
TNN
1998
100views more  TNN 1998»
15 years 6 months ago
A dynamical system perspective of structural learning with forgetting
—Structural learning with forgetting is an established method of using Laplace regularization to generate skeletal artificial neural networks. In this paper we develop a continu...
D. A. Miller, J. M. Zurada