{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/direction-oriented-multi-objective-learning","title":"Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms","arxiv_id":"2305.18409","date":"2023-05-28","proceeding":"NeurIPS 2023 11","authors":["Peiyao Xiao","Hao Ban","Kaiyi Ji"],"abstract":"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. To solve this problem, we propose Stochastic Direction-oriented Multi-objective Gradient descent (SDMGrad) with simple SGD type of updates, and its variant SDMGrad-OS with an efficient objective sampling in the setting where the number of objectives is large. For a constant-level regularization parameter $\\lambda$, we show that SDMGrad and SDMGrad-OS provably converge to a Pareto stationary point with improved complexities and milder assumptions. For an increasing $\\lambda$, this convergent point reduces to a stationary point of the linear combination of objectives. We demonstrate the superior performance of the proposed methods in a series of tasks on multi-task supervised learning and reinforcement learning. Code is provided at https://github.com/ml-opt-lab/sdmgrad.","url_abs":"https://arxiv.org/abs/2305.18409v3","url_pdf":"https://arxiv.org/pdf/2305.18409v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"direction-oriented-multi-objective-learning","repo_url":"https://github.com/ml-opt-lab/sdmgrad","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"multi-task-learning","task_name":"Multi-Task Learning"}],"methods":[{"method_slug":"sgd","method_name":"SGD"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2305.18409","atlas_url":"https://app.syntology.ai/?focus=2305.18409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18409"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.18409"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.18409"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.18409\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2305.18409"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2305.18409\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2305.18409"},"call":"get_concepts_for_paper(arxiv_id=\"2305.18409\")"}],"by_repo":[{"repo":"ml-opt-lab/sdmgrad","kind":"official","samples":10,"ran":8,"instrument":0,"unverified":2}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2305.18409.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2305.18409.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ml-opt-lab/sdmgrad","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":5,"ran_violates":1,"ran_honours":2,"unverified":2},"n_samples":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":10,"ran":8,"n_ran_checked":8,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":7,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-24","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"2b356e9ebfba41cb","code_sha256_prefix":"2b356e9ebfba41cb","entry":"delta_fn","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/cityscapes/utils.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/cityscapes/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"a:ndarray/1/float","fixture_out_type":"float64","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2b356e9ebfba41cb"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2b356e9ebfba41cb"}},{"code_sha256":"1539c8d54c086d09","code_sha256_prefix":"1539c8d54c086d09","entry":"depth_error","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/cityscapes/utils.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/cityscapes/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"x_pred:Tensor/3/float, x_output:Tensor/3/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1539c8d54c086d09"}},{"code_sha256":"b7b864e78753f74c","code_sha256_prefix":"b7b864e78753f74c","entry":"euclidean_proj_simplex","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"mtrl_files/sdmgrad.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/mtrl_files/sdmgrad.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"v:ndarray/1/float, s:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","retrieve_with":{"tool":"get_code","code_sha256":"b7b864e78753f74c"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b7b864e78753f74c"}},{"code_sha256":"47019f3895d2e9d3","code_sha256_prefix":"47019f3895d2e9d3","entry":"get_rank","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/mean_rank.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/mean_rank.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"stats:dict/0/?","fixture_out_type":"defaultdict","level_recorded_at":"2026-09-26T00:54:16.521071+00:00","code_page":"/code/get-rank","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"47019f3895d2e9d3"}},{"code_sha256":"1cb4b9ddd1f0d15b","code_sha256_prefix":"1cb4b9ddd1f0d15b","entry":"read_file","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/mean_rank.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/mean_rank.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"fname:str/0/str","fixture_out_type":"defaultdict","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","code_page":"/code/read-file","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1cb4b9ddd1f0d15b"}},{"code_sha256":"7c508037b40522af","code_sha256_prefix":"7c508037b40522af","entry":"str2bool","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/utils.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/utils.py","link_basis":"harvester_set","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"v:str/0/str","fixture_out_type":"bool","code_page":"/code/str2bool","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7c508037b40522af"}},{"code_sha256":"eefc191f062ea49a","code_sha256_prefix":"eefc191f062ea49a","entry":"str_or_float","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/utils.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/utils.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"value:str/0/str","fixture_out_type":"float","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","retrieve_with":{"tool":"get_code","code_sha256":"eefc191f062ea49a"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"eefc191f062ea49a"}},{"code_sha256":"267fdf7ca1571871","code_sha256_prefix":"267fdf7ca1571871","entry":"str_to_list","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/utils.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/utils.py","link_basis":"plan_row","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"string:str/0/str","fixture_out_type":"list","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":"/code/str-to-list","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"267fdf7ca1571871"}},{"code_sha256":"0a0f4c8898070a9d","code_sha256_prefix":"0a0f4c8898070a9d","entry":"calc_loss","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"experiments/cityscapes/trainer.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/experiments/cityscapes/trainer.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/calc-loss","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0a0f4c8898070a9d"}},{"code_sha256":"2d5ff72859c98459","code_sha256_prefix":"2d5ff72859c98459","entry":"gradient_normalizers","repo":"ml-opt-lab/sdmgrad","repo_kind":"official","path":"methods/min_norm_solvers.py","file_url":"https://github.com/ml-opt-lab/sdmgrad/blob/HEAD/methods/min_norm_solvers.py","link_basis":"plan_row","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/gradient-normalizers","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2d5ff72859c98459"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"9d7452e39f1c6095965ba11008050996158ee3a7cf139ebd4518067bd344f014","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}