{"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/2","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":7,"rows_per_page":100,"rows":[101,200],"of":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"},"first_page":"/task/structured-prediction","prev":"/task/structured-prediction","next":"/task/structured-prediction/papers/3","papers":[{"url":"/paper/learning-randomly-perturbed-structured","slug":"learning-randomly-perturbed-structured","title":"Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization","date":"2020-07-11","arxiv_id":"2007.05724","repositories_listed":1,"syntology":null},{"url":"/paper/consistent-structured-prediction-with-max-min","slug":"consistent-structured-prediction-with-max-min","title":"Consistent Structured Prediction with Max-Min Margin Markov Networks","date":"2020-07-02","arxiv_id":"2007.01012","repositories_listed":1,"syntology":null},{"url":"/paper/torch-struct-deep-structured-prediction-1","slug":"torch-struct-deep-structured-prediction-1","title":"Torch-Struct: Deep Structured Prediction Library","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/active-imitation-learning-with-noisy-guidance","slug":"active-imitation-learning-with-noisy-guidance","title":"Active Imitation Learning with Noisy Guidance","date":"2020-05-26","arxiv_id":"2005.12801","repositories_listed":1,"syntology":null},{"url":"/paper/learning-constraints-for-structured","slug":"learning-constraints-for-structured","title":"Learning Constraints for Structured Prediction Using Rectifier Networks","date":"2020-05-23","arxiv_id":"2006.01209","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-constraints-for-structured#ran","syntology_url":"https://syntology.ai/paper/2006.01209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.01209"}},"official":{"repos":["utahnlp/learning-constraints"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/the-structured-weighted-violations-mira","slug":"the-structured-weighted-violations-mira","title":"The Structured Weighted Violations MIRA","date":"2020-05-09","arxiv_id":"2005.04418","repositories_listed":1,"syntology":null},{"url":"/paper/structpool-structured-graph-pooling-via","slug":"structpool-structured-graph-pooling-via","title":"StructPool: Structured Graph Pooling via Conditional Random Fields","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/instance-based-learning-of-span","slug":"instance-based-learning-of-span","title":"Instance-Based Learning of Span Representations: A Case Study through Named Entity Recognition","date":"2020-04-29","arxiv_id":"2004.14514","repositories_listed":1,"syntology":null},{"url":"/paper/differential-network-learning-beyond-data","slug":"differential-network-learning-beyond-data","title":"Beyond Data Samples: Aligning Differential Networks Estimation with Scientific Knowledge","date":"2020-04-24","arxiv_id":"2004.11494","repositories_listed":1,"syntology":null},{"url":"/paper/a-structured-prediction-approach-for-2","slug":"a-structured-prediction-approach-for-2","title":"Structured Prediction for Conditional Meta-Learning","date":"2020-02-20","arxiv_id":"2002.08799","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-in-structured-prediction","slug":"uncertainty-in-structured-prediction","title":"Uncertainty Estimation in Autoregressive Structured Prediction","date":"2020-02-18","arxiv_id":"2002.07650","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-discrepancy-between-density-estimation","slug":"on-the-discrepancy-between-density-estimation","title":"On the Discrepancy between Density Estimation and Sequence Generation","date":"2020-02-17","arxiv_id":"2002.07233","repositories_listed":1,"syntology":null},{"url":"/paper/estimating-gradients-for-discrete-random-1","slug":"estimating-gradients-for-discrete-random-1","title":"Estimating Gradients for Discrete Random Variables by Sampling without Replacement","date":"2020-02-14","arxiv_id":"2002.06043","repositories_listed":1,"syntology":null},{"url":"/paper/torch-struct-deep-structured-prediction","slug":"torch-struct-deep-structured-prediction","title":"Torch-Struct: Deep Structured Prediction Library","date":"2020-02-03","arxiv_id":"2002.00876","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/torch-struct-deep-structured-prediction#ran","syntology_url":"https://syntology.ai/paper/2002.00876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.00876"}},"official":{"repos":["harvardnlp/pytorch-struct"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/sequence-labeling-approach-to-the-task-of","slug":"sequence-labeling-approach-to-the-task-of","title":"Sequence Labeling Approach to the Task of Sentence Boundary Detection","date":"2020-01-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lp-sparsemap-differentiable-relaxed","slug":"lp-sparsemap-differentiable-relaxed","title":"LP-SparseMAP: Differentiable Relaxed Optimization for Sparse Structured Prediction","date":"2020-01-13","arxiv_id":"2001.04437","repositories_listed":1,"syntology":null},{"url":"/paper/learning-likelihoods-with-conditional-1","slug":"learning-likelihoods-with-conditional-1","title":"Learning Likelihoods with Conditional Normalizing Flows","date":"2019-11-29","arxiv_id":"1912.00042","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-domain-adaptation-via-structured","slug":"unsupervised-domain-adaptation-via-structured","title":"Unsupervised Domain Adaptation via Structured Prediction Based Selective Pseudo-Labeling","date":"2019-11-18","arxiv_id":"1911.07982","repositories_listed":1,"syntology":null},{"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/graph-to-graph-transformer-for-transition","slug":"graph-to-graph-transformer-for-transition","title":"Graph-to-Graph Transformer for Transition-based Dependency Parsing","date":"2019-11-08","arxiv_id":"1911.03561","repositories_listed":1,"syntology":null},{"url":"/paper/co-generation-with-gans-using-ais-based-hmc","slug":"co-generation-with-gans-using-ais-based-hmc","title":"Co-Generation with GANs using AIS based HMC","date":"2019-10-31","arxiv_id":"1910.14673","repositories_listed":1,"syntology":null},{"url":"/paper/graph-structured-prediction-energy-networks","slug":"graph-structured-prediction-energy-networks","title":"Graph Structured Prediction Energy Networks","date":"2019-10-31","arxiv_id":"1910.14670","repositories_listed":1,"syntology":null},{"url":"/paper/drvot-measuring-positive-and-negative-voice","slug":"drvot-measuring-positive-and-negative-voice","title":"Dr.VOT : Measuring Positive and Negative Voice Onset Time in the Wild","date":"2019-10-27","arxiv_id":"1910.13255","repositories_listed":1,"syntology":null},{"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/structured-prediction-helps-3d-human-motion","slug":"structured-prediction-helps-3d-human-motion","title":"Structured Prediction Helps 3D Human Motion Modelling","date":"2019-10-20","arxiv_id":"1910.09070","repositories_listed":1,"syntology":null},{"url":"/paper/a-structured-prediction-approach-for","slug":"a-structured-prediction-approach-for","title":"A Structured Prediction Approach for Generalization in Cooperative Multi-Agent Reinforcement Learning","date":"2019-10-19","arxiv_id":"1910.08809","repositories_listed":1,"syntology":null},{"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/phrase-grounding-by-soft-label-chain","slug":"phrase-grounding-by-soft-label-chain","title":"Phrase Grounding by Soft-Label Chain Conditional Random Field","date":"2019-09-01","arxiv_id":"1909.00301","repositories_listed":1,"syntology":null},{"url":"/paper/um-adapt-unsupervised-multi-task-adaptation","slug":"um-adapt-unsupervised-multi-task-adaptation","title":"UM-Adapt: Unsupervised Multi-Task Adaptation Using Adversarial Cross-Task Distillation","date":"2019-08-11","arxiv_id":"1908.03884","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-relation-between-code-features","slug":"learning-the-relation-between-code-features","title":"Learning the Relation between Code Features and Code Transforms with Structured Prediction","date":"2019-07-22","arxiv_id":"1907.09282","repositories_listed":1,"syntology":null},{"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-knowledge-distillation-for-1","slug":"structured-knowledge-distillation-for-1","title":"Structured Knowledge Distillation for Semantic Segmentation","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/benchmarking-approximate-inference-methods","slug":"benchmarking-approximate-inference-methods","title":"Benchmarking Approximate Inference Methods for Neural Structured Prediction","date":"2019-04-01","arxiv_id":"1904.01138","repositories_listed":1,"syntology":null},{"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/a-smoother-way-to-train-structured-prediction","slug":"a-smoother-way-to-train-structured-prediction","title":"A Smoother Way to Train Structured Prediction Models","date":"2019-02-08","arxiv_id":"1902.03228","repositories_listed":1,"syntology":null},{"url":"/paper/learning-hierarchical-interactions-at-scale-a","slug":"learning-hierarchical-interactions-at-scale-a","title":"Learning Hierarchical Interactions at Scale: A Convex Optimization Approach","date":"2019-02-05","arxiv_id":"1902.01542","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/learning-hierarchical-interactions-at-scale-a#ran","syntology_url":"https://syntology.ai/paper/1902.01542","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.01542"}},"official":null}},{"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/deep-structured-prediction-with-nonlinear","slug":"deep-structured-prediction-with-nonlinear","title":"Deep Structured Prediction with Nonlinear Output Transformations","date":"2018-11-01","arxiv_id":"1811.00539","repositories_listed":1,"syntology":null},{"url":"/paper/feasible-annotation-scheme-for-capturing","slug":"feasible-annotation-scheme-for-capturing","title":"Feasible Annotation Scheme for Capturing Policy Argument Reasoning using Argument Templates","date":"2018-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-beam-search-policies-via-imitation","slug":"learning-beam-search-policies-via-imitation","title":"Learning Beam Search Policies via Imitation Learning","date":"2018-11-01","arxiv_id":"1811.00512","repositories_listed":1,"syntology":null},{"url":"/paper/deep-adversarial-training-for-multi-organ","slug":"deep-adversarial-training-for-multi-organ","title":"Deep Adversarial Training for Multi-Organ Nuclei Segmentation in Histopathology Images","date":"2018-09-29","arxiv_id":"1810.00236","repositories_listed":1,"syntology":null},{"url":"/paper/free-as-in-free-word-order-an-energy-based","slug":"free-as-in-free-word-order-an-energy-based","title":"Free as in Free Word Order: An Energy Based Model for Word Segmentation and Morphological Tagging in Sanskrit","date":"2018-09-05","arxiv_id":"1809.01446","repositories_listed":1,"syntology":null},{"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/hierarchical-neural-networks-for-sequential","slug":"hierarchical-neural-networks-for-sequential","title":"Hierarchical Neural Networks for Sequential Sentence Classification in Medical Scientific Abstracts","date":"2018-08-19","arxiv_id":"1808.06161","repositories_listed":1,"syntology":null},{"url":"/paper/a-structured-prediction-approach-for-label","slug":"a-structured-prediction-approach-for-label","title":"A Structured Prediction Approach for Label Ranking","date":"2018-07-06","arxiv_id":"1807.02374","repositories_listed":1,"syntology":null},{"url":"/paper/distilling-knowledge-for-search-based","slug":"distilling-knowledge-for-search-based","title":"Distilling Knowledge for Search-based Structured Prediction","date":"2018-05-29","arxiv_id":"1805.11224","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-constraint-learning-for","slug":"adversarial-constraint-learning-for","title":"Adversarial Constraint Learning for Structured Prediction","date":"2018-05-27","arxiv_id":"1805.10561","repositories_listed":1,"syntology":null},{"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/adversarial-structure-matching-loss-for-image","slug":"adversarial-structure-matching-loss-for-image","title":"Adversarial Structure Matching for Structured Prediction Tasks","date":"2018-05-18","arxiv_id":"1805.07457","repositories_listed":1,"syntology":null},{"url":"/paper/mapping-images-to-scene-graphs-with","slug":"mapping-images-to-scene-graphs-with","title":"Mapping Images to Scene Graphs with Permutation-Invariant Structured Prediction","date":"2018-02-15","arxiv_id":"1802.05451","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-pavement-crack-detection-based-on","slug":"automatic-pavement-crack-detection-based-on","title":"Automatic Pavement Crack Detection Based on Structured Prediction with the Convolutional Neural Network","date":"2018-02-01","arxiv_id":"1802.02208","repositories_listed":1,"syntology":null},{"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/multi-task-spatiotemporal-neural-networks-for","slug":"multi-task-spatiotemporal-neural-networks-for","title":"Multi-Task Spatiotemporal Neural Networks for Structured Surface Reconstruction","date":"2018-01-11","arxiv_id":"1801.03986","repositories_listed":1,"syntology":null},{"url":"/paper/residual-loss-prediction-reinforcement","slug":"residual-loss-prediction-reinforcement","title":"Residual Loss Prediction: Reinforcement Learning With No Incremental Feedback","date":"2018-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-the-robustness-of-semantic-segmentation","slug":"on-the-robustness-of-semantic-segmentation","title":"On the Robustness of Semantic Segmentation Models to Adversarial Attacks","date":"2017-11-27","arxiv_id":"1711.09856","repositories_listed":1,"syntology":null},{"url":"/paper/classical-structured-prediction-losses-for","slug":"classical-structured-prediction-losses-for","title":"Classical Structured Prediction Losses for Sequence to Sequence Learning","date":"2017-11-14","arxiv_id":"1711.04956","repositories_listed":1,"syntology":null},{"url":"/paper/active-learning-amidst-logical-knowledge","slug":"active-learning-amidst-logical-knowledge","title":"Active Learning amidst Logical Knowledge","date":"2017-09-26","arxiv_id":"1709.08850","repositories_listed":1,"syntology":null},{"url":"/paper/learning-graph-structured-sum-product","slug":"learning-graph-structured-sum-product","title":"Learning Graph-Structured Sum-Product Networks for Probabilistic Semantic Maps","date":"2017-09-24","arxiv_id":"1709.08274","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-structured-prediction-with","slug":"semi-supervised-structured-prediction-with","title":"Semi-supervised Structured Prediction with Neural CRF Autoencoder","date":"2017-09-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/abstract-meaning-representation-parsing-using","slug":"abstract-meaning-representation-parsing-using","title":"Abstract Meaning Representation Parsing using LSTM Recurrent Neural Networks","date":"2017-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/searnn-training-rnns-with-global-local-losses","slug":"searnn-training-rnns-with-global-local-losses","title":"SEARNN: Training RNNs with Global-Local Losses","date":"2017-06-14","arxiv_id":"1706.04499","repositories_listed":1,"syntology":null},{"url":"/paper/bandit-structured-prediction-for-neural","slug":"bandit-structured-prediction-for-neural","title":"Bandit Structured Prediction for Neural Sequence-to-Sequence Learning","date":"2017-04-21","arxiv_id":"1704.06497","repositories_listed":1,"syntology":null},{"url":"/paper/reconstructing-the-house-from-the-ad","slug":"reconstructing-the-house-from-the-ad","title":"Reconstructing the house from the ad: Structured prediction on real estate classifieds","date":"2017-04-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-structured-prediction-theory-with","slug":"on-structured-prediction-theory-with","title":"On Structured Prediction Theory with Calibrated Convex Surrogate Losses","date":"2017-03-07","arxiv_id":"1703.02403","repositories_listed":1,"syntology":null},{"url":"/paper/detect-replace-refine-deep-structured","slug":"detect-replace-refine-deep-structured","title":"Detect, Replace, Refine: Deep Structured Prediction For Pixel Wise Labeling","date":"2016-12-14","arxiv_id":"1612.04770","repositories_listed":1,"syntology":null},{"url":"/paper/deep-metric-learning-via-facility-location","slug":"deep-metric-learning-via-facility-location","title":"Deep Metric Learning via Facility Location","date":"2016-12-05","arxiv_id":"1612.01213","repositories_listed":1,"syntology":null},{"url":"/paper/table-filling-multi-task-recurrent-neural","slug":"table-filling-multi-task-recurrent-neural","title":"Table Filling Multi-Task Recurrent Neural Network for Joint Entity and Relation Extraction","date":"2016-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"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/unsupervised-neural-dependency-parsing","slug":"unsupervised-neural-dependency-parsing","title":"Unsupervised Neural Dependency Parsing","date":"2016-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/automatic-measurement-of-vowel-duration-via","slug":"automatic-measurement-of-vowel-duration-via","title":"Automatic measurement of vowel duration via structured prediction","date":"2016-10-26","arxiv_id":"1610.08166","repositories_listed":1,"syntology":null},{"url":"/paper/estimation-from-indirect-supervision-with","slug":"estimation-from-indirect-supervision-with","title":"Estimation from Indirect Supervision with Linear Moments","date":"2016-08-10","arxiv_id":"1608.03100","repositories_listed":1,"syntology":null},{"url":"/paper/structured-prediction-models-for-rnn-based","slug":"structured-prediction-models-for-rnn-based","title":"Structured prediction models for RNN based sequence labeling in clinical text","date":"2016-08-01","arxiv_id":"1608.00612","repositories_listed":1,"syntology":null},{"url":"/paper/slack-and-margin-rescaling-as-convex","slug":"slack-and-margin-rescaling-as-convex","title":"Slack and Margin Rescaling as Convex Extensions of Supermodular Functions","date":"2016-06-19","arxiv_id":"1606.05918","repositories_listed":1,"syntology":null},{"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/feature-space-optimization-for-semantic-video","slug":"feature-space-optimization-for-semantic-video","title":"Feature Space Optimization for Semantic Video Segmentation","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/joint-event-extraction-via-recurrent-neural","slug":"joint-event-extraction-via-recurrent-neural","title":"Joint Event Extraction via Recurrent Neural Networks","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/situation-recognition-visual-semantic-role","slug":"situation-recognition-visual-semantic-role","title":"Situation Recognition: Visual Semantic Role Labeling for Image Understanding","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transition-based-syntactic-linearization-with","slug":"transition-based-syntactic-linearization-with","title":"Transition-Based Syntactic Linearization with Lookahead Features","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":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/video-summarization-with-long-short-term","slug":"video-summarization-with-long-short-term","title":"Video Summarization with Long Short-term Memory","date":"2016-05-26","arxiv_id":"1605.08110","repositories_listed":1,"syntology":null},{"url":"/paper/fast-exact-and-multi-scale-inference-for","slug":"fast-exact-and-multi-scale-inference-for","title":"Fast, Exact and Multi-Scale Inference for Semantic Image Segmentation with Deep Gaussian CRFs","date":"2016-03-28","arxiv_id":"1603.08358","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-structured-inference-for-transition","slug":"efficient-structured-inference-for-transition","title":"Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States","date":"2016-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/calibrated-structured-prediction","slug":"calibrated-structured-prediction","title":"Calibrated Structured Prediction","date":"2015-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-structured-output-representation","slug":"learning-structured-output-representation","title":"Learning Structured Output Representation using Deep Conditional Generative Models","date":"2015-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/super-resolution-with-deep-convolutional","slug":"super-resolution-with-deep-convolutional","title":"Super-Resolution with Deep Convolutional Sufficient Statistics","date":"2015-11-18","arxiv_id":"1511.05666","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-color-constancy","slug":"convolutional-color-constancy","title":"Convolutional Color Constancy","date":"2015-07-02","arxiv_id":"1507.00410","repositories_listed":1,"syntology":null},{"url":"/paper/learning-where-to-sample-in-structured","slug":"learning-where-to-sample-in-structured","title":"Learning Where to Sample in Structured Prediction","date":"2015-05-09","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transforming-dependencies-into-phrase","slug":"transforming-dependencies-into-phrase","title":"Transforming Dependencies into Phrase Structures","date":"2015-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-fast-mixing-models-for-structured","slug":"learning-fast-mixing-models-for-structured","title":"Learning Fast-Mixing Models for Structured Prediction","date":"2015-02-24","arxiv_id":"1502.06668","repositories_listed":1,"syntology":null},{"url":"/paper/feedforward-semantic-segmentation-with-zoom","slug":"feedforward-semantic-segmentation-with-zoom","title":"Feedforward semantic segmentation with zoom-out features","date":"2014-12-02","arxiv_id":"1412.0774","repositories_listed":1,"syntology":null},{"url":"/paper/conditional-random-field-autoencoders-for","slug":"conditional-random-field-autoencoders-for","title":"Conditional Random Field Autoencoders for Unsupervised Structured Prediction","date":"2014-11-05","arxiv_id":"1411.1147","repositories_listed":1,"syntology":null},{"url":"/paper/representation-learning-for-text-level","slug":"representation-learning-for-text-level","title":"Representation Learning for Text-level Discourse Parsing","date":"2014-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-structured-prediction-using-gaussian","slug":"bayesian-structured-prediction-using-gaussian","title":"Bayesian Structured Prediction Using Gaussian Processes","date":"2013-07-15","arxiv_id":"1307.3846","repositories_listed":1,"syntology":null},{"url":null,"slug":"learning-distributions-over-permutations-and","title":"Learning Distributions over Permutations and Rankings with Factorized Representations","date":"2025-05-30","arxiv_id":"2505.24664","repositories_listed":0,"syntology":null},{"url":null,"slug":"nested-named-entity-recognition-as-single","title":"Nested Named Entity Recognition as Single-Pass Sequence Labeling","date":"2025-05-22","arxiv_id":"2505.16855","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-domain-multilingual-sentiment-analysis","title":"Multi-domain Multilingual Sentiment Analysis in Industry: Predicting Aspect-based Opinion Quadruples","date":"2025-05-15","arxiv_id":"2505.10389","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-prediction-with-abstention-via-the","title":"Structured Prediction with Abstention via the Lovász Hinge","date":"2025-05-09","arxiv_id":"2505.06446","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-through-generation-why-generation","title":"Predicting Through Generation: Why Generation Is Better for Prediction","date":"2025-02-25","arxiv_id":"2502.17817","repositories_listed":0,"syntology":null}],"record_sha256":"ec5ee2e3865d7f3c8cac062626c7ac3aa567b5f32e4b209a9f78237b7a8eb599","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}