697 search results - page 98 / 140 » Convex Functions on Discrete Sets |
SUM
2009
Springer
14 years 3 months ago
2009
Springer
Bayesian networks are probabilistic graphical models widely employed in AI for the implementation of knowledge-based systems. Standard inference algorithms can update the beliefs a...
IJAR
2006
13 years 8 months ago
2006
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster-Shafer uncertainty, we only know the masses m...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
Potential games are a special class of games that admit tractable static and dynamic analysis. Intuitively, games that are "close" to a potential game should enjoy somewh...
ML
2010
ACM
13 years 3 months ago
2010
ACM
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
COLT
1999
Springer
14 years 1 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...