1252 search results - page 157 / 251 » Minimizing Learned Clauses |
208
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
147
click to vote
WPES
2004
ACM
15 years 11 months ago
2004
ACM
In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather tha...
138
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalizatio...
134
click to vote
COLT
2006
Springer
15 years 9 months ago
2006
Springer
Stability is a common tool to verify the validity of sample based algorithms. In clustering it is widely used to tune the parameters of the algorithm, such as the number k of clust...
146
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...