atlas

Research map / Federated learning and privacy / Differential privacy

Improved Regret for Differentially Private Exploration in Linear MDP

ICML 2022 · Federated learning and privacy › Differential privacy · approach: Private online and user-level learning · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 adaptive policy updates triggered by sufficient changes in the data instead of a non-adaptive update schedulePrivate LSVI-UCB for linear MDPs · Linear MDP, K episodesregret bound: \widetilde{O}\pp{\sqrt{d^3 H^4 K} + \frac{d^{8/5} H^{11/5} K^{3/5}}{\epsilon^{2/5}}} -> \widetilde{O} \left ( d^{3/2} H^Helped
Use adaptive updates, yielding only O(log(K)) updates rather than polynomially many updatesPrivate LSVI-UCB · Linear MDP, K episodesnumber of policy updates: O(\mathrm{poly}(K)) -> O(\log(K))Helped
Use adaptive updates to reduce privacy noisePrivate LSVI-UCB · Linear MDP, K episodesprivacy cost in regret: K^{3/5} -> K^{1/2}Helped

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