BoNGs: make recovery work for \(n\)-grams, \(n\ge 2\).
Treegrams
cf. Sida Wang
hyperdim vectors
document embedding (axioms?)
GANs for BoNGs
Long-term memory (COLT open problem) (Tue)
For convex optimization
Tue: this seems difficult because of “bottleneck” of probability \(\ll \rc{\poly(n)}\). Next step: familiarize with lower-bound techniques and try to prove lower bound.
Reinforcement learning (experiments - what to do?)