{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BL5QJ7DDRWAV7ZHN3P3SRXNSYQ","short_pith_number":"pith:BL5QJ7DD","schema_version":"1.0","canonical_sha256":"0afb04fc638d815fe4eddbf728ddb2c40b18adab67b54cb97be5e24e49973ded","source":{"kind":"arxiv","id":"2408.04179","version":1},"attestation_state":"computed","paper":{"title":"An Upper Confidence Bound Approach to Estimating the Maximum Mean","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Liu Guangwu, Shi Wen, Zhang Kun","submitted_at":"2024-08-08T02:53:09Z","abstract_excerpt":"Estimating the maximum mean finds a variety of applications in practice. In this paper, we study estimation of the maximum mean using an upper confidence bound (UCB) approach where the sampling budget is adaptively allocated to one of the systems. We study in depth the existing grand average (GA) estimator, and propose a new largest-size average (LSA) estimator. Specifically, we establish statistical guarantees, including strong consistency, asymptotic mean squared errors, and central limit theorems (CLTs) for both estimators, which are new to the literature. We show that LSA is preferable ove"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2408.04179","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.ST","submitted_at":"2024-08-08T02:53:09Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"8b467a9f54c6a82bfb904ee14060c9dc91fc3a44030d0477426783afec252447","abstract_canon_sha256":"65dc522a4b95c01321abe540e63c74b85392b1fd811e76a650243f9f6cd8cb6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:29.293696Z","signature_b64":"V4g4w/7W9Bk98+5Zw7vaydCr4zs7cxl8fo5gB3qQTqEtffHB6d5SZdSwLDxV3P08QI93Tu4rq9WJup6pIb+eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0afb04fc638d815fe4eddbf728ddb2c40b18adab67b54cb97be5e24e49973ded","last_reissued_at":"2026-07-05T08:53:29.293249Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:29.293249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Confidence Bound Approach to Estimating the Maximum Mean","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Liu Guangwu, Shi Wen, Zhang Kun","submitted_at":"2024-08-08T02:53:09Z","abstract_excerpt":"Estimating the maximum mean finds a variety of applications in practice. In this paper, we study estimation of the maximum mean using an upper confidence bound (UCB) approach where the sampling budget is adaptively allocated to one of the systems. We study in depth the existing grand average (GA) estimator, and propose a new largest-size average (LSA) estimator. Specifically, we establish statistical guarantees, including strong consistency, asymptotic mean squared errors, and central limit theorems (CLTs) for both estimators, which are new to the literature. We show that LSA is preferable ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04179","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.04179/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2408.04179","created_at":"2026-07-05T08:53:29.293305+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04179v1","created_at":"2026-07-05T08:53:29.293305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04179","created_at":"2026-07-05T08:53:29.293305+00:00"},{"alias_kind":"pith_short_12","alias_value":"BL5QJ7DDRWAV","created_at":"2026-07-05T08:53:29.293305+00:00"},{"alias_kind":"pith_short_16","alias_value":"BL5QJ7DDRWAV7ZHN","created_at":"2026-07-05T08:53:29.293305+00:00"},{"alias_kind":"pith_short_8","alias_value":"BL5QJ7DD","created_at":"2026-07-05T08:53:29.293305+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02933","citing_title":"From Theory to Practice with RAVEN-UCB: Addressing Non-Stationarity in Multi-Armed Bandits through Variance Adaptation","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ","json":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ.json","graph_json":"https://pith.science/api/pith-number/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/graph.json","events_json":"https://pith.science/api/pith-number/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/events.json","paper":"https://pith.science/paper/BL5QJ7DD"},"agent_actions":{"view_html":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ","download_json":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ.json","view_paper":"https://pith.science/paper/BL5QJ7DD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04179&json=true","fetch_graph":"https://pith.science/api/pith-number/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/action/storage_attestation","attest_author":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/action/author_attestation","sign_citation":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/action/citation_signature","submit_replication":"https://pith.science/pith/BL5QJ7DDRWAV7ZHN3P3SRXNSYQ/action/replication_record"}},"created_at":"2026-07-05T08:53:29.293305+00:00","updated_at":"2026-07-05T08:53:29.293305+00:00"}