On sequential strategies for loss functions with memory

DOI10.1109/TIT.2002.1013135MaRDI QIDQ4674553zbMATH OpenOpenAlexFDO

Authors Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Marcelo J. Weinberger

Publication date 11 May 2005

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2002.1013135

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Memoryless sequences for general losses
• Learning with bounded memory in stochastic models
• Stochastic minimization with adaptive memory
• On optimum strategies for minimizing the exponential moments of a loss function
• Memory-Constrained No-Regret Learning in Adversarial Multi-Armed Bandits
• scientific article; zbMATH DE number 6001451
• A sequential dual method for the structured ramp loss minimization
• A new memory gradient method and its convergence
• scientific article; zbMATH DE number 5951924
• On Learning With Finite Memory

Cited in

(10)

• scientific article; zbMATH DE number 7014218 (Why is no real title available?)
• Stochastic goal-oriented error estimation with memory
• A universal online caching algorithm based on pattern matching
• A tree-weighting approach to sequential decision problems with multiplicative loss
• On delayed prediction of individual sequences
• Sensor networks: from dependence analysis via matroid bases to online synthesis
• Chasing Ghosts: Competing with Stateful Policies
• Regret in the on-line decision problem
• The strong law of large numbers for sequential decisions under uncertainty
• Memoryless sequences for general losses

This page was built for publication: On sequential strategies for loss functions with memory

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