{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/towards-practical-mean-bounds-for-small","title":"Towards Practical Mean Bounds for Small Samples","arxiv_id":"2106.03163","date":"2021-06-06","proceeding":null,"authors":["My Phan","Philip S. Thomas","Erik Learned-Miller"],"abstract":"Historically, to bound the mean for small sample sizes, practitioners have had to choose between using methods with unrealistic assumptions about the unknown distribution (e.g., Gaussianity) and methods like Hoeffding's inequality that use weaker assumptions but produce much looser (wider) intervals. In 1969, Anderson (1969) proposed a mean confidence interval strictly better than or equal to Hoeffding's whose only assumption is that the distribution's support is contained in an interval $[a,b]$. For the first time since then, we present a new family of bounds that compares favorably to Anderson's. We prove that each bound in the family has {\\em guaranteed coverage}, i.e., it holds with probability at least $1-\\alpha$ for all distributions on an interval $[a,b]$. Furthermore, one of the bounds is tighter than or equal to Anderson's for all samples. In simulations, we show that for many distributions, the gain over Anderson's bound is substantial.","url_abs":"https://arxiv.org/abs/2106.03163v5","url_pdf":"https://arxiv.org/pdf/2106.03163v5.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"towards-practical-mean-bounds-for-small","repo_url":"https://github.com/myphan9/small_sample_mean_bounds","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2106.03163","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03163"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/myphan9/small_sample_mean_bounds","reach":null}],"summary":{"ran_draft_wrong":2,"ran_honours":1,"ran_fixture":1},"by_repo_kind":{"official":{"samples":4,"ran":4,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"9fa7685946249cae","entry":"b_alpha_linear","repo":"myphan9/small_sample_mean_bounds","repo_kind":"official","path":"bound_manual_solver.py","file_url":"https://github.com/myphan9/small_sample_mean_bounds/blob/HEAD/bound_manual_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9fa7685946249cae"}},{"code_sha256_prefix":"84ded445e96ceb5d","entry":"b_alpha_linear_inner","repo":"myphan9/small_sample_mean_bounds","repo_kind":"official","path":"bound_manual_solver.py","file_url":"https://github.com/myphan9/small_sample_mean_bounds/blob/HEAD/bound_manual_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"84ded445e96ceb5d"}},{"code_sha256_prefix":"64f23c00518a06a6","entry":"upper_triangle_vertices","repo":"myphan9/small_sample_mean_bounds","repo_kind":"official","path":"bound_manual_solver.py","file_url":"https://github.com/myphan9/small_sample_mean_bounds/blob/HEAD/bound_manual_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"64f23c00518a06a6"}},{"code_sha256_prefix":"30b635878c20b95a","entry":"vertices_with_intersection","repo":"myphan9/small_sample_mean_bounds","repo_kind":"official","path":"bound_manual_solver.py","file_url":"https://github.com/myphan9/small_sample_mean_bounds/blob/HEAD/bound_manual_solver.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"30b635878c20b95a"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}