{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3MMZBBCY5H6Z5XQR57EQQJQCZV","short_pith_number":"pith:3MMZBBCY","schema_version":"1.0","canonical_sha256":"db19908458e9fd9ede11efc9082602cd46b8cdade4288e7024d918149168a1dc","source":{"kind":"arxiv","id":"1411.7450","version":1},"attestation_state":"computed","paper":{"title":"Worst-Case Linear Discriminant Analysis as Scalable Semidefinite Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Chunhua Shen, Hui Li, Qinfeng Shi","submitted_at":"2014-11-27T02:52:56Z","abstract_excerpt":"In this paper, we propose an efficient semidefinite programming (SDP) approach to worst-case linear discriminant analysis (WLDA). Compared with the traditional LDA, WLDA considers the dimensionality reduction problem from the worst-case viewpoint, which is in general more robust for classification. However, the original problem of WLDA is non-convex and difficult to optimize. In this paper, we reformulate the optimization problem of WLDA into a sequence of semidefinite feasibility problems. To efficiently solve the semidefinite feasibility problems, we design a new scalable optimization method"},"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":"1411.7450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-27T02:52:56Z","cross_cats_sorted":[],"title_canon_sha256":"9179e0d16f8e10a0446b5948de4ae7ec912c8a718493f5468ac47cbfba97db20","abstract_canon_sha256":"7f4ff36d99ef032cb0721d87702f1771c957d19f8cb87f64a914a1de2f8831bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:31:45.444648Z","signature_b64":"OV4Z9GBR8FgNPyByn5vDx4uuLI/a3EqT+iidiQ1Mp48s66DYRFyVaC576jsyH2B037sb3rAgge+U+ibV1QlyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db19908458e9fd9ede11efc9082602cd46b8cdade4288e7024d918149168a1dc","last_reissued_at":"2026-07-05T06:31:45.444231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:31:45.444231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-Case Linear Discriminant Analysis as Scalable Semidefinite Feasibility Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Chunhua Shen, Hui Li, Qinfeng Shi","submitted_at":"2014-11-27T02:52:56Z","abstract_excerpt":"In this paper, we propose an efficient semidefinite programming (SDP) approach to worst-case linear discriminant analysis (WLDA). Compared with the traditional LDA, WLDA considers the dimensionality reduction problem from the worst-case viewpoint, which is in general more robust for classification. However, the original problem of WLDA is non-convex and difficult to optimize. In this paper, we reformulate the optimization problem of WLDA into a sequence of semidefinite feasibility problems. To efficiently solve the semidefinite feasibility problems, we design a new scalable optimization method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7450","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/1411.7450/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":"1411.7450","created_at":"2026-07-05T06:31:45.444300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7450v1","created_at":"2026-07-05T06:31:45.444300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7450","created_at":"2026-07-05T06:31:45.444300+00:00"},{"alias_kind":"pith_short_12","alias_value":"3MMZBBCY5H6Z","created_at":"2026-07-05T06:31:45.444300+00:00"},{"alias_kind":"pith_short_16","alias_value":"3MMZBBCY5H6Z5XQR","created_at":"2026-07-05T06:31:45.444300+00:00"},{"alias_kind":"pith_short_8","alias_value":"3MMZBBCY","created_at":"2026-07-05T06:31:45.444300+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/3MMZBBCY5H6Z5XQR57EQQJQCZV","json":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV.json","graph_json":"https://pith.science/api/pith-number/3MMZBBCY5H6Z5XQR57EQQJQCZV/graph.json","events_json":"https://pith.science/api/pith-number/3MMZBBCY5H6Z5XQR57EQQJQCZV/events.json","paper":"https://pith.science/paper/3MMZBBCY"},"agent_actions":{"view_html":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV","download_json":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV.json","view_paper":"https://pith.science/paper/3MMZBBCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7450&json=true","fetch_graph":"https://pith.science/api/pith-number/3MMZBBCY5H6Z5XQR57EQQJQCZV/graph.json","fetch_events":"https://pith.science/api/pith-number/3MMZBBCY5H6Z5XQR57EQQJQCZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV/action/storage_attestation","attest_author":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV/action/author_attestation","sign_citation":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV/action/citation_signature","submit_replication":"https://pith.science/pith/3MMZBBCY5H6Z5XQR57EQQJQCZV/action/replication_record"}},"created_at":"2026-07-05T06:31:45.444300+00:00","updated_at":"2026-07-05T06:31:45.444300+00:00"}