{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S2YPETY4FSDJE736JVXVBZ7YXO","short_pith_number":"pith:S2YPETY4","schema_version":"1.0","canonical_sha256":"96b0f24f1c2c86927f7e4d6f50e7f8bbaa136a7410b744f5631138b0aa4867c4","source":{"kind":"arxiv","id":"1805.11710","version":1},"attestation_state":"computed","paper":{"title":"Active and Adaptive Sequential learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiaxun Lu, Venugopal V. Veeravalli, Yuheng Bu","submitted_at":"2018-05-29T21:15:42Z","abstract_excerpt":"A framework is introduced for actively and adaptively solving a sequence of machine learning problems, which are changing in bounded manner from one time step to the next. An algorithm is developed that actively queries the labels of the most informative samples from an unlabeled data pool, and that adapts to the change by utilizing the information acquired in the previous steps. Our analysis shows that the proposed active learning algorithm based on stochastic gradient descent achieves a near-optimal excess risk performance for maximum likelihood estimation. Furthermore, an estimator of the c"},"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.11710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-29T21:15:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a28f38dcd3fce9d74ab5d63586755b7e2d00513c6e662c5ab69c7660a94dc1aa","abstract_canon_sha256":"9ea5c408d92dc137c13b94094c3ed424eb49e9264ca329ef8d9fc3f3c5293fe1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:36.852569Z","signature_b64":"ZrTflMLDrZzSiM/TebuiNVx8FcBTCKG61XyjdvEdgzglvE+TR1A1uqH452lOaHP5g9LyUunbr036KvS2Q0lEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96b0f24f1c2c86927f7e4d6f50e7f8bbaa136a7410b744f5631138b0aa4867c4","last_reissued_at":"2026-05-18T00:14:36.851780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:36.851780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active and Adaptive Sequential learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiaxun Lu, Venugopal V. Veeravalli, Yuheng Bu","submitted_at":"2018-05-29T21:15:42Z","abstract_excerpt":"A framework is introduced for actively and adaptively solving a sequence of machine learning problems, which are changing in bounded manner from one time step to the next. An algorithm is developed that actively queries the labels of the most informative samples from an unlabeled data pool, and that adapts to the change by utilizing the information acquired in the previous steps. Our analysis shows that the proposed active learning algorithm based on stochastic gradient descent achieves a near-optimal excess risk performance for maximum likelihood estimation. Furthermore, an estimator of the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11710","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":""},"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.11710","created_at":"2026-05-18T00:14:36.851907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11710v1","created_at":"2026-05-18T00:14:36.851907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11710","created_at":"2026-05-18T00:14:36.851907+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2YPETY4FSDJ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2YPETY4FSDJE736","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2YPETY4","created_at":"2026-05-18T12:32:50.500415+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/S2YPETY4FSDJE736JVXVBZ7YXO","json":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO.json","graph_json":"https://pith.science/api/pith-number/S2YPETY4FSDJE736JVXVBZ7YXO/graph.json","events_json":"https://pith.science/api/pith-number/S2YPETY4FSDJE736JVXVBZ7YXO/events.json","paper":"https://pith.science/paper/S2YPETY4"},"agent_actions":{"view_html":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO","download_json":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO.json","view_paper":"https://pith.science/paper/S2YPETY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11710&json=true","fetch_graph":"https://pith.science/api/pith-number/S2YPETY4FSDJE736JVXVBZ7YXO/graph.json","fetch_events":"https://pith.science/api/pith-number/S2YPETY4FSDJE736JVXVBZ7YXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO/action/storage_attestation","attest_author":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO/action/author_attestation","sign_citation":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO/action/citation_signature","submit_replication":"https://pith.science/pith/S2YPETY4FSDJE736JVXVBZ7YXO/action/replication_record"}},"created_at":"2026-05-18T00:14:36.851907+00:00","updated_at":"2026-05-18T00:14:36.851907+00:00"}