菜单

关于 🐙 GitHub
arXiv 提交日期: 2026-06-22
📄 Abstract - Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy

Minimax risk and regret are expectation-based criteria and do not capture rare but consequential failures. To address this concern, we develop a $\delta$-explicit minimax-quantile theory for interactive statistical decision making (ISDM). We first provide structural relations between minimax quantiles, lower minimax quantiles, and minimax risk. This includes a quantile-to-expectation conversion and an equivalence between strict and lower minimax quantiles outside a countable set of confidence levels. We then derive two converse tools for ISDM: a high-probability interactive Fano's method and a high-probability interactive Le Cam's method. Then, we show that mutual-information (MI) privacy can be handled in the same framework by restricting the admissible decision class. For coordinatewise Gaussian privatization, we derive a two-point template that isolates the privacy-induced variance inflation. We instantiate this template for Gaussian mean estimation, and use the same two-point strategy directly for two-armed Gaussian bandits. We then derive a minimax quantile lower bound for the $K$-armed Gaussian bandit problem, showing that the interactive Fano method captures the exploration cost over multiple possible best arms. The resulting lower bounds are explicit in the confidence level $\delta$ and in the privacy budget for the private problems. They yield $\log(1/\delta)/n$ scaling for squared-error Gaussian mean estimation, $\sqrt{T\log(1/\delta)}$ scaling for two-armed bounded-mean Gaussian bandits, and $\sqrt{KT\log(1/\delta)}$-type scaling for the $K$-armed bandits, with privacy appearing through a Gaussian variance-inflation factor for the private problems.

顶级标签: theory machine learning benchmark
详细标签: minimax quantile interactive decision making privacy bandits lower bounds 或 搜索:

交互式统计决策中带隐私保护的极小化分位数下界 / Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy


1️⃣ 一句话总结

本文提出了一套基于分位数而非期望值的理论框架,用于分析交互式统计决策中的最坏情况风险,并推导出在高隐私保护要求下,高斯均值估计和K臂老虎机问题所需样本量的明确下界,揭示了隐私保护与探索成本之间的权衡关系。

源自 arXiv: 2606.23096