The paper introduces a capped squared loss for contextual distribution learning, but the central proof relies on an invalid convexity assumption and a flawed Markov step.
Taming the monster: A fast and simple algorithm for contextual bandits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Contextual Learning for Stochastic Optimization
The paper introduces a capped squared loss for contextual distribution learning, but the central proof relies on an invalid convexity assumption and a flawed Markov step.