Overview

Minimax estimation asks how accurately an unknown quantity can be recovered in the hardest case within a specified model, and how many observations are needed. Researchers establish upper bounds for concrete estimators and lower bounds that apply to every method, often using regularization, aggregation, thresholding, and information-theoretic tools such as Fano's and Le Cam's methods. The framework covers settings including nonparametric regression, sparse covariance and distribution estimation, one-bit data, dependent observations, and differential privacy. A central challenge is understanding when adaptation to unknown structure is possible without extra cost, especially when privacy, contamination, or computational limits change the achievable rates.

Latest papers

CardsList

96 papers23 papers in the last four weeks, up 92% on the four weeks before. 0.1% of all new papers.

  1. High-Dimensional Robust Mean Estimation with Untrusted Batches

    Feb 24, 2026Maryam Aliakbarpour, Vladimir Braverman, Yuhan Liu +1Robust Mean EstimationRobust Estimation

  2. Learning from Biased and Costly Data Sources: Minimax-optimal Data Collection under a Budget

    Feb 19, 2026Michael O. Harding, Vikas Singh, Kirthevasan KandasamyMinimax EstimationSelection Bias

  3. Ratio Covers of Convex Sets and Optimal Mixture Density Estimation

    Feb 18, 2026Spencer Compton, Gábor Lugosi, Jaouad Mourtada +2Density EstimationMinimax Estimation

  4. Locally Private Parametric Methods for Change-Point Detection

    Feb 14, 2026Anuj Kumar Yadav, Cemre Cadir, Yanina Y. Shkel +1Change-Point DetectionDifferential Privacy

  5. Optimal Estimation of Watermark Proportions in Hybrid AI-Human Texts

    Jun 27, 2025Xiang Li, Garrett Wen, Weiqing He +3Text WatermarkingMinimax Estimation

  6. On the minimax optimality of Flow Matching through the connection to kernel density estimation

    Apr 17, 2025Lea Kunkel, Mathias TrabsFlow MatchingGenerative Modeling