{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6ERGAVAARRQHRK56MAILHSYMKW","short_pith_number":"pith:6ERGAVAA","schema_version":"1.0","canonical_sha256":"f1226054008c6078abbe6010b3cb0c5586913a4a3c5f3cbc6c27c1cbe4a6eefd","source":{"kind":"arxiv","id":"1408.2196","version":1},"attestation_state":"computed","paper":{"title":"Exponentiated Gradient Exploration for Active Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Djallel Bouneffouf","submitted_at":"2014-08-10T07:47:50Z","abstract_excerpt":"Active learning strategies respond to the costly labelling task in a supervised classification by selecting the most useful unlabelled examples in training a predictive model. Many conventional active learning algorithms focus on refining the decision boundary, rather than exploring new regions that can be more informative. In this setting, we propose a sequential algorithm named EG-Active that can improve any Active learning algorithm by an optimal random exploration. Experimental results show a statistically significant and appreciable improvement in the performance of our new approach over "},"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":"1408.2196","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-10T07:47:50Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"71a0cfb3291e0d9bc98de4769141e08e9f40c54b641fdaeb9a284b8013ce2e9e","abstract_canon_sha256":"0b2c52c1eda0cb5575e748e0e1411a9cb756bbbc9e743f74761be328cd8c532a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.103924Z","signature_b64":"ULheRTEBnzOVTrhEqH+xNIYoDe9rZgVNxVnP9RI6erZ+KUauHs4Kq3gj+CdtKOlbBEC2O+346VSMG7igGcTkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1226054008c6078abbe6010b3cb0c5586913a4a3c5f3cbc6c27c1cbe4a6eefd","last_reissued_at":"2026-05-18T02:45:30.103311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.103311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponentiated Gradient Exploration for Active Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Djallel Bouneffouf","submitted_at":"2014-08-10T07:47:50Z","abstract_excerpt":"Active learning strategies respond to the costly labelling task in a supervised classification by selecting the most useful unlabelled examples in training a predictive model. Many conventional active learning algorithms focus on refining the decision boundary, rather than exploring new regions that can be more informative. In this setting, we propose a sequential algorithm named EG-Active that can improve any Active learning algorithm by an optimal random exploration. Experimental results show a statistically significant and appreciable improvement in the performance of our new approach over "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2196","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":"1408.2196","created_at":"2026-05-18T02:45:30.103428+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2196v1","created_at":"2026-05-18T02:45:30.103428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2196","created_at":"2026-05-18T02:45:30.103428+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ERGAVAARRQH","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ERGAVAARRQHRK56","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ERGAVAA","created_at":"2026-05-18T12:28:16.859392+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/6ERGAVAARRQHRK56MAILHSYMKW","json":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW.json","graph_json":"https://pith.science/api/pith-number/6ERGAVAARRQHRK56MAILHSYMKW/graph.json","events_json":"https://pith.science/api/pith-number/6ERGAVAARRQHRK56MAILHSYMKW/events.json","paper":"https://pith.science/paper/6ERGAVAA"},"agent_actions":{"view_html":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW","download_json":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW.json","view_paper":"https://pith.science/paper/6ERGAVAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2196&json=true","fetch_graph":"https://pith.science/api/pith-number/6ERGAVAARRQHRK56MAILHSYMKW/graph.json","fetch_events":"https://pith.science/api/pith-number/6ERGAVAARRQHRK56MAILHSYMKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW/action/storage_attestation","attest_author":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW/action/author_attestation","sign_citation":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW/action/citation_signature","submit_replication":"https://pith.science/pith/6ERGAVAARRQHRK56MAILHSYMKW/action/replication_record"}},"created_at":"2026-05-18T02:45:30.103428+00:00","updated_at":"2026-05-18T02:45:30.103428+00:00"}