A tree-weighting approach to sequential decision problems with multiplicative loss
From MaRDI portal
Publication:551626
DOI10.1016/J.SIGPRO.2010.09.007zbMath1217.91041OpenAlexW2060753468MaRDI QIDQ551626
Andrew Bean, Suleyman S. Kozat, Andrew C. Singer
Publication date: 21 July 2011
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.09.007
Statistical methods; risk measures (91G70) Decision theory (91B06) Empirical decision procedures; empirical Bayes procedures (62C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Twice-universal coding
- Universal portfolios with and without transaction costs.
- The Cost of Achieving the Best Portfolio in Hindsight
- Coding for a binary independent piecewise-identically-distributed source
- The context-tree weighting method: extensions
- Efficient Universal Portfolios for Past‐Dependent Target Classes
- Universal Piecewise Linear Prediction Via Context Trees
- Switching Strategies for Sequential Decision Problems With Multiplicative Loss With Application to Portfolios
- Low-complexity sequential lossless coding for piecewise-stationary memoryless sources
- On‐Line Portfolio Selection Using Multiplicative Updates
- Multi-stream adaptive evidence combination for noise robust ASR
- 10.1162/153244303321897672
- The context-tree weighting method: basic properties
- Universal portfolios with side information
- Context weighting for general finite-context sources
- Introduction to Digital Speech Processing
- NONPARAMETRIC KERNEL‐BASED SEQUENTIAL INVESTMENT STRATEGIES
- Portfolio Selection with Transaction Costs
- Internal regret in on-line portfolio selection
This page was built for publication: A tree-weighting approach to sequential decision problems with multiplicative loss