{"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/structured-prediction/papers/ran/1","list_of":"/task/structured-prediction","task":"Structured Prediction","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":1,"rows_per_page":100,"rows":[1,43],"of":43,"counts":{"archive_papers_tagged":639,"with_a_code_link":195,"where_syntology_ran_a_sample":43,"not_listed_spam_title":0,"listed":639,"listed_where_code_ran":43,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":9,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":9,"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/structured-prediction/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/conformal-structured-prediction","slug":"conformal-structured-prediction","title":"Conformal Structured Prediction","date":"2024-10-08","arxiv_id":"2410.06296","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"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) · 2 unverified","sample_list":"/paper/conformal-structured-prediction#ran","syntology_url":"https://syntology.ai/paper/2410.06296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06296"}},"official":{"repos":["botong516/conformal_structured_prediction"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/promptly-predicting-structures-the-return-of","slug":"promptly-predicting-structures-the-return-of","title":"Promptly Predicting Structures: The Return of Inference","date":"2024-01-12","arxiv_id":"2401.06877","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/promptly-predicting-structures-the-return-of#ran","syntology_url":"https://syntology.ai/paper/2401.06877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.06877"}},"official":{"repos":["utahnlp/prompts-for-structures"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unified-low-resource-sequence-labeling-by","slug":"unified-low-resource-sequence-labeling-by","title":"Unified Low-Resource Sequence Labeling by Sample-Aware Dynamic Sparse Finetuning","date":"2023-11-07","arxiv_id":"2311.03748","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":3,"phrase":"11 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unified-low-resource-sequence-labeling-by#ran","syntology_url":"https://syntology.ai/paper/2311.03748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03748"}},"official":{"repos":["psunlpgroup/fish-dip"],"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":["official"]}}},{"url":"/paper/contextual-label-projection-for-cross-lingual","slug":"contextual-label-projection-for-cross-lingual","title":"Contextual Label Projection for Cross-Lingual Structured Prediction","date":"2023-09-16","arxiv_id":"2309.08943","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":15,"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) · 5 unverified","sample_list":"/paper/contextual-label-projection-for-cross-lingual#ran","syntology_url":"https://syntology.ai/paper/2309.08943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.08943"}},"official":{"repos":["pluslabnlp/clap"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/speech-structured-prediction-with-energy","slug":"speech-structured-prediction-with-energy","title":"SPEECH: Structured Prediction with Energy-Based Event-Centric Hyperspheres","date":"2023-05-23","arxiv_id":"2305.13617","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 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; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/speech-structured-prediction-with-energy#ran","syntology_url":"https://syntology.ai/paper/2305.13617","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.13617"}},"official":{"repos":["zjunlp/speech"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-graph-is-more-than-its-nodes-towards","slug":"a-graph-is-more-than-its-nodes-towards","title":"A Graph Is More Than Its Nodes: Towards Structured Uncertainty-Aware Learning on Graphs","date":"2022-10-27","arxiv_id":"2210.15575","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 3 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) · 1 unverified","sample_list":"/paper/a-graph-is-more-than-its-nodes-towards#ran","syntology_url":"https://syntology.ai/paper/2210.15575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15575"}},"official":{"repos":["hans66hsu/structured_uncertainty_metrics"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-structured-prediction-for-inductive-1","slug":"neural-structured-prediction-for-inductive-1","title":"Neural Structured Prediction for Inductive Node Classification","date":"2022-04-15","arxiv_id":"2204.07524","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/neural-structured-prediction-for-inductive-1#ran","syntology_url":"https://syntology.ai/paper/2204.07524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07524"}},"official":{"repos":["deepgraphlearning/spn"],"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/crossbeam-learning-to-search-in-bottom-up-1","slug":"crossbeam-learning-to-search-in-bottom-up-1","title":"CrossBeam: Learning to Search in Bottom-Up Program Synthesis","date":"2022-03-20","arxiv_id":"2203.10452","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/crossbeam-learning-to-search-in-bottom-up-1#ran","syntology_url":"https://syntology.ai/paper/2203.10452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10452"}},"official":{"repos":["google-research/crossbeam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/neuraltailor-reconstructing-sewing-pattern","slug":"neuraltailor-reconstructing-sewing-pattern","title":"NeuralTailor: Reconstructing Sewing Pattern Structures from 3D Point Clouds of Garments","date":"2022-01-31","arxiv_id":"2201.13063","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":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/neuraltailor-reconstructing-sewing-pattern#ran","syntology_url":"https://syntology.ai/paper/2201.13063","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.13063"}},"official":{"repos":["maria-korosteleva/Garment-Pattern-Estimation"],"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/event-extraction-as-natural-language","slug":"event-extraction-as-natural-language","title":"DEGREE: A Data-Efficient Generation-Based Event Extraction Model","date":"2021-08-29","arxiv_id":"2108.12724","repositories_listed":2,"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/event-extraction-as-natural-language#ran","syntology_url":"https://syntology.ai/paper/2108.12724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12724"}},"official":{"repos":["pluslabnlp/degree"],"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/shifts-a-dataset-of-real-distributional-shift","slug":"shifts-a-dataset-of-real-distributional-shift","title":"Shifts: A Dataset of Real Distributional Shift Across Multiple Large-Scale Tasks","date":"2021-07-15","arxiv_id":"2107.07455","repositories_listed":3,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/shifts-a-dataset-of-real-distributional-shift#ran","syntology_url":"https://syntology.ai/paper/2107.07455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.07455"}},"official":{"repos":["yandex-research/shifts"],"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/very-deep-graph-neural-networks-via-noise","slug":"very-deep-graph-neural-networks-via-noise","title":"Simple GNN Regularisation for 3D Molecular Property Prediction & Beyond","date":"2021-06-15","arxiv_id":"2106.07971","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/very-deep-graph-neural-networks-via-noise#ran","syntology_url":"https://syntology.ai/paper/2106.07971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07971"}},"official":null}},{"url":"/paper/improving-pretrained-cross-lingual-language","slug":"improving-pretrained-cross-lingual-language","title":"Improving Pretrained Cross-Lingual Language Models via Self-Labeled Word Alignment","date":"2021-06-11","arxiv_id":"2106.06381","repositories_listed":1,"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":0,"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/improving-pretrained-cross-lingual-language#ran","syntology_url":"https://syntology.ai/paper/2106.06381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06381"}},"official":{"repos":["CZWin32768/XLM-Align"],"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/structured-convolutional-kernel-networks-for","slug":"structured-convolutional-kernel-networks-for","title":"Structured Convolutional Kernel Networks for Airline Crew Scheduling","date":"2021-05-25","arxiv_id":"2105.11646","repositories_listed":1,"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/structured-convolutional-kernel-networks-for#ran","syntology_url":"https://syntology.ai/paper/2105.11646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11646"}},"official":{"repos":["Yaakoubi/Struct-CKN"],"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"]}}},{"url":"/paper/a-frustratingly-easy-approach-for-joint","slug":"a-frustratingly-easy-approach-for-joint","title":"A Frustratingly Easy Approach for Entity and Relation Extraction","date":"2020-10-24","arxiv_id":"2010.12812","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-frustratingly-easy-approach-for-joint#ran","syntology_url":"https://syntology.ai/paper/2010.12812","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12812"}},"official":{"repos":["princeton-nlp/PURE"],"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/on-long-tailed-phenomena-in-neural-machine","slug":"on-long-tailed-phenomena-in-neural-machine","title":"On Long-Tailed Phenomena in Neural Machine Translation","date":"2020-10-10","arxiv_id":"2010.04924","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/on-long-tailed-phenomena-in-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2010.04924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04924"}},"official":{"repos":["vyraun/long-tailed"],"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/adversarial-attack-and-defense-of-structured","slug":"adversarial-attack-and-defense-of-structured","title":"Adversarial Attack and Defense of Structured Prediction Models","date":"2020-10-04","arxiv_id":"2010.01610","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/adversarial-attack-and-defense-of-structured#ran","syntology_url":"https://syntology.ai/paper/2010.01610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01610"}},"official":{"repos":["WinnieHAN/structure_adv"],"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/the-language-interpretability-tool-extensible","slug":"the-language-interpretability-tool-extensible","title":"The Language Interpretability Tool: Extensible, Interactive Visualizations and Analysis for NLP Models","date":"2020-08-12","arxiv_id":"2008.05122","repositories_listed":1,"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/the-language-interpretability-tool-extensible#ran","syntology_url":"https://syntology.ai/paper/2008.05122","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.05122"}},"official":{"repos":["PAIR-code/lit"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-stochastic-approximation-and-its","slug":"joint-stochastic-approximation-and-its","title":"Joint Stochastic Approximation and Its Application to Learning Discrete Latent Variable Models","date":"2020-05-28","arxiv_id":"2005.14001","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":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) · 1 unverified","sample_list":"/paper/joint-stochastic-approximation-and-its#ran","syntology_url":"https://syntology.ai/paper/2005.14001","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14001"}},"official":{"repos":["thu-spmi/JSA"],"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/structured-prediction-with-partial-labelling","slug":"structured-prediction-with-partial-labelling","title":"Structured Prediction with Partial Labelling through the Infimum Loss","date":"2020-03-02","arxiv_id":"2003.00920","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/structured-prediction-with-partial-labelling#ran","syntology_url":"https://syntology.ai/paper/2003.00920","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.00920"}},"official":{"repos":["VivienCabannes/infimum_loss","VivienCabannes/partial_labelling"],"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/sato-contextual-semantic-type-detection-in","slug":"sato-contextual-semantic-type-detection-in","title":"Sato: Contextual Semantic Type Detection in Tables","date":"2019-11-14","arxiv_id":"1911.06311","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":1,"n_no_contract":5,"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, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/sato-contextual-semantic-type-detection-in#ran","syntology_url":"https://syntology.ai/paper/1911.06311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06311"}},"official":{"repos":["megagonlabs/sato"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-prediction-with-projection-oracles","slug":"structured-prediction-with-projection-oracles","title":"Structured Prediction with Projection Oracles","date":"2019-10-24","arxiv_id":"1910.11369","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"10 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structured-prediction-with-projection-oracles#ran","syntology_url":"https://syntology.ai/paper/1910.11369","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11369"}},"official":{"repos":["mblondel/projection-losses"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-differentiable-cross-entropy-method-1","slug":"the-differentiable-cross-entropy-method-1","title":"The Differentiable Cross-Entropy Method","date":"2019-09-27","arxiv_id":"1909.12830","repositories_listed":1,"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/the-differentiable-cross-entropy-method-1#ran","syntology_url":"https://syntology.ai/paper/1909.12830","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.12830"}},"official":{"repos":["facebookresearch/dcem"],"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/label-agnostic-sequence-labeling-by-copying","slug":"label-agnostic-sequence-labeling-by-copying","title":"Label-Agnostic Sequence Labeling by Copying Nearest Neighbors","date":"2019-06-10","arxiv_id":"1906.04225","repositories_listed":1,"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":2,"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/label-agnostic-sequence-labeling-by-copying#ran","syntology_url":"https://syntology.ai/paper/1906.04225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.04225"}},"official":{"repos":["swiseman/neighbor-tagging"],"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"]}}},{"url":"/paper/structured-output-learning-with-conditional","slug":"structured-output-learning-with-conditional","title":"Structured Output Learning with Conditional Generative Flows","date":"2019-05-30","arxiv_id":"1905.13288","repositories_listed":2,"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/structured-output-learning-with-conditional#ran","syntology_url":"https://syntology.ai/paper/1905.13288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13288"}},"official":{"repos":["yolu1055/conditional-glow"],"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/on-the-use-of-arxiv-as-a-dataset","slug":"on-the-use-of-arxiv-as-a-dataset","title":"On the Use of ArXiv as a Dataset","date":"2019-04-30","arxiv_id":"1905.00075","repositories_listed":1,"syntology":{"n":19,"n_ran":15,"n_constructed":0,"n_ran_checked":15,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"15 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/on-the-use-of-arxiv-as-a-dataset#ran","syntology_url":"https://syntology.ai/paper/1905.00075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00075"}},"official":{"repos":["mattbierbaum/arxiv-public-datasets"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":15,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/structured-knowledge-distillation-for","slug":"structured-knowledge-distillation-for","title":"Structured Knowledge Distillation for Dense Prediction","date":"2019-03-11","arxiv_id":"1903.04197","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/structured-knowledge-distillation-for#ran","syntology_url":"https://syntology.ai/paper/1903.04197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.04197"}},"official":{"repos":["irfanICMLL/structure_knowledge_distillation"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/extracting-multiple-relations-in-one-pass","slug":"extracting-multiple-relations-in-one-pass","title":"Extracting Multiple-Relations in One-Pass with Pre-Trained Transformers","date":"2019-02-04","arxiv_id":"1902.01030","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":2,"n_honours":1,"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; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/extracting-multiple-relations-in-one-pass#ran","syntology_url":"https://syntology.ai/paper/1902.01030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01030"}},"official":{"repos":["helloeve/mre-in-one-pass"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reasoning-about-actions-and-state-changes-by","slug":"reasoning-about-actions-and-state-changes-by","title":"Reasoning about Actions and State Changes by Injecting Commonsense Knowledge","date":"2018-08-29","arxiv_id":"1808.10012","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":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) · 1 unverified","sample_list":"/paper/reasoning-about-actions-and-state-changes-by#ran","syntology_url":"https://syntology.ai/paper/1808.10012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10012"}},"official":{"repos":["allenai/propara"],"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/memory-augmented-policy-optimization-for","slug":"memory-augmented-policy-optimization-for","title":"Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing","date":"2018-07-06","arxiv_id":"1807.02322","repositories_listed":4,"syntology":{"n":15,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":8,"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) · 8 unverified","sample_list":"/paper/memory-augmented-policy-optimization-for#ran","syntology_url":"https://syntology.ai/paper/1807.02322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.02322"}},"official":{"repos":["crazydonkey200/neural-symbolic-machines"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-code-modeling-with-graphs","slug":"generative-code-modeling-with-graphs","title":"Generative Code Modeling with Graphs","date":"2018-05-22","arxiv_id":"1805.08490","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/generative-code-modeling-with-graphs#ran","syntology_url":"https://syntology.ai/paper/1805.08490","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08490"}},"official":{"repos":["Microsoft/graph-based-code-modelling"],"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/learning-approximate-inference-networks-for","slug":"learning-approximate-inference-networks-for","title":"Learning Approximate Inference Networks for Structured Prediction","date":"2018-03-09","arxiv_id":"1803.03376","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-approximate-inference-networks-for#ran","syntology_url":"https://syntology.ai/paper/1803.03376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03376"}},"official":null}},{"url":"/paper/augmented-cyclegan-learning-many-to-many","slug":"augmented-cyclegan-learning-many-to-many","title":"Augmented CycleGAN: Learning Many-to-Many Mappings from Unpaired Data","date":"2018-02-27","arxiv_id":"1802.10151","repositories_listed":3,"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/augmented-cyclegan-learning-many-to-many#ran","syntology_url":"https://syntology.ai/paper/1802.10151","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10151"}},"official":null}},{"url":"/paper/sparsemap-differentiable-sparse-structured","slug":"sparsemap-differentiable-sparse-structured","title":"SparseMAP: Differentiable Sparse Structured Inference","date":"2018-02-12","arxiv_id":"1802.04223","repositories_listed":3,"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/sparsemap-differentiable-sparse-structured#ran","syntology_url":"https://syntology.ai/paper/1802.04223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04223"}},"official":{"repos":["vene/sparsemap"],"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/deep-structured-energy-based-image-inpainting","slug":"deep-structured-energy-based-image-inpainting","title":"Deep Structured Energy-Based Image Inpainting","date":"2018-01-24","arxiv_id":"1801.07939","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":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/deep-structured-energy-based-image-inpainting#ran","syntology_url":"https://syntology.ai/paper/1801.07939","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.07939"}},"official":{"repos":["cvlab-tohoku/DSEBImageInpainting"],"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/vse-improving-visual-semantic-embeddings-with","slug":"vse-improving-visual-semantic-embeddings-with","title":"VSE++: Improving Visual-Semantic Embeddings with Hard Negatives","date":"2017-07-18","arxiv_id":"1707.05612","repositories_listed":10,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/vse-improving-visual-semantic-embeddings-with#ran","syntology_url":"https://syntology.ai/paper/1707.05612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.05612"}},"official":{"repos":["fartashf/vsepp"],"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/fast-and-accurate-entity-recognition-with","slug":"fast-and-accurate-entity-recognition-with","title":"Fast and Accurate Entity Recognition with Iterated Dilated Convolutions","date":"2017-02-07","arxiv_id":"1702.02098","repositories_listed":4,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":0,"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, 3 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-and-accurate-entity-recognition-with#ran","syntology_url":"https://syntology.ai/paper/1702.02098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02098"}},"official":{"repos":["iesl/dilated-cnn-ner"],"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/log-time-and-log-space-extreme-classification","slug":"log-time-and-log-space-extreme-classification","title":"Log-time and Log-space Extreme Classification","date":"2016-11-07","arxiv_id":"1611.01964","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/log-time-and-log-space-extreme-classification#ran","syntology_url":"https://syntology.ai/paper/1611.01964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01964"}},"official":null}},{"url":"/paper/the-concrete-distribution-a-continuous","slug":"the-concrete-distribution-a-continuous","title":"The Concrete Distribution: A Continuous Relaxation of Discrete Random Variables","date":"2016-11-02","arxiv_id":"1611.00712","repositories_listed":5,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/the-concrete-distribution-a-continuous#ran","syntology_url":"https://syntology.ai/paper/1611.00712","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.00712"}},"official":null}},{"url":"/paper/input-convex-neural-networks","slug":"input-convex-neural-networks","title":"Input Convex Neural Networks","date":"2016-09-22","arxiv_id":"1609.07152","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/input-convex-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1609.07152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.07152"}},"official":{"repos":["locuslab/icnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-structured-prediction-under-bandit","slug":"stochastic-structured-prediction-under-bandit","title":"Stochastic Structured Prediction under Bandit Feedback","date":"2016-06-02","arxiv_id":"1606.00739","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/stochastic-structured-prediction-under-bandit#ran","syntology_url":"https://syntology.ai/paper/1606.00739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.00739"}},"official":null}},{"url":"/paper/end-to-end-instance-segmentation-with","slug":"end-to-end-instance-segmentation-with","title":"End-to-End Instance Segmentation with Recurrent Attention","date":"2016-05-30","arxiv_id":"1605.09410","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/end-to-end-instance-segmentation-with#ran","syntology_url":"https://syntology.ai/paper/1605.09410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.09410"}},"official":null}},{"url":"/paper/convolutional-pose-machines","slug":"convolutional-pose-machines","title":"Convolutional Pose Machines","date":"2016-01-30","arxiv_id":"1602.00134","repositories_listed":50,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 3 unverified","sample_list":"/paper/convolutional-pose-machines#ran","syntology_url":"https://syntology.ai/paper/1602.00134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.00134"}},"official":{"repos":["CMU-Perceptual-Computing-Lab/convolutional-pose-machines-release"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"bee74494665af73667ca65af5bec73dcf4a6ac22e52b323d156b73ecaa2b40b9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}