Sciweavers

683 search results - page 48 / 137
» Generalization Bounds for Learning Kernels
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 6 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
NIPS
2004
13 years 10 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
EWRL
2008
13 years 10 months ago
Regularized Fitted Q-Iteration: Application to Planning
We consider planning in a Markovian decision problem, i.e., the problem of finding a good policy given access to a generative model of the environment. We propose to use fitted Q-i...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
ICML
2008
IEEE
14 years 9 months ago
Multi-classification by categorical features via clustering
We derive a generalization bound for multiclassification schemes based on grid clustering in categorical parameter product spaces. Grid clustering partitions the parameter space i...
Yevgeny Seldin, Naftali Tishby
ICML
2008
IEEE
14 years 9 months ago
Sequence kernels for predicting protein essentiality
The problem of identifying the minimal gene set required to sustain life is of crucial importance in understanding cellular mechanisms and designing therapeutic drugs. This work d...
Cyril Allauzen, Mehryar Mohri, Ameet Talwalkar