1974 search results - page 115 / 395 » Online learning in online auctions |
SOFSEM
2010
Springer
14 years 7 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
ICML
2003
IEEE
14 years 11 months ago
2003
IEEE
The majority of theoretical work in machine learning is done under the assumption of exchangeability: essentially, it is assumed that the examples are generated from the same prob...
ECTEL
2007
Springer
14 years 4 months ago
2007
Springer
Motivation to learn is affected by a student’s self-efficacy, goal orientation, locus of control and perceived task difficulty. In the classroom, teachers know how to motivate th...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
To complement standard fitness functions, we propose "Fitness Importance" (FI) as a novel meta-heuristic for online learning systems. We define FI and show how it can be...
ICA
2012
Springer
12 years 5 months ago
2012
Springer
Non-negative spectrogram factorization algorithms such as probabilistic latent component analysis (PLCA) have been shown to be quite powerful for source separation. When training d...