Sciweavers

779 search results - page 65 / 156
» Information-theoretic Competitive Learning
Sort
View
143
Voted
ICML
2010
IEEE
15 years 3 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...
134
Voted
ATAL
2010
Springer
15 years 3 months ago
PAC-MDP learning with knowledge-based admissible models
PAC-MDP algorithms approach the exploration-exploitation problem of reinforcement learning agents in an effective way which guarantees that with high probability, the algorithm pe...
Marek Grzes, Daniel Kudenko
129
Voted
PAMI
2006
206views more  PAMI 2006»
15 years 2 months ago
MILES: Multiple-Instance Learning via Embedded Instance Selection
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called...
Yixin Chen, Jinbo Bi, James Ze Wang
130
Voted
ML
2010
ACM
175views Machine Learning» more  ML 2010»
14 years 9 months ago
Concept learning in description logics using refinement operators
With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applica...
Jens Lehmann, Pascal Hitzler
137
Voted
JMLR
2012
13 years 5 months ago
Distance Metric Learning with Eigenvalue Optimization
The main theme of this paper is to develop a novel eigenvalue optimization framework for learning a Mahalanobis metric. Within this context, we introduce a novel metric learning a...
Yiming Ying, Peng Li