English static mirror for SEO/GEO · AI-assisted translation · Read Chinese original

A Complexity Measure for Active Learning in Multi-group Mean Estimation: Variance Local Curvature

Forum topic · 小凯 · 2026-06-16

Summary

This arXiv paper (2606.14690) by Abdellah Aznag, Rachel Cummings, and Adam N. Elmachtoub studies a max-risk objective for active learning in multi-group mean estimation modeled as d-armed bandits. A learner adaptively allocates a budget of T samples across d groups to minimize the worst-case uncertainty index max sigma_k^2 / n_k, where sigma_k is the standard deviation of arm k and n_k is its sample count. The authors develop a local minimax framework and prove the first general lower bound for this objective, valid for any finite-variance hypothesis class. The bound decomposes difficulty into three orthogonal factors: a budget term, a heteroscedasticity index capturing how unevenly uncertainty is spread across arms, and a model-dependent complexity measure called Variance Local Curvature (VLC). For smooth classes, VLC is a reparameterization of variance-Fisher information with closed forms for common families. Benchmarks against the strongest known upper bounds show near-optimality up to logarithmic factors, while revealing systematic gaps in highly heterogeneous instances. Key proof techniques include a loss-induced l1 geometry on the decision space and a representation-based instance generator reducing hard-instance constructions to explicit random matrix computations.

Paper Overview

Field: Machine Learning Authors: Abdellah Aznag, Rachel Cummings, Adam N. Elmachtoub Published: 2026-06-12 arXiv: 2606.14690

Abstract

We study a max-risk objective for active learning in a multi-group mean estimation d-armed bandits: a learner adaptively allocates a budget of T samples across d groups to minimize the worst-case uncertainty index max_{k in [d]} sigma_k^2 / n_k, where sigma_k is the standard deviation of the distribution of arm k, and n_k is the number of times arm k is sampled.

We develop a local minimax framework and prove the first general lower bound for this objective, valid for any finite-variance hypothesis class. The bound separates difficulty into three orthogonal factors:

  • Budget term: the total sampling budget T
  • Heteroscedasticity index: measuring how unevenly the uncertainty is spread across arms
  • Variance Local Curvature (VLC): a model-dependent complexity measure capturing how much information a local change in variance creates within the hypothesis class
For smooth classes, VLC is a reparameterization of variance-Fisher information, with closed-form values for common families. Benchmark comparisons against the strongest available upper bounds show near-optimality (within logarithmic factors) across a broad range, while identifying systematic gaps for highly heterogeneous instances.

The proofs introduce two key elements:

1. A loss-induced l1 geometry on the decision space 2. A representation-based instance generator that reduces hard-instance constructions to explicit random matrix computations

---

*Auto-collected on 2026-06-16*

Tags

#active-learning#bandits#mean-estimation#minimax-lower-bounds#statistics#machine-learning#arxiv

This page is an English static mirror generated for search and AI citation. It may be a full translation or structured summary of the Chinese original. Canonical interactive discussion lives on the Chinese page: https://zhichai.net/topic/177981386