6142 search results - page 658 / 1229 » The Complexity of Partition Functions |
191
click to vote
VIS
2007
IEEE
16 years 8 months ago
2007
IEEE
Our ability to generate ever-larger, increasingly-complex data, has established the need for scalable methods that identify, and provide insight into, important variable trends and...
172
click to vote
ICML
2009
IEEE
16 years 8 months ago
2009
IEEE
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
160
click to vote
ICML
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the sparse grid combination technique for regression, which we regard as a problem of function reconstruction in some given function space. We use a regularised least ...
179
click to vote
ICML
2004
IEEE
16 years 8 months ago
2004
IEEE
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
193
click to vote
ICML
2003
IEEE
16 years 8 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...