{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PG6OUHXARFIXRYVJB2LMPGA7JO","short_pith_number":"pith:PG6OUHXA","schema_version":"1.0","canonical_sha256":"79bcea1ee0895178e2a90e96c7981f4b920a806ba8102a76e4965dcd9ec8754f","source":{"kind":"arxiv","id":"1805.11386","version":2},"attestation_state":"computed","paper":{"title":"Uniform regret bounds over $R^d$ for the sequential linear regression problem with the square loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Gilles Stoltz (LMO), Malo Huard (LMO), Pierre Gaillard (SIERRA), S\\'ebastien Gerchinovitz (IMT)","submitted_at":"2018-05-29T12:26:14Z","abstract_excerpt":"We consider the setting of online linear regression for arbitrary deterministic sequences, with the square loss. We are interested in the aim set by Bartlett et al. (2015): obtain regret bounds that hold uniformly over all competitor vectors. When the feature sequence is known at the beginning of the game, they provided closed-form regret bounds of $2d B^2 \\ln T + \\mathcal{O}_T(1)$, where $T$ is the number of rounds and $B$ is a bound on the observations. Instead, we derive bounds with an optimal constant of $1$ in front of the $d B^2 \\ln T$ term. In the case of sequentially revealed features,"},"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":"1805.11386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-29T12:26:14Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"dea93bff124edfcadc0eec33b775b5dade00be6db8b1c3b473ab9838b6f89771","abstract_canon_sha256":"00117d8b8e4335492aade1bd1a268cb99e2658454cd83336b6a8ef15036c9750"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:52.993358Z","signature_b64":"n7E8JRkaCzGTA2otBIxYuZ4Gb/l6KeYP2S1k/O/uOozqwchdkMksQvftRUPMF6VQ2AyuffER9TqWSjtlEP5oCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79bcea1ee0895178e2a90e96c7981f4b920a806ba8102a76e4965dcd9ec8754f","last_reissued_at":"2026-05-17T23:52:52.992656Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:52.992656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform regret bounds over $R^d$ for the sequential linear regression problem with the square loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Gilles Stoltz (LMO), Malo Huard (LMO), Pierre Gaillard (SIERRA), S\\'ebastien Gerchinovitz (IMT)","submitted_at":"2018-05-29T12:26:14Z","abstract_excerpt":"We consider the setting of online linear regression for arbitrary deterministic sequences, with the square loss. We are interested in the aim set by Bartlett et al. (2015): obtain regret bounds that hold uniformly over all competitor vectors. When the feature sequence is known at the beginning of the game, they provided closed-form regret bounds of $2d B^2 \\ln T + \\mathcal{O}_T(1)$, where $T$ is the number of rounds and $B$ is a bound on the observations. Instead, we derive bounds with an optimal constant of $1$ in front of the $d B^2 \\ln T$ term. In the case of sequentially revealed features,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11386","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1805.11386","created_at":"2026-05-17T23:52:52.992771+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11386v2","created_at":"2026-05-17T23:52:52.992771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11386","created_at":"2026-05-17T23:52:52.992771+00:00"},{"alias_kind":"pith_short_12","alias_value":"PG6OUHXARFIX","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PG6OUHXARFIXRYVJ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PG6OUHXA","created_at":"2026-05-18T12:32:43.782077+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/PG6OUHXARFIXRYVJB2LMPGA7JO","json":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO.json","graph_json":"https://pith.science/api/pith-number/PG6OUHXARFIXRYVJB2LMPGA7JO/graph.json","events_json":"https://pith.science/api/pith-number/PG6OUHXARFIXRYVJB2LMPGA7JO/events.json","paper":"https://pith.science/paper/PG6OUHXA"},"agent_actions":{"view_html":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO","download_json":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO.json","view_paper":"https://pith.science/paper/PG6OUHXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11386&json=true","fetch_graph":"https://pith.science/api/pith-number/PG6OUHXARFIXRYVJB2LMPGA7JO/graph.json","fetch_events":"https://pith.science/api/pith-number/PG6OUHXARFIXRYVJB2LMPGA7JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/action/storage_attestation","attest_author":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/action/author_attestation","sign_citation":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/action/citation_signature","submit_replication":"https://pith.science/pith/PG6OUHXARFIXRYVJB2LMPGA7JO/action/replication_record"}},"created_at":"2026-05-17T23:52:52.992771+00:00","updated_at":"2026-05-17T23:52:52.992771+00:00"}