Sciweavers

12194 search results - page 174 / 2439
» Numberings Optimal for Learning
Sort
View
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
15 years 6 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
NIPS
1998
15 years 6 months ago
SMEM Algorithm for Mixture Models
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Ryohei Nakano, Zoubin Ghahramani, Ge...
175
Voted
CORR
2011
Springer
230views Education» more  CORR 2011»
14 years 12 months ago
Computational Rationalization: The Inverse Equilibrium Problem
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
Kevin Waugh, Brian Ziebart, J. Andrew Bagnell
MP
2011
14 years 12 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
153
Voted
TEC
2010
120views more  TEC 2010»
14 years 11 months ago
Benefits of a Population: Five Mechanisms That Advantage Population-Based Algorithms
This paper identifies five distinct mechanisms by which a population-based algorithm might have an advantage over a solo-search algorithm in classical optimization. These mechanism...
Adam Prügel-Bennett