{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X4Q34VZXYHNY3TFSGZYXHHL5WL","short_pith_number":"pith:X4Q34VZX","schema_version":"1.0","canonical_sha256":"bf21be5737c1db8dccb23671739d7db2e8be78f643cdc798334cfb60aca7c50d","source":{"kind":"arxiv","id":"1703.06925","version":1},"attestation_state":"computed","paper":{"title":"Black-Box Optimization in Machine Learning with Trust Region Based Derivative Free Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hiva Ghanbari, Katya Scheinberg","submitted_at":"2017-03-20T19:00:18Z","abstract_excerpt":"In this work, we utilize a Trust Region based Derivative Free Optimization (DFO-TR) method to directly maximize the Area Under Receiver Operating Characteristic Curve (AUC), which is a nonsmooth, noisy function. We show that AUC is a smooth function, in expectation, if the distributions of the positive and negative data points obey a jointly normal distribution. The practical performance of this algorithm is compared to three prominent Bayesian optimization methods and random search. The presented numerical results show that DFO-TR surpasses Bayesian optimization and random search on various b"},"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":"1703.06925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-20T19:00:18Z","cross_cats_sorted":[],"title_canon_sha256":"12a6ea248b56d9ed1dc8b8ea125e272fb72866f2bf125433efe9d11bb1d15b2d","abstract_canon_sha256":"799ba2356044793911713a0e7c810374276f7d2470ba5c23a2dc33f9e5aa4596"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:13.951560Z","signature_b64":"7JcskweF02IWvbGAxCI8AOLzExIDrLHxGAv9YSzR9MlJDT3W+1xcWKfWCCdtgBpRUq113lKZAKKISDOlCjsvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf21be5737c1db8dccb23671739d7db2e8be78f643cdc798334cfb60aca7c50d","last_reissued_at":"2026-05-18T00:48:13.950841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:13.950841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Black-Box Optimization in Machine Learning with Trust Region Based Derivative Free Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hiva Ghanbari, Katya Scheinberg","submitted_at":"2017-03-20T19:00:18Z","abstract_excerpt":"In this work, we utilize a Trust Region based Derivative Free Optimization (DFO-TR) method to directly maximize the Area Under Receiver Operating Characteristic Curve (AUC), which is a nonsmooth, noisy function. We show that AUC is a smooth function, in expectation, if the distributions of the positive and negative data points obey a jointly normal distribution. The practical performance of this algorithm is compared to three prominent Bayesian optimization methods and random search. The presented numerical results show that DFO-TR surpasses Bayesian optimization and random search on various b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06925","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":"1703.06925","created_at":"2026-05-18T00:48:13.950957+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06925v1","created_at":"2026-05-18T00:48:13.950957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06925","created_at":"2026-05-18T00:48:13.950957+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4Q34VZXYHNY","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4Q34VZXYHNY3TFS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4Q34VZX","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2312.03169","citing_title":"$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method","ref_index":18,"is_internal_anchor":true},{"citing_arxiv_id":"2506.20335","citing_title":"CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL","json":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL.json","graph_json":"https://pith.science/api/pith-number/X4Q34VZXYHNY3TFSGZYXHHL5WL/graph.json","events_json":"https://pith.science/api/pith-number/X4Q34VZXYHNY3TFSGZYXHHL5WL/events.json","paper":"https://pith.science/paper/X4Q34VZX"},"agent_actions":{"view_html":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL","download_json":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL.json","view_paper":"https://pith.science/paper/X4Q34VZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06925&json=true","fetch_graph":"https://pith.science/api/pith-number/X4Q34VZXYHNY3TFSGZYXHHL5WL/graph.json","fetch_events":"https://pith.science/api/pith-number/X4Q34VZXYHNY3TFSGZYXHHL5WL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL/action/storage_attestation","attest_author":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL/action/author_attestation","sign_citation":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL/action/citation_signature","submit_replication":"https://pith.science/pith/X4Q34VZXYHNY3TFSGZYXHHL5WL/action/replication_record"}},"created_at":"2026-05-18T00:48:13.950957+00:00","updated_at":"2026-05-18T00:48:13.950957+00:00"}