Learning what to remember
From MaRDI portal
Cites work
- A spectral algorithm for learning hidden Markov models
- Counting large numbers of events in small registers
- Extractor-based time-space lower bounds for learning
- Fast learning requires good memory: a time-space lower bound for parity learning
- Finding frequent items in data streams
- Making online decisions with bounded memory
- Prediction, Learning, and Games
This page was built for publication: Learning what to remember
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028787)