{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SGHNWMKDJQ357PHK2GRT4B7J3C","short_pith_number":"pith:SGHNWMKD","schema_version":"1.0","canonical_sha256":"918edb31434c37dfbcead1a33e07e9d8bbd160f8e44d6b75a4c5682be6724a6e","source":{"kind":"arxiv","id":"2305.18409","version":3},"attestation_state":"computed","paper":{"title":"Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hao Ban, Kaiyi Ji, Peiyao Xiao","submitted_at":"2023-05-28T16:13:59Z","abstract_excerpt":"Multi-objective optimization (MOO) has become an influential framework in many machine learning problems with multiple objectives such as learning with multiple criteria and multi-task learning (MTL). In this paper, we propose a new direction-oriented multi-objective problem by regularizing the common descent direction within a neighborhood of a direction that optimizes a linear combination of objectives such as the average loss in MTL. This formulation includes GD and MGDA as special cases, enjoys the direction-oriented benefit as in CAGrad, and facilitates the design of stochastic algorithms"},"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":"2305.18409","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-28T16:13:59Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"fab3ced339a85f33fdabd4ea38697bd8a0bced7dfa1dfebb8b4c1d40f8c32fd3","abstract_canon_sha256":"9fb899bfd1ebbca266d3eedac98f7f81f660165c4d34e92764658ade7b97d39f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:17:53.527026Z","signature_b64":"b41JLwwlHHtcdPg9+2Zo7cEtjJUzMCpOsf+MhfLaJGeM+z2Ng1PYmMfM2jmGLHDCs1ODys1i69MN+PlyisbLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"918edb31434c37dfbcead1a33e07e9d8bbd160f8e44d6b75a4c5682be6724a6e","last_reissued_at":"2026-07-05T07:17:53.526538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:17:53.526538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hao Ban, Kaiyi Ji, Peiyao Xiao","submitted_at":"2023-05-28T16:13:59Z","abstract_excerpt":"Multi-objective optimization (MOO) has become an influential framework in many machine learning problems with multiple objectives such as learning with multiple criteria and multi-task learning (MTL). In this paper, we propose a new direction-oriented multi-objective problem by regularizing the common descent direction within a neighborhood of a direction that optimizes a linear combination of objectives such as the average loss in MTL. This formulation includes GD and MGDA as special cases, enjoys the direction-oriented benefit as in CAGrad, and facilitates the design of stochastic algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.18409","kind":"arxiv","version":3},"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/2305.18409/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":"2305.18409","created_at":"2026-07-05T07:17:53.526596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.18409v3","created_at":"2026-07-05T07:17:53.526596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.18409","created_at":"2026-07-05T07:17:53.526596+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGHNWMKDJQ35","created_at":"2026-07-05T07:17:53.526596+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGHNWMKDJQ357PHK","created_at":"2026-07-05T07:17:53.526596+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGHNWMKD","created_at":"2026-07-05T07:17:53.526596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.21397","citing_title":"Enabling Pareto-Stationarity Exploration in Multi-Objective Reinforcement Learning: A Multi-Objective Weighted-Chebyshev Actor-Critic Approach","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C","json":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C.json","graph_json":"https://pith.science/api/pith-number/SGHNWMKDJQ357PHK2GRT4B7J3C/graph.json","events_json":"https://pith.science/api/pith-number/SGHNWMKDJQ357PHK2GRT4B7J3C/events.json","paper":"https://pith.science/paper/SGHNWMKD"},"agent_actions":{"view_html":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C","download_json":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C.json","view_paper":"https://pith.science/paper/SGHNWMKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.18409&json=true","fetch_graph":"https://pith.science/api/pith-number/SGHNWMKDJQ357PHK2GRT4B7J3C/graph.json","fetch_events":"https://pith.science/api/pith-number/SGHNWMKDJQ357PHK2GRT4B7J3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C/action/storage_attestation","attest_author":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C/action/author_attestation","sign_citation":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C/action/citation_signature","submit_replication":"https://pith.science/pith/SGHNWMKDJQ357PHK2GRT4B7J3C/action/replication_record"}},"created_at":"2026-07-05T07:17:53.526596+00:00","updated_at":"2026-07-05T07:17:53.526596+00:00"}