pith. sign in

arxiv: 2501.14928 · v1 · pith:5LZTV6OGnew · submitted 2025-01-24 · 💻 cs.LG · cs.AI· cs.IT· math.IT· math.ST· stat.ML· stat.TH

Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy

classification 💻 cs.LG cs.AIcs.ITmath.ITmath.STstat.MLstat.TH
keywords decisionmakingframeworklearningdifferentialhybridlocalprivacy
0
0 comments X
read the original abstract

We study the problem of interactive decision making in which the underlying environment changes over time subject to given constraints. We propose a framework, which we call \textit{hybrid Decision Making with Structured Observations} (hybrid DMSO), that provides an interpolation between the stochastic and adversarial settings of decision making. Within this framework, we can analyze local differentially private (LDP) decision making, query-based learning (in particular, SQ learning), and robust and smooth decision making under the same umbrella, deriving upper and lower bounds based on variants of the Decision-Estimation Coefficient (DEC). We further establish strong connections between the DEC's behavior, the SQ dimension, local minimax complexity, learnability, and joint differential privacy. To showcase the framework's power, we provide new results for contextual bandits under the LDP constraint.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Sample Complexity of Multiclass and Sparse Contextual Bandits

    cs.LG 2026-05 unverdicted novelty 8.0

    Algorithms and matching lower bounds for s-sparse contextual bandits yield Õ((s/ε² + |A|/ε) log |Π|/δ) samples to output an ε-optimal policy.

  2. Minimax Quantile Lower Bounds for Interactive Statistical Decision Making with Privacy

    cs.LG 2026-06 unverdicted novelty 7.0

    Derives explicit minimax quantile lower bounds for Gaussian mean estimation and K-armed bandits under interactive decision making and MI privacy, with log(1/δ)/n and √(KT log(1/δ)) scalings.