Sciweavers

1863 search results - page 235 / 373
» Multiagent learning using a variable learning rate
Sort
View
WWW
2008
ACM
16 years 5 months ago
Dynamic cost-per-action mechanisms and applications to online advertising
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra
131
Voted
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
15 years 11 months ago
The Feature Importance Ranking Measure
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
Alexander Zien, Nicole Krämer, Sören Son...
ACMICEC
2006
ACM
157views ECommerce» more  ACMICEC 2006»
15 years 11 months ago
Adaptive mechanism design: a metalearning approach
Auction mechanism design has traditionally been a largely analytic process, relying on assumptions such as fully rational bidders. In practice, however, bidders often exhibit unkn...
David Pardoe, Peter Stone, Maytal Saar-Tsechansky,...
161
Voted
NIPS
2008
15 years 6 months ago
Implicit Mixtures of Restricted Boltzmann Machines
We present a mixture model whose components are Restricted Boltzmann Machines (RBMs). This possibility has not been considered before because computing the partition function of a...
Vinod Nair, Geoffrey E. Hinton
COLT
2006
Springer
15 years 7 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth