{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:66E6S43ALM3KI36EDRSCP5M3RY","short_pith_number":"pith:66E6S43A","schema_version":"1.0","canonical_sha256":"f789e973605b36a46fc41c6427f59b8e145998ef36c0dce2e43f238d7abef0d2","source":{"kind":"arxiv","id":"2109.05535","version":1},"attestation_state":"computed","paper":{"title":"Adversarial Representation Learning With Closed-Form Solvers","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bashir Sadeghi, Lan Wang, Vishnu Naresh Boddeti","submitted_at":"2021-09-12T15:12:23Z","abstract_excerpt":"Adversarial representation learning aims to learn data representations for a target task while removing unwanted sensitive information at the same time. Existing methods learn model parameters iteratively through stochastic gradient descent-ascent, which is often unstable and unreliable in practice. To overcome this challenge, we adopt closed-form solvers for the adversary and target task. We model them as kernel ridge regressors and analytically determine an upper-bound on the optimal dimensionality of representation. Our solution, dubbed OptNet-ARL, reduces to a stable one one-shot optimizat"},"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":"2109.05535","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-12T15:12:23Z","cross_cats_sorted":[],"title_canon_sha256":"7cd084494939816f47b975238be1bec3769c3e2330f15a910dbe92ea54ad469f","abstract_canon_sha256":"59462bd30c27ac747aab60bd3d35cef5bb4408dc842426fee86b91d83274c83f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:40.047401Z","signature_b64":"MaIEUQNrsl/DBa/U9uNakUJNpWXAfdAU9jUaTVNDeBhBGEimP3LnfIrSgjOFRjnorLJFSVzRXzDNur4vfNY7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f789e973605b36a46fc41c6427f59b8e145998ef36c0dce2e43f238d7abef0d2","last_reissued_at":"2026-07-05T03:13:40.047038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:40.047038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Representation Learning With Closed-Form Solvers","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bashir Sadeghi, Lan Wang, Vishnu Naresh Boddeti","submitted_at":"2021-09-12T15:12:23Z","abstract_excerpt":"Adversarial representation learning aims to learn data representations for a target task while removing unwanted sensitive information at the same time. Existing methods learn model parameters iteratively through stochastic gradient descent-ascent, which is often unstable and unreliable in practice. To overcome this challenge, we adopt closed-form solvers for the adversary and target task. We model them as kernel ridge regressors and analytically determine an upper-bound on the optimal dimensionality of representation. Our solution, dubbed OptNet-ARL, reduces to a stable one one-shot optimizat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.05535","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.05535/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.05535","created_at":"2026-07-05T03:13:40.047094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.05535v1","created_at":"2026-07-05T03:13:40.047094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.05535","created_at":"2026-07-05T03:13:40.047094+00:00"},{"alias_kind":"pith_short_12","alias_value":"66E6S43ALM3K","created_at":"2026-07-05T03:13:40.047094+00:00"},{"alias_kind":"pith_short_16","alias_value":"66E6S43ALM3KI36E","created_at":"2026-07-05T03:13:40.047094+00:00"},{"alias_kind":"pith_short_8","alias_value":"66E6S43A","created_at":"2026-07-05T03:13:40.047094+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/66E6S43ALM3KI36EDRSCP5M3RY","json":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY.json","graph_json":"https://pith.science/api/pith-number/66E6S43ALM3KI36EDRSCP5M3RY/graph.json","events_json":"https://pith.science/api/pith-number/66E6S43ALM3KI36EDRSCP5M3RY/events.json","paper":"https://pith.science/paper/66E6S43A"},"agent_actions":{"view_html":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY","download_json":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY.json","view_paper":"https://pith.science/paper/66E6S43A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.05535&json=true","fetch_graph":"https://pith.science/api/pith-number/66E6S43ALM3KI36EDRSCP5M3RY/graph.json","fetch_events":"https://pith.science/api/pith-number/66E6S43ALM3KI36EDRSCP5M3RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY/action/storage_attestation","attest_author":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY/action/author_attestation","sign_citation":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY/action/citation_signature","submit_replication":"https://pith.science/pith/66E6S43ALM3KI36EDRSCP5M3RY/action/replication_record"}},"created_at":"2026-07-05T03:13:40.047094+00:00","updated_at":"2026-07-05T03:13:40.047094+00:00"}