Thomas Lumley • 7/26/2017

Tail bounds under sparse correlation

Read Original

This in-depth statistical article discusses deriving tail bounds (probability of deviations) for sums of non-independent random variables exhibiting 'sparse correlation', a structure common in scenarios like multi-rater reliability studies (e.g., radiologists rating images). It extends ideas from Bernstein's Inequality, focusing on cases where dependencies are limited, defined via a dependency graph with parameters M (max neighborhood size) and m (size of largest independent set).

0 comments
#statistics #Probability Bounds #Bernoulli Inequality
Tail bounds under sparse correlation

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
Limit token usage in Microsoft Agent Framework
Jesse Liberty • 1 votes
2
How to Roll Back AI Agents: Incident Response, Circuit Breakers, and Recovery Patterns
Paul Bryant • 1 votes
3
Avoiding Reasoning Model Failures with Microsoft Foundry
Luke Murray • 1 votes
4
When Your AI Agent Lies: Silent LLM Fallbacks
Luke Murray • 1 votes
5
Adding a custom MCP server to Claude and ChatGPT
Simon Willison • 1 votes
6
Testing AI prompts and comparing models with promptfoo
Tim Deschryver • 1 votes
7
Superlogical
Mitchell Hashimoto • 1 votes