{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PLQVDZAQLID7Z3TNLYTCJNNTCY","short_pith_number":"pith:PLQVDZAQ","schema_version":"1.0","canonical_sha256":"7ae151e4105a07fcee6d5e2624b5b316313a74645a35fde2ce549fab6c80df69","source":{"kind":"arxiv","id":"1806.04798","version":1},"attestation_state":"computed","paper":{"title":"Meta-Learning Transferable Active Learning Policies by Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kunkun Pang, Mingzhi Dong, Timothy Hospedales, Yang Wu","submitted_at":"2018-06-12T23:52:08Z","abstract_excerpt":"Active learning (AL) aims to enable training high performance classifiers with low annotation cost by predicting which subset of unlabelled instances would be most beneficial to label. The importance of AL has motivated extensive research, proposing a wide variety of manually designed AL algorithms with diverse theoretical and intuitive motivations. In contrast to this body of research, we propose to treat active learning algorithm design as a meta-learning problem and learn the best criterion from data. We model an active learning algorithm as a deep neural network that inputs the base learne"},"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":"1806.04798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-12T23:52:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f1b887ef70dd08b47b4f33501aa78d9d0714f9964cdb42b4b0f2b97087f9c6e9","abstract_canon_sha256":"5899ccd7c1fda98ee2707882b39f362de7e65be412597a98a5161ff203089751"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:20.857087Z","signature_b64":"TCKH6vdmNMn1GUGNdf4QJxOK3Eiq8RuH2XwfrsWyc+i6+4SSRq289I/XWh2z75Bqg72Ks9A5cYIebE+ozzZGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ae151e4105a07fcee6d5e2624b5b316313a74645a35fde2ce549fab6c80df69","last_reissued_at":"2026-05-18T00:13:20.856530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:20.856530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta-Learning Transferable Active Learning Policies by Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kunkun Pang, Mingzhi Dong, Timothy Hospedales, Yang Wu","submitted_at":"2018-06-12T23:52:08Z","abstract_excerpt":"Active learning (AL) aims to enable training high performance classifiers with low annotation cost by predicting which subset of unlabelled instances would be most beneficial to label. The importance of AL has motivated extensive research, proposing a wide variety of manually designed AL algorithms with diverse theoretical and intuitive motivations. In contrast to this body of research, we propose to treat active learning algorithm design as a meta-learning problem and learn the best criterion from data. We model an active learning algorithm as a deep neural network that inputs the base learne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04798","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":"1806.04798","created_at":"2026-05-18T00:13:20.856612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04798v1","created_at":"2026-05-18T00:13:20.856612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04798","created_at":"2026-05-18T00:13:20.856612+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLQVDZAQLID7","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLQVDZAQLID7Z3TN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLQVDZAQ","created_at":"2026-05-18T12:32:46.962924+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/PLQVDZAQLID7Z3TNLYTCJNNTCY","json":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY.json","graph_json":"https://pith.science/api/pith-number/PLQVDZAQLID7Z3TNLYTCJNNTCY/graph.json","events_json":"https://pith.science/api/pith-number/PLQVDZAQLID7Z3TNLYTCJNNTCY/events.json","paper":"https://pith.science/paper/PLQVDZAQ"},"agent_actions":{"view_html":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY","download_json":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY.json","view_paper":"https://pith.science/paper/PLQVDZAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04798&json=true","fetch_graph":"https://pith.science/api/pith-number/PLQVDZAQLID7Z3TNLYTCJNNTCY/graph.json","fetch_events":"https://pith.science/api/pith-number/PLQVDZAQLID7Z3TNLYTCJNNTCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY/action/storage_attestation","attest_author":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY/action/author_attestation","sign_citation":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY/action/citation_signature","submit_replication":"https://pith.science/pith/PLQVDZAQLID7Z3TNLYTCJNNTCY/action/replication_record"}},"created_at":"2026-05-18T00:13:20.856612+00:00","updated_at":"2026-05-18T00:13:20.856612+00:00"}