{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QCQXHMPHYOZMMG6PMSW2GY4RZS","short_pith_number":"pith:QCQXHMPH","schema_version":"1.0","canonical_sha256":"80a173b1e7c3b2c61bcf64ada36391cc9f3eab681cece6a338950ffa753d7856","source":{"kind":"arxiv","id":"1712.03010","version":2},"attestation_state":"computed","paper":{"title":"Coordinate Descent with Bandit Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farnood Salehi, L. Elisa Celis, Patrick Thiran","submitted_at":"2017-12-08T10:23:30Z","abstract_excerpt":"Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which would effectively negate the improvement in computational tractability that coordinate descent is intended to afford. To address this, we propose a new adaptive method for selecting a coordinate. First, we find a lower bound on the amount the cost function decreases when a coord"},"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":"1712.03010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-08T10:23:30Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"1353b03cd81d11af11255000635e02dd04f830f5de2f7c0f1909d75cb0df638b","abstract_canon_sha256":"8c388251106034840782d572f53397d6c0d3c13804810f17535c4fe5a8cb7167"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:17.822901Z","signature_b64":"hpFVKYKu/SdAFUYNpKecDbFi7pCj7Jc0zbkYqsIo3MESh3VDyjP76vZ96FXGe4bUXWXcfcy6nVLcp2YoEmj5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a173b1e7c3b2c61bcf64ada36391cc9f3eab681cece6a338950ffa753d7856","last_reissued_at":"2026-05-17T23:59:17.822355Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:17.822355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coordinate Descent with Bandit Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farnood Salehi, L. Elisa Celis, Patrick Thiran","submitted_at":"2017-12-08T10:23:30Z","abstract_excerpt":"Coordinate descent methods usually minimize a cost function by updating a random decision variable (corresponding to one coordinate) at a time. Ideally, we would update the decision variable that yields the largest decrease in the cost function. However, finding this coordinate would require checking all of them, which would effectively negate the improvement in computational tractability that coordinate descent is intended to afford. To address this, we propose a new adaptive method for selecting a coordinate. First, we find a lower bound on the amount the cost function decreases when a coord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03010","kind":"arxiv","version":2},"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":"1712.03010","created_at":"2026-05-17T23:59:17.822440+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.03010v2","created_at":"2026-05-17T23:59:17.822440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03010","created_at":"2026-05-17T23:59:17.822440+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCQXHMPHYOZM","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCQXHMPHYOZMMG6P","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCQXHMPH","created_at":"2026-05-18T12:31:37.085036+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/QCQXHMPHYOZMMG6PMSW2GY4RZS","json":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS.json","graph_json":"https://pith.science/api/pith-number/QCQXHMPHYOZMMG6PMSW2GY4RZS/graph.json","events_json":"https://pith.science/api/pith-number/QCQXHMPHYOZMMG6PMSW2GY4RZS/events.json","paper":"https://pith.science/paper/QCQXHMPH"},"agent_actions":{"view_html":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS","download_json":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS.json","view_paper":"https://pith.science/paper/QCQXHMPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.03010&json=true","fetch_graph":"https://pith.science/api/pith-number/QCQXHMPHYOZMMG6PMSW2GY4RZS/graph.json","fetch_events":"https://pith.science/api/pith-number/QCQXHMPHYOZMMG6PMSW2GY4RZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/action/storage_attestation","attest_author":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/action/author_attestation","sign_citation":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/action/citation_signature","submit_replication":"https://pith.science/pith/QCQXHMPHYOZMMG6PMSW2GY4RZS/action/replication_record"}},"created_at":"2026-05-17T23:59:17.822440+00:00","updated_at":"2026-05-17T23:59:17.822440+00:00"}