{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HFXQTFZ7HCEGAP4GHRCWXIHOXB","short_pith_number":"pith:HFXQTFZ7","schema_version":"1.0","canonical_sha256":"396f09973f3888603f863c456ba0eeb87c2714be81a5dc0d3cc00b10dc4139be","source":{"kind":"arxiv","id":"2501.11127","version":1},"attestation_state":"computed","paper":{"title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Jingxin Zhan, Kaicheng Jin, Yuchen Xin, Zhihua Zhang","submitted_at":"2025-01-19T17:35:45Z","abstract_excerpt":"We study a stochastic convex bandit problem where the subgaussian noise parameter is assumed to decrease linearly as the learner selects actions closer and closer to the minimizer of the convex loss function. Accordingly, we propose a Regularized Online Newton Method (RONM) for solving the problem, based on the Online Newton Method (ONM) of arXiv:2406.06506. Our RONM reaches a polylogarithmic regret in the time horizon $n$ when the loss function grows quadratically in the constraint set, which recovers the results of arXiv:2402.12042 in linear bandits. Our analyses rely on the growth rate of t"},"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":"2501.11127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-19T17:35:45Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"dd604c6a660f8a9f17b849f222c41db8c1703e81e5f7812ef40c93b5631e56d2","abstract_canon_sha256":"c372131018da11a42efc405366d9f4067d7d79efef8aa1a33560c908c027165a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:03.712323Z","signature_b64":"IGtKXUme+G76IGJccTNoY3nn1WHZ2yBuo8L5tFNRL1QB7cwh+ISRmPHf7zNljQUqHomVUMtjoO9zRxQ7lLzdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396f09973f3888603f863c456ba0eeb87c2714be81a5dc0d3cc00b10dc4139be","last_reissued_at":"2026-07-05T10:03:03.711846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:03.711846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Jingxin Zhan, Kaicheng Jin, Yuchen Xin, Zhihua Zhang","submitted_at":"2025-01-19T17:35:45Z","abstract_excerpt":"We study a stochastic convex bandit problem where the subgaussian noise parameter is assumed to decrease linearly as the learner selects actions closer and closer to the minimizer of the convex loss function. Accordingly, we propose a Regularized Online Newton Method (RONM) for solving the problem, based on the Online Newton Method (ONM) of arXiv:2406.06506. Our RONM reaches a polylogarithmic regret in the time horizon $n$ when the loss function grows quadratically in the constraint set, which recovers the results of arXiv:2402.12042 in linear bandits. Our analyses rely on the growth rate of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11127","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/2501.11127/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":"2501.11127","created_at":"2026-07-05T10:03:03.711909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11127v1","created_at":"2026-07-05T10:03:03.711909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11127","created_at":"2026-07-05T10:03:03.711909+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFXQTFZ7HCEG","created_at":"2026-07-05T10:03:03.711909+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFXQTFZ7HCEGAP4G","created_at":"2026-07-05T10:03:03.711909+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFXQTFZ7","created_at":"2026-07-05T10:03:03.711909+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB","json":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB.json","graph_json":"https://pith.science/api/pith-number/HFXQTFZ7HCEGAP4GHRCWXIHOXB/graph.json","events_json":"https://pith.science/api/pith-number/HFXQTFZ7HCEGAP4GHRCWXIHOXB/events.json","paper":"https://pith.science/paper/HFXQTFZ7"},"agent_actions":{"view_html":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB","download_json":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB.json","view_paper":"https://pith.science/paper/HFXQTFZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11127&json=true","fetch_graph":"https://pith.science/api/pith-number/HFXQTFZ7HCEGAP4GHRCWXIHOXB/graph.json","fetch_events":"https://pith.science/api/pith-number/HFXQTFZ7HCEGAP4GHRCWXIHOXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB/action/storage_attestation","attest_author":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB/action/author_attestation","sign_citation":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB/action/citation_signature","submit_replication":"https://pith.science/pith/HFXQTFZ7HCEGAP4GHRCWXIHOXB/action/replication_record"}},"created_at":"2026-07-05T10:03:03.711909+00:00","updated_at":"2026-07-05T10:03:03.711909+00:00"}