Sciweavers

1055 search results - page 51 / 211
» Convex Factorization Machines
Sort
View
JCO
2010
169views more  JCO 2010»
14 years 11 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
ICML
2002
IEEE
16 years 1 months ago
Discovering Hierarchy in Reinforcement Learning with HEXQ
An open problem in reinforcement learning is discovering hierarchical structure. HEXQ, an algorithm which automatically attempts to decompose and solve a model-free factored MDP h...
Bernhard Hengst
ECTEL
2006
Springer
15 years 4 months ago
The AtGentive Project: Attentive Agents for Collaborative Learners
Abstract. Attention, which intervenes at many different levels such as the perception of the environment and the allocation of cognitive resources, appears to represent one of the ...
Claudia Roda, Thierry Nabeth
76
Voted
ICML
2010
IEEE
15 years 1 months ago
Exploiting Data-Independence for Fast Belief-Propagation
Maximum a posteriori (MAP) inference in graphical models requires that we maximize the sum of two terms: a data-dependent term, encoding the conditional likelihood of a certain la...
Julian John McAuley, Tibério S. Caetano
JMLR
2006
124views more  JMLR 2006»
15 years 15 days ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini