{"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/machine-learning/papers/101","list_of":"/task/machine-learning","task":"BIG-bench Machine Learning","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":101,"pages_in_order":101,"rows_per_page":100,"rows":[10001,10033],"of":10033,"counts":{"archive_papers_tagged":10033,"with_a_code_link":2352,"where_syntology_ran_a_sample":356,"not_listed_spam_title":0,"listed":10033,"listed_where_code_ran":356,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":290,"every_run_a_failure_of_syntologys_instrument":66,"listed_with_a_run_with_no_instrument_failure":290,"listed_every_run_a_failure_of_syntologys_instrument":66,"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/machine-learning","prev":"/task/machine-learning/papers/100","next":null,"papers":[{"url":null,"slug":"a-machine-learning-approach-to-predict","title":"A Machine Learning Approach to Predict Chemical Reactions","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-online-learning-via-randomized","title":"Efficient Online Learning via Randomized Rounding","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-asymptotic-analysis-of-stochastic","title":"Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-fast-approximate-submodular-minimization","title":"On fast approximate submodular minimization","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"prismatic-algorithm-for-discrete-dc","title":"Prismatic Algorithm for Discrete D.C. Programming Problem","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"testing-a-bayesian-measure-of","title":"Testing a Bayesian Measure of Representativeness Using a Large Image Database","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-submodular-functions-a-convex","title":"Learning with Submodular Functions: A Convex Optimization Perspective","date":"2011-11-28","arxiv_id":"1111.6453","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-minimization-of-higher-order","title":"Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions","date":"2011-09-11","arxiv_id":"1109.2304","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-methods-for-the-approximation-of","title":"Kernel Methods for the Approximation of Nonlinear Systems","date":"2011-08-14","arxiv_id":"1108.2903","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-independence-based-markov","title":"A survey on independence-based Markov networks learning","date":"2011-08-10","arxiv_id":"1108.2283","repositories_listed":0,"syntology":null},{"url":"/paper/machine-learned-solutions-for-three-stages-of","slug":"machine-learned-solutions-for-three-stages-of","title":"Machine-learned solutions for three stages of clinical information extraction: the state of the art at i2b2 2010","date":"2011-05-12","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-combining-machine-learning-with-decision","title":"On Combining Machine Learning with Decision Making","date":"2011-04-27","arxiv_id":"1104.5061","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-machine-learning-to-machine-reasoning","title":"From Machine Learning to Machine Reasoning","date":"2011-02-09","arxiv_id":"1102.1808","repositories_listed":0,"syntology":null},{"url":null,"slug":"humans-learn-using-manifolds-reluctantly","title":"Humans Learn Using Manifolds, Reluctantly","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"random-conic-pursuit-for-semidefinite","title":"Random Conic Pursuit for Semidefinite Programming","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-approach-to-inverse-problem","title":"Machine learning approach to inverse problem and unfolding procedure","date":"2010-04-12","arxiv_id":"1004.2006","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-naive-bayes-machine-learning","title":"A Survey of Naïve Bayes Machine Learning approach in Text Document Classification","date":"2010-03-09","arxiv_id":"1003.1795","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-explain-individual-classification","title":"How to Explain Individual Classification Decisions","date":"2009-12-06","arxiv_id":"0912.1128","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-lower-bounds-on-the","title":"Information-theoretic lower bounds on the oracle complexity of convex optimization","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-time-algorithms-for-pairwise","title":"Linear-time Algorithms for Pairwise Statistical Problems","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"maximin-affinity-learning-of-image","title":"Maximin affinity learning of image segmentation","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-analysis-of-domain-adaptation","title":"An Empirical Analysis of Domain Adaptation Algorithms for Genomic Sequence Analysis","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-interior-point-stochastic-approximation","title":"An interior-point stochastic approximation method and an L1-regularized delta rule","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-human-feature-learning-as","title":"Analyzing human feature learning as nonparametric Bayesian inference","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-online-tuning-for-fast-gaussian","title":"Automatic online tuning for fast Gaussian summation","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"human-active-learning","title":"Human Active Learning","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-arma-for-hand-tracking-and-brain","title":"Kernel-ARMA for Hand Tracking and Brain-Machine interfacing During 3D Motor Control","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-measures-of-independence-for-non-iid","title":"Kernel Measures of Independence for non-iid Data","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-logistic-regression","title":"Privacy-preserving logistic regression","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"quic-svd-fast-svd-using-cosine-trees","title":"QUIC-SVD: Fast SVD Using Cosine Trees","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/machine-learning-for-signature-verification","slug":"machine-learning-for-signature-verification","title":"Machine learning for signature verification","date":"2006-12-15","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"thumbs-up-sentiment-classification-using","title":"Thumbs up? Sentiment Classification using Machine Learning Techniques","date":"2002-05-28","arxiv_id":"cs/0205070","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-of-generic-and-user-focused","title":"Machine Learning of Generic and User-Focused Summarization","date":"1998-11-02","arxiv_id":"cs/9811006","repositories_listed":0,"syntology":null}],"record_sha256":"4ed8da0946bb58814d61d6c3d7d7252a1ca8132716007a89a7e748894427b669","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}