{"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","name":"Structured Prediction","slug":"structured-prediction","description_markdown":"**Structured Prediction** is an area of machine learning focusing on representations of spaces with combinatorial structure, and algorithms for inference and parameter estimation over these structures. Core methods include both tractable exact approaches like dynamic programming and spanning tree algorithms as well as heuristic techniques such as linear programming relaxations and greedy search.\n\n\n<span class=\"description-source\">Source: [Torch-Struct: Deep Structured Prediction Library ](https://arxiv.org/abs/2002.00876)</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":639,"papers_with_code":195,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":6,"subtasks":0,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/structured-prediction-on-mnist","slug":"structured-prediction-on-mnist","dataset":"MNIST","dataset_url":"/dataset/mnist","rows_in_archive":1,"metrics":["Negative CLL"],"first_row_in_archive_order":{"model":"CVAE","paper_title":"Learning Structured Output Representation using Deep Conditional Generative Models","paper_url":"/paper/learning-structured-output-representation","paper_date":"2015-12-01","arxiv_id":null,"code_links":[{"title":"ucals/cvae","url":"https://github.com/ucals/cvae"}],"syntology":null}}],"datasets":[{"url":"/dataset/mnist","name":"MNIST","full_name":"","num_papers_in_archive":7651},{"url":"/dataset/listops","name":"ListOps","full_name":"ListOps","num_papers_in_archive":97},{"url":"/dataset/cfq","name":"CFQ","full_name":"Compositional Freebase Questions","num_papers_in_archive":66},{"url":"/dataset/scirex","name":"SciREX","full_name":"SciREX","num_papers_in_archive":33},{"url":"/dataset/wbm","name":"WBM","full_name":"Predicting stable crystalline compounds using chemical similarity","num_papers_in_archive":1},{"url":"/dataset/wikiog","name":"WIKIOG","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"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":7,"rows_per_page":100,"shown":100,"of":639,"of_with_code":195,"tagged_in_all":639,"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"},"items":[{"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"]}}},{"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/neural-networks-for-joint-sentence","slug":"neural-networks-for-joint-sentence","title":"Neural Networks for Joint Sentence Classification in Medical Paper Abstracts","date":"2016-12-15","arxiv_id":"1612.05251","repositories_listed":5,"syntology":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/reseg-a-recurrent-neural-network-based-model","slug":"reseg-a-recurrent-neural-network-based-model","title":"ReSeg: A Recurrent Neural Network-based Model for Semantic Segmentation","date":"2015-11-22","arxiv_id":"1511.07053","repositories_listed":5,"syntology":null},{"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/thinking-fast-and-slow-with-deep-learning-and","slug":"thinking-fast-and-slow-with-deep-learning-and","title":"Thinking Fast and Slow with Deep Learning and Tree Search","date":"2017-05-23","arxiv_id":"1705.08439","repositories_listed":4,"syntology":null},{"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/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/learning-with-differentiable-perturbed","slug":"learning-with-differentiable-perturbed","title":"Learning with Differentiable Perturbed Optimizers","date":"2020-02-20","arxiv_id":"2002.08676","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/learning-with-fenchel-young-losses","slug":"learning-with-fenchel-young-losses","title":"Learning with Fenchel-Young Losses","date":"2019-01-08","arxiv_id":"1901.02324","repositories_listed":3,"syntology":null},{"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/men-also-like-shopping-reducing-gender-bias","slug":"men-also-like-shopping-reducing-gender-bias","title":"Men Also Like Shopping: Reducing Gender Bias Amplification using Corpus-level Constraints","date":"2017-07-29","arxiv_id":"1707.09457","repositories_listed":3,"syntology":null},{"url":"/paper/deep-functional-maps-structured-prediction","slug":"deep-functional-maps-structured-prediction","title":"Deep Functional Maps: Structured Prediction for Dense Shape Correspondence","date":"2017-04-27","arxiv_id":"1704.08686","repositories_listed":3,"syntology":null},{"url":"/paper/frank-wolfe-algorithms-for-saddle-point","slug":"frank-wolfe-algorithms-for-saddle-point","title":"Frank-Wolfe Algorithms for Saddle Point Problems","date":"2016-10-25","arxiv_id":"1610.07797","repositories_listed":3,"syntology":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/deep-metric-learning-via-lifted-structured","slug":"deep-metric-learning-via-lifted-structured","title":"Deep Metric Learning via Lifted Structured Feature Embedding","date":"2015-11-19","arxiv_id":"1511.06452","repositories_listed":3,"syntology":null},{"url":"/paper/a-reduction-of-imitation-learning-and","slug":"a-reduction-of-imitation-learning-and","title":"A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning","date":"2010-11-02","arxiv_id":"1011.0686","repositories_listed":3,"syntology":null},{"url":"/paper/structured-prediction-problem-archive","slug":"structured-prediction-problem-archive","title":"Structured Prediction Problem Archive","date":"2022-02-04","arxiv_id":"2202.03574","repositories_listed":2,"syntology":null},{"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/structured-prediction-as-translation-between-1","slug":"structured-prediction-as-translation-between-1","title":"Structured Prediction as Translation between Augmented Natural Languages","date":"2021-01-14","arxiv_id":"2101.05779","repositories_listed":2,"syntology":null},{"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/automated-concatenation-of-embeddings-for-1","slug":"automated-concatenation-of-embeddings-for-1","title":"Automated Concatenation of Embeddings for Structured Prediction","date":"2020-10-10","arxiv_id":"2010.05006","repositories_listed":2,"syntology":null},{"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/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/a-fast-and-scalable-joint-estimator-for-1","slug":"a-fast-and-scalable-joint-estimator-for-1","title":"A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models","date":"2018-06-01","arxiv_id":"1806.00548","repositories_listed":2,"syntology":null},{"url":"/paper/experiment-segmentation-in-scientific","slug":"experiment-segmentation-in-scientific","title":"Experiment Segmentation in Scientific Discourse as Clause-level Structured Prediction using Recurrent Neural Networks","date":"2017-02-17","arxiv_id":"1702.05398","repositories_listed":2,"syntology":null},{"url":"/paper/commonly-uncommon-semantic-sparsity-in","slug":"commonly-uncommon-semantic-sparsity-in","title":"Commonly Uncommon: Semantic Sparsity in Situation Recognition","date":"2016-12-03","arxiv_id":"1612.00901","repositories_listed":2,"syntology":null},{"url":"/paper/neural-symbolic-machines-learning-semantic-1","slug":"neural-symbolic-machines-learning-semantic-1","title":"Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision","date":"2016-10-31","arxiv_id":"1611.00020","repositories_listed":2,"syntology":null},{"url":"/paper/a-probabilistic-generative-grammar-for","slug":"a-probabilistic-generative-grammar-for","title":"A Probabilistic Generative Grammar for Semantic Parsing","date":"2016-06-20","arxiv_id":"1606.06361","repositories_listed":2,"syntology":null},{"url":"/paper/learning-identifiable-structures-helps-avoid","slug":"learning-identifiable-structures-helps-avoid","title":"Learning Identifiable Structures Helps Avoid Bias in DNN-based Supervised Causal Learning","date":"2025-02-15","arxiv_id":"2502.10883","repositories_listed":1,"syntology":null},{"url":"/paper/meaning-typed-prompting-a-technique-for","slug":"meaning-typed-prompting-a-technique-for","title":"Meaning Typed Prompting: A Technique for Efficient, Reliable Structured Output Generation","date":"2024-10-22","arxiv_id":"2410.18146","repositories_listed":1,"syntology":null},{"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":5,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 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":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-sketched-output-kernel-regression-for","slug":"deep-sketched-output-kernel-regression-for","title":"Deep Sketched Output Kernel Regression for Structured Prediction","date":"2024-06-13","arxiv_id":"2406.09253","repositories_listed":1,"syntology":null},{"url":"/paper/to-be-continuous-or-to-be-discrete-those-are","slug":"to-be-continuous-or-to-be-discrete-those-are","title":"To be Continuous, or to be Discrete, Those are Bits of Questions","date":"2024-06-12","arxiv_id":"2406.07812","repositories_listed":1,"syntology":null},{"url":"/paper/cf-opt-counterfactual-explanations-for","slug":"cf-opt-counterfactual-explanations-for","title":"CF-OPT: Counterfactual Explanations for Structured Prediction","date":"2024-05-28","arxiv_id":"2405.18293","repositories_listed":1,"syntology":null},{"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":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 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; 2 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":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lazy-k-decoding-for-constrained-token","slug":"lazy-k-decoding-for-constrained-token","title":"Lazy-k: Decoding for Constrained Token Classification","date":"2023-12-06","arxiv_id":"2312.03367","repositories_listed":1,"syntology":null},{"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/spel-structured-prediction-for-entity-linking","slug":"spel-structured-prediction-for-entity-linking","title":"SpEL: Structured Prediction for Entity Linking","date":"2023-10-23","arxiv_id":"2310.14684","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-view-of-evaluation-metrics-for","slug":"a-unified-view-of-evaluation-metrics-for","title":"A Unified View of Evaluation Metrics for Structured Prediction","date":"2023-10-20","arxiv_id":"2310.13793","repositories_listed":1,"syntology":null},{"url":"/paper/an-expression-tree-decoding-strategy-for","slug":"an-expression-tree-decoding-strategy-for","title":"An Expression Tree Decoding Strategy for Mathematical Equation Generation","date":"2023-10-14","arxiv_id":"2310.09619","repositories_listed":1,"syntology":null},{"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/data-efficient-active-learning-for-structured","slug":"data-efficient-active-learning-for-structured","title":"Data-efficient Active Learning for Structured Prediction with Partial Annotation and Self-Training","date":"2023-05-22","arxiv_id":"2305.12634","repositories_listed":1,"syntology":null},{"url":"/paper/mvp-multi-view-prompting-improves-aspect","slug":"mvp-multi-view-prompting-improves-aspect","title":"MvP: Multi-view Prompting Improves Aspect Sentiment Tuple Prediction","date":"2023-05-22","arxiv_id":"2305.12627","repositories_listed":1,"syntology":null},{"url":"/paper/rxnscribe-a-sequence-generation-model-for","slug":"rxnscribe-a-sequence-generation-model-for","title":"RxnScribe: A Sequence Generation Model for Reaction Diagram Parsing","date":"2023-05-19","arxiv_id":"2305.11845","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-soft-prompts-for-controllable-data","slug":"mixture-of-soft-prompts-for-controllable-data","title":"Mixture of Soft Prompts for Controllable Data Generation","date":"2023-03-02","arxiv_id":"2303.01580","repositories_listed":1,"syntology":null},{"url":"/paper/sketch-in-sketch-out-accelerating-both","slug":"sketch-in-sketch-out-accelerating-both","title":"Sketch In, Sketch Out: Accelerating both Learning and Inference for Structured Prediction with Kernels","date":"2023-02-20","arxiv_id":"2302.10128","repositories_listed":1,"syntology":null},{"url":"/paper/pac-prediction-sets-for-large-language-models","slug":"pac-prediction-sets-for-large-language-models","title":"PAC Prediction Sets for Large Language Models of Code","date":"2023-02-17","arxiv_id":"2302.08703","repositories_listed":1,"syntology":null},{"url":"/paper/diverse-probabilistic-trajectory-forecasting","slug":"diverse-probabilistic-trajectory-forecasting","title":"Diverse Probabilistic Trajectory Forecasting with Admissibility Constraints","date":"2023-02-07","arxiv_id":"2302.03462","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-the-dots-floorplan-reconstruction","slug":"connecting-the-dots-floorplan-reconstruction","title":"Connecting the Dots: Floorplan Reconstruction Using Two-Level Queries","date":"2022-11-28","arxiv_id":"2211.15658","repositories_listed":1,"syntology":null},{"url":"/paper/lifting-weak-supervision-to-structured","slug":"lifting-weak-supervision-to-structured","title":"Lifting Weak Supervision To Structured Prediction","date":"2022-11-24","arxiv_id":"2211.13375","repositories_listed":1,"syntology":null},{"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/autoregressive-structured-prediction-with","slug":"autoregressive-structured-prediction-with","title":"Autoregressive Structured Prediction with Language Models","date":"2022-10-26","arxiv_id":"2210.14698","repositories_listed":1,"syntology":null},{"url":"/paper/code4struct-code-generation-for-few-shot","slug":"code4struct-code-generation-for-few-shot","title":"Code4Struct: Code Generation for Few-Shot Event Structure Prediction","date":"2022-10-23","arxiv_id":"2210.12810","repositories_listed":1,"syntology":null},{"url":"/paper/evidence-intuition-transferability-estimation","slug":"evidence-intuition-transferability-estimation","title":"Evidence > Intuition: Transferability Estimation for Encoder Selection","date":"2022-10-20","arxiv_id":"2210.11255","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-of-active-learning-for-natural","slug":"a-survey-of-active-learning-for-natural","title":"A Survey of Active Learning for Natural Language Processing","date":"2022-10-18","arxiv_id":"2210.10109","repositories_listed":1,"syntology":null},{"url":"/paper/reducing-model-churn-stable-re-training-of","slug":"reducing-model-churn-stable-re-training-of","title":"Reducing Model Churn: Stable Re-training of Conversational Agents","date":"2022-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/coalescing-global-and-local-information-for","slug":"coalescing-global-and-local-information-for","title":"Coalescing Global and Local Information for Procedural Text Understanding","date":"2022-08-26","arxiv_id":"2208.12848","repositories_listed":1,"syntology":null},{"url":"/paper/doge-train-discrete-optimization-on-gpu-with","slug":"doge-train-discrete-optimization-on-gpu-with","title":"DOGE-Train: Discrete Optimization on GPU with End-to-end Training","date":"2022-05-23","arxiv_id":"2205.11638","repositories_listed":1,"syntology":null},{"url":"/paper/learning-constrained-structured-spaces-with","slug":"learning-constrained-structured-spaces-with","title":"Learning Constrained Structured Spaces with Application to Multi-Graph Matching","date":"2022-05-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/efficient-sub-structured-knowledge","slug":"efficient-sub-structured-knowledge","title":"Efficient Sub-structured Knowledge Distillation","date":"2022-03-09","arxiv_id":"2203.04825","repositories_listed":1,"syntology":null},{"url":"/paper/structured-multi-task-learning-for-molecular","slug":"structured-multi-task-learning-for-molecular","title":"Structured Multi-task Learning for Molecular Property Prediction","date":"2022-02-22","arxiv_id":"2203.04695","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 3 unverified","sample_list":"/paper/structured-multi-task-learning-for-molecular#ran","syntology_url":"https://syntology.ai/paper/2203.04695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.04695"}},"official":{"repos":["chao1224/sgnn-ebm"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"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/improving-scripts-with-a-memory-of-natural","slug":"improving-scripts-with-a-memory-of-natural","title":"Learning to Repair: Repairing model output errors after deployment using a dynamic memory of feedback","date":"2021-12-16","arxiv_id":"2112.09737","repositories_listed":1,"syntology":null},{"url":"/paper/interscript-a-dataset-for-interactive","slug":"interscript-a-dataset-for-interactive","title":"Interscript: A dataset for interactive learning of scripts through error feedback","date":"2021-12-15","arxiv_id":"2112.07867","repositories_listed":1,"syntology":null},{"url":"/paper/group-wise-learning-for-weakly-supervised","slug":"group-wise-learning-for-weakly-supervised","title":"Group-Wise Learning for Weakly Supervised Semantic Segmentation","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fastdog-fast-discrete-optimization-on-gpu","slug":"fastdog-fast-discrete-optimization-on-gpu","title":"FastDOG: Fast Discrete Optimization on GPU","date":"2021-11-19","arxiv_id":"2111.10270","repositories_listed":1,"syntology":null},{"url":"/paper/enct5-fine-tuning-t5-encoder-for-non","slug":"enct5-fine-tuning-t5-encoder-for-non","title":"EncT5: A Framework for Fine-tuning T5 as Non-autoregressive Models","date":"2021-10-16","arxiv_id":"2110.08426","repositories_listed":1,"syntology":null},{"url":"/paper/bottom-up-constituency-parsing-and-nested","slug":"bottom-up-constituency-parsing-and-nested","title":"Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks","date":"2021-10-11","arxiv_id":"2110.05419","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-cross-lingual-transfer-of","slug":"unsupervised-cross-lingual-transfer-of","title":"Unsupervised Cross-Lingual Transfer of Structured Predictors without Source Data","date":"2021-10-08","arxiv_id":"2110.03866","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-label-space-interactions-in-multi","slug":"modeling-label-space-interactions-in-multi","title":"Modeling Label Space Interactions in Multi-label Classification using Box Embeddings","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/towards-consistent-document-level-entity","slug":"towards-consistent-document-level-entity","title":"Towards Consistent Document-level Entity Linking: Joint Models for Entity Linking and Coreference Resolution","date":"2021-08-30","arxiv_id":"2108.13530","repositories_listed":1,"syntology":null},{"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/constraining-linear-chain-crfs-to-regular","slug":"constraining-linear-chain-crfs-to-regular","title":"Constraining Linear-chain CRFs to Regular Languages","date":"2021-06-14","arxiv_id":"2106.07306","repositories_listed":1,"syntology":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/supervised-neural-clustering-via-latent","slug":"supervised-neural-clustering-via-latent","title":"Supervised Neural Clustering via Latent Structured Output Learning: Application to Question Intents","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/flow-based-autoregressive-structured","slug":"flow-based-autoregressive-structured","title":"Flow-based Spatio-Temporal Structured Prediction of Motion Dynamics","date":"2021-04-09","arxiv_id":"2104.04391","repositories_listed":1,"syntology":null},{"url":"/paper/energy-based-learning-for-scene-graph","slug":"energy-based-learning-for-scene-graph","title":"Energy-Based Learning for Scene Graph Generation","date":"2021-03-03","arxiv_id":"2103.02221","repositories_listed":1,"syntology":null},{"url":"/paper/structured-prediction-for-crisp-inverse","slug":"structured-prediction-for-crisp-inverse","title":"Structured Prediction for CRiSP Inverse Kinematics Learning with Misspecified Robot Models","date":"2021-02-25","arxiv_id":"2102.12942","repositories_listed":1,"syntology":null},{"url":"/paper/assignment-space-based-multi-object-tracking","slug":"assignment-space-based-multi-object-tracking","title":"Assignment-Space-Based Multi-Object Tracking and Segmentation","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/group-wise-semantic-mining-for-weakly","slug":"group-wise-semantic-mining-for-weakly","title":"Group-Wise Semantic Mining for Weakly Supervised Semantic Segmentation","date":"2020-12-09","arxiv_id":"2012.05007","repositories_listed":1,"syntology":null},{"url":"/paper/a-pac-bayesian-perspective-on-structured","slug":"a-pac-bayesian-perspective-on-structured","title":"A PAC-Bayesian Perspective on Structured Prediction with Implicit Loss Embeddings","date":"2020-12-07","arxiv_id":"2012.03780","repositories_listed":1,"syntology":null},{"url":"/paper/reciprocal-supervised-learning-improves","slug":"reciprocal-supervised-learning-improves","title":"Reciprocal Supervised Learning Improves Neural Machine Translation","date":"2020-12-05","arxiv_id":"2012.02975","repositories_listed":1,"syntology":null},{"url":"/paper/supertagging-the-long-tail-with-tree","slug":"supertagging-the-long-tail-with-tree","title":"Supertagging the Long Tail with Tree-Structured Decoding of Complex Categories","date":"2020-12-02","arxiv_id":"2012.01285","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-exploration-of-local-ordering","slug":"an-empirical-exploration-of-local-ordering","title":"An Empirical Exploration of Local Ordering Pre-training for Structured Prediction","date":"2020-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deep-structured-prediction-for-facial-1","slug":"deep-structured-prediction-for-facial-1","title":"Deep Structured Prediction for Facial Landmark Detection","date":"2020-10-18","arxiv_id":"2010.09035","repositories_listed":1,"syntology":null},{"url":"/paper/an-empirical-investigation-of-beam-aware","slug":"an-empirical-investigation-of-beam-aware","title":"An Empirical Investigation of Beam-Aware Training in Supertagging","date":"2020-10-10","arxiv_id":"2010.04980","repositories_listed":1,"syntology":null},{"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/structural-knowledge-distillation-1","slug":"structural-knowledge-distillation-1","title":"Structural Knowledge Distillation: Tractably Distilling Information for Structured Predictor","date":"2020-10-10","arxiv_id":"2010.05010","repositories_listed":1,"syntology":null},{"url":"/paper/interactive-fiction-game-playing-as-multi","slug":"interactive-fiction-game-playing-as-multi","title":"Interactive Fiction Game Playing as Multi-Paragraph Reading Comprehension with Reinforcement Learning","date":"2020-10-05","arxiv_id":"2010.02386","repositories_listed":1,"syntology":null},{"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"]}}}],"syntology_records":30,"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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":43,"papers_where_code_ran_first_page":"/task/structured-prediction/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":7,"url":"/task/structured-prediction/papers/2","json":"/task/structured-prediction/papers/2.json","rows":100},{"order":"archive","page":3,"of":7,"url":"/task/structured-prediction/papers/3","json":"/task/structured-prediction/papers/3.json","rows":100},{"order":"archive","page":4,"of":7,"url":"/task/structured-prediction/papers/4","json":"/task/structured-prediction/papers/4.json","rows":100},{"order":"archive","page":5,"of":7,"url":"/task/structured-prediction/papers/5","json":"/task/structured-prediction/papers/5.json","rows":100},{"order":"archive","page":6,"of":7,"url":"/task/structured-prediction/papers/6","json":"/task/structured-prediction/papers/6.json","rows":100},{"order":"archive","page":7,"of":7,"url":"/task/structured-prediction/papers/7","json":"/task/structured-prediction/papers/7.json","rows":39},{"order":"ran","page":1,"of":1,"url":"/task/structured-prediction/papers/ran/1","json":"/task/structured-prediction/papers/ran/1.json","rows":43}],"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":"acf9bd9510cbe6574282ab6bbbea5b4c7b2609cebb8b1c625e52d69412c7e841","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}