740 search results - page 125 / 148 » Lower bounds for Buchsbaum* complexes |
156
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
161
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
189
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
159
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
164
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...