Sciweavers

2944 search results - page 23 / 589
» Improving Bound Propagation
Sort
View
ICML
2001
IEEE
14 years 8 months ago
An Improved Predictive Accuracy Bound for Averaging Classifiers
We present an improved bound on the difference between training and test errors for voting classifiers. This improved averaging bound provides a theoretical justification for popu...
John Langford, Matthias Seeger, Nimrod Megiddo
ECCC
2010
108views more  ECCC 2010»
13 years 4 months ago
Improved bounds for the randomized decision tree complexity of recursive majority
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
Frédéric Magniez, Ashwin Nayak, Mikl...
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 8 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan
DM
2008
104views more  DM 2008»
13 years 7 months ago
Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies
We improve upon the best known upper and lower bounds on the sizes of minimal feedback vertex sets in butterflies. Also, we construct new feedback vertex sets in grids so that for...
Florent R. Madelaine, Iain A. Stewart
MP
2010
128views more  MP 2010»
13 years 6 months ago
Copositivity cuts for improving SDP bounds on the clique number
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
Immanuel M. Bomze, Florian Frommlet, Marco Locatel...