{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DCFPL3RPUACYOX6ZFC6UXDMQ7M","short_pith_number":"pith:DCFPL3RP","schema_version":"1.0","canonical_sha256":"188af5ee2fa005875fd928bd4b8d90fb1f845c086e8b0f82e22056954a0d88ad","source":{"kind":"arxiv","id":"2603.21180","version":4},"attestation_state":"computed","paper":{"title":"ALMAB-DC: Active Learning, Multi-Armed Bandits, and Distributed Computing for Sequential Experimental Design and Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks.","cross_cats":["stat.CO","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Foo Hui-Mean, Yuan-chin I Chang","submitted_at":"2026-03-22T11:47:20Z","abstract_excerpt":"Sequential experimental design under expensive, gradient-free objectives is a central challenge in computational statistics: evaluation budgets are tightly constrained and information must be extracted efficiently from each observation. We propose \\textbf{ALMAB-DC}, a GP-based sequential design framework combining active learning, multi-armed bandits (MAB), and distributed asynchronous computing for expensive black-box experimentation. A Gaussian process surrogate with uncertainty-aware acquisition identifies informative query points; a UCB or Thompson-sampling bandit controller allocates eval"},"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":true},"canonical_record":{"source":{"id":"2603.21180","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-03-22T11:47:20Z","cross_cats_sorted":["stat.CO","stat.ME","stat.ML"],"title_canon_sha256":"17c146c9b7af9956c5f049f3c259b94beb2b2bc5b1ee742e4c0ad14e5d18304f","abstract_canon_sha256":"7caab0afb98dae47b8fb199dfc217472078b99a0d41b937d354400297159a952"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:49.005345Z","signature_b64":"JVKtFSyCQ7sWIyRnDt8qJDu6BvSgDJjqv5UiSBowmHzdN7GTjv67cdt1Jk2sk8ds1sWWR5TjWK37rk72mYgmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"188af5ee2fa005875fd928bd4b8d90fb1f845c086e8b0f82e22056954a0d88ad","last_reissued_at":"2026-06-04T01:08:49.004877Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:49.004877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ALMAB-DC: Active Learning, Multi-Armed Bandits, and Distributed Computing for Sequential Experimental Design and Black-Box Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks.","cross_cats":["stat.CO","stat.ME","stat.ML"],"primary_cat":"cs.LG","authors_text":"Foo Hui-Mean, Yuan-chin I Chang","submitted_at":"2026-03-22T11:47:20Z","abstract_excerpt":"Sequential experimental design under expensive, gradient-free objectives is a central challenge in computational statistics: evaluation budgets are tightly constrained and information must be extracted efficiently from each observation. We propose \\textbf{ALMAB-DC}, a GP-based sequential design framework combining active learning, multi-armed bandits (MAB), and distributed asynchronous computing for expensive black-box experimentation. A Gaussian process surrogate with uncertainty-aware acquisition identifies informative query points; a UCB or Thompson-sampling bandit controller allocates eval"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"ALMAB-DC achieves lower simple regret than Equal Spacing, Random, and D-optimal designs on statistical tasks, 93.4% CIFAR-10 accuracy outperforming BOHB and Optuna, 36.9% drag reduction, 50% RL improvement, and 7.5x speedup at K=16, with all advantages statistically significant.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The Gaussian process surrogate accurately models the black-box objective and that the UCB/Thompson sampling bandit controller with asynchronous scheduler effectively allocates evaluations without significant overhead or synchronization issues.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ALMAB-DC integrates Gaussian process active learning with multi-armed bandit allocation and distributed asynchronous computing to achieve lower regret and faster wall-clock performance in sequential experimental design.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9505a03ab8dd0d292de9eb3e470795325d8126ea178c754c495e7fe7ffd07437"},"source":{"id":"2603.21180","kind":"arxiv","version":4},"verdict":{"id":"25452ec5-db9c-4cb2-b0a0-73640a864df8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T07:12:13.237692Z","strongest_claim":"ALMAB-DC achieves lower simple regret than Equal Spacing, Random, and D-optimal designs on statistical tasks, 93.4% CIFAR-10 accuracy outperforming BOHB and Optuna, 36.9% drag reduction, 50% RL improvement, and 7.5x speedup at K=16, with all advantages statistically significant.","one_line_summary":"ALMAB-DC integrates Gaussian process active learning with multi-armed bandit allocation and distributed asynchronous computing to achieve lower regret and faster wall-clock performance in sequential experimental design.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The Gaussian process surrogate accurately models the black-box objective and that the UCB/Thompson sampling bandit controller with asynchronous scheduler effectively allocates evaluations without significant overhead or synchronization issues.","pith_extraction_headline":"ALMAB-DC pairs Gaussian process active learning with multi-armed bandit allocation and asynchronous distributed scheduling to cut regret and wall-clock time on expensive black-box tasks."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.21180/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":2,"snapshot_sha256":"b51a747aa0fdc5041e199a619c3e1497d24ee5fa4e7372409adaaeb0b37005f3"},"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":"2603.21180","created_at":"2026-06-04T01:08:49.004932+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.21180v4","created_at":"2026-06-04T01:08:49.004932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.21180","created_at":"2026-06-04T01:08:49.004932+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCFPL3RPUACY","created_at":"2026-06-04T01:08:49.004932+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCFPL3RPUACYOX6Z","created_at":"2026-06-04T01:08:49.004932+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCFPL3RP","created_at":"2026-06-04T01:08:49.004932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M","json":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M.json","graph_json":"https://pith.science/api/pith-number/DCFPL3RPUACYOX6ZFC6UXDMQ7M/graph.json","events_json":"https://pith.science/api/pith-number/DCFPL3RPUACYOX6ZFC6UXDMQ7M/events.json","paper":"https://pith.science/paper/DCFPL3RP"},"agent_actions":{"view_html":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M","download_json":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M.json","view_paper":"https://pith.science/paper/DCFPL3RP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.21180&json=true","fetch_graph":"https://pith.science/api/pith-number/DCFPL3RPUACYOX6ZFC6UXDMQ7M/graph.json","fetch_events":"https://pith.science/api/pith-number/DCFPL3RPUACYOX6ZFC6UXDMQ7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/action/storage_attestation","attest_author":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/action/author_attestation","sign_citation":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/action/citation_signature","submit_replication":"https://pith.science/pith/DCFPL3RPUACYOX6ZFC6UXDMQ7M/action/replication_record"}},"created_at":"2026-06-04T01:08:49.004932+00:00","updated_at":"2026-06-04T01:08:49.004932+00:00"}