{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZHQZ334IQBI2BCNFBHXQTVHSMW","short_pith_number":"pith:ZHQZ334I","schema_version":"1.0","canonical_sha256":"c9e19def888051a089a509ef09d4f2658f28f12d4ab34c302ed337a99c194808","source":{"kind":"arxiv","id":"1901.00243","version":2},"attestation_state":"computed","paper":{"title":"Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kimmo Karkkainen, Majid Sarrafzadeh, Mohammad Kachuee, Orpaz Goldstein, Sajad Darabi","submitted_at":"2019-01-02T02:33:54Z","abstract_excerpt":"In many real-world learning scenarios, features are only acquirable at a cost constrained under a budget. In this paper, we propose a novel approach for cost-sensitive feature acquisition at the prediction-time. The suggested method acquires features incrementally based on a context-aware feature-value function. We formulate the problem in the reinforcement learning paradigm, and introduce a reward function based on the utility of each feature. Specifically, MC dropout sampling is used to measure expected variations of the model uncertainty which is used as a feature-value function. Furthermor"},"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":"1901.00243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-02T02:33:54Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"3a1f0b8c405f63a60ddb26cdaa569dce843650462a31c7a13c82a07915c4e702","abstract_canon_sha256":"e2272e17ed388528f034a9cb4a9411d321fe48a522eb2dd2a0706fb6f3b54b83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:49.714055Z","signature_b64":"MBD+cxPvpUlyBbdEVEk7YD6HtuTqHRHr4jHhymLq9gVyueTxnlmOARH69Ykri9CDTncaaDcQi9uNKiAGH6j2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9e19def888051a089a509ef09d4f2658f28f12d4ab34c302ed337a99c194808","last_reissued_at":"2026-05-17T23:53:49.713417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:49.713417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kimmo Karkkainen, Majid Sarrafzadeh, Mohammad Kachuee, Orpaz Goldstein, Sajad Darabi","submitted_at":"2019-01-02T02:33:54Z","abstract_excerpt":"In many real-world learning scenarios, features are only acquirable at a cost constrained under a budget. In this paper, we propose a novel approach for cost-sensitive feature acquisition at the prediction-time. The suggested method acquires features incrementally based on a context-aware feature-value function. We formulate the problem in the reinforcement learning paradigm, and introduce a reward function based on the utility of each feature. Specifically, MC dropout sampling is used to measure expected variations of the model uncertainty which is used as a feature-value function. Furthermor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00243","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":"1901.00243","created_at":"2026-05-17T23:53:49.713522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00243v2","created_at":"2026-05-17T23:53:49.713522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00243","created_at":"2026-05-17T23:53:49.713522+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHQZ334IQBI2","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHQZ334IQBI2BCNF","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHQZ334I","created_at":"2026-05-18T12:33:33.725879+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/ZHQZ334IQBI2BCNFBHXQTVHSMW","json":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW.json","graph_json":"https://pith.science/api/pith-number/ZHQZ334IQBI2BCNFBHXQTVHSMW/graph.json","events_json":"https://pith.science/api/pith-number/ZHQZ334IQBI2BCNFBHXQTVHSMW/events.json","paper":"https://pith.science/paper/ZHQZ334I"},"agent_actions":{"view_html":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW","download_json":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW.json","view_paper":"https://pith.science/paper/ZHQZ334I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00243&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHQZ334IQBI2BCNFBHXQTVHSMW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHQZ334IQBI2BCNFBHXQTVHSMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/action/storage_attestation","attest_author":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/action/author_attestation","sign_citation":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/action/citation_signature","submit_replication":"https://pith.science/pith/ZHQZ334IQBI2BCNFBHXQTVHSMW/action/replication_record"}},"created_at":"2026-05-17T23:53:49.713522+00:00","updated_at":"2026-05-17T23:53:49.713522+00:00"}