Sciweavers

2095 search results - page 71 / 419
» Improved pebbling bounds
Sort
View
ICONIP
2004
13 years 11 months ago
An Auxiliary Variational Method
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...
Felix V. Agakov, David Barber
NIPS
2003
13 years 11 months ago
PAC-Bayesian Generic Chaining
There exist many different generalization error bounds for classification. Each of these bounds contains an improvement over the others for certain situations. Our goal is to com...
Jean-Yves Audibert, Olivier Bousquet
SIGECOM
2011
ACM
219views ECommerce» more  SIGECOM 2011»
13 years 24 days ago
GSP auctions with correlated types
The Generalized Second Price (GSP) auction is the primary method by which sponsered search advertisements are sold. We study the performance of this auction in the Bayesian settin...
Brendan Lucier, Renato Paes Leme
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
14 years 4 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 10 months ago
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
—We consider the problem of minimizing upper bounds and maximizing lower bounds on information rates of stationary and ergodic discrete-time channels with memory. The channels we...
Parastoo Sadeghi, Pascal O. Vontobel, Ramtin Shams