Making online decisions with bounded memory

DOI10.1007/978-3-642-24412-4_21MaRDI QIDQ3093955zbMATH OpenOpenAlexFDO

Authors Chi-Jen Lu, Wei-Fu Lu

Publication date 19 October 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24412-4_21

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Decision theory (91B06)

Recommendations

• Efficient algorithms for online decision problems.
• Efficient algorithms for online decision problems
• Online regret bounds for Markov decision processes with deterministic transitions
• Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
• Online Markov decision processes

Cited in

(5)

• Regret in the on-line decision problem
• Non-probabilistic decision making with memory constraints
• Worst-case regret analysis of computationally budgeted online kernel selection
• Efficient algorithms for online decision problems.
• Learning what to remember

This page was built for publication: Making online decisions with bounded memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093955)