Sciweavers

590 search results - page 34 / 118
» Can We Learn to Beat the Best Stock
Sort
View
ISIPTA
2003
IEEE
125views Mathematics» more  ISIPTA 2003»
15 years 3 months ago
Game-Theoretic Learning Using the Imprecise Dirichlet Model
We discuss two approaches for choosing a strategy in a two-player game. We suppose that the game is played a large number of rounds, which allows the players to use observations o...
Erik Quaeghebeur, Gert de Cooman
IUI
2009
ACM
15 years 6 months ago
Learning to recognize valuable tags
Many websites use tags as a mechanism for improving item metadata through collective user effort. Users of tagging systems often apply far more tags to an item than a system can ...
Shilad Sen, Jesse Vig, John Riedl
ICASSP
2011
IEEE
14 years 1 months ago
Social norm and long-run learning in peer-to-peer networks
We start by formulating the resource sharing in peer-to-peer (P2P) networks as a random-matching gift-giving game, where self-interested peers aim at maximizing their own long-ter...
Yu Zhang, Mihaela van der Schaar
CSFW
2011
IEEE
13 years 9 months ago
Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection
Abstract—Audit mechanisms are essential for privacy protection in permissive access control regimes, such as in hospitals where denying legitimate access requests can adversely a...
Jeremiah Blocki, Nicolas Christin, Anupam Datta, A...
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
14 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro