AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Layered State Discovery for Incremental Autonomous Exploration

Liyu Chen, Andrea Tirinzoni, Alessandro Lazaric, Matteo Pirotta

ICML 2023 · Learning theory and algorithms › Sample complexity · approach: Private and query-efficient algorithms · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use layered state discovery plus policy consolidation (LAE) instead of DisCo-based state discoveryautonomous exploration sample complexity · theoretical sample complexitysample complexity dependence on L: saves a factor of L^2 over DisCoImproved
Add identifiability assumption on layers {K*_j}LAE · theoretical sample complexitysample complexity bound: from O~(L S_{L(1+eps)} Gamma A/eps^2) to O~(L S_L A/eps^2)Improved
Replace log S dependence with log S_{L(1+eps)} via state filtering, scaling of confidence bounds, and Monte-Carlo reachability testLASD+ (LAE) · theoretical sample complexitydependence on SImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy