{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FYWJABY3ZIZGGQSQITSEDRV5LL","short_pith_number":"pith:FYWJABY3","schema_version":"1.0","canonical_sha256":"2e2c90071bca3263425044e441c6bd5adff21361064ebb6ae20d348640aca951","source":{"kind":"arxiv","id":"1707.09157","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA)","submitted_at":"2017-07-28T09:02:52Z","abstract_excerpt":"We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints corresponding to first-order stochastic dominance. We propose new discretization schemes that lead to simple and efficient algorithms based on zero-th, first, or higher order oracles; these algorithms also lead to improvements without isotonic constraints. Finally, our experiments show that non-convex loss functions can be much more robust to outliers for isoton"},"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":"1707.09157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-28T09:02:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"162add226803a314e94e5e12197e0ab156c79614467e1e1223b528d17fe33649","abstract_canon_sha256":"d600feb3fbd7f6fb87fe9dc49247587d162fe5ecce4c66a88b21a636822b4d71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:16.923814Z","signature_b64":"0namcBSh45rBMPLO4HS0Igua4lKk8yETkPr8JFIOuouLawnw1J029tObEdmzHDj4daDnk567YgvD7BkaHRGpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e2c90071bca3263425044e441c6bd5adff21361064ebb6ae20d348640aca951","last_reissued_at":"2026-05-18T00:39:16.923162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:16.923162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (SIERRA)","submitted_at":"2017-07-28T09:02:52Z","abstract_excerpt":"We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints corresponding to first-order stochastic dominance. We propose new discretization schemes that lead to simple and efficient algorithms based on zero-th, first, or higher order oracles; these algorithms also lead to improvements without isotonic constraints. Finally, our experiments show that non-convex loss functions can be much more robust to outliers for isoton"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09157","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":"1707.09157","created_at":"2026-05-18T00:39:16.923276+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09157v1","created_at":"2026-05-18T00:39:16.923276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09157","created_at":"2026-05-18T00:39:16.923276+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYWJABY3ZIZG","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYWJABY3ZIZGGQSQ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYWJABY3","created_at":"2026-05-18T12:31:15.632608+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/FYWJABY3ZIZGGQSQITSEDRV5LL","json":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL.json","graph_json":"https://pith.science/api/pith-number/FYWJABY3ZIZGGQSQITSEDRV5LL/graph.json","events_json":"https://pith.science/api/pith-number/FYWJABY3ZIZGGQSQITSEDRV5LL/events.json","paper":"https://pith.science/paper/FYWJABY3"},"agent_actions":{"view_html":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL","download_json":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL.json","view_paper":"https://pith.science/paper/FYWJABY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09157&json=true","fetch_graph":"https://pith.science/api/pith-number/FYWJABY3ZIZGGQSQITSEDRV5LL/graph.json","fetch_events":"https://pith.science/api/pith-number/FYWJABY3ZIZGGQSQITSEDRV5LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL/action/storage_attestation","attest_author":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL/action/author_attestation","sign_citation":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL/action/citation_signature","submit_replication":"https://pith.science/pith/FYWJABY3ZIZGGQSQITSEDRV5LL/action/replication_record"}},"created_at":"2026-05-18T00:39:16.923276+00:00","updated_at":"2026-05-18T00:39:16.923276+00:00"}