{"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/prediction/papers/88","list_of":"/task/prediction","task":"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":88,"pages_in_order":88,"rows_per_page":100,"rows":[8701,8760],"of":8760,"counts":{"archive_papers_tagged":8760,"with_a_code_link":2835,"where_syntology_ran_a_sample":607,"not_listed_spam_title":0,"listed":8760,"listed_where_code_ran":607,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":519,"every_run_a_failure_of_syntologys_instrument":88,"listed_with_a_run_with_no_instrument_failure":519,"listed_every_run_a_failure_of_syntologys_instrument":88,"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/prediction","prev":"/task/prediction/papers/87","next":null,"papers":[{"url":null,"slug":"advice-efficient-prediction-with-expert","title":"Advice-Efficient Prediction with Expert Advice","date":"2013-04-12","arxiv_id":"1304.3708","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-prediction-for-artificial","title":"Bayesian Prediction for Artificial Intelligence","date":"2013-03-27","arxiv_id":"1304.2717","repositories_listed":0,"syntology":null},{"url":null,"slug":"evidential-reasoning-in-a-network-usage","title":"Evidential Reasoning in a Network Usage Prediction Testbed","date":"2013-03-27","arxiv_id":"1304.2368","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sharp-bound-on-the-computation-accuracy","title":"Estimating a sharp convergence bound for randomized ensembles","date":"2013-03-04","arxiv_id":"1303.0727","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-conformal-prediction-approach-to-explore","title":"A Conformal Prediction Approach to Explore Functional Data","date":"2013-02-26","arxiv_id":"1302.6452","repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-tree-substitution-grammar-for","title":"Incremental Tree Substitution Grammar for Parsing and Sentence Prediction","date":"2013-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"runtime-optimizations-for-prediction-with","title":"Runtime Optimizations for Prediction with Tree-Based Models","date":"2012-12-11","arxiv_id":"1212.2287","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-and-protein-function-prediction","title":"Hypergraph and protein function prediction with gene expression data","date":"2012-12-03","arxiv_id":"1212.0388","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-comparison-of-prediction-models","title":"Active Comparison of Prediction Models","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cocktail-party-processing-via-structured","title":"Cocktail Party Processing via Structured Prediction","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"context-sensitive-decision-forests-for-object","title":"Context-Sensitive Decision Forests for Object Detection","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-spatio-temporal-architectures-and","title":"Deep Spatio-Temporal Architectures and Learning for Protein Structure Prediction","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-pruning-of-factor-graphs-for-maximum","title":"Dynamic Pruning of Factor Graphs for Maximum Marginal Prediction","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"interpreting-prediction-markets-a-stochastic","title":"Interpreting prediction markets: a stochastic approach","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-in-graphs-with-autoregressive","title":"Link Prediction in Graphs with Autoregressive Features","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mandatory-leaf-node-prediction-in","title":"Mandatory Leaf Node Prediction in Hierarchical Multilabel Classification","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mixability-in-statistical-learning","title":"Mixability in Statistical Learning","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multilabel-classification-using-bayesian","title":"Multilabel Classification using Bayesian Compressed Sensing","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multiple-choice-learning-learning-to-produce","title":"Multiple Choice Learning: Learning to Produce Multiple Structured Outputs","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-prediction-with-the-k-support-norm","title":"Sparse Prediction with the k-Support Norm","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimally-fuzzy-temporal-memory","title":"Optimally fuzzy temporal memory","date":"2012-11-22","arxiv_id":"1211.5189","repositories_listed":0,"syntology":null},{"url":null,"slug":"algorithm-runtime-prediction-methods","title":"Algorithm Runtime Prediction: Methods & Evaluation","date":"2012-11-05","arxiv_id":"1211.0906","repositories_listed":0,"syntology":null},{"url":null,"slug":"blending-learning-and-inference-in-structured","title":"Blending Learning and Inference in Structured Prediction","date":"2012-10-08","arxiv_id":"1210.2346","repositories_listed":0,"syntology":null},{"url":null,"slug":"head-driven-transition-based-parsing-with-top","title":"Head-driven Transition-based Parsing with Top-down Prediction","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-conversation-structure","title":"Hierarchical Conversation Structure Prediction in Multi-Party Chat","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-amortizing-inference-cost-for-structured","title":"On Amortizing Inference Cost for Structured Prediction","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-of-learning-curves-in-machine","title":"Prediction of Learning Curves in Machine Translation","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-use-of-granularity-in-rhetorical-relation","title":"The Use of Granularity in Rhetorical Relation Prediction","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-grapheme-to-phoneme-prediction-over","title":"Universal Grapheme-to-Phoneme Prediction Over Latin Alphabets","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-link-prediction-in-dynamic","title":"Nonparametric Link Prediction in Dynamic Networks","date":"2012-06-27","arxiv_id":"1206.6394","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-prediction-techniques-to-phoneme","title":"Applying Prediction Techniques to Phoneme-based AAC Systems","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-syntactic-word-prediction-for-aac","title":"Non-Syntactic Word Prediction for AAC","date":"2012-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"effort-of-genre-variation-and-prediction-of","title":"Effort of Genre Variation and Prediction of System Performance","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"user-participation-prediction-in-online","title":"User Participation Prediction in Online Forums","date":"2012-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-collaborative-mechanism-for-crowdsourcing","title":"A Collaborative Mechanism for Crowdsourcing Prediction Problems","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-margin-multi-label-structured","title":"Maximum Margin Multi-Label Structured Prediction","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-strategies-without-loss","title":"Prediction strategies without loss","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"selective-prediction-of-financial-trends-with","title":"Selective Prediction of Financial Trends with Hidden Markov Models","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-link-prediction-in-large-scale","title":"Nonparametric Link Prediction in Large Scale Dynamic Networks","date":"2011-09-06","arxiv_id":"1109.1077","repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-and-modularity-in-dynamical","title":"Prediction and Modularity in Dynamical Systems","date":"2011-06-19","arxiv_id":"1106.3703","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-multi-template-learning-for","title":"Efficient Multi-Template Learning for Structured Prediction","date":"2011-03-04","arxiv_id":"1103.0890","repositories_listed":0,"syntology":null},{"url":null,"slug":"nextplace-a-spatio-temporal-prediction","title":"Nextplace: a spatio-temporal prediction framework for pervasive systems","date":"2011-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"direct-loss-minimization-for-structured","title":"Direct Loss Minimization for Structured Prediction","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"implicitly-constrained-gaussian-process","title":"Implicitly Constrained Gaussian Process Regression for Monocular Non-Rigid Pose Estimation","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-margin-learning-of-upstream-scene","title":"Large Margin Learning of Upstream Scene Understanding Models","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-execution-time-of-computer","title":"Predicting Execution Time of Computer Programs Using Sparse Polynomial Regression","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reverse-multi-label-learning","title":"Reverse Multi-Label Learning","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-introduction-to-conditional-random-fields","title":"An Introduction to Conditional Random Fields","date":"2010-11-17","arxiv_id":"1011.4088","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-via-sequential-complexities","title":"Online Learning via Sequential Complexities","date":"2010-06-06","arxiv_id":"1006.1138","repositories_listed":0,"syntology":null},{"url":"/paper/twin-gaussian-processes-for-structured","slug":"twin-gaussian-processes-for-structured","title":"Twin gaussian processes for structured prediction","date":"2010-03-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"grouped-orthogonal-matching-pursuit-for","title":"Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-label-prediction-via-sparse-infinite","title":"Multi-Label Prediction via Sparse Infinite CCA","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nash-equilibria-of-static-prediction-games","title":"Nash Equilibria of Static Prediction Games","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-latent-feature-models-for-link","title":"Nonparametric Latent Feature Models for Link Prediction","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"search-based-structured-prediction","title":"Search-based Structured Prediction","date":"2009-07-04","arxiv_id":"0907.0786","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-prediction-on-a-tree","title":"Fast Prediction on a Tree","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"local-gaussian-process-regression-for-real","title":"Local Gaussian Process Regression for Real Time Online Model Learning","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-prediction-on-large-diameter-graphs","title":"Online Prediction on Large Diameter Graphs","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-multiple-hyperparameter-learning","title":"Efficient multiple hyperparameter learning for log-linear models","date":"2007-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-and-adaptation-in-an-evolving","title":"Prediction and Adaptation in an Evolving Chaotic Environment","date":"1993-06-28","arxiv_id":"adap-org/9306005","repositories_listed":0,"syntology":null}],"record_sha256":"dc4f76af63696765ff75f068f8e7d9eea07bbe20c95c53160083f9d621b170ce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}