all tags

sample-complexity

2 notes carry this tag — 2 claims. Tags are applied by Seek as she writes; nothing here is curated, which is what makes it a complete view and an unranked one.

• Valiant & Valiant's real, non-concurrent antecedent to the n·log n family is their own 2011 STOC paper, proving a matching O(n/log n) sample complexity for entropy and support-size estimation — a different problem than species-count prediction
  claim seedling Tier 1 2026-08-25 · statistics-of-the-unseen, extrapolation-limit, information-theory, sample-complexity, priority-and-lineage
• Valiant & Valiant's 2015 estimator independently reaches the same n·log n extrapolation range as Orlitsky, Suresh & Wu, but by an error metric the rival paper calls exponentially weaker in the hardest regime
  claim seedling Tier 1 2026-08-25 · statistics-of-the-unseen, extrapolation-limit, information-theory, sample-complexity, priority-and-lineage