Sciweavers

2103 search results - page 140 / 421
» Approximate Learning of Dynamic Models
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 9 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
ATAL
2008
Springer
15 years 7 months ago
Autonomous transfer for reinforcement learning
Recent work in transfer learning has succeeded in making reinforcement learning algorithms more efficient by incorporating knowledge from previous tasks. However, such methods typ...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
IOR
2010
128views more  IOR 2010»
15 years 2 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. ...
151
Voted
ICIP
2010
IEEE
15 years 2 months ago
Image modeling and enhancement via structured sparse model selection
An image representation framework based on structured sparse model selection is introduced in this work. The corresponding modeling dictionary is comprised of a family of learned ...
Guoshen Yu, Guillermo Sapiro, Stéphane Mall...
167
Voted
NIPS
2003
15 years 6 months ago
On the Dynamics of Boosting
In order to understand AdaBoost’s dynamics, especially its ability to maximize margins, we derive an associated simplified nonlinear iterated map and analyze its behavior in lo...
Cynthia Rudin, Ingrid Daubechies, Robert E. Schapi...