{"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","name":"Multi-Task Learning","slug":"multi-task-learning","description_markdown":"Multi-task learning aims to learn multiple different tasks simultaneously while maximizing\r\nperformance on one or all of the tasks.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Cross-stitch Networks for Multi-task Learning](https://arxiv.org/pdf/1604.03539v1.pdf) )</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":3687,"papers_with_code":1306,"benchmarks":8,"benchmark_tables_in_archive":8,"benchmark_tables_shown":8,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":59,"subtasks":2,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/multi-task-learning-on-qm9","slug":"multi-task-learning-on-qm9","dataset":"QM9","dataset_url":"/dataset/qm9","rows_in_archive":5,"metrics":["∆m%"],"first_row_in_archive_order":{"model":"BayesAgg-MTL","paper_title":"Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning","paper_url":"/paper/bayesian-uncertainty-for-gradient-aggregation","paper_date":"2024-02-06","arxiv_id":"2402.04005","code_links":[{"title":"ssi-research/bayesagg_mtl","url":"https://github.com/ssi-research/bayesagg_mtl"}],"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 3 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":4,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/multi-task-learning-on-cityscapes","slug":"multi-task-learning-on-cityscapes","dataset":"Cityscapes test","dataset_url":"/dataset/cityscapes","rows_in_archive":3,"metrics":["mIoU","RMSE"],"first_row_in_archive_order":{"model":"SwinMTL","paper_title":"SwinMTL: A Shared Architecture for Simultaneous Depth Estimation and Semantic Segmentation from Monocular Camera Images","paper_url":"/paper/swinmtl-a-shared-architecture-for","paper_date":"2024-03-15","arxiv_id":"2403.10662","code_links":[{"title":"pardistaghavi/swinmtl","url":"https://github.com/pardistaghavi/swinmtl"}],"syntology":null}},{"leaderboard":"/sota/multi-task-learning-on-nyuv2","slug":"multi-task-learning-on-nyuv2","dataset":"NYUv2","dataset_url":"/dataset/nyuv2","rows_in_archive":2,"metrics":["Mean IoU"],"first_row_in_archive_order":{"model":"SwinMTL","paper_title":"SwinMTL: A Shared Architecture for Simultaneous Depth Estimation and Semantic Segmentation from Monocular Camera Images","paper_url":"/paper/swinmtl-a-shared-architecture-for","paper_date":"2024-03-15","arxiv_id":"2403.10662","code_links":[{"title":"pardistaghavi/swinmtl","url":"https://github.com/pardistaghavi/swinmtl"}],"syntology":null}},{"leaderboard":"/sota/multi-task-learning-on-omniglot","slug":"multi-task-learning-on-omniglot","dataset":"OMNIGLOT","dataset_url":null,"rows_in_archive":2,"metrics":["Average Accuracy"],"first_row_in_archive_order":{"model":"Gumbel-Matrix Routing","paper_title":"Flexible Multi-task Networks by Learning Parameter Allocation","paper_url":"/paper/gumbel-matrix-routing-for-flexible-multi-task-1","paper_date":"2019-10-10","arxiv_id":"1910.04915","code_links":[],"syntology":null}},{"leaderboard":"/sota/multi-task-learning-on-celeba","slug":"multi-task-learning-on-celeba","dataset":"CelebA","dataset_url":"/dataset/celeba","rows_in_archive":1,"metrics":["Error"],"first_row_in_archive_order":{"model":"MGDA-UB","paper_title":"Multi-Task Learning as Multi-Objective Optimization","paper_url":"/paper/multi-task-learning-as-multi-objective","paper_date":"2018-10-10","arxiv_id":"1810.04650","code_links":[{"title":"IntelVCL/MultiObjectiveOptimization","url":"https://github.com/IntelVCL/MultiObjectiveOptimization"},{"title":"isl-org/multiobjectiveoptimization","url":"https://github.com/isl-org/multiobjectiveoptimization"},{"title":"ebagdasa/backdoors101","url":"https://github.com/ebagdasa/backdoors101"},{"title":"torchjd/torchjd","url":"https://github.com/torchjd/torchjd"},{"title":"hav4ik/Hydra","url":"https://github.com/hav4ik/Hydra"},{"title":"VICO-UoE/KD4MTL","url":"https://github.com/VICO-UoE/KD4MTL"},{"title":"salomonhotegni/mdmtn","url":"https://github.com/salomonhotegni/mdmtn"}],"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":1,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-learning-as-multi-objective#ran","syntology_url":"https://syntology.ai/paper/1810.04650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04650"}},"official":{"repos":["IntelVCL/MultiObjectiveOptimization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["listed","official"]}}}},{"leaderboard":"/sota/multi-task-learning-on-chestx-ray14","slug":"multi-task-learning-on-chestx-ray14","dataset":"ChestX-ray14","dataset_url":"/dataset/chestx-ray14","rows_in_archive":1,"metrics":["delta_m"],"first_row_in_archive_order":{"model":"BayesAgg-MTL","paper_title":"Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning","paper_url":"/paper/bayesian-uncertainty-for-gradient-aggregation","paper_date":"2024-02-06","arxiv_id":"2402.04005","code_links":[{"title":"ssi-research/bayesagg_mtl","url":"https://github.com/ssi-research/bayesagg_mtl"}],"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 3 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":4,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/multi-task-learning-on-utkface","slug":"multi-task-learning-on-utkface","dataset":"UTKFace","dataset_url":"/dataset/utkface","rows_in_archive":1,"metrics":["delta_m"],"first_row_in_archive_order":{"model":"BayesAgg-MTL","paper_title":"Bayesian Uncertainty for Gradient Aggregation in Multi-Task Learning","paper_url":"/paper/bayesian-uncertainty-for-gradient-aggregation","paper_date":"2024-02-06","arxiv_id":"2402.04005","code_links":[{"title":"ssi-research/bayesagg_mtl","url":"https://github.com/ssi-research/bayesagg_mtl"}],"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 3 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":4,"n_unverified":1,"ran_from_kinds":["official"]}}}},{"leaderboard":"/sota/multi-task-learning-on-wireframe-dataset","slug":"multi-task-learning-on-wireframe-dataset","dataset":"wireframe dataset","dataset_url":"/dataset/wireframe","rows_in_archive":1,"metrics":["FH","sAP10","sAP15"],"first_row_in_archive_order":{"model":"LETR","paper_title":"Line Segment Detection Using Transformers without Edges","paper_url":"/paper/line-segment-detection-using-transformers","paper_date":"2021-01-06","arxiv_id":"2101.01909","code_links":[{"title":"mlpc-ucsd/LETR","url":"https://github.com/mlpc-ucsd/LETR"},{"title":"abrarum/bezierobjdet","url":"https://github.com/abrarum/bezierobjdet"}],"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":0,"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/line-segment-detection-using-transformers#ran","syntology_url":"https://syntology.ai/paper/2101.01909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.01909"}},"official":{"repos":["mlpc-ucsd/LETR"],"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"]}}}}],"datasets":[{"url":"/dataset/cityscapes","name":"Cityscapes","full_name":"","num_papers_in_archive":3702},{"url":"/dataset/celeba","name":"CelebA","full_name":"CelebFaces Attributes Dataset","num_papers_in_archive":3477},{"url":"/dataset/nyuv2","name":"NYUv2","full_name":"NYU-Depth V2","num_papers_in_archive":986},{"url":"/dataset/utkface","name":"UTKFace","full_name":"","num_papers_in_archive":243},{"url":"/dataset/chestx-ray14","name":"ChestX-ray14","full_name":"ChestX-ray14","num_papers_in_archive":237},{"url":"/dataset/clotho","name":"Clotho","full_name":"Clotho","num_papers_in_archive":202},{"url":"/dataset/ethics-1","name":"ETHICS","full_name":"","num_papers_in_archive":183},{"url":"/dataset/aff-wild2","name":"Aff-Wild2","full_name":"","num_papers_in_archive":142},{"url":"/dataset/hypersim","name":"Hypersim","full_name":"","num_papers_in_archive":108},{"url":"/dataset/tartanair","name":"TartanAir","full_name":"","num_papers_in_archive":107},{"url":"/dataset/kp20k","name":"KP20k","full_name":"KP20k","num_papers_in_archive":87},{"url":"/dataset/qm9","name":"QM9","full_name":"","num_papers_in_archive":76},{"url":"/dataset/meta-world-benchmark","name":"Meta-World Benchmark","full_name":"","num_papers_in_archive":73},{"url":"/dataset/celex","name":"CELEX","full_name":"CELEX","num_papers_in_archive":59},{"url":"/dataset/wireframe","name":"Wireframe","full_name":"","num_papers_in_archive":57},{"url":"/dataset/kuairand","name":"KuaiRand","full_name":"","num_papers_in_archive":42},{"url":"/dataset/thchs-30","name":"THCHS-30","full_name":"","num_papers_in_archive":34},{"url":"/dataset/mtl-aqa","name":"MTL-AQA","full_name":"","num_papers_in_archive":33},{"url":"/dataset/ch-sims","name":"CH-SIMS","full_name":"CH-SIMS","num_papers_in_archive":25},{"url":"/dataset/wider","name":"WIDER","full_name":"Web Image Dataset for Event Recognition","num_papers_in_archive":22},{"url":"/dataset/cal500","name":"CAL500","full_name":"Computer Audition Lab 500","num_papers_in_archive":21},{"url":"/dataset/aqa-7","name":"AQA-7","full_name":"","num_papers_in_archive":20},{"url":"/dataset/leaf-benchmark","name":"LEAF Benchmark","full_name":"","num_papers_in_archive":19},{"url":"/dataset/juice","name":"JuICe","full_name":"JuICe Dataset","num_papers_in_archive":16},{"url":"/dataset/semart","name":"SemArt","full_name":"","num_papers_in_archive":16},{"url":"/dataset/gcdc","name":"GCDC","full_name":"Grammarly Corpus of Discourse Coherence","num_papers_in_archive":13},{"url":"/dataset/fsdkaggle2018","name":"FSDKaggle2018","full_name":"FSDKaggle2018","num_papers_in_archive":12},{"url":"/dataset/cropandweed-dataset","name":"CropAndWeed","full_name":"","num_papers_in_archive":10},{"url":"/dataset/skillspan","name":"SkillSpan","full_name":"Hard and Soft Skill Extraction from English Job Postings","num_papers_in_archive":10},{"url":"/dataset/ncls","name":"NCLS","full_name":"Neural Cross-Lingual Summarization Corpora","num_papers_in_archive":9},{"url":"/dataset/omniart","name":"OmniArt","full_name":"","num_papers_in_archive":9},{"url":"/dataset/vmsmo","name":"VMSMO","full_name":null,"num_papers_in_archive":8},{"url":"/dataset/fsdkaggle2019","name":"FSDKaggle2019","full_name":"FSDKaggle2019","num_papers_in_archive":5},{"url":"/dataset/pgdp5k","name":"PGDP5K","full_name":"Plane Geometry Diagram Parsing Dataset","num_papers_in_archive":5},{"url":"/dataset/www-crowd","name":"WWW Crowd","full_name":"WWW Crowd","num_papers_in_archive":5},{"url":"/dataset/cs","name":"CS","full_name":"Chinese Simile","num_papers_in_archive":3},{"url":"/dataset/famulus","name":"Famulus","full_name":"","num_papers_in_archive":3},{"url":"/dataset/hotelrec","name":"HotelRec","full_name":"","num_papers_in_archive":3},{"url":"/dataset/hsd","name":"HSD","full_name":"Honda Scenes Dataset","num_papers_in_archive":3},{"url":"/dataset/mmdb","name":"MMDB","full_name":"Multimodal Dyadic Behavior","num_papers_in_archive":3},{"url":"/dataset/openttgames","name":"OpenTTGames","full_name":"","num_papers_in_archive":3},{"url":"/dataset/robopianist","name":"RoboPianist","full_name":"","num_papers_in_archive":3},{"url":"/dataset/tasksource","name":"Tasksource","full_name":"","num_papers_in_archive":3},{"url":"/dataset/cqr","name":"CQR","full_name":"Contextual Query Rewrite","num_papers_in_archive":2},{"url":"/dataset/exhvv","name":"ExHVV","full_name":"","num_papers_in_archive":2},{"url":"/dataset/cifar10mnist","name":"Cifar10Mnist","full_name":"","num_papers_in_archive":1},{"url":"/dataset/fiw-mm","name":"FIW-MM","full_name":"Families In Wild Multimedia","num_papers_in_archive":1},{"url":"/dataset/mcic-coco","name":"MCIC-COCO","full_name":"","num_papers_in_archive":1},{"url":"/dataset/merrec","name":"MerRec","full_name":"MerRec Recommendation Dataset","num_papers_in_archive":1},{"url":"/dataset/noun-ainoun-compound-dataset","name":"Noun-Noun Compound Dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/photographic-defect-severity","name":"Photographic Defect Severity","full_name":"","num_papers_in_archive":1},{"url":"/dataset/pic2kcal","name":"pic2kcal","full_name":null,"num_papers_in_archive":1},{"url":"/dataset/semanticsugarbeets","name":"SemanticSugarBeets","full_name":"","num_papers_in_archive":1},{"url":"/dataset/sickle","name":"SICKLE","full_name":"Satellite Imagery for Cropping annotated with Keyparameter LabEls","num_papers_in_archive":1},{"url":"/dataset/tfix-s-code-patch-data","name":"TFix's Code Patches Data","full_name":"","num_papers_in_archive":1},{"url":"/dataset/timbervision-dataset","name":"TimberVision","full_name":"TimberVision","num_papers_in_archive":1},{"url":"/dataset/vidset","name":"VidSet","full_name":"","num_papers_in_archive":1},{"url":"/dataset/cvgl","name":"CVGL","full_name":"","num_papers_in_archive":0},{"url":"/dataset/dronescapes","name":"Dronescapes","full_name":"","num_papers_in_archive":0}],"subtasks":[{"url":"/task/multi-task-language-understanding","name":"Multi-task Language Understanding"},{"url":"/task/task-arithmetic","name":"Task Arithmetic"}],"parent_tasks":[{"url":"/task/transfer-learning","name":"Transfer Learning"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":37,"rows_per_page":100,"shown":100,"of":3687,"of_with_code":1306,"tagged_in_all":3687,"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":215,"every_run_a_failure_of_syntologys_instrument":45,"listed_with_a_run_with_no_instrument_failure":215,"listed_every_run_a_failure_of_syntologys_instrument":45,"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"},"items":[{"url":"/paper/190500641","slug":"190500641","title":"RetinaFace: Single-stage Dense Face Localisation in the Wild","date":"2019-05-02","arxiv_id":"1905.00641","repositories_listed":76,"syntology":{"n":91,"n_ran":73,"n_constructed":0,"n_ran_checked":58,"n_instrument":15,"n_unverified":18,"n_honours":1,"n_violates":4,"n_no_contract":53,"n_pointer_only":8,"phrase":"73 ran (of which 0 constructed an object rather than computing a result; 58 with no instrument failure: 1 honoured, 4 violated, 53 with no contract checked; 15 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/190500641#ran","syntology_url":"https://syntology.ai/paper/1905.00641","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00641"}},"official":{"repos":["deepinsight/insightface"],"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/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","repositories_listed":67,"syntology":{"n":65,"n_ran":45,"n_constructed":0,"n_ran_checked":37,"n_instrument":8,"n_unverified":20,"n_honours":3,"n_violates":2,"n_no_contract":32,"n_pointer_only":7,"phrase":"45 ran (of which 0 constructed an object rather than computing a result; 37 with no instrument failure: 3 honoured, 2 violated, 32 with no contract checked; 8 where Syntology's instrument failed) · 20 unverified","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}},"official":{"repos":["openai/gpt-3"],"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/a-simple-baseline-for-multi-object-tracking","slug":"a-simple-baseline-for-multi-object-tracking","title":"FairMOT: On the Fairness of Detection and Re-Identification in Multiple Object Tracking","date":"2020-04-04","arxiv_id":"2004.01888","repositories_listed":33,"syntology":{"n":53,"n_ran":46,"n_constructed":0,"n_ran_checked":41,"n_instrument":5,"n_unverified":7,"n_honours":2,"n_violates":0,"n_no_contract":39,"n_pointer_only":1,"phrase":"46 ran (of which 0 constructed an object rather than computing a result; 41 with no instrument failure: 2 honoured, 0 violated, 39 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-simple-baseline-for-multi-object-tracking#ran","syntology_url":"https://syntology.ai/paper/2004.01888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.01888"}},"official":{"repos":["ifzhang/FairMOT"],"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/language-models-are-unsupervised-multitask","slug":"language-models-are-unsupervised-multitask","title":"Language Models are Unsupervised Multitask Learners","date":"2019-02-14","arxiv_id":null,"repositories_listed":21,"syntology":null},{"url":"/paper/multi-task-learning-using-uncertainty-to","slug":"multi-task-learning-using-uncertainty-to","title":"Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semantics","date":"2017-05-19","arxiv_id":"1705.07115","repositories_listed":19,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/multi-task-learning-using-uncertainty-to#ran","syntology_url":"https://syntology.ai/paper/1705.07115","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07115"}},"official":null}},{"url":"/paper/measuring-massive-multitask-language","slug":"measuring-massive-multitask-language","title":"Measuring Massive Multitask Language Understanding","date":"2020-09-07","arxiv_id":"2009.03300","repositories_listed":18,"syntology":{"n":26,"n_ran":19,"n_constructed":0,"n_ran_checked":10,"n_instrument":9,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 9 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/measuring-massive-multitask-language#ran","syntology_url":"https://syntology.ai/paper/2009.03300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03300"}},"official":{"repos":["hendrycks/test"],"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/gradient-surgery-for-multi-task-learning-1","slug":"gradient-surgery-for-multi-task-learning-1","title":"Gradient Surgery for Multi-Task Learning","date":"2020-01-19","arxiv_id":"2001.06782","repositories_listed":18,"syntology":{"n":10,"n_ran":7,"n_constructed":5,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"7 ran (of which 5 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) · 3 unverified","sample_list":"/paper/gradient-surgery-for-multi-task-learning-1#ran","syntology_url":"https://syntology.ai/paper/2001.06782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06782"}},"official":{"repos":["tianheyu927/PCGrad"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/covid-ct-dataset-a-ct-scan-dataset-about","slug":"covid-ct-dataset-a-ct-scan-dataset-about","title":"COVID-CT-Dataset: A CT Scan Dataset about COVID-19","date":"2020-03-30","arxiv_id":"2003.13865","repositories_listed":17,"syntology":null},{"url":"/paper/towards-real-time-multi-object-tracking","slug":"towards-real-time-multi-object-tracking","title":"Towards Real-Time Multi-Object Tracking","date":"2019-09-27","arxiv_id":"1909.12605","repositories_listed":12,"syntology":{"n":36,"n_ran":30,"n_constructed":0,"n_ran_checked":28,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":28,"n_pointer_only":0,"phrase":"30 ran (of which 0 constructed an object rather than computing a result; 28 with no instrument failure: 0 honoured, 0 violated, 28 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/towards-real-time-multi-object-tracking#ran","syntology_url":"https://syntology.ai/paper/1909.12605","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12605"}},"official":{"repos":["Zhongdao/Towards-Realtime-MOT"],"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/modeling-task-relationships-in-multi-task","slug":"modeling-task-relationships-in-multi-task","title":"Modeling Task Relationships in Multi-task Learning with Multi-gate Mixture-of-Experts","date":"2018-07-19","arxiv_id":null,"repositories_listed":11,"syntology":null},{"url":"/paper/you-only-learn-one-representation-unified","slug":"you-only-learn-one-representation-unified","title":"You Only Learn One Representation: Unified Network for Multiple Tasks","date":"2021-05-10","arxiv_id":"2105.04206","repositories_listed":9,"syntology":null},{"url":"/paper/meta-world-a-benchmark-and-evaluation-for","slug":"meta-world-a-benchmark-and-evaluation-for","title":"Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learning","date":"2019-10-24","arxiv_id":"1910.10897","repositories_listed":9,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"7 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/meta-world-a-benchmark-and-evaluation-for#ran","syntology_url":"https://syntology.ai/paper/1910.10897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10897"}},"official":{"repos":["rlworkgroup/metaworld"],"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/pamtri-pose-aware-multi-task-learning-for-1","slug":"pamtri-pose-aware-multi-task-learning-for-1","title":"PAMTRI: Pose-Aware Multi-Task Learning for Vehicle Re-Identification Using Highly Randomized Synthetic Data","date":"2020-05-02","arxiv_id":"2005.00673","repositories_listed":8,"syntology":null},{"url":"/paper/joint-ctc-attention-based-end-to-end-speech","slug":"joint-ctc-attention-based-end-to-end-speech","title":"Joint CTC-Attention based End-to-End Speech Recognition using Multi-task Learning","date":"2016-09-21","arxiv_id":"1609.06773","repositories_listed":8,"syntology":{"n":10,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/joint-ctc-attention-based-end-to-end-speech#ran","syntology_url":"https://syntology.ai/paper/1609.06773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.06773"}},"official":null}},{"url":"/paper/progressive-layered-extraction-ple-a-novel","slug":"progressive-layered-extraction-ple-a-novel","title":"Progressive Layered Extraction (PLE): A Novel Multi-Task Learning (MTL) Model for Personalized Recommendations","date":"2020-02-22","arxiv_id":null,"repositories_listed":7,"syntology":null},{"url":"/paper/leaf-a-benchmark-for-federated-settings","slug":"leaf-a-benchmark-for-federated-settings","title":"LEAF: A Benchmark for Federated Settings","date":"2018-12-03","arxiv_id":"1812.01097","repositories_listed":7,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/leaf-a-benchmark-for-federated-settings#ran","syntology_url":"https://syntology.ai/paper/1812.01097","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01097"}},"official":{"repos":["TalwalkarLab/leaf"],"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/multi-task-learning-as-multi-objective","slug":"multi-task-learning-as-multi-objective","title":"Multi-Task Learning as Multi-Objective Optimization","date":"2018-10-10","arxiv_id":"1810.04650","repositories_listed":7,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":1,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-learning-as-multi-objective#ran","syntology_url":"https://syntology.ai/paper/1810.04650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04650"}},"official":{"repos":["IntelVCL/MultiObjectiveOptimization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/revisiting-rcnn-on-awakening-the","slug":"revisiting-rcnn-on-awakening-the","title":"Revisiting RCNN: On Awakening the Classification Power of Faster RCNN","date":"2018-03-19","arxiv_id":"1803.06799","repositories_listed":7,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-rcnn-on-awakening-the#ran","syntology_url":"https://syntology.ai/paper/1803.06799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.06799"}},"official":null}},{"url":"/paper/two-stream-convolutional-networks-for-action","slug":"two-stream-convolutional-networks-for-action","title":"Two-Stream Convolutional Networks for Action Recognition in Videos","date":"2014-06-09","arxiv_id":"1406.2199","repositories_listed":7,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"5 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/two-stream-convolutional-networks-for-action#ran","syntology_url":"https://syntology.ai/paper/1406.2199","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.2199"}},"official":{"repos":["feichtenhofer/twostreamfusion"],"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/a-multi-task-learning-model-for-chinese","slug":"a-multi-task-learning-model-for-chinese","title":"A Multi-task Learning Model for Chinese-oriented Aspect Polarity Classification and Aspect Term Extraction","date":"2019-12-17","arxiv_id":"1912.07976","repositories_listed":6,"syntology":null},{"url":"/paper/improving-grammatical-error-correction-via","slug":"improving-grammatical-error-correction-via","title":"Improving Grammatical Error Correction via Pre-Training a Copy-Augmented Architecture with Unlabeled Data","date":"2019-03-01","arxiv_id":"1903.00138","repositories_listed":6,"syntology":null},{"url":"/paper/unispeech-sat-universal-speech-representation","slug":"unispeech-sat-universal-speech-representation","title":"UniSpeech-SAT: Universal Speech Representation Learning with Speaker Aware Pre-Training","date":"2021-10-12","arxiv_id":"2110.05752","repositories_listed":5,"syntology":null},{"url":"/paper/codet5-identifier-aware-unified-pre-trained","slug":"codet5-identifier-aware-unified-pre-trained","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","date":"2021-09-02","arxiv_id":"2109.00859","repositories_listed":5,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 5 unverified","sample_list":"/paper/codet5-identifier-aware-unified-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2109.00859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00859"}},"official":{"repos":["salesforce/codet5"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/yolop-you-only-look-once-for-panoptic-driving","slug":"yolop-you-only-look-once-for-panoptic-driving","title":"YOLOP: You Only Look Once for Panoptic Driving Perception","date":"2021-08-25","arxiv_id":"2108.11250","repositories_listed":5,"syntology":{"n":18,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":2,"phrase":"13 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; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/yolop-you-only-look-once-for-panoptic-driving#ran","syntology_url":"https://syntology.ai/paper/2108.11250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.11250"}},"official":{"repos":["hustvl/yolop"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/federated-multi-task-learning-under-a-mixture","slug":"federated-multi-task-learning-under-a-mixture","title":"Federated Multi-Task Learning under a Mixture of Distributions","date":"2021-08-23","arxiv_id":"2108.10252","repositories_listed":5,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":9,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 1 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/federated-multi-task-learning-under-a-mixture#ran","syntology_url":"https://syntology.ai/paper/2108.10252","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.10252"}},"official":{"repos":["omarfoq/fedem"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/unispeech-unified-speech-representation","slug":"unispeech-unified-speech-representation","title":"UniSpeech: Unified Speech Representation Learning with Labeled and Unlabeled Data","date":"2021-01-19","arxiv_id":"2101.07597","repositories_listed":5,"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":2,"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/unispeech-unified-speech-representation#ran","syntology_url":"https://syntology.ai/paper/2101.07597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.07597"}},"official":{"repos":["cywang97/unispeech"],"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/fairseq-s2t-fast-speech-to-text-modeling-with","slug":"fairseq-s2t-fast-speech-to-text-modeling-with","title":"fairseq S2T: Fast Speech-to-Text Modeling with fairseq","date":"2020-10-11","arxiv_id":"2010.05171","repositories_listed":5,"syntology":null},{"url":"/paper/federated-optimization-for-heterogeneous-1","slug":"federated-optimization-for-heterogeneous-1","title":"Federated Optimization for Heterogeneous Networks","date":"2019-05-16","arxiv_id":null,"repositories_listed":5,"syntology":null},{"url":"/paper/what-and-how-well-you-performed-a-multitask","slug":"what-and-how-well-you-performed-a-multitask","title":"What and How Well You Performed? A Multitask Learning Approach to Action Quality Assessment","date":"2019-04-08","arxiv_id":"1904.04346","repositories_listed":5,"syntology":null},{"url":"/paper/multi-task-learning-for-machine-reading","slug":"multi-task-learning-for-machine-reading","title":"Multi-task Learning with Sample Re-weighting for Machine Reading Comprehension","date":"2018-09-18","arxiv_id":"1809.06963","repositories_listed":5,"syntology":null},{"url":"/paper/stacked-conditional-generative-adversarial","slug":"stacked-conditional-generative-adversarial","title":"Stacked Conditional Generative Adversarial Networks for Jointly Learning Shadow Detection and Shadow Removal","date":"2017-12-07","arxiv_id":"1712.02478","repositories_listed":5,"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/stacked-conditional-generative-adversarial#ran","syntology_url":"https://syntology.ai/paper/1712.02478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.02478"}},"official":null}},{"url":"/paper/an-overview-of-multi-task-learning-in-deep","slug":"an-overview-of-multi-task-learning-in-deep","title":"An Overview of Multi-Task Learning in Deep Neural Networks","date":"2017-06-15","arxiv_id":"1706.05098","repositories_listed":5,"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":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) · 0 unverified","sample_list":"/paper/an-overview-of-multi-task-learning-in-deep#ran","syntology_url":"https://syntology.ai/paper/1706.05098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.05098"}},"official":null}},{"url":"/paper/mitigating-gradient-bias-in-multi-objective","slug":"mitigating-gradient-bias-in-multi-objective","title":"Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent Stochastic Approach","date":"2022-10-23","arxiv_id":"2210.12624","repositories_listed":4,"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":0,"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/mitigating-gradient-bias-in-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2210.12624","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12624"}},"official":null}},{"url":"/paper/uglad-sparse-graph-recovery-by-optimizing","slug":"uglad-sparse-graph-recovery-by-optimizing","title":"uGLAD: Sparse graph recovery by optimizing deep unrolled networks","date":"2022-05-23","arxiv_id":"2205.11610","repositories_listed":4,"syntology":null},{"url":"/paper/multi-task-learning-as-a-bargaining-game","slug":"multi-task-learning-as-a-bargaining-game","title":"Multi-Task Learning as a Bargaining Game","date":"2022-02-02","arxiv_id":"2202.01017","repositories_listed":4,"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":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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/multi-task-learning-as-a-bargaining-game#ran","syntology_url":"https://syntology.ai/paper/2202.01017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.01017"}},"official":{"repos":["avivnavon/nash-mtl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/ext5-towards-extreme-multi-task-scaling-for-1","slug":"ext5-towards-extreme-multi-task-scaling-for-1","title":"ExT5: Towards Extreme Multi-Task Scaling for Transfer Learning","date":"2021-11-22","arxiv_id":"2111.10952","repositories_listed":4,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/ext5-towards-extreme-multi-task-scaling-for-1#ran","syntology_url":"https://syntology.ai/paper/2111.10952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.10952"}},"official":{"repos":["google-research/text-to-text-transfer-transformer","tensorflow/mesh"],"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/conflict-averse-gradient-descent-for-multi","slug":"conflict-averse-gradient-descent-for-multi","title":"Conflict-Averse Gradient Descent for Multi-task Learning","date":"2021-10-26","arxiv_id":"2110.14048","repositories_listed":4,"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":0,"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/conflict-averse-gradient-descent-for-multi#ran","syntology_url":"https://syntology.ai/paper/2110.14048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14048"}},"official":{"repos":["cranial-xix/cagrad"],"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/federated-multi-task-learning-for-competing","slug":"federated-multi-task-learning-for-competing","title":"Ditto: Fair and Robust Federated Learning Through Personalization","date":"2020-12-08","arxiv_id":"2012.04221","repositories_listed":4,"syntology":{"n":18,"n_ran":15,"n_constructed":5,"n_ran_checked":12,"n_instrument":3,"n_unverified":3,"n_honours":7,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 12 with no instrument failure: 7 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/federated-multi-task-learning-for-competing#ran","syntology_url":"https://syntology.ai/paper/2012.04221","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.04221"}},"official":{"repos":["litian96/ditto"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/knowledge-distillation-for-multi-task","slug":"knowledge-distillation-for-multi-task","title":"Knowledge Distillation for Multi-task Learning","date":"2020-07-14","arxiv_id":"2007.06889","repositories_listed":4,"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":4,"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/knowledge-distillation-for-multi-task#ran","syntology_url":"https://syntology.ai/paper/2007.06889","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.06889"}},"official":{"repos":["VICO-UoE/KD4MTL"],"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/discor-corrective-feedback-in-reinforcement","slug":"discor-corrective-feedback-in-reinforcement","title":"DisCor: Corrective Feedback in Reinforcement Learning via Distribution Correction","date":"2020-03-16","arxiv_id":"2003.07305","repositories_listed":4,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/discor-corrective-feedback-in-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2003.07305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.07305"}},"official":null}},{"url":"/paper/bayesian-neural-networks-with-maximum-mean","slug":"bayesian-neural-networks-with-maximum-mean","title":"Bayesian Neural Networks With Maximum Mean Discrepancy Regularization","date":"2020-03-02","arxiv_id":"2003.00952","repositories_listed":4,"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/bayesian-neural-networks-with-maximum-mean#ran","syntology_url":"https://syntology.ai/paper/2003.00952","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00952"}},"official":{"repos":["ispamm/MMD-Bayesian-Neural-Network"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/emotion-cause-pair-extraction-a-new-task-to","slug":"emotion-cause-pair-extraction-a-new-task-to","title":"Emotion-Cause Pair Extraction: A New Task to Emotion Analysis in Texts","date":"2019-06-04","arxiv_id":"1906.01267","repositories_listed":4,"syntology":null},{"url":"/paper/self-supervised-generalisation-with-meta","slug":"self-supervised-generalisation-with-meta","title":"Self-Supervised Generalisation with Meta Auxiliary Learning","date":"2019-01-25","arxiv_id":"1901.08933","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/self-supervised-generalisation-with-meta#ran","syntology_url":"https://syntology.ai/paper/1901.08933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08933"}},"official":{"repos":["lorenmt/maxl"],"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/learning-general-purpose-distributed-sentence","slug":"learning-general-purpose-distributed-sentence","title":"Learning General Purpose Distributed Sentence Representations via Large Scale Multi-task Learning","date":"2018-03-30","arxiv_id":"1804.00079","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-general-purpose-distributed-sentence#ran","syntology_url":"https://syntology.ai/paper/1804.00079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00079"}},"official":{"repos":["facebookresearch/SentEval","Maluuba/gensen"],"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":["official"]}}},{"url":"/paper/end-to-end-multi-task-learning-with-attention","slug":"end-to-end-multi-task-learning-with-attention","title":"End-to-End Multi-Task Learning with Attention","date":"2018-03-28","arxiv_id":"1803.10704","repositories_listed":4,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 4 unverified","sample_list":"/paper/end-to-end-multi-task-learning-with-attention#ran","syntology_url":"https://syntology.ai/paper/1803.10704","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10704"}},"official":{"repos":["lorenmt/mtan"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-automatic-generation-of-medical","slug":"on-the-automatic-generation-of-medical","title":"On the Automatic Generation of Medical Imaging Reports","date":"2017-11-22","arxiv_id":"1711.08195","repositories_listed":4,"syntology":null},{"url":"/paper/cross-stitch-networks-for-multi-task-learning","slug":"cross-stitch-networks-for-multi-task-learning","title":"Cross-stitch Networks for Multi-task Learning","date":"2016-04-12","arxiv_id":"1604.03539","repositories_listed":4,"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/cross-stitch-networks-for-multi-task-learning#ran","syntology_url":"https://syntology.ai/paper/1604.03539","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.03539"}},"official":null}},{"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":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 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/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":2,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 1 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/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":1,"n_unverified":0,"ran_from_kinds":["listed","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":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"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, 1 violated, 2 with no contract checked; 2 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":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lip-to-speech-synthesis-in-the-wild-with","slug":"lip-to-speech-synthesis-in-the-wild-with","title":"Lip-to-Speech Synthesis in the Wild with Multi-task Learning","date":"2023-02-17","arxiv_id":"2302.08841","repositories_listed":3,"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/lip-to-speech-synthesis-in-the-wild-with#ran","syntology_url":"https://syntology.ai/paper/2302.08841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.08841"}},"official":{"repos":["ms-dot-k/Lip-to-Speech-Synthesis-in-the-Wild"],"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/mlink-linking-black-box-models-from-multiple","slug":"mlink-linking-black-box-models-from-multiple","title":"MLink: Linking Black-Box Models from Multiple Domains for Collaborative Inference","date":"2022-09-28","arxiv_id":"2209.13883","repositories_listed":3,"syntology":null},{"url":"/paper/generalized-scene-classification-from-small","slug":"generalized-scene-classification-from-small","title":"Generalized Scene Classification from Small-Scale Datasets with Multi-Task Learning","date":"2021-10-08","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/vogue-answer-verbalization-through-multi-task","slug":"vogue-answer-verbalization-through-multi-task","title":"VOGUE: Answer Verbalization through Multi-Task Learning","date":"2021-06-24","arxiv_id":"2106.13316","repositories_listed":3,"syntology":null},{"url":"/paper/dselect-k-differentiable-selection-in-the","slug":"dselect-k-differentiable-selection-in-the","title":"DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning","date":"2021-06-07","arxiv_id":"2106.03760","repositories_listed":3,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"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, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/dselect-k-differentiable-selection-in-the#ran","syntology_url":"https://syntology.ai/paper/2106.03760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03760"}},"official":{"repos":["google-research/google-research"],"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":["listed","official"]}}},{"url":"/paper/modeling-the-sequential-dependence-among","slug":"modeling-the-sequential-dependence-among","title":"Modeling the Sequential Dependence among Audience Multi-step Conversions with Multi-task Learning in Targeted Display Advertising","date":"2021-05-18","arxiv_id":"2105.08489","repositories_listed":3,"syntology":null},{"url":"/paper/an-empirical-study-on-channel-effects-for","slug":"an-empirical-study-on-channel-effects-for","title":"An Empirical Study on Channel Effects for Synthetic Voice Spoofing Countermeasure Systems","date":"2021-04-03","arxiv_id":"2104.01320","repositories_listed":3,"syntology":{"n":18,"n_ran":14,"n_constructed":0,"n_ran_checked":9,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"14 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/an-empirical-study-on-channel-effects-for#ran","syntology_url":"https://syntology.ai/paper/2104.01320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01320"}},"official":{"repos":["yzyouzhang/Empirical-Channel-CM"],"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":["listed","official"]}}},{"url":"/paper/exploiting-shared-representations-for","slug":"exploiting-shared-representations-for","title":"Exploiting Shared Representations for Personalized Federated Learning","date":"2021-02-14","arxiv_id":"2102.07078","repositories_listed":3,"syntology":null},{"url":"/paper/towards-impartial-multi-task-learning","slug":"towards-impartial-multi-task-learning","title":"Towards Impartial Multi-task Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/a-multi-task-learning-framework-for-opinion","slug":"a-multi-task-learning-framework-for-opinion","title":"A Multi-task Learning Framework for Opinion Triplet Extraction","date":"2020-10-04","arxiv_id":"2010.01512","repositories_listed":3,"syntology":null},{"url":"/paper/weakly-supervised-segmentation-with-multi","slug":"weakly-supervised-segmentation-with-multi","title":"Learning to Segment from Scribbles using Multi-scale Adversarial Attention Gates","date":"2020-07-02","arxiv_id":"2007.01152","repositories_listed":3,"syntology":null},{"url":"/paper/an-efficient-framework-for-clustered","slug":"an-efficient-framework-for-clustered","title":"An Efficient Framework for Clustered Federated Learning","date":"2020-06-07","arxiv_id":"2006.04088","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/an-efficient-framework-for-clustered#ran","syntology_url":"https://syntology.ai/paper/2006.04088","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04088"}},"official":{"repos":["jichan3751/ifca"],"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":["listed","official"]}}},{"url":"/paper/adapterfusion-non-destructive-task","slug":"adapterfusion-non-destructive-task","title":"AdapterFusion: Non-Destructive Task Composition for Transfer Learning","date":"2020-05-01","arxiv_id":"2005.00247","repositories_listed":3,"syntology":null},{"url":"/paper/a-dependency-syntactic-knowledge-augmented","slug":"a-dependency-syntactic-knowledge-augmented","title":"A Dependency Syntactic Knowledge Augmented Interactive Architecture for End-to-End Aspect-based Sentiment Analysis","date":"2020-04-04","arxiv_id":"2004.01951","repositories_listed":3,"syntology":null},{"url":"/paper/the-microsoft-toolkit-of-multi-task-deep","slug":"the-microsoft-toolkit-of-multi-task-deep","title":"The Microsoft Toolkit of Multi-Task Deep Neural Networks for Natural Language Understanding","date":"2020-02-19","arxiv_id":"2002.07972","repositories_listed":3,"syntology":null},{"url":"/paper/generalizing-natural-language-analysis-1","slug":"generalizing-natural-language-analysis-1","title":"Generalizing Natural Language Analysis through Span-relation Representations","date":"2019-11-10","arxiv_id":"1911.03822","repositories_listed":3,"syntology":null},{"url":"/paper/ludwig-a-type-based-declarative-deep-learning","slug":"ludwig-a-type-based-declarative-deep-learning","title":"Ludwig: a type-based declarative deep learning toolbox","date":"2019-09-17","arxiv_id":"1909.07930","repositories_listed":3,"syntology":null},{"url":"/paper/ernie-20-a-continual-pre-training-framework","slug":"ernie-20-a-continual-pre-training-framework","title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","date":"2019-07-29","arxiv_id":"1907.12412","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/ernie-20-a-continual-pre-training-framework#ran","syntology_url":"https://syntology.ai/paper/1907.12412","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12412"}},"official":{"repos":["PaddlePaddle/ERNIE"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/an-interactive-multi-task-learning-network","slug":"an-interactive-multi-task-learning-network","title":"An Interactive Multi-Task Learning Network for End-to-End Aspect-Based Sentiment Analysis","date":"2019-06-17","arxiv_id":"1906.06906","repositories_listed":3,"syntology":null},{"url":"/paper/improving-multi-task-deep-neural-networks-via","slug":"improving-multi-task-deep-neural-networks-via","title":"Improving Multi-Task Deep Neural Networks via Knowledge Distillation for Natural Language Understanding","date":"2019-04-20","arxiv_id":"1904.09482","repositories_listed":3,"syntology":null},{"url":"/paper/influence-maximization-via-representation","slug":"influence-maximization-via-representation","title":"Multi-task Learning for Influence Estimation and Maximization","date":"2019-04-18","arxiv_id":"1904.08804","repositories_listed":3,"syntology":null},{"url":"/paper/multi-task-feature-learning-for-knowledge","slug":"multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","arxiv_id":"1901.08907","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"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 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) · 2 unverified","sample_list":"/paper/multi-task-feature-learning-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/1901.08907","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08907"}},"official":{"repos":["hwwang55/MKR"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/decoupled-classification-refinement-hard","slug":"decoupled-classification-refinement-hard","title":"Decoupled Classification Refinement: Hard False Positive Suppression for Object Detection","date":"2018-10-05","arxiv_id":"1810.04002","repositories_listed":3,"syntology":null},{"url":"/paper/jointly-learning-to-see-ask-and-guesswhat","slug":"jointly-learning-to-see-ask-and-guesswhat","title":"Beyond task success: A closer look at jointly learning to see, ask, and GuessWhat","date":"2018-09-10","arxiv_id":"1809.03408","repositories_listed":3,"syntology":null},{"url":"/paper/auxiliary-tasks-in-multi-task-learning","slug":"auxiliary-tasks-in-multi-task-learning","title":"Auxiliary Tasks in Multi-task Learning","date":"2018-05-16","arxiv_id":"1805.06334","repositories_listed":3,"syntology":null},{"url":"/paper/learning-multi-attention-convolutional-neural","slug":"learning-multi-attention-convolutional-neural","title":"Learning Multi-Attention Convolutional Neural Network for Fine-Grained Image Recognition","date":"2017-10-01","arxiv_id":null,"repositories_listed":3,"syntology":null},{"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/scalable-bilevel-loss-balancing-for-multi","slug":"scalable-bilevel-loss-balancing-for-multi","title":"LDC-MTL: Balancing Multi-Task Learning through Scalable Loss Discrepancy Control","date":"2025-02-12","arxiv_id":"2502.08585","repositories_listed":2,"syntology":null},{"url":"/paper/gradient-alignment-in-physics-informed-neural","slug":"gradient-alignment-in-physics-informed-neural","title":"Gradient Alignment in Physics-informed Neural Networks: A Second-Order Optimization Perspective","date":"2025-02-02","arxiv_id":"2502.00604","repositories_listed":2,"syntology":null},{"url":"/paper/supervised-learning-with-evolving-tasks-and","slug":"supervised-learning-with-evolving-tasks-and","title":"Supervised Learning with Evolving Tasks and Performance Guarantees","date":"2025-01-09","arxiv_id":"2501.05089","repositories_listed":2,"syntology":null},{"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":1,"n_instrument":6,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":11,"phrase":"7 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; 6 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":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-head-sequence-tagging-model-for","slug":"multi-head-sequence-tagging-model-for","title":"Multi-head Sequence Tagging Model for Grammatical Error Correction","date":"2024-10-21","arxiv_id":"2410.16473","repositories_listed":2,"syntology":null},{"url":"/paper/2408-02128","slug":"2408-02128","title":"Table Transformers for Imputing Textual Attributes","date":"2024-08-04","arxiv_id":"2408.02128","repositories_listed":2,"syntology":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/jacobian-descent-for-multi-objective","slug":"jacobian-descent-for-multi-objective","title":"Jacobian Descent for Multi-Objective Optimization","date":"2024-06-23","arxiv_id":"2406.16232","repositories_listed":2,"syntology":null},{"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/unleashing-the-power-of-multi-task-learning-a","slug":"unleashing-the-power-of-multi-task-learning-a","title":"Unleashing the Power of Multi-Task Learning: A Comprehensive Survey Spanning Traditional, Deep, and Pretrained Foundation Model Eras","date":"2024-04-29","arxiv_id":"2404.18961","repositories_listed":2,"syntology":null},{"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":3,"n_instrument":3,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 3 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":3,"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/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":8,"n_instrument":7,"n_unverified":3,"n_honours":4,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 4 honoured, 0 violated, 4 with no contract checked; 7 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":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/sequencepar-understanding-pedestrian","slug":"sequencepar-understanding-pedestrian","title":"SequencePAR: Understanding Pedestrian Attributes via A Sequence Generation Paradigm","date":"2023-12-04","arxiv_id":"2312.01640","repositories_listed":2,"syntology":null},{"url":"/paper/esm-nbr-fast-and-accurate-nucleic-acid","slug":"esm-nbr-fast-and-accurate-nucleic-acid","title":"ESM-NBR: fast and accurate nucleic acid-binding residue prediction via protein language model feature representation and multi-task learning","date":"2023-12-01","arxiv_id":"2312.00842","repositories_listed":2,"syntology":null},{"url":"/paper/acoustic-prompt-tuning-empowering-large","slug":"acoustic-prompt-tuning-empowering-large","title":"Acoustic Prompt Tuning: Empowering Large Language Models with Audition Capabilities","date":"2023-11-30","arxiv_id":"2312.00249","repositories_listed":2,"syntology":null},{"url":"/paper/av-rir-audio-visual-room-impulse-response","slug":"av-rir-audio-visual-room-impulse-response","title":"AV-RIR: Audio-Visual Room Impulse Response Estimation","date":"2023-11-30","arxiv_id":"2312.00834","repositories_listed":2,"syntology":null},{"url":"/paper/pean-a-diffusion-based-prior-enhanced","slug":"pean-a-diffusion-based-prior-enhanced","title":"PEAN: A Diffusion-Based Prior-Enhanced Attention Network for Scene Text Image Super-Resolution","date":"2023-11-29","arxiv_id":"2311.17955","repositories_listed":2,"syntology":null},{"url":"/paper/causal-similarity-based-hierarchical-bayesian","slug":"causal-similarity-based-hierarchical-bayesian","title":"Bayesian Meta-Learning for Improving Generalizability of Health Prediction Models With Similar Causal Mechanisms","date":"2023-10-19","arxiv_id":"2310.12595","repositories_listed":2,"syntology":null},{"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/large-scale-korean-text-dataset-for","slug":"large-scale-korean-text-dataset-for","title":"KoMultiText: Large-Scale Korean Text Dataset for Classifying Biased Speech in Real-World Online Services","date":"2023-10-06","arxiv_id":"2310.04313","repositories_listed":2,"syntology":null}],"syntology_records":50,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":1,"papers_placed":1,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/multi-task-learning-on-qm9","since_archive":"/sota/multi-task-learning-on-qm9#since-judged","papers_judged":1,"placed":1}]},"papers_where_code_ran":260,"papers_where_code_ran_first_page":"/task/multi-task-learning/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"archive","page":2,"of":37,"url":"/task/multi-task-learning/papers/2","json":"/task/multi-task-learning/papers/2.json","rows":100},{"order":"archive","page":3,"of":37,"url":"/task/multi-task-learning/papers/3","json":"/task/multi-task-learning/papers/3.json","rows":100},{"order":"archive","page":4,"of":37,"url":"/task/multi-task-learning/papers/4","json":"/task/multi-task-learning/papers/4.json","rows":100},{"order":"archive","page":5,"of":37,"url":"/task/multi-task-learning/papers/5","json":"/task/multi-task-learning/papers/5.json","rows":100},{"order":"archive","page":6,"of":37,"url":"/task/multi-task-learning/papers/6","json":"/task/multi-task-learning/papers/6.json","rows":100},{"order":"archive","page":7,"of":37,"url":"/task/multi-task-learning/papers/7","json":"/task/multi-task-learning/papers/7.json","rows":100},{"order":"archive","page":8,"of":37,"url":"/task/multi-task-learning/papers/8","json":"/task/multi-task-learning/papers/8.json","rows":100},{"order":"archive","page":9,"of":37,"url":"/task/multi-task-learning/papers/9","json":"/task/multi-task-learning/papers/9.json","rows":100},{"order":"archive","page":10,"of":37,"url":"/task/multi-task-learning/papers/10","json":"/task/multi-task-learning/papers/10.json","rows":100},{"order":"archive","page":11,"of":37,"url":"/task/multi-task-learning/papers/11","json":"/task/multi-task-learning/papers/11.json","rows":100},{"order":"archive","page":12,"of":37,"url":"/task/multi-task-learning/papers/12","json":"/task/multi-task-learning/papers/12.json","rows":100},{"order":"archive","page":13,"of":37,"url":"/task/multi-task-learning/papers/13","json":"/task/multi-task-learning/papers/13.json","rows":100},{"order":"archive","page":14,"of":37,"url":"/task/multi-task-learning/papers/14","json":"/task/multi-task-learning/papers/14.json","rows":100},{"order":"archive","page":15,"of":37,"url":"/task/multi-task-learning/papers/15","json":"/task/multi-task-learning/papers/15.json","rows":100},{"order":"archive","page":16,"of":37,"url":"/task/multi-task-learning/papers/16","json":"/task/multi-task-learning/papers/16.json","rows":100},{"order":"archive","page":17,"of":37,"url":"/task/multi-task-learning/papers/17","json":"/task/multi-task-learning/papers/17.json","rows":100},{"order":"archive","page":18,"of":37,"url":"/task/multi-task-learning/papers/18","json":"/task/multi-task-learning/papers/18.json","rows":100},{"order":"archive","page":19,"of":37,"url":"/task/multi-task-learning/papers/19","json":"/task/multi-task-learning/papers/19.json","rows":100},{"order":"archive","page":20,"of":37,"url":"/task/multi-task-learning/papers/20","json":"/task/multi-task-learning/papers/20.json","rows":100},{"order":"archive","page":21,"of":37,"url":"/task/multi-task-learning/papers/21","json":"/task/multi-task-learning/papers/21.json","rows":100},{"order":"archive","page":22,"of":37,"url":"/task/multi-task-learning/papers/22","json":"/task/multi-task-learning/papers/22.json","rows":100},{"order":"archive","page":23,"of":37,"url":"/task/multi-task-learning/papers/23","json":"/task/multi-task-learning/papers/23.json","rows":100},{"order":"archive","page":24,"of":37,"url":"/task/multi-task-learning/papers/24","json":"/task/multi-task-learning/papers/24.json","rows":100},{"order":"archive","page":25,"of":37,"url":"/task/multi-task-learning/papers/25","json":"/task/multi-task-learning/papers/25.json","rows":100},{"order":"archive","page":26,"of":37,"url":"/task/multi-task-learning/papers/26","json":"/task/multi-task-learning/papers/26.json","rows":100},{"order":"archive","page":27,"of":37,"url":"/task/multi-task-learning/papers/27","json":"/task/multi-task-learning/papers/27.json","rows":100},{"order":"archive","page":28,"of":37,"url":"/task/multi-task-learning/papers/28","json":"/task/multi-task-learning/papers/28.json","rows":100},{"order":"archive","page":29,"of":37,"url":"/task/multi-task-learning/papers/29","json":"/task/multi-task-learning/papers/29.json","rows":100},{"order":"archive","page":30,"of":37,"url":"/task/multi-task-learning/papers/30","json":"/task/multi-task-learning/papers/30.json","rows":100},{"order":"archive","page":31,"of":37,"url":"/task/multi-task-learning/papers/31","json":"/task/multi-task-learning/papers/31.json","rows":100},{"order":"archive","page":32,"of":37,"url":"/task/multi-task-learning/papers/32","json":"/task/multi-task-learning/papers/32.json","rows":100},{"order":"archive","page":33,"of":37,"url":"/task/multi-task-learning/papers/33","json":"/task/multi-task-learning/papers/33.json","rows":100},{"order":"archive","page":34,"of":37,"url":"/task/multi-task-learning/papers/34","json":"/task/multi-task-learning/papers/34.json","rows":100},{"order":"archive","page":35,"of":37,"url":"/task/multi-task-learning/papers/35","json":"/task/multi-task-learning/papers/35.json","rows":100},{"order":"archive","page":36,"of":37,"url":"/task/multi-task-learning/papers/36","json":"/task/multi-task-learning/papers/36.json","rows":100},{"order":"archive","page":37,"of":37,"url":"/task/multi-task-learning/papers/37","json":"/task/multi-task-learning/papers/37.json","rows":87},{"order":"ran","page":1,"of":3,"url":"/task/multi-task-learning/papers/ran/1","json":"/task/multi-task-learning/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":3,"url":"/task/multi-task-learning/papers/ran/2","json":"/task/multi-task-learning/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":3,"url":"/task/multi-task-learning/papers/ran/3","json":"/task/multi-task-learning/papers/ran/3.json","rows":60}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"5f10b189634c96377f253c8c6def03519f989e75d9268300f998b818cd79d87a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}