- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper treats the grouping of source trajectories into latent tasks as a decision: before each episode the learner either keeps the current hidden task or draws a new one. It argues that this choice changes the experiment. A parity construction seems to show that short same-task views can be uninformative while a long enough continuation is informative, and that a short-horizon information planner can miss that. For finite models with a depth limit and disjoint answers, the fixed-confidence cost looks like a Bellman–Chernoff game, computed by a Track-and-Stop rule with column generation. A small cross-modal calibration model is solved in closed form.
Critical strengths
The parity task seems to separate another fresh episode from one more view of the same latent, which ordinary one-episode access cannot see. Giving that choice an exact fixed-confidence price, rather than leaving it as part of the access model, looks like the part that would justify acceptance.
Critical weaknesses
The exact result seems to assume a known finite tree class and known likelihoods, so it does not yet say what a meta-learner without that model should do. The calibration section looks like a closed-form special case of the same game, rather than evidence about the meta-RL settings named in the introduction.
Questions for authors
- Why characterize a learner that already knows the quotient and the tree likelihoods, instead of the usual meta-RL interface, where the trial boundary is given and the agent does not get that model?
- Why leave task-boundary detection and latent-context change-point methods out of the comparison, since those already decide whether the current hidden task is still the one they are in?