{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ESRHVEQYROA5VBKAO7LIAT6E6L","short_pith_number":"pith:ESRHVEQY","schema_version":"1.0","canonical_sha256":"24a27a92188b81da854077d6804fc4f2e3e0cdc2eacf2fd86e32ecda8b04597d","source":{"kind":"arxiv","id":"1707.02198","version":1},"attestation_state":"computed","paper":{"title":"Learning Loss Functions for Semi-supervised Learning via Discriminative Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bowen Zhou, Cicero Nogueira dos Santos, Kahini Wadhawan","submitted_at":"2017-07-07T14:38:33Z","abstract_excerpt":"We propose discriminative adversarial networks (DAN) for semi-supervised learning and loss function learning. Our DAN approach builds upon generative adversarial networks (GANs) and conditional GANs but includes the key differentiator of using two discriminators instead of a generator and a discriminator. DAN can be seen as a framework to learn loss functions for predictors that also implements semi-supervised learning in a straightforward manner. We propose instantiations of DAN for two different prediction tasks: classification and ranking. Our experimental results on three datasets of diffe"},"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":"1707.02198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-07T14:38:33Z","cross_cats_sorted":[],"title_canon_sha256":"13ac9895f0972ac4aacd43aeba9011c60ff53cae960e0d448425f0fb653c5608","abstract_canon_sha256":"11b614920ee5f73b0d0d8f675319a370c66be2aa468e38404bec3a479da539cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:42.598525Z","signature_b64":"PC5HDl2vTYeKqkAneylB0kDs22rjA7itkXROvjBCFbZWceJi45PNGUASLMn1uTZe4ery41TDz779tMfofU4sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24a27a92188b81da854077d6804fc4f2e3e0cdc2eacf2fd86e32ecda8b04597d","last_reissued_at":"2026-05-18T00:40:42.597772Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:42.597772Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Loss Functions for Semi-supervised Learning via Discriminative Adversarial Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bowen Zhou, Cicero Nogueira dos Santos, Kahini Wadhawan","submitted_at":"2017-07-07T14:38:33Z","abstract_excerpt":"We propose discriminative adversarial networks (DAN) for semi-supervised learning and loss function learning. Our DAN approach builds upon generative adversarial networks (GANs) and conditional GANs but includes the key differentiator of using two discriminators instead of a generator and a discriminator. DAN can be seen as a framework to learn loss functions for predictors that also implements semi-supervised learning in a straightforward manner. We propose instantiations of DAN for two different prediction tasks: classification and ranking. Our experimental results on three datasets of diffe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02198","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":"1707.02198","created_at":"2026-05-18T00:40:42.597899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.02198v1","created_at":"2026-05-18T00:40:42.597899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02198","created_at":"2026-05-18T00:40:42.597899+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESRHVEQYROA5","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESRHVEQYROA5VBKA","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESRHVEQY","created_at":"2026-05-18T12:31:12.930513+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/ESRHVEQYROA5VBKAO7LIAT6E6L","json":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L.json","graph_json":"https://pith.science/api/pith-number/ESRHVEQYROA5VBKAO7LIAT6E6L/graph.json","events_json":"https://pith.science/api/pith-number/ESRHVEQYROA5VBKAO7LIAT6E6L/events.json","paper":"https://pith.science/paper/ESRHVEQY"},"agent_actions":{"view_html":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L","download_json":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L.json","view_paper":"https://pith.science/paper/ESRHVEQY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.02198&json=true","fetch_graph":"https://pith.science/api/pith-number/ESRHVEQYROA5VBKAO7LIAT6E6L/graph.json","fetch_events":"https://pith.science/api/pith-number/ESRHVEQYROA5VBKAO7LIAT6E6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L/action/storage_attestation","attest_author":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L/action/author_attestation","sign_citation":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L/action/citation_signature","submit_replication":"https://pith.science/pith/ESRHVEQYROA5VBKAO7LIAT6E6L/action/replication_record"}},"created_at":"2026-05-18T00:40:42.597899+00:00","updated_at":"2026-05-18T00:40:42.597899+00:00"}