1252 search results - page 58 / 251 » Minimizing Learned Clauses |
ORL
2007
14 years 9 months ago
2007
We propose online decision strategies for time-dependent sequences of linear programs which use no distributional and minimal geometric assumptions about the data. These strategies...
TIP
1998
14 years 9 months ago
1998
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
NIPS
2007
14 years 11 months ago
2007
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We present a general PAC-Bayes theorem from which all known PAC-Bayes risk bounds are obtained as particular cases. We also propose different learning algorithms for finding linea...
NIPS
2004
14 years 11 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...