{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:EONCAKGC5GBCHDUG6PC4SWCYTX","short_pith_number":"pith:EONCAKGC","schema_version":"1.0","canonical_sha256":"239a2028c2e982238e86f3c5c958589de2e413730389d3fb5b2a7f4f1004f000","source":{"kind":"arxiv","id":"2604.26867","version":2},"attestation_state":"computed","paper":{"title":"Function-free Optimization via Comparison Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Katya Scheinberg, Zikai Xiong","submitted_at":"2026-04-29T16:34:11Z","abstract_excerpt":"In this work, we study optimization specified only through a comparison oracle: given two points, it reports which one is preferred. We call it function-free optimization because we do not assume access to, nor the existence of, a canonical application-given objective function. The goal is to find the most preferred feasible point, which we call the optimal solution. This model arises in preference- and ranking-based settings where objective values and derivatives are unavailable or meaningless. Even when a representative function exists, it may be nonsmooth, nonconvex, or discontinuous. We de"},"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":"2604.26867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-04-29T16:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"8cc25123f57772b347fc61ae5be670b2ab4d2f3054e52b0d3bfdc2e5260d3aa5","abstract_canon_sha256":"fb814d657d409a5a9d12c95406cfae2254fb7d31a2e03e586cb3cf3742a4efb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:14.628788Z","signature_b64":"PHz0Uv7JuUZYQx4Ft+htA5P8mk4S7uzIEpsshQ1MBZKtAN9XV5YlN3k+f0S+NqwWYS4C/zF2D6KCjhqZJ7AQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"239a2028c2e982238e86f3c5c958589de2e413730389d3fb5b2a7f4f1004f000","last_reissued_at":"2026-05-20T01:05:14.628029Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:14.628029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Function-free Optimization via Comparison Oracles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Katya Scheinberg, Zikai Xiong","submitted_at":"2026-04-29T16:34:11Z","abstract_excerpt":"In this work, we study optimization specified only through a comparison oracle: given two points, it reports which one is preferred. We call it function-free optimization because we do not assume access to, nor the existence of, a canonical application-given objective function. The goal is to find the most preferred feasible point, which we call the optimal solution. This model arises in preference- and ranking-based settings where objective values and derivatives are unavailable or meaningless. Even when a representative function exists, it may be nonsmooth, nonconvex, or discontinuous. We de"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"Under regularity of the preference relation in a d-dimensional Euclidean space, we estimate normal directions to accuracy ε using O(d log(d/ε)) comparisons, nearly matching a lower bound of Ω(d log(1/ε)). Under convexity, regularity, and a local growth condition on the regularity radius, the resulting normal direction descent method reaches an ε level-set optimality gap using at most Õ(d D²/ε²) comparisons over O(D²/ε²) normal direction estimation steps.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The regularity of the preference relation together with convexity and the local growth condition on the regularity radius; these are invoked to derive the normal-direction estimation and descent complexity bounds but are not guaranteed to hold for arbitrary comparison oracles.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"0c20cfc3539c15e702f52ea80fc4acf033b7701cb868d565942f0b9aee04df84"},"source":{"id":"2604.26867","kind":"arxiv","version":2},"verdict":{"id":"b83445bf-2d25-4542-bffc-130f793fb5af","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T11:53:01.481806Z","strongest_claim":"Under regularity of the preference relation in a d-dimensional Euclidean space, we estimate normal directions to accuracy ε using O(d log(d/ε)) comparisons, nearly matching a lower bound of Ω(d log(1/ε)). Under convexity, regularity, and a local growth condition on the regularity radius, the resulting normal direction descent method reaches an ε level-set optimality gap using at most Õ(d D²/ε²) comparisons over O(D²/ε²) normal direction estimation steps.","one_line_summary":"Introduces a comparison-oracle framework using preference level-set geometry to achieve near-optimal query complexity for normal direction estimation and descent-based optimization under regularity and convexity.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The regularity of the preference relation together with convexity and the local growth condition on the regularity radius; these are invoked to derive the normal-direction estimation and descent complexity bounds but are not guaranteed to hold for arbitrary comparison oracles.","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26867/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":"2604.26867","created_at":"2026-05-20T01:05:14.628157+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.26867v2","created_at":"2026-05-20T01:05:14.628157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26867","created_at":"2026-05-20T01:05:14.628157+00:00"},{"alias_kind":"pith_short_12","alias_value":"EONCAKGC5GBC","created_at":"2026-05-20T01:05:14.628157+00:00"},{"alias_kind":"pith_short_16","alias_value":"EONCAKGC5GBCHDUG","created_at":"2026-05-20T01:05:14.628157+00:00"},{"alias_kind":"pith_short_8","alias_value":"EONCAKGC","created_at":"2026-05-20T01:05:14.628157+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/EONCAKGC5GBCHDUG6PC4SWCYTX","json":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX.json","graph_json":"https://pith.science/api/pith-number/EONCAKGC5GBCHDUG6PC4SWCYTX/graph.json","events_json":"https://pith.science/api/pith-number/EONCAKGC5GBCHDUG6PC4SWCYTX/events.json","paper":"https://pith.science/paper/EONCAKGC"},"agent_actions":{"view_html":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX","download_json":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX.json","view_paper":"https://pith.science/paper/EONCAKGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.26867&json=true","fetch_graph":"https://pith.science/api/pith-number/EONCAKGC5GBCHDUG6PC4SWCYTX/graph.json","fetch_events":"https://pith.science/api/pith-number/EONCAKGC5GBCHDUG6PC4SWCYTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/action/storage_attestation","attest_author":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/action/author_attestation","sign_citation":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/action/citation_signature","submit_replication":"https://pith.science/pith/EONCAKGC5GBCHDUG6PC4SWCYTX/action/replication_record"}},"created_at":"2026-05-20T01:05:14.628157+00:00","updated_at":"2026-05-20T01:05:14.628157+00:00"}