4 search results - page 1 / 1 » Learning Near-Pareto-Optimal Conventions in Polynomial Time |
NIPS
2003
13 years 6 months ago
2003
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
ICML
2004
IEEE
14 years 5 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
ICML
2005
IEEE
14 years 5 months ago
2005
IEEE
This paper presents a Support Vector Method for optimizing multivariate nonlinear performance measures like the F1score. Taking a multivariate prediction approach, we give an algo...
COLT
1994
Springer
13 years 9 months ago
1994
Springer
We propose and analyze a distribution learning algorithm for variable memory length Markov processes. These processes can be described by a subclass of probabilistic nite automata...