{"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":"/task/multi-task-learning/papers/ran/1","list_of":"/task/multi-task-learning","task":"Multi-Task Learning","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":3,"rows_per_page":100,"rows":[1,100],"of":260,"counts":{"archive_papers_tagged":3687,"with_a_code_link":1306,"where_syntology_ran_a_sample":260,"not_listed_spam_title":0,"listed":3687,"listed_where_code_ran":260,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":217,"every_run_a_failure_of_syntologys_instrument":43,"listed_with_a_run_with_no_instrument_failure":217,"listed_every_run_a_failure_of_syntologys_instrument":43,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/multi-task-learning/papers/ran/1","prev":null,"next":"/task/multi-task-learning/papers/ran/2","papers":[{"url":"/paper/calm-consensus-aware-localized-merging-for","slug":"calm-consensus-aware-localized-merging-for","title":"CALM: Consensus-Aware Localized Merging for Multi-Task Learning","date":"2025-06-16","arxiv_id":"2506.13406","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/calm-consensus-aware-localized-merging-for#ran","syntology_url":"https://syntology.ai/paper/2506.13406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.13406"}},"official":{"repos":["yankd22/calm"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/csi-bench-a-large-scale-in-the-wild-dataset","slug":"csi-bench-a-large-scale-in-the-wild-dataset","title":"CSI-Bench: A Large-Scale In-the-Wild Dataset for Multi-task WiFi Sensing","date":"2025-05-28","arxiv_id":"2505.21866","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/csi-bench-a-large-scale-in-the-wild-dataset#ran","syntology_url":"https://syntology.ai/paper/2505.21866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.21866"}},"official":{"repos":["Jenny-Zhu/CSI-Bench-Real-WiFi-Sensing-Benchmark"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-ripple-effect-on-unforeseen-complications","slug":"the-ripple-effect-on-unforeseen-complications","title":"The Ripple Effect: On Unforeseen Complications of Backdoor Attacks","date":"2025-05-16","arxiv_id":"2505.11586","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-ripple-effect-on-unforeseen-complications#ran","syntology_url":"https://syntology.ai/paper/2505.11586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.11586"}},"official":{"repos":["zhangrui4041/backdoor_complications"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adarank-adaptive-rank-pruning-for-enhanced","slug":"adarank-adaptive-rank-pruning-for-enhanced","title":"AdaRank: Adaptive Rank Pruning for Enhanced Model Merging","date":"2025-03-28","arxiv_id":"2503.22178","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adarank-adaptive-rank-pruning-for-enhanced#ran","syntology_url":"https://syntology.ai/paper/2503.22178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.22178"}},"official":{"repos":["david3684/adarank"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-survey-of-mixture-of-experts","slug":"a-comprehensive-survey-of-mixture-of-experts","title":"A Comprehensive Survey of Mixture-of-Experts: Algorithms, Theory, and Applications","date":"2025-03-10","arxiv_id":"2503.07137","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-comprehensive-survey-of-mixture-of-experts#ran","syntology_url":"https://syntology.ai/paper/2503.07137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.07137"}},"official":{"repos":["deepseek-ai/DeepEP"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-accurate-blind-flexible-docking","slug":"fast-and-accurate-blind-flexible-docking","title":"Fast and Accurate Blind Flexible Docking","date":"2025-02-20","arxiv_id":"2502.14934","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-blind-flexible-docking#ran","syntology_url":"https://syntology.ai/paper/2502.14934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.14934"}},"official":{"repos":["tmlr-group/fabflex"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/selective-task-group-updates-for-multi-task","slug":"selective-task-group-updates-for-multi-task","title":"Selective Task Group Updates for Multi-Task Optimization","date":"2025-02-17","arxiv_id":"2502.11986","repositories_listed":1,"syntology":{"n":16,"n_ran":6,"n_constructed":2,"n_ran_checked":3,"n_instrument":3,"n_unverified":10,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/selective-task-group-updates-for-multi-task#ran","syntology_url":"https://syntology.ai/paper/2502.11986","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.11986"}},"official":{"repos":["wooseong97/sel-update-mtl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":10,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-time-aware-mixture-of-experts","slug":"hierarchical-time-aware-mixture-of-experts","title":"Hierarchical Time-Aware Mixture of Experts for Multi-Modal Sequential Recommendation","date":"2025-01-24","arxiv_id":"2501.14269","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-time-aware-mixture-of-experts#ran","syntology_url":"https://syntology.ai/paper/2501.14269","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.14269"}},"official":{"repos":["SStarCCat/HM4SR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-corrupted-prediction-for-learning","slug":"multi-task-corrupted-prediction-for-learning","title":"Multi-Task Corrupted Prediction for Learning Robust Audio-Visual Speech Representation","date":"2025-01-23","arxiv_id":"2504.18539","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-task-corrupted-prediction-for-learning#ran","syntology_url":"https://syntology.ai/paper/2504.18539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.18539"}},"official":{"repos":["sungnyun/cav2vec"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gradient-based-multi-objective-deep-learning","slug":"gradient-based-multi-objective-deep-learning","title":"Gradient-Based Multi-Objective Deep Learning: Algorithms, Theories, Applications, and Beyond","date":"2025-01-19","arxiv_id":"2501.10945","repositories_listed":3,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradient-based-multi-objective-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2501.10945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.10945"}},"official":{"repos":["baijiong-lin/awesome-multi-objective-deep-learning","median-research-group/libmtl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/transforming-vision-transformer-towards","slug":"transforming-vision-transformer-towards","title":"Transforming Vision Transformer: Towards Efficient Multi-Task Asynchronous Learning","date":"2025-01-12","arxiv_id":"2501.06884","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/transforming-vision-transformer-towards#ran","syntology_url":"https://syntology.ai/paper/2501.06884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.06884"}},"official":{"repos":["yewen1486/emtal"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/modeling-multi-task-model-merging-as-adaptive","slug":"modeling-multi-task-model-merging-as-adaptive","title":"Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent","date":"2025-01-02","arxiv_id":"2501.01230","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/modeling-multi-task-model-merging-as-adaptive#ran","syntology_url":"https://syntology.ai/paper/2501.01230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.01230"}},"official":{"repos":["walkerworldpeace/doge"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-weight-averaging-for-model-merging","slug":"revisiting-weight-averaging-for-model-merging","title":"Revisiting Weight Averaging for Model Merging","date":"2024-12-11","arxiv_id":"2412.12153","repositories_listed":2,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":11,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/revisiting-weight-averaging-for-model-merging#ran","syntology_url":"https://syntology.ai/paper/2412.12153","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.12153"}},"official":{"repos":["JH-GEECS/CART_public"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-based-visual-anagram-as-multi-task","slug":"diffusion-based-visual-anagram-as-multi-task","title":"Diffusion-based Visual Anagram as Multi-task Learning","date":"2024-12-03","arxiv_id":"2412.02693","repositories_listed":1,"syntology":{"n":12,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/diffusion-based-visual-anagram-as-multi-task#ran","syntology_url":"https://syntology.ai/paper/2412.02693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.02693"}},"official":{"repos":["pixtella/anagram-mtl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/munba-machine-unlearning-via-nash-bargaining","slug":"munba-machine-unlearning-via-nash-bargaining","title":"MUNBa: Machine Unlearning via Nash Bargaining","date":"2024-11-23","arxiv_id":"2411.15537","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":2,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/munba-machine-unlearning-via-nash-bargaining#ran","syntology_url":"https://syntology.ai/paper/2411.15537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15537"}},"official":{"repos":["JingWu321/MUNBa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/urbandit-a-foundation-model-for-open-world","slug":"urbandit-a-foundation-model-for-open-world","title":"UrbanDiT: A Foundation Model for Open-World Urban Spatio-Temporal Learning","date":"2024-11-19","arxiv_id":"2411.12164","repositories_listed":1,"syntology":{"n":22,"n_ran":20,"n_constructed":2,"n_ran_checked":12,"n_instrument":8,"n_unverified":2,"n_honours":3,"n_violates":0,"n_no_contract":9,"n_pointer_only":8,"phrase":"20 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 0 violated, 9 with no contract checked; 8 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/urbandit-a-foundation-model-for-open-world#ran","syntology_url":"https://syntology.ai/paper/2411.12164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.12164"}},"official":{"repos":["YuanYuan98/UrbanDiT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/surgeryv2-bridging-the-gap-between-model","slug":"surgeryv2-bridging-the-gap-between-model","title":"SurgeryV2: Bridging the Gap Between Model Merging and Multi-Task Learning with Deep Representation Surgery","date":"2024-10-18","arxiv_id":"2410.14389","repositories_listed":1,"syntology":{"n":12,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":12,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/surgeryv2-bridging-the-gap-between-model#ran","syntology_url":"https://syntology.ai/paper/2410.14389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.14389"}},"official":{"repos":["ennengyang/surgeryv2"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/stylistic-multi-task-analysis-of-ukiyo-e","slug":"stylistic-multi-task-analysis-of-ukiyo-e","title":"Stylistic Multi-Task Analysis of Ukiyo-e Woodblock Prints","date":"2024-10-16","arxiv_id":"2410.12379","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stylistic-multi-task-analysis-of-ukiyo-e#ran","syntology_url":"https://syntology.ai/paper/2410.12379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12379"}},"official":{"repos":["selinakhan/stylistic-MTL-ukiyoe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/get-rid-of-task-isolation-a-continuous-multi","slug":"get-rid-of-task-isolation-a-continuous-multi","title":"Get Rid of Isolation: A Continuous Multi-task Spatio-Temporal Learning Framework","date":"2024-10-14","arxiv_id":"2410.10524","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/get-rid-of-task-isolation-a-continuous-multi#ran","syntology_url":"https://syntology.ai/paper/2410.10524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10524"}},"official":{"repos":["dilab-ustcsz/cmust"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mtl-lora-low-rank-adaptation-for-multi-task","slug":"mtl-lora-low-rank-adaptation-for-multi-task","title":"MTL-LoRA: Low-Rank Adaptation for Multi-Task Learning","date":"2024-10-12","arxiv_id":"2410.09437","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mtl-lora-low-rank-adaptation-for-multi-task#ran","syntology_url":"https://syntology.ai/paper/2410.09437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09437"}},"official":{"repos":["pumpkin-co/mtl-lora"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/coba-convergence-balancer-for-multitask","slug":"coba-convergence-balancer-for-multitask","title":"CoBa: Convergence Balancer for Multitask Finetuning of Large Language Models","date":"2024-10-09","arxiv_id":"2410.06741","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/coba-convergence-balancer-for-multitask#ran","syntology_url":"https://syntology.ai/paper/2410.06741","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06741"}},"official":{"repos":["codefuse-ai/mftcoder"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dawin-training-free-dynamic-weight","slug":"dawin-training-free-dynamic-weight","title":"DaWin: Training-free Dynamic Weight Interpolation for Robust Adaptation","date":"2024-10-03","arxiv_id":"2410.03782","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":2,"n_ran_checked":3,"n_instrument":5,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/dawin-training-free-dynamic-weight#ran","syntology_url":"https://syntology.ai/paper/2410.03782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03782"}},"official":{"repos":["naver-ai/dawin"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/theoretical-insights-into-overparameterized","slug":"theoretical-insights-into-overparameterized","title":"Theoretical Insights into Overparameterized Models in Multi-Task and Replay-Based Continual Learning","date":"2024-08-29","arxiv_id":"2408.16939","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/theoretical-insights-into-overparameterized#ran","syntology_url":"https://syntology.ai/paper/2408.16939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16939"}},"official":{"repos":["aminbana/MTL-Theory"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neurolm-a-universal-multi-task-foundation","slug":"neurolm-a-universal-multi-task-foundation","title":"NeuroLM: A Universal Multi-task Foundation Model for Bridging the Gap between Language and EEG Signals","date":"2024-08-27","arxiv_id":"2409.00101","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neurolm-a-universal-multi-task-foundation#ran","syntology_url":"https://syntology.ai/paper/2409.00101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.00101"}},"official":{"repos":["935963004/neurolm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/wcebleedgen-a-wireless-capsule-endoscopy","slug":"wcebleedgen-a-wireless-capsule-endoscopy","title":"WCEbleedGen: A wireless capsule endoscopy dataset and its benchmarking for automatic bleeding classification, detection, and segmentation","date":"2024-08-22","arxiv_id":"2408.12466","repositories_listed":1,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":17,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/wcebleedgen-a-wireless-capsule-endoscopy#ran","syntology_url":"https://syntology.ai/paper/2408.12466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.12466"}},"official":{"repos":["misahub2023/benchmarking-codes-of-the-wcebleedgen-dataset"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hokoff-real-game-dataset-from-honor-of-kings-1","slug":"hokoff-real-game-dataset-from-honor-of-kings-1","title":"Hokoff: Real Game Dataset from Honor of Kings and its Offline Reinforcement Learning Benchmarks","date":"2024-08-20","arxiv_id":"2408.10556","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hokoff-real-game-dataset-from-honor-of-kings-1#ran","syntology_url":"https://syntology.ai/paper/2408.10556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10556"}},"official":{"repos":["tencent-ailab/hokoff"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/customizing-language-models-with-instance","slug":"customizing-language-models-with-instance","title":"Customizing Language Models with Instance-wise LoRA for Sequential Recommendation","date":"2024-08-19","arxiv_id":"2408.10159","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":7,"n_ran_checked":7,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":13,"phrase":"8 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/customizing-language-models-with-instance#ran","syntology_url":"https://syntology.ai/paper/2408.10159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.10159"}},"official":{"repos":["akalikong/ilora"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-heterogeneous-graph-learning-on","slug":"multi-task-heterogeneous-graph-learning-on","title":"Multi-task Heterogeneous Graph Learning on Electronic Health Records","date":"2024-08-14","arxiv_id":"2408.07569","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-heterogeneous-graph-learning-on#ran","syntology_url":"https://syntology.ai/paper/2408.07569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07569"}},"official":{"repos":["hku-medai/mult-ehr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/repvf-a-unified-vector-fields-representation","slug":"repvf-a-unified-vector-fields-representation","title":"RepVF: A Unified Vector Fields Representation for Multi-task 3D Perception","date":"2024-07-15","arxiv_id":"2407.10876","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/repvf-a-unified-vector-fields-representation#ran","syntology_url":"https://syntology.ai/paper/2407.10876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.10876"}},"official":{"repos":["jbji/repvf"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/pareto-low-rank-adapters-efficient-multi-task","slug":"pareto-low-rank-adapters-efficient-multi-task","title":"Pareto Low-Rank Adapters: Efficient Multi-Task Learning with Preferences","date":"2024-07-10","arxiv_id":"2407.08056","repositories_listed":0,"syntology":{"n":11,"n_ran":7,"n_constructed":7,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 7 samples that ran constructed an object rather than computing a result","sample_list":"/paper/pareto-low-rank-adapters-efficient-multi-task#ran","syntology_url":"https://syntology.ai/paper/2407.08056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.08056"}},"official":null}},{"url":"/paper/fine-tuning-linear-layers-only-is-a-simple","slug":"fine-tuning-linear-layers-only-is-a-simple","title":"Fine-Tuning Attention Modules Only: Enhancing Weight Disentanglement in Task Arithmetic","date":"2024-07-09","arxiv_id":"2407.07089","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fine-tuning-linear-layers-only-is-a-simple#ran","syntology_url":"https://syntology.ai/paper/2407.07089","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07089"}},"official":{"repos":["kyrie-23/task_arithmetic_tangent","kyrie-23/linear_task_arithmetic"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dmtg-one-shot-differentiable-multi-task","slug":"dmtg-one-shot-differentiable-multi-task","title":"DMTG: One-Shot Differentiable Multi-Task Grouping","date":"2024-07-06","arxiv_id":"2407.05082","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":1,"n_ran_checked":6,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/dmtg-one-shot-differentiable-multi-task#ran","syntology_url":"https://syntology.ai/paper/2407.05082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05082"}},"official":{"repos":["ethanygao/dmtg"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/routefinder-towards-foundation-models-for","slug":"routefinder-towards-foundation-models-for","title":"RouteFinder: Towards Foundation Models for Vehicle Routing Problems","date":"2024-06-21","arxiv_id":"2406.15007","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/routefinder-towards-foundation-models-for#ran","syntology_url":"https://syntology.ai/paper/2406.15007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15007"}},"official":{"repos":["ai4co/routefinder"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/streamspeech-simultaneous-speech-to-speech","slug":"streamspeech-simultaneous-speech-to-speech","title":"StreamSpeech: Simultaneous Speech-to-Speech Translation with Multi-task Learning","date":"2024-06-05","arxiv_id":"2406.03049","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/streamspeech-simultaneous-speech-to-speech#ran","syntology_url":"https://syntology.ai/paper/2406.03049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03049"}},"official":{"repos":["ictnlp/streamspeech"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gs-phong-meta-learned-3d-gaussians-for","slug":"gs-phong-meta-learned-3d-gaussians-for","title":"GS-Phong: Meta-Learned 3D Gaussians for Relightable Novel View Synthesis","date":"2024-05-31","arxiv_id":"2405.20791","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gs-phong-meta-learned-3d-gaussians-for#ran","syntology_url":"https://syntology.ai/paper/2405.20791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20791"}},"official":{"repos":["ymhe12/GS-Phong"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-noise-robustness-of-retrieval","slug":"enhancing-noise-robustness-of-retrieval","title":"Enhancing Noise Robustness of Retrieval-Augmented Language Models with Adaptive Adversarial Training","date":"2024-05-31","arxiv_id":"2405.20978","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-noise-robustness-of-retrieval#ran","syntology_url":"https://syntology.ai/paper/2405.20978","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20978"}},"official":{"repos":["calubkk/raat"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/glycanml-a-multi-task-and-multi-structure","slug":"glycanml-a-multi-task-and-multi-structure","title":"GlycanML: A Multi-Task and Multi-Structure Benchmark for Glycan Machine Learning","date":"2024-05-25","arxiv_id":"2405.16206","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glycanml-a-multi-task-and-multi-structure#ran","syntology_url":"https://syntology.ai/paper/2405.16206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16206"}},"official":{"repos":["glycanml/glycanml"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/end-to-end-real-world-polyphonic-piano-audio","slug":"end-to-end-real-world-polyphonic-piano-audio","title":"End-to-End Real-World Polyphonic Piano Audio-to-Score Transcription with Hierarchical Decoding","date":"2024-05-22","arxiv_id":"2405.13527","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/end-to-end-real-world-polyphonic-piano-audio#ran","syntology_url":"https://syntology.ai/paper/2405.13527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.13527"}},"official":{"repos":["wei-zeng98/piano-a2s"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/sebot-structural-entropy-guided-multi-view","slug":"sebot-structural-entropy-guided-multi-view","title":"SeBot: Structural Entropy Guided Multi-View Contrastive Learning for Social Bot Detection","date":"2024-05-18","arxiv_id":"2405.11225","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":4,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sebot-structural-entropy-guided-multi-view#ran","syntology_url":"https://syntology.ai/paper/2405.11225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.11225"}},"official":{"repos":["846468230/sebot"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-correlations-of-self-supervised","slug":"exploring-correlations-of-self-supervised","title":"Exploring Correlations of Self-Supervised Tasks for Graphs","date":"2024-05-07","arxiv_id":"2405.04245","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/exploring-correlations-of-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2405.04245","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04245"}},"official":{"repos":["zjunet/graphtcm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mvmoe-multi-task-vehicle-routing-solver-with","slug":"mvmoe-multi-task-vehicle-routing-solver-with","title":"MVMoE: Multi-Task Vehicle Routing Solver with Mixture-of-Experts","date":"2024-05-02","arxiv_id":"2405.01029","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mvmoe-multi-task-vehicle-routing-solver-with#ran","syntology_url":"https://syntology.ai/paper/2405.01029","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01029"}},"official":{"repos":["ai4co/awesome-fm4co","royalskye/routing-mvmoe"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mixlora-enhancing-large-language-models-fine","slug":"mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","arxiv_id":"2404.15159","repositories_listed":2,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/mixlora-enhancing-large-language-models-fine#ran","syntology_url":"https://syntology.ai/paper/2404.15159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15159"}},"official":{"repos":["TUDB-Labs/MixLoRA","mikecovlee/mLoRA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/ming-moe-enhancing-medical-multi-task","slug":"ming-moe-enhancing-medical-multi-task","title":"MING-MOE: Enhancing Medical Multi-Task Learning in Large Language Models with Sparse Mixture of Low-Rank Adapter Experts","date":"2024-04-13","arxiv_id":"2404.09027","repositories_listed":2,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":3,"n_instrument":5,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ming-moe-enhancing-medical-multi-task#ran","syntology_url":"https://syntology.ai/paper/2404.09027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.09027"}},"official":{"repos":["mediabrain-sjtu/ming"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/sequential-recommendation-for-optimizing-both","slug":"sequential-recommendation-for-optimizing-both","title":"Sequential Recommendation for Optimizing Both Immediate Feedback and Long-term Retention","date":"2024-04-04","arxiv_id":"2404.03637","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequential-recommendation-for-optimizing-both#ran","syntology_url":"https://syntology.ai/paper/2404.03637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03637"}},"official":{"repos":["applied-machine-learning-lab/dt4ier"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/egtr-extracting-graph-from-transformer-for","slug":"egtr-extracting-graph-from-transformer-for","title":"EGTR: Extracting Graph from Transformer for Scene Graph Generation","date":"2024-04-02","arxiv_id":"2404.02072","repositories_listed":1,"syntology":{"n":17,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":4,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/egtr-extracting-graph-from-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2404.02072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.02072"}},"official":{"repos":["naver-ai/egtr"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mtlora-a-low-rank-adaptation-approach-for","slug":"mtlora-a-low-rank-adaptation-approach-for","title":"MTLoRA: A Low-Rank Adaptation Approach for Efficient Multi-Task Learning","date":"2024-03-29","arxiv_id":"2403.20320","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mtlora-a-low-rank-adaptation-approach-for#ran","syntology_url":"https://syntology.ai/paper/2403.20320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.20320"}},"official":{"repos":["scale-lab/mtlora"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/switch-diffusion-transformer-synergizing","slug":"switch-diffusion-transformer-synergizing","title":"Switch Diffusion Transformer: Synergizing Denoising Tasks with Sparse Mixture-of-Experts","date":"2024-03-14","arxiv_id":"2403.09176","repositories_listed":2,"syntology":{"n":18,"n_ran":15,"n_constructed":0,"n_ran_checked":9,"n_instrument":6,"n_unverified":3,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/switch-diffusion-transformer-synergizing#ran","syntology_url":"https://syntology.ai/paper/2403.09176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.09176"}},"official":{"repos":["byeongjun-park/Switch-DiT"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ups-towards-foundation-models-for-pde-solving","slug":"ups-towards-foundation-models-for-pde-solving","title":"UPS: Efficiently Building Foundation Models for PDE Solving via Cross-Modal Adaptation","date":"2024-03-11","arxiv_id":"2403.07187","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":3,"n_ran_checked":7,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 3 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/ups-towards-foundation-models-for-pde-solving#ran","syntology_url":"https://syntology.ai/paper/2403.07187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.07187"}},"official":{"repos":["sjunhongshen/unifiedpdesolvers"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":3,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/automated-multi-task-learning-for-joint","slug":"automated-multi-task-learning-for-joint","title":"Automated Multi-Task Learning for Joint Disease Prediction on Electronic Health Records","date":"2024-03-06","arxiv_id":"2403.04086","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":1,"n_ran_checked":3,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":10,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/automated-multi-task-learning-for-joint#ran","syntology_url":"https://syntology.ai/paper/2403.04086","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.04086"}},"official":{"repos":["sh-src/autodp"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-maximize-mutual-information-for-1","slug":"learning-to-maximize-mutual-information-for-1","title":"Learning to Maximize Mutual Information for Chain-of-Thought Distillation","date":"2024-03-05","arxiv_id":"2403.03348","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-maximize-mutual-information-for-1#ran","syntology_url":"https://syntology.ai/paper/2403.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.03348"}},"official":{"repos":["xinchen9/cot_distillation_acl2024"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fair-resource-allocation-in-multi-task","slug":"fair-resource-allocation-in-multi-task","title":"Fair Resource Allocation in Multi-Task Learning","date":"2024-02-23","arxiv_id":"2402.15638","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fair-resource-allocation-in-multi-task#ran","syntology_url":"https://syntology.ai/paper/2402.15638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.15638"}},"official":{"repos":["optmn-lab/fairgrad"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-learning-for-routing-problem-with","slug":"multi-task-learning-for-routing-problem-with","title":"Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot Generalization","date":"2024-02-23","arxiv_id":"2402.16891","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-learning-for-routing-problem-with#ran","syntology_url":"https://syntology.ai/paper/2402.16891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16891"}},"official":{"repos":["feiliu36/mtnco"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hypermoe-towards-better-mixture-of-experts","slug":"hypermoe-towards-better-mixture-of-experts","title":"HyperMoE: Towards Better Mixture of Experts via Transferring Among Experts","date":"2024-02-20","arxiv_id":"2402.12656","repositories_listed":1,"syntology":{"n":18,"n_ran":14,"n_constructed":2,"n_ran_checked":13,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":7,"phrase":"14 ran (of which 2 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hypermoe-towards-better-mixture-of-experts#ran","syntology_url":"https://syntology.ai/paper/2402.12656","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12656"}},"official":{"repos":["bumble666/hypermoe_early_version"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/loretta-low-rank-economic-tensor-train","slug":"loretta-low-rank-economic-tensor-train","title":"LoRETTA: Low-Rank Economic Tensor-Train Adaptation for Ultra-Low-Parameter Fine-Tuning of Large Language Models","date":"2024-02-18","arxiv_id":"2402.11417","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/loretta-low-rank-economic-tensor-train#ran","syntology_url":"https://syntology.ai/paper/2402.11417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11417"}},"official":{"repos":["yifanycc/loretta"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-uncertainty-for-gradient-aggregation","slug":"bayesian-uncertainty-for-gradient-aggregation","title":"Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning","date":"2024-02-06","arxiv_id":"2402.04005","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bayesian-uncertainty-for-gradient-aggregation#ran","syntology_url":"https://syntology.ai/paper/2402.04005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04005"}},"official":{"repos":["ssi-research/bayesagg_mtl"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-surgery-for-multi-task-model","slug":"representation-surgery-for-multi-task-model","title":"Representation Surgery for Multi-Task Model Merging","date":"2024-02-05","arxiv_id":"2402.02705","repositories_listed":3,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/representation-surgery-for-multi-task-model#ran","syntology_url":"https://syntology.ai/paper/2402.02705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02705"}},"official":{"repos":["ennengyang/representationsurgery"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/robust-multi-task-learning-with-excess-risks","slug":"robust-multi-task-learning-with-excess-risks","title":"Robust Multi-Task Learning with Excess Risks","date":"2024-02-03","arxiv_id":"2402.02009","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/robust-multi-task-learning-with-excess-risks#ran","syntology_url":"https://syntology.ai/paper/2402.02009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02009"}},"official":{"repos":["yifei-he/excessmtl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/laa-net-localized-artifact-attention-network","slug":"laa-net-localized-artifact-attention-network","title":"LAA-Net: Localized Artifact Attention Network for Quality-Agnostic and Generalizable Deepfake Detection","date":"2024-01-24","arxiv_id":"2401.13856","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/laa-net-localized-artifact-attention-network#ran","syntology_url":"https://syntology.ai/paper/2401.13856","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.13856"}},"official":{"repos":["10ring/laa-net"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-first-order-multi-gradient-algorithm-for","slug":"a-first-order-multi-gradient-algorithm-for","title":"A First-Order Multi-Gradient Algorithm for Multi-Objective Bi-Level Optimization","date":"2024-01-17","arxiv_id":"2401.09257","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-first-order-multi-gradient-algorithm-for#ran","syntology_url":"https://syntology.ai/paper/2401.09257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09257"}},"official":{"repos":["baijiong-lin/forum"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/the-art-of-balancing-revolutionizing-mixture","slug":"the-art-of-balancing-revolutionizing-mixture","title":"LoRAMoE: Alleviate World Knowledge Forgetting in Large Language Models via MoE-Style Plugin","date":"2023-12-15","arxiv_id":"2312.09979","repositories_listed":1,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":14,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/the-art-of-balancing-revolutionizing-mixture#ran","syntology_url":"https://syntology.ai/paper/2312.09979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.09979"}},"official":{"repos":["ablustrund/loramoe"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/compressed-context-memory-for-online-language","slug":"compressed-context-memory-for-online-language","title":"Compressed Context Memory For Online Language Model Interaction","date":"2023-12-06","arxiv_id":"2312.03414","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":5,"n_instrument":4,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/compressed-context-memory-for-online-language#ran","syntology_url":"https://syntology.ai/paper/2312.03414","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.03414"}},"official":{"repos":["snu-mllab/context-memory"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/ssb-simple-but-strong-baseline-for-boosting-1","slug":"ssb-simple-but-strong-baseline-for-boosting-1","title":"SSB: Simple but Strong Baseline for Boosting Performance of Open-Set Semi-Supervised Learning","date":"2023-11-17","arxiv_id":"2311.10572","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":2,"n_ran_checked":4,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":12,"phrase":"7 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/ssb-simple-but-strong-baseline-for-boosting-1#ran","syntology_url":"https://syntology.ai/paper/2311.10572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.10572"}},"official":{"repos":["yue-fan/ssb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":2,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/apgl4sr-a-generic-framework-with-adaptive-and","slug":"apgl4sr-a-generic-framework-with-adaptive-and","title":"APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation","date":"2023-11-06","arxiv_id":"2311.02816","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/apgl4sr-a-generic-framework-with-adaptive-and#ran","syntology_url":"https://syntology.ai/paper/2311.02816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02816"}},"official":{"repos":["graph-team/apgl4sr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-modules-with-temporal-attention","slug":"contrastive-modules-with-temporal-attention","title":"Contrastive Modules with Temporal Attention for Multi-Task Reinforcement Learning","date":"2023-11-02","arxiv_id":"2311.01075","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contrastive-modules-with-temporal-attention#ran","syntology_url":"https://syntology.ai/paper/2311.01075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.01075"}},"official":{"repos":["niiceMing/CMTA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ultra-dp-unifying-graph-pre-training-with","slug":"ultra-dp-unifying-graph-pre-training-with","title":"ULTRA-DP: Unifying Graph Pre-training with Multi-task Graph Dual Prompt","date":"2023-10-23","arxiv_id":"2310.14845","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ultra-dp-unifying-graph-pre-training-with#ran","syntology_url":"https://syntology.ai/paper/2310.14845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14845"}},"official":{"repos":["keytoyze/ultra-dp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/moelora-an-moe-based-parameter-efficient-fine","slug":"moelora-an-moe-based-parameter-efficient-fine","title":"When MOE Meets LLMs: Parameter Efficient Fine-tuning for Multi-task Medical Applications","date":"2023-10-21","arxiv_id":"2310.18339","repositories_listed":3,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/moelora-an-moe-based-parameter-efficient-fine#ran","syntology_url":"https://syntology.ai/paper/2310.18339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18339"}},"official":{"repos":["applied-machine-learning-lab/moelora-peft","liuqidong07/moelora-peft"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/prototype-based-hyperadapter-for-sample","slug":"prototype-based-hyperadapter-for-sample","title":"Prototype-based HyperAdapter for Sample-Efficient Multi-task Tuning","date":"2023-10-18","arxiv_id":"2310.11670","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/prototype-based-hyperadapter-for-sample#ran","syntology_url":"https://syntology.ai/paper/2310.11670","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.11670"}},"official":{"repos":["bumble666/pha"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/minigpt-v2-large-language-model-as-a-unified","slug":"minigpt-v2-large-language-model-as-a-unified","title":"MiniGPT-v2: large language model as a unified interface for vision-language multi-task learning","date":"2023-10-14","arxiv_id":"2310.09478","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/minigpt-v2-large-language-model-as-a-unified#ran","syntology_url":"https://syntology.ai/paper/2310.09478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09478"}},"official":null}},{"url":"/paper/denoising-task-routing-for-diffusion-models","slug":"denoising-task-routing-for-diffusion-models","title":"Denoising Task Routing for Diffusion Models","date":"2023-10-11","arxiv_id":"2310.07138","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/denoising-task-routing-for-diffusion-models#ran","syntology_url":"https://syntology.ai/paper/2310.07138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07138"}},"official":{"repos":["byeongjun-park/DTR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lauragpt-listen-attend-understand-and","slug":"lauragpt-listen-attend-understand-and","title":"LauraGPT: Listen, Attend, Understand, and Regenerate Audio with GPT","date":"2023-10-07","arxiv_id":"2310.04673","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lauragpt-listen-attend-understand-and#ran","syntology_url":"https://syntology.ai/paper/2310.04673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04673"}},"official":null}},{"url":"/paper/adamerging-adaptive-model-merging-for-multi","slug":"adamerging-adaptive-model-merging-for-multi","title":"AdaMerging: Adaptive Model Merging for Multi-Task Learning","date":"2023-10-04","arxiv_id":"2310.02575","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adamerging-adaptive-model-merging-for-multi#ran","syntology_url":"https://syntology.ai/paper/2310.02575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02575"}},"official":{"repos":["EnnengYang/AdaMerging"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-regularization-of-multi-task","slug":"implicit-regularization-of-multi-task","title":"Inductive biases of multi-task learning and finetuning: multiple regimes of feature reuse","date":"2023-10-03","arxiv_id":"2310.02396","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-regularization-of-multi-task#ran","syntology_url":"https://syntology.ai/paper/2310.02396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02396"}},"official":{"repos":["sflippl/multi-task"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/polarnet-3d-point-clouds-for-language-guided","slug":"polarnet-3d-point-clouds-for-language-guided","title":"PolarNet: 3D Point Clouds for Language-Guided Robotic Manipulation","date":"2023-09-27","arxiv_id":"2309.15596","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/polarnet-3d-point-clouds-for-language-guided#ran","syntology_url":"https://syntology.ai/paper/2309.15596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.15596"}},"official":{"repos":["vlc-robot/polarnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rade-reference-assisted-dialogue-evaluation","slug":"rade-reference-assisted-dialogue-evaluation","title":"RADE: Reference-Assisted Dialogue Evaluation for Open-Domain Dialogue","date":"2023-09-15","arxiv_id":"2309.08156","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rade-reference-assisted-dialogue-evaluation#ran","syntology_url":"https://syntology.ai/paper/2309.08156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.08156"}},"official":null}},{"url":"/paper/from-chatter-to-matter-addressing-critical","slug":"from-chatter-to-matter-addressing-critical","title":"From Chatter to Matter: Addressing Critical Steps of Emotion Recognition Learning in Task-oriented Dialogue","date":"2023-08-24","arxiv_id":"2308.12648","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/from-chatter-to-matter-addressing-critical#ran","syntology_url":"https://syntology.ai/paper/2308.12648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12648"}},"official":{"repos":["ConvLab/ConvLab-3"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bridgedata-v2-a-dataset-for-robot-learning-at","slug":"bridgedata-v2-a-dataset-for-robot-learning-at","title":"BridgeData V2: A Dataset for Robot Learning at Scale","date":"2023-08-24","arxiv_id":"2308.12952","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bridgedata-v2-a-dataset-for-robot-learning-at#ran","syntology_url":"https://syntology.ai/paper/2308.12952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12952"}},"official":{"repos":["rail-berkeley/BridgeData-V2"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ofvl-ms-once-for-visual-localization-across","slug":"ofvl-ms-once-for-visual-localization-across","title":"OFVL-MS: Once for Visual Localization across Multiple Indoor Scenes","date":"2023-08-23","arxiv_id":"2308.11928","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ofvl-ms-once-for-visual-localization-across#ran","syntology_url":"https://syntology.ai/paper/2308.11928","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11928"}},"official":{"repos":["mooncake199809/ufvl-net"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/critical-learning-periods-emerge-even-in-deep","slug":"critical-learning-periods-emerge-even-in-deep","title":"Critical Learning Periods Emerge Even in Deep Linear Networks","date":"2023-08-23","arxiv_id":"2308.12221","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/critical-learning-periods-emerge-even-in-deep#ran","syntology_url":"https://syntology.ai/paper/2308.12221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12221"}},"official":{"repos":["mjkleinman/criticalperioddeeplinearnets"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-sharing-conflict-aware-multivariate","slug":"beyond-sharing-conflict-aware-multivariate","title":"Beyond Sharing: Conflict-Aware Multivariate Time Series Anomaly Detection","date":"2023-08-17","arxiv_id":"2308.08915","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/beyond-sharing-conflict-aware-multivariate#ran","syntology_url":"https://syntology.ai/paper/2308.08915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08915"}},"official":{"repos":["dawnvince/mts_cad"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-generate-semantic-layouts-for","slug":"learning-to-generate-semantic-layouts-for","title":"Learning to Generate Semantic Layouts for Higher Text-Image Correspondence in Text-to-Image Synthesis","date":"2023-08-16","arxiv_id":"2308.08157","repositories_listed":1,"syntology":{"n":17,"n_ran":15,"n_constructed":0,"n_ran_checked":14,"n_instrument":1,"n_unverified":2,"n_honours":4,"n_violates":3,"n_no_contract":7,"n_pointer_only":17,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 4 honoured, 3 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-generate-semantic-layouts-for#ran","syntology_url":"https://syntology.ai/paper/2308.08157","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08157"}},"official":{"repos":["pmh9960/GCDP"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/taskexpert-dynamically-assembling-multi-task","slug":"taskexpert-dynamically-assembling-multi-task","title":"TaskExpert: Dynamically Assembling Multi-Task Representations with Memorial Mixture-of-Experts","date":"2023-07-28","arxiv_id":"2307.15324","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/taskexpert-dynamically-assembling-multi-task#ran","syntology_url":"https://syntology.ai/paper/2307.15324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15324"}},"official":{"repos":["prismformore/multi-task-transformer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/improvable-gap-balancing-for-multi-task","slug":"improvable-gap-balancing-for-multi-task","title":"Improvable Gap Balancing for Multi-Task Learning","date":"2023-07-28","arxiv_id":"2307.15429","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improvable-gap-balancing-for-multi-task#ran","syntology_url":"https://syntology.ai/paper/2307.15429","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.15429"}},"official":{"repos":["yanqidai/igb4mtl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/transnuseg-a-lightweight-multi-task","slug":"transnuseg-a-lightweight-multi-task","title":"TransNuSeg: A Lightweight Multi-Task Transformer for Nuclei Segmentation","date":"2023-07-16","arxiv_id":"2307.08051","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/transnuseg-a-lightweight-multi-task#ran","syntology_url":"https://syntology.ai/paper/2307.08051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08051"}},"official":{"repos":["zhenqi-he/transnuseg"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/hyperspherical-embedding-for-point-cloud-1","slug":"hyperspherical-embedding-for-point-cloud-1","title":"Hyperspherical Embedding for Point Cloud Completion","date":"2023-07-11","arxiv_id":"2307.05634","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyperspherical-embedding-for-point-cloud-1#ran","syntology_url":"https://syntology.ai/paper/2307.05634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.05634"}},"official":{"repos":["haomengz/hyperpc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stg-mtl-scalable-task-grouping-for-multi-task","slug":"stg-mtl-scalable-task-grouping-for-multi-task","title":"STG-MTL: Scalable Task Grouping for Multi-Task Learning Using Data Map","date":"2023-07-07","arxiv_id":"2307.03374","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/stg-mtl-scalable-task-grouping-for-multi-task#ran","syntology_url":"https://syntology.ai/paper/2307.03374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.03374"}},"official":{"repos":["ammarsherif/stg-mtl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/precursor-of-anomaly-detection-for-irregular","slug":"precursor-of-anomaly-detection-for-irregular","title":"Precursor-of-Anomaly Detection for Irregular Time Series","date":"2023-06-27","arxiv_id":"2306.15489","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/precursor-of-anomaly-detection-for-irregular#ran","syntology_url":"https://syntology.ai/paper/2306.15489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15489"}},"official":{"repos":["sheoyon-jhin/pad"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mofi-learning-image-representations-from","slug":"mofi-learning-image-representations-from","title":"MOFI: Learning Image Representations from Noisy Entity Annotated Images","date":"2023-06-13","arxiv_id":"2306.07952","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mofi-learning-image-representations-from#ran","syntology_url":"https://syntology.ai/paper/2306.07952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07952"}},"official":{"repos":["apple/ml-mofi"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/prefer-to-classify-improving-text-classifiers","slug":"prefer-to-classify-improving-text-classifiers","title":"Prefer to Classify: Improving Text Classifiers via Auxiliary Preference Learning","date":"2023-06-08","arxiv_id":"2306.04925","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/prefer-to-classify-improving-text-classifiers#ran","syntology_url":"https://syntology.ai/paper/2306.04925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04925"}},"official":{"repos":["minnesotanlp/p2c"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-negative-transfer-in-diffusion-1","slug":"addressing-negative-transfer-in-diffusion-1","title":"Addressing Negative Transfer in Diffusion Models","date":"2023-06-01","arxiv_id":"2306.00354","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/addressing-negative-transfer-in-diffusion-1#ran","syntology_url":"https://syntology.ai/paper/2306.00354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00354"}},"official":{"repos":["gohyojun15/ANT_diffusion"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sonicverse-a-multisensory-simulation-platform","slug":"sonicverse-a-multisensory-simulation-platform","title":"Sonicverse: A Multisensory Simulation Platform for Embodied Household Agents that See and Hear","date":"2023-06-01","arxiv_id":"2306.00923","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sonicverse-a-multisensory-simulation-platform#ran","syntology_url":"https://syntology.ai/paper/2306.00923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.00923"}},"official":{"repos":["stanfordvl/sonicverse"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/direction-oriented-multi-objective-learning","slug":"direction-oriented-multi-objective-learning","title":"Direction-oriented Multi-objective Learning: Simple and Provable Stochastic Algorithms","date":"2023-05-28","arxiv_id":"2305.18409","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/direction-oriented-multi-objective-learning#ran","syntology_url":"https://syntology.ai/paper/2305.18409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18409"}},"official":{"repos":["ml-opt-lab/sdmgrad"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/when-does-aggregating-multiple-skills-with","slug":"when-does-aggregating-multiple-skills-with","title":"When Does Aggregating Multiple Skills with Multi-Task Learning Work? A Case Study in Financial NLP","date":"2023-05-23","arxiv_id":"2305.14007","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/when-does-aggregating-multiple-skills-with#ran","syntology_url":"https://syntology.ai/paper/2305.14007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14007"}},"official":{"repos":["edisonni-hku/mtl4finance","EdisonNi-hku/when-does-mtl-work"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/instruction-tuned-models-are-quick-learners","slug":"instruction-tuned-models-are-quick-learners","title":"Instruction Tuned Models are Quick Learners","date":"2023-05-17","arxiv_id":"2306.05539","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/instruction-tuned-models-are-quick-learners#ran","syntology_url":"https://syntology.ai/paper/2306.05539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05539"}},"official":{"repos":["srsawant34/efficient_instruction_learning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-structural-learning-using-local","slug":"multi-task-structural-learning-using-local","title":"Multi-Task Structural Learning using Local Task Similarity induced Neuron Creation and Removal","date":"2023-04-30","arxiv_id":"2305.00441","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/multi-task-structural-learning-using-local#ran","syntology_url":"https://syntology.ai/paper/2305.00441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.00441"}},"official":{"repos":["neurai-lab/mtsl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/non-proportional-parametrizations-for-stable","slug":"non-proportional-parametrizations-for-stable","title":"Magnitude Invariant Parametrizations Improve Hypernetwork Learning","date":"2023-04-15","arxiv_id":"2304.07645","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/non-proportional-parametrizations-for-stable#ran","syntology_url":"https://syntology.ai/paper/2304.07645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.07645"}},"official":{"repos":["jjgo/hyperlight"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-from-similar-linear-representations","slug":"learning-from-similar-linear-representations","title":"Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustness","date":"2023-03-31","arxiv_id":"2303.17765","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-from-similar-linear-representations#ran","syntology_url":"https://syntology.ai/paper/2303.17765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.17765"}},"official":{"repos":["ytstat/rl-mtl-tl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-the-distribution-of-errors-in-stereo","slug":"learning-the-distribution-of-errors-in-stereo","title":"Learning the Distribution of Errors in Stereo Matching for Joint Disparity and Uncertainty Estimation","date":"2023-03-31","arxiv_id":"2304.00152","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-the-distribution-of-errors-in-stereo#ran","syntology_url":"https://syntology.ai/paper/2304.00152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00152"}},"official":{"repos":["lly00412/sednet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/identification-of-negative-transfers-in","slug":"identification-of-negative-transfers-in","title":"Identification of Negative Transfers in Multitask Learning Using Surrogate Models","date":"2023-03-25","arxiv_id":"2303.14582","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/identification-of-negative-transfers-in#ran","syntology_url":"https://syntology.ai/paper/2303.14582","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.14582"}},"official":{"repos":["neu-statsml-research/task-modeling","virtuosoresearch/task-modeling"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bigsmall-efficient-multi-task-learning-for","slug":"bigsmall-efficient-multi-task-learning-for","title":"BigSmall: Efficient Multi-Task Learning for Disparate Spatial and Temporal Physiological Measurements","date":"2023-03-21","arxiv_id":"2303.11573","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bigsmall-efficient-multi-task-learning-for#ran","syntology_url":"https://syntology.ai/paper/2303.11573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.11573"}},"official":{"repos":["girishvn/bigsmall"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-diffusion-training-via-min-snr","slug":"efficient-diffusion-training-via-min-snr","title":"Efficient Diffusion Training via Min-SNR Weighting Strategy","date":"2023-03-16","arxiv_id":"2303.09556","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/efficient-diffusion-training-via-min-snr#ran","syntology_url":"https://syntology.ai/paper/2303.09556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.09556"}},"official":{"repos":["tiankaihang/min-snr-diffusion-training"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}}],"record_sha256":"2835fdbca147bd892bbb822dc44cde648f198b1875543711d46683f2483810e0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}