3353 search results - page 480 / 671 » Laver and set theory |
187
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
143
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
We examine the problem of evaluating a policy in the contextual bandit setting using only observations collected during the execution of another policy. We show that policy evalua...
191
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
137
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
169
click to vote
SIGSOFT
2005
ACM
16 years 7 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...