Sciweavers

835 search results - page 87 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ICPR
2006
IEEE
15 years 11 months ago
Learning Mixtures of Offline and Online features for Handwritten Stroke Recognition
In this paper we propose a novel scheme to combine offline and online features of handwritten strokes. The stateof-the-art methods in handwritten stroke recognition have used a pr...
C. V. Jawahar, Karteek Alahari, Satya Lahari Putre...
ICML
2009
IEEE
15 years 10 months ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
CADE
2001
Springer
15 years 10 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
ALT
2005
Springer
15 years 6 months ago
Defensive Universal Learning with Experts
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
Jan Poland, Marcus Hutter
IOR
2010
128views more  IOR 2010»
14 years 7 months ago
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
The paper considers a stylized model of a dynamic assortment optimization problem, where given a limited capacity constraint, we must decide the assortment of products to offer to...
Paat Rusmevichientong, Zuo-Jun Max Shen, David B. ...