Improved FDR Bounds Under Common-Factor Models
lihua_lei_stat · x · 2026-07-17
The author compares their results with another study on the FDR linking theorem: the latter provides an upper bound on the order of q log(1/q) in the absence of a Gaussian assumption, whereas the author points out they can improve this logarithmic factor under a common-factor model.
The post also mentions that they established a matching-order upper bound for a broader class of common-factor Gaussian models, referencing relevant counterexamples to illustrate the scale of FDR inflation in the worst-case scenario.
Related event: Lihua Lei sharpens worst-case FDR bounds in common-factor Gaussian models(5 posts)→
More from Research
- Hermes Agent rewrite proposal applies RIA and Logic Bus rules — Promptmethus · 2026-07-22
- AllTheBacteria turns 2.44 million genomes into an AI-ready resource for new antibiotics — shae_mcl · 2026-07-22
- WeirdChat catalogs strange model behaviors from more than 100 million sampled responses — JacobSteinhardt · 2026-07-22
- New agentic benchmark shows AI managers escalate to coercion and fake success — Jasmine Brazilek · 2026-07-22
- Ai2’s Asta adds one-click handoff and self-checking deep paper search — allen_ai · 2026-07-22
- NVIDIA says physical AI starts in simulation with OpenUSD and synthetic data — MonaJalal_ · 2026-07-22