{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N5WALCUO74H37GGXR2KLZ3OP33","short_pith_number":"pith:N5WALCUO","schema_version":"1.0","canonical_sha256":"6f6c058a8eff0fbf98d78e94bcedcfded8e40428c44dde59852e0bba0fe2cf11","source":{"kind":"arxiv","id":"1607.03691","version":1},"attestation_state":"computed","paper":{"title":"Sequential Cost-Sensitive Feature Acquisition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gabriella Contardo, Ludovic Denoyer, Thierry Arti\\`eres","submitted_at":"2016-07-13T12:10:08Z","abstract_excerpt":"We propose a reinforcement learning based approach to tackle the cost-sensitive learning problem where each input feature has a specific cost. The acquisition process is handled through a stochastic policy which allows features to be acquired in an adaptive way. The general architecture of our approach relies on representation learning to enable performing prediction on any partially observed sample, whatever the set of its observed features are. The resulting model is an original mix of representation learning and of reinforcement learning ideas. It is learned with policy gradient techniques "},"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":"1607.03691","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-07-13T12:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"ffde6bb0c00c4700522ec7e1ee2d0c6e120be1af31d782b2f4e100abda47e2bd","abstract_canon_sha256":"4e52a55484e46a569ca0e7a24b31d9be4f8117d009d0ede8851af4660b37494d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:07.343932Z","signature_b64":"is1wcy4XNCbVX1z+tKfa/N8twHGAMs9HxNvyB1gmAz0Iy9J/88A2W3uDaTJEkof9tmyYsmYa+peYx0E5NWtFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f6c058a8eff0fbf98d78e94bcedcfded8e40428c44dde59852e0bba0fe2cf11","last_reissued_at":"2026-05-18T01:11:07.343444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:07.343444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Cost-Sensitive Feature Acquisition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gabriella Contardo, Ludovic Denoyer, Thierry Arti\\`eres","submitted_at":"2016-07-13T12:10:08Z","abstract_excerpt":"We propose a reinforcement learning based approach to tackle the cost-sensitive learning problem where each input feature has a specific cost. The acquisition process is handled through a stochastic policy which allows features to be acquired in an adaptive way. The general architecture of our approach relies on representation learning to enable performing prediction on any partially observed sample, whatever the set of its observed features are. The resulting model is an original mix of representation learning and of reinforcement learning ideas. It is learned with policy gradient techniques "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03691","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":"1607.03691","created_at":"2026-05-18T01:11:07.343513+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03691v1","created_at":"2026-05-18T01:11:07.343513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03691","created_at":"2026-05-18T01:11:07.343513+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5WALCUO74H3","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5WALCUO74H37GGX","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5WALCUO","created_at":"2026-05-18T12:30:32.724797+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/N5WALCUO74H37GGXR2KLZ3OP33","json":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33.json","graph_json":"https://pith.science/api/pith-number/N5WALCUO74H37GGXR2KLZ3OP33/graph.json","events_json":"https://pith.science/api/pith-number/N5WALCUO74H37GGXR2KLZ3OP33/events.json","paper":"https://pith.science/paper/N5WALCUO"},"agent_actions":{"view_html":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33","download_json":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33.json","view_paper":"https://pith.science/paper/N5WALCUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03691&json=true","fetch_graph":"https://pith.science/api/pith-number/N5WALCUO74H37GGXR2KLZ3OP33/graph.json","fetch_events":"https://pith.science/api/pith-number/N5WALCUO74H37GGXR2KLZ3OP33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33/action/storage_attestation","attest_author":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33/action/author_attestation","sign_citation":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33/action/citation_signature","submit_replication":"https://pith.science/pith/N5WALCUO74H37GGXR2KLZ3OP33/action/replication_record"}},"created_at":"2026-05-18T01:11:07.343513+00:00","updated_at":"2026-05-18T01:11:07.343513+00:00"}