{"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/feature-selection/papers/ran/1","list_of":"/task/feature-selection","task":"feature selection","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,85],"of":85,"counts":{"archive_papers_tagged":2971,"with_a_code_link":707,"where_syntology_ran_a_sample":85,"not_listed_spam_title":0,"listed":2971,"listed_where_code_ran":85,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":71,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":71,"listed_every_run_a_failure_of_syntologys_instrument":14,"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/feature-selection/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/sand-one-shot-feature-selection-with-additive","slug":"sand-one-shot-feature-selection-with-additive","title":"SAND: One-Shot Feature Selection with Additive Noise Distortion","date":"2025-05-06","arxiv_id":"2505.03923","repositories_listed":0,"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":0,"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/sand-one-shot-feature-selection-with-additive#ran","syntology_url":"https://syntology.ai/paper/2505.03923","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03923"}},"official":null}},{"url":"/paper/llm-fe-automated-feature-engineering-for","slug":"llm-fe-automated-feature-engineering-for","title":"LLM-FE: Automated Feature Engineering for Tabular Data with LLMs as Evolutionary Optimizers","date":"2025-03-18","arxiv_id":"2503.14434","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/llm-fe-automated-feature-engineering-for#ran","syntology_url":"https://syntology.ai/paper/2503.14434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.14434"}},"official":{"repos":["nikhilsab/llmfe"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/saeuron-interpretable-concept-unlearning-in","slug":"saeuron-interpretable-concept-unlearning-in","title":"SAeUron: Interpretable Concept Unlearning in Diffusion Models with Sparse Autoencoders","date":"2025-01-29","arxiv_id":"2501.18052","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/saeuron-interpretable-concept-unlearning-in#ran","syntology_url":"https://syntology.ai/paper/2501.18052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18052"}},"official":{"repos":["cywinski/saeuron"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/one-node-one-model-featuring-the-missing-half","slug":"one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","arxiv_id":"2412.09902","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/one-node-one-model-featuring-the-missing-half#ran","syntology_url":"https://syntology.ai/paper/2412.09902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.09902"}},"official":{"repos":["xiexuanting/fpgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-ai-generated-text-detection-by","slug":"robust-ai-generated-text-detection-by","title":"Robust AI-Generated Text Detection by Restricted Embeddings","date":"2024-10-10","arxiv_id":"2410.08113","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/robust-ai-generated-text-detection-by#ran","syntology_url":"https://syntology.ai/paper/2410.08113","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.08113"}},"official":{"repos":["silversolver/robustatd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mdap-a-multi-view-disentangled-and-adaptive","slug":"mdap-a-multi-view-disentangled-and-adaptive","title":"MDAP: A Multi-view Disentangled and Adaptive Preference Learning Framework for Cross-Domain Recommendation","date":"2024-10-08","arxiv_id":"2410.05877","repositories_listed":1,"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":4,"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/mdap-a-multi-view-disentangled-and-adaptive#ran","syntology_url":"https://syntology.ai/paper/2410.05877","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05877"}},"official":{"repos":["the-garden-of-sinner/mdap"],"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/not-all-diffusion-model-activations-have-been","slug":"not-all-diffusion-model-activations-have-been","title":"Not All Diffusion Model Activations Have Been Evaluated as Discriminative Features","date":"2024-10-04","arxiv_id":"2410.03558","repositories_listed":1,"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":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) · 2 unverified","sample_list":"/paper/not-all-diffusion-model-activations-have-been#ran","syntology_url":"https://syntology.ai/paper/2410.03558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03558"}},"official":{"repos":["darkbblue/generic-diffusion-feature"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/geom2vec-pretrained-gnns-as-geometric","slug":"geom2vec-pretrained-gnns-as-geometric","title":"Using pretrained graph neural networks with token mixers as geometric featurizers for conformational dynamics","date":"2024-09-30","arxiv_id":"2409.19838","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"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) · 2 unverified","sample_list":"/paper/geom2vec-pretrained-gnns-as-geometric#ran","syntology_url":"https://syntology.ai/paper/2409.19838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19838"}},"official":{"repos":["dinner-group/geom2vec","zpengmei/geom2vec"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/comprehensive-attribution-inherently","slug":"comprehensive-attribution-inherently","title":"Comprehensive Attribution: Inherently Explainable Vision Model with Feature Detector","date":"2024-07-27","arxiv_id":"2407.19308","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":3,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":12,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/comprehensive-attribution-inherently#ran","syntology_url":"https://syntology.ai/paper/2407.19308","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.19308"}},"official":{"repos":["zood123/comet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/local-feature-selection-without-label-or","slug":"local-feature-selection-without-label-or","title":"Local Feature Selection without Label or Feature Leakage for Interpretable Machine Learning Predictions","date":"2024-07-16","arxiv_id":"2407.11778","repositories_listed":1,"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":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) · 2 unverified","sample_list":"/paper/local-feature-selection-without-label-or#ran","syntology_url":"https://syntology.ai/paper/2407.11778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11778"}},"official":{"repos":["garfieldlyu/suwr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/chaosmining-a-benchmark-to-evaluate-post-hoc","slug":"chaosmining-a-benchmark-to-evaluate-post-hoc","title":"ChaosMining: A Benchmark to Evaluate Post-Hoc Local Attribution Methods in Low SNR Environments","date":"2024-06-17","arxiv_id":"2406.12150","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/chaosmining-a-benchmark-to-evaluate-post-hoc#ran","syntology_url":"https://syntology.ai/paper/2406.12150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.12150"}},"official":{"repos":["geshijoker/chaosmining"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/optimized-feature-generation-for-tabular-data","slug":"optimized-feature-generation-for-tabular-data","title":"Optimized Feature Generation for Tabular Data via LLMs with Decision Tree Reasoning","date":"2024-06-12","arxiv_id":"2406.08527","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimized-feature-generation-for-tabular-data#ran","syntology_url":"https://syntology.ai/paper/2406.08527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08527"}},"official":{"repos":["jaehyun513/octree"],"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/interpretabnet-distilling-predictive-signals","slug":"interpretabnet-distilling-predictive-signals","title":"InterpreTabNet: Distilling Predictive Signals from Tabular Data by Salient Feature Interpretation","date":"2024-06-01","arxiv_id":"2406.00426","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":10,"n_ran_checked":10,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 10 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; every one of the 10 samples that ran constructed an object rather than computing a result","sample_list":"/paper/interpretabnet-distilling-predictive-signals#ran","syntology_url":"https://syntology.ai/paper/2406.00426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00426"}},"official":{"repos":["jacobyhsi/InterpreTabNet"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":10,"n_ran_no_instrument_failure":10,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/decomposing-the-neurons-activation-sparsity","slug":"decomposing-the-neurons-activation-sparsity","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","date":"2024-05-26","arxiv_id":"2405.16486","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":8,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/decomposing-the-neurons-activation-sparsity#ran","syntology_url":"https://syntology.ai/paper/2405.16486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16486"}},"official":{"repos":["royzry98/moase-pytorch"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/fairgt-a-fairness-aware-graph-transformer","slug":"fairgt-a-fairness-aware-graph-transformer","title":"FairGT: A Fairness-aware Graph Transformer","date":"2024-04-26","arxiv_id":"2404.17169","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairgt-a-fairness-aware-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2404.17169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17169"}},"official":{"repos":["yushuowiki/fairgt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/quiver-laplacians-and-feature-selection","slug":"quiver-laplacians-and-feature-selection","title":"Quiver Laplacians and Feature Selection","date":"2024-04-10","arxiv_id":"2404.06993","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/quiver-laplacians-and-feature-selection#ran","syntology_url":"https://syntology.ai/paper/2404.06993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.06993"}},"official":{"repos":["osumray/harmonic_feature_selection"],"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/non-negative-contrastive-learning","slug":"non-negative-contrastive-learning","title":"Non-negative Contrastive Learning","date":"2024-03-19","arxiv_id":"2403.12459","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":10,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/non-negative-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2403.12459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12459"}},"official":{"repos":["pku-ml/non_neg"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/realnet-a-feature-selection-network-with","slug":"realnet-a-feature-selection-network-with","title":"RealNet: A Feature Selection Network with Realistic Synthetic Anomaly for Anomaly Detection","date":"2024-03-09","arxiv_id":"2403.05897","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/realnet-a-feature-selection-network-with#ran","syntology_url":"https://syntology.ai/paper/2403.05897","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05897"}},"official":{"repos":["cnulab/realnet"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/indirectly-parameterized-concrete","slug":"indirectly-parameterized-concrete","title":"Indirectly Parameterized Concrete Autoencoders","date":"2024-03-01","arxiv_id":"2403.00563","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/indirectly-parameterized-concrete#ran","syntology_url":"https://syntology.ai/paper/2403.00563","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.00563"}},"official":{"repos":["alfred-n/ip-cae"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/feature-selection-in-the-contrastive-analysis-1","slug":"feature-selection-in-the-contrastive-analysis-1","title":"Feature Selection in the Contrastive Analysis Setting","date":"2023-10-27","arxiv_id":"2310.18531","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/feature-selection-in-the-contrastive-analysis-1#ran","syntology_url":"https://syntology.ai/paper/2310.18531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18531"}},"official":null}},{"url":"/paper/reimagining-synthetic-tabular-data-generation-1","slug":"reimagining-synthetic-tabular-data-generation-1","title":"Reimagining Synthetic Tabular Data Generation through Data-Centric AI: A Comprehensive Benchmark","date":"2023-10-25","arxiv_id":"2310.16981","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reimagining-synthetic-tabular-data-generation-1#ran","syntology_url":"https://syntology.ai/paper/2310.16981","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.16981"}},"official":{"repos":["hlasse/data-centric-synthetic-data","vanderschaarlab/data-centric-synthetic-data"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-regularization-of-multi-task","slug":"implicit-regularization-of-multi-task","title":"Inductive biases of multi-task learning and finetuning: multiple regimes of feature reuse","date":"2023-10-03","arxiv_id":"2310.02396","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":9,"phrase":"9 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-regularization-of-multi-task#ran","syntology_url":"https://syntology.ai/paper/2310.02396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02396"}},"official":{"repos":["sflippl/multi-task"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evolutionary-neural-architecture-search-for-1","slug":"evolutionary-neural-architecture-search-for-1","title":"Evolutionary Neural Architecture Search for Transformer in Knowledge Tracing","date":"2023-10-02","arxiv_id":"2310.01180","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":14,"phrase":"11 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/evolutionary-neural-architecture-search-for-1#ran","syntology_url":"https://syntology.ai/paper/2310.01180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01180"}},"official":{"repos":["devilyangs/enas-kt"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/steerer-resolving-scale-variations-for","slug":"steerer-resolving-scale-variations-for","title":"STEERER: Resolving Scale Variations for Counting and Localization via Selective Inheritance Learning","date":"2023-08-21","arxiv_id":"2308.10468","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"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) · 6 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/steerer-resolving-scale-variations-for#ran","syntology_url":"https://syntology.ai/paper/2308.10468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10468"}},"official":{"repos":["taohan10200/steerer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/hope-high-order-polynomial-expansion-of-black","slug":"hope-high-order-polynomial-expansion-of-black","title":"HOPE: High-order Polynomial Expansion of Black-box Neural Networks","date":"2023-07-17","arxiv_id":"2307.08192","repositories_listed":1,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":18,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hope-high-order-polynomial-expansion-of-black#ran","syntology_url":"https://syntology.ai/paper/2307.08192","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08192"}},"official":{"repos":["harrypotterxtx/hope"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/protogate-prototype-based-neural-networks","slug":"protogate-prototype-based-neural-networks","title":"ProtoGate: Prototype-based Neural Networks with Global-to-local Feature Selection for Tabular Biomedical Data","date":"2023-06-21","arxiv_id":"2306.12330","repositories_listed":1,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/protogate-prototype-based-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2306.12330","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.12330"}},"official":{"repos":["SilenceX12138/ProtoGate"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/estimating-conditional-mutual-information-for-1","slug":"estimating-conditional-mutual-information-for-1","title":"Estimating Conditional Mutual Information for Dynamic Feature Selection","date":"2023-06-05","arxiv_id":"2306.03301","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/estimating-conditional-mutual-information-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.03301","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03301"}},"official":{"repos":["suinleelab/dime"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/joint-feature-and-differentiable-k-nn-graph","slug":"joint-feature-and-differentiable-k-nn-graph","title":"Joint Feature and Differentiable $ k $-NN Graph Learning using Dirichlet Energy","date":"2023-05-21","arxiv_id":"2305.12396","repositories_listed":0,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/joint-feature-and-differentiable-k-nn-graph#ran","syntology_url":"https://syntology.ai/paper/2305.12396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12396"}},"official":null}},{"url":"/paper/slide-transformer-hierarchical-vision","slug":"slide-transformer-hierarchical-vision","title":"Slide-Transformer: Hierarchical Vision Transformer with Local Self-Attention","date":"2023-04-09","arxiv_id":"2304.04237","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/slide-transformer-hierarchical-vision#ran","syntology_url":"https://syntology.ai/paper/2304.04237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.04237"}},"official":{"repos":["leaplabthu/slide-transformer"],"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/finalmlp-an-enhanced-two-stream-mlp-model-for-1","slug":"finalmlp-an-enhanced-two-stream-mlp-model-for-1","title":"FinalMLP: An Enhanced Two-Stream MLP Model for CTR Prediction","date":"2023-04-03","arxiv_id":"2304.00902","repositories_listed":4,"syntology":{"n":16,"n_ran":13,"n_constructed":4,"n_ran_checked":8,"n_instrument":5,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/finalmlp-an-enhanced-two-stream-mlp-model-for-1#ran","syntology_url":"https://syntology.ai/paper/2304.00902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00902"}},"official":{"repos":["reczoo/RecZoo"],"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/spherical-transformer-for-lidar-based-3d","slug":"spherical-transformer-for-lidar-based-3d","title":"Spherical Transformer for LiDAR-based 3D Recognition","date":"2023-03-22","arxiv_id":"2303.12766","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/spherical-transformer-for-lidar-based-3d#ran","syntology_url":"https://syntology.ai/paper/2303.12766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12766"}},"official":{"repos":["dvlab-research/sphereformer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/lmr-a-large-scale-multi-reference-dataset-for","slug":"lmr-a-large-scale-multi-reference-dataset-for","title":"LMR: A Large-Scale Multi-Reference Dataset for Reference-based Super-Resolution","date":"2023-03-09","arxiv_id":"2303.04970","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"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) · 1 unverified","sample_list":"/paper/lmr-a-large-scale-multi-reference-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2303.04970","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04970"}},"official":{"repos":["wdmwhh/MRefSR"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-maximize-mutual-information-for","slug":"learning-to-maximize-mutual-information-for","title":"Learning to Maximize Mutual Information for Dynamic Feature Selection","date":"2023-01-02","arxiv_id":"2301.00557","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-to-maximize-mutual-information-for#ran","syntology_url":"https://syntology.ai/paper/2301.00557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00557"}},"official":{"repos":["iancovert/dynamic-selection"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/losses-over-labels-weakly-supervised-learning","slug":"losses-over-labels-weakly-supervised-learning","title":"Losses over Labels: Weakly Supervised Learning via Direct Loss Construction","date":"2022-12-13","arxiv_id":"2212.06921","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/losses-over-labels-weakly-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2212.06921","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.06921"}},"official":{"repos":["dsam99/lol"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/systematic-analysis-of-biomolecular","slug":"systematic-analysis-of-biomolecular","title":"Systematic Analysis of Biomolecular Conformational Ensembles with PENSA","date":"2022-12-06","arxiv_id":"2212.02714","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/systematic-analysis-of-biomolecular#ran","syntology_url":"https://syntology.ai/paper/2212.02714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.02714"}},"official":{"repos":["drorlab/pensa"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/weight-predictor-network-with-feature","slug":"weight-predictor-network-with-feature","title":"Weight Predictor Network with Feature Selection for Small Sample Tabular Biomedical Data","date":"2022-11-28","arxiv_id":"2211.15616","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/weight-predictor-network-with-feature#ran","syntology_url":"https://syntology.ai/paper/2211.15616","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.15616"}},"official":{"repos":["andreimargeloiu/wpfs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/where-to-pay-attention-in-sparse-training-for","slug":"where-to-pay-attention-in-sparse-training-for","title":"Where to Pay Attention in Sparse Training for Feature Selection?","date":"2022-11-26","arxiv_id":"2211.14627","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/where-to-pay-attention-in-sparse-training-for#ran","syntology_url":"https://syntology.ai/paper/2211.14627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14627"}},"official":{"repos":["ghadasokar/wast"],"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":["community","official"]}}},{"url":"/paper/composite-feature-selection-using-deep","slug":"composite-feature-selection-using-deep","title":"Composite Feature Selection using Deep Ensembles","date":"2022-11-01","arxiv_id":"2211.00631","repositories_listed":2,"syntology":{"n":13,"n_ran":13,"n_constructed":4,"n_ran_checked":12,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":0,"phrase":"13 ran (of which 4 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 1 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/composite-feature-selection-using-deep#ran","syntology_url":"https://syntology.ai/paper/2211.00631","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.00631"}},"official":{"repos":["a-norcliffe/composite-feature-selection","vanderschaarlab/composite-feature-selection"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":4,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/margin-optimal-classification-trees","slug":"margin-optimal-classification-trees","title":"Margin Optimal Classification Trees","date":"2022-10-19","arxiv_id":"2210.10567","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/margin-optimal-classification-trees#ran","syntology_url":"https://syntology.ai/paper/2210.10567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.10567"}},"official":{"repos":["m-monaci/MARGOT"],"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/an-experiment-design-paradigm-using-joint","slug":"an-experiment-design-paradigm-using-joint","title":"Experimental Design for Multi-Channel Imaging via Task-Driven Feature Selection","date":"2022-10-13","arxiv_id":"2210.06891","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/an-experiment-design-paradigm-using-joint#ran","syntology_url":"https://syntology.ai/paper/2210.06891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06891"}},"official":{"repos":["sbb-gh/experimental-design-multichannel"],"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/sequential-attention-for-feature-selection","slug":"sequential-attention-for-feature-selection","title":"Sequential Attention for Feature Selection","date":"2022-09-29","arxiv_id":"2209.14881","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":0,"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/sequential-attention-for-feature-selection#ran","syntology_url":"https://syntology.ai/paper/2209.14881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.14881"}},"official":{"repos":["google-research/google-research"],"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/gate-gated-additive-tree-ensemble-for-tabular","slug":"gate-gated-additive-tree-ensemble-for-tabular","title":"GANDALF: Gated Adaptive Network for Deep Automated Learning of Features","date":"2022-07-18","arxiv_id":"2207.08548","repositories_listed":2,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gate-gated-additive-tree-ensemble-for-tabular#ran","syntology_url":"https://syntology.ai/paper/2207.08548","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08548"}},"official":{"repos":["manujosephv/GATE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/multiscale-methods-for-signal-selection-in","slug":"multiscale-methods-for-signal-selection-in","title":"Multiscale methods for signal selection in single-cell data","date":"2022-06-15","arxiv_id":"2206.07760","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multiscale-methods-for-signal-selection-in#ran","syntology_url":"https://syntology.ai/paper/2206.07760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.07760"}},"official":{"repos":["osumray/multiscale-signal-selection-single-cell"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-learning-for-zero-shot-performance","slug":"multi-task-learning-for-zero-shot-performance","title":"Multi Task Learning For Zero Shot Performance Prediction of Multilingual Models","date":"2022-05-12","arxiv_id":"2205.06130","repositories_listed":0,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/multi-task-learning-for-zero-shot-performance#ran","syntology_url":"https://syntology.ai/paper/2205.06130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06130"}},"official":null}},{"url":"/paper/the-shapley-value-in-machine-learning","slug":"the-shapley-value-in-machine-learning","title":"The Shapley Value in Machine Learning","date":"2022-02-11","arxiv_id":"2202.05594","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-shapley-value-in-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2202.05594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05594"}},"official":{"repos":["benedekrozemberczki/shapley"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tdan-top-down-attention-networks-for-enhanced","slug":"tdan-top-down-attention-networks-for-enhanced","title":"TDAM: Top-Down Attention Module for Contextually Guided Feature Selection in CNNs","date":"2021-11-26","arxiv_id":"2111.13470","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/tdan-top-down-attention-networks-for-enhanced#ran","syntology_url":"https://syntology.ai/paper/2111.13470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.13470"}},"official":{"repos":["shantanuj/tdam_top_down_attention_module"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sega-semantic-guided-attention-on-visual","slug":"sega-semantic-guided-attention-on-visual","title":"SEGA: Semantic Guided Attention on Visual Prototype for Few-Shot Learning","date":"2021-11-08","arxiv_id":"2111.04316","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"6 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sega-semantic-guided-attention-on-visual#ran","syntology_url":"https://syntology.ai/paper/2111.04316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04316"}},"official":{"repos":["martayang/sega"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/ppfs-predictive-permutation-feature-selection","slug":"ppfs-predictive-permutation-feature-selection","title":"PPFS: Predictive Permutation Feature Selection","date":"2021-10-20","arxiv_id":"2110.10713","repositories_listed":1,"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":0,"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/ppfs-predictive-permutation-feature-selection#ran","syntology_url":"https://syntology.ai/paper/2110.10713","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.10713"}},"official":{"repos":["atif-hassan/PyImpetus"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fapn-feature-aligned-pyramid-network-for","slug":"fapn-feature-aligned-pyramid-network-for","title":"FaPN: Feature-aligned Pyramid Network for Dense Image Prediction","date":"2021-08-16","arxiv_id":"2108.07058","repositories_listed":3,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fapn-feature-aligned-pyramid-network-for#ran","syntology_url":"https://syntology.ai/paper/2108.07058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.07058"}},"official":{"repos":["EMI-Group/FaPN"],"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/explaining-time-series-predictions-with","slug":"explaining-time-series-predictions-with","title":"Explaining Time Series Predictions with Dynamic Masks","date":"2021-06-09","arxiv_id":"2106.05303","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/explaining-time-series-predictions-with#ran","syntology_url":"https://syntology.ai/paper/2106.05303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05303"}},"official":{"repos":["JonathanCrabbe/Dynamask"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/attentional-meta-learners-are-polythetic","slug":"attentional-meta-learners-are-polythetic","title":"Attentional Meta-learners for Few-shot Polythetic Classification","date":"2021-06-09","arxiv_id":"2106.05317","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/attentional-meta-learners-are-polythetic#ran","syntology_url":"https://syntology.ai/paper/2106.05317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05317"}},"official":{"repos":["rvinas/polythetic_metalearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/normalizing-flows-for-knockoff-free","slug":"normalizing-flows-for-knockoff-free","title":"Normalizing Flows for Knockoff-free Controlled Feature Selection","date":"2021-06-03","arxiv_id":"2106.01528","repositories_listed":1,"syntology":{"n":33,"n_ran":25,"n_constructed":9,"n_ran_checked":12,"n_instrument":13,"n_unverified":8,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":11,"phrase":"25 ran (of which 9 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 13 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/normalizing-flows-for-knockoff-free#ran","syntology_url":"https://syntology.ai/paper/2106.01528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01528"}},"official":{"repos":["dereklhansen/flowselect"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/towards-rigorous-interpretations-a","slug":"towards-rigorous-interpretations-a","title":"Towards Rigorous Interpretations: a Formalisation of Feature Attribution","date":"2021-04-26","arxiv_id":"2104.12437","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-rigorous-interpretations-a#ran","syntology_url":"https://syntology.ai/paper/2104.12437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12437"}},"official":{"repos":["DariusAf/functional_attribution"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/neural-feature-search-for-rgb-infrared-person","slug":"neural-feature-search-for-rgb-infrared-person","title":"Neural Feature Search for RGB-Infrared Person Re-Identification","date":"2021-04-06","arxiv_id":"2104.02366","repositories_listed":0,"syntology":{"n":11,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/neural-feature-search-for-rgb-infrared-person#ran","syntology_url":"https://syntology.ai/paper/2104.02366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.02366"}},"official":null}},{"url":"/paper/a-uniformly-stable-algorithm-for-unsupervised","slug":"a-uniformly-stable-algorithm-for-unsupervised","title":"Algorithmic Stability and Generalization of an Unsupervised Feature Selection Algorithm","date":"2020-10-19","arxiv_id":"2010.09416","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-uniformly-stable-algorithm-for-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2010.09416","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09416"}},"official":{"repos":["xinxingwu-uk/ufs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/feature-importance-ranking-for-deep-learning","slug":"feature-importance-ranking-for-deep-learning","title":"Feature Importance Ranking for Deep Learning","date":"2020-10-18","arxiv_id":"2010.08973","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/feature-importance-ranking-for-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2010.08973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08973"}},"official":{"repos":["maksym33/FeatureImportanceDL"],"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/consistent-feature-selection-for-analytic","slug":"consistent-feature-selection-for-analytic","title":"Consistent Feature Selection for Analytic Deep Neural Networks","date":"2020-10-16","arxiv_id":"2010.08097","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/consistent-feature-selection-for-analytic#ran","syntology_url":"https://syntology.ai/paper/2010.08097","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08097"}},"official":{"repos":["vucdinh/alg-net"],"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/covariate-shift-adaptation-in-high","slug":"covariate-shift-adaptation-in-high","title":"Effective Sample Size, Dimensionality, and Generalization in Covariate Shift Adaptation","date":"2020-10-02","arxiv_id":"2010.01184","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/covariate-shift-adaptation-in-high#ran","syntology_url":"https://syntology.ai/paper/2010.01184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.01184"}},"official":{"repos":["felipemaiapolo/infoselect"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/let-the-data-choose-its-features","slug":"let-the-data-choose-its-features","title":"Differentiable Unsupervised Feature Selection based on a Gated Laplacian","date":"2020-07-09","arxiv_id":"2007.04728","repositories_listed":1,"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":2,"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/let-the-data-choose-its-features#ran","syntology_url":"https://syntology.ai/paper/2007.04728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04728"}},"official":{"repos":["Ofirlin/DUFS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/optilime-optimized-lime-explanations-for","slug":"optilime-optimized-lime-explanations-for","title":"OptiLIME: Optimized LIME Explanations for Diagnostic Computer Algorithms","date":"2020-06-10","arxiv_id":"2006.05714","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/optilime-optimized-lime-explanations-for#ran","syntology_url":"https://syntology.ai/paper/2006.05714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05714"}},"official":{"repos":["giorgiovisani/lime_stability"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-refinement-network-for-oriented-and","slug":"dynamic-refinement-network-for-oriented-and","title":"Dynamic Refinement Network for Oriented and Densely Packed Object Detection","date":"2020-05-20","arxiv_id":"2005.09973","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/dynamic-refinement-network-for-oriented-and#ran","syntology_url":"https://syntology.ai/paper/2005.09973","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.09973"}},"official":{"repos":["Anymake/DRN_CVPR2020"],"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/towards-prediction-explainability-through","slug":"towards-prediction-explainability-through","title":"The Explanation Game: Towards Prediction Explainability through Sparse Communication","date":"2020-04-28","arxiv_id":"2004.13876","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-prediction-explainability-through#ran","syntology_url":"https://syntology.ai/paper/2004.13876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13876"}},"official":{"repos":["deep-spin/spec"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/parametric-programming-approach-for-powerful","slug":"parametric-programming-approach-for-powerful","title":"Parametric Programming Approach for More Powerful and General Lasso Selective Inference","date":"2020-04-21","arxiv_id":"2004.09749","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/parametric-programming-approach-for-powerful#ran","syntology_url":"https://syntology.ai/paper/2004.09749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09749"}},"official":{"repos":["vonguyenleduy/parametric_lasso_selective_inference"],"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/x3d-expanding-architectures-for-efficient","slug":"x3d-expanding-architectures-for-efficient","title":"X3D: Expanding Architectures for Efficient Video Recognition","date":"2020-04-09","arxiv_id":"2004.04730","repositories_listed":8,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/x3d-expanding-architectures-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2004.04730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.04730"}},"official":{"repos":["facebookresearch/SlowFast"],"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/arda-automatic-relational-data-augmentation","slug":"arda-automatic-relational-data-augmentation","title":"ARDA: Automatic Relational Data Augmentation for Machine Learning","date":"2020-03-21","arxiv_id":"2003.09758","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/arda-automatic-relational-data-augmentation#ran","syntology_url":"https://syntology.ai/paper/2003.09758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09758"}},"official":null}},{"url":"/paper/selecting-relevant-features-from-a-universal","slug":"selecting-relevant-features-from-a-universal","title":"Selecting Relevant Features from a Multi-domain Representation for Few-shot Classification","date":"2020-03-20","arxiv_id":"2003.09338","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/selecting-relevant-features-from-a-universal#ran","syntology_url":"https://syntology.ai/paper/2003.09338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09338"}},"official":{"repos":["dvornikita/SUR"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fsnet-feature-selection-network-on-high","slug":"fsnet-feature-selection-network-on-high","title":"FsNet: Feature Selection Network on High-dimensional Biological Data","date":"2020-01-23","arxiv_id":"2001.08322","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fsnet-feature-selection-network-on-high#ran","syntology_url":"https://syntology.ai/paper/2001.08322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08322"}},"official":{"repos":["dineshsinghindian/fsnet"],"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/graphlime-local-interpretable-model","slug":"graphlime-local-interpretable-model","title":"GraphLIME: Local Interpretable Model Explanations for Graph Neural Networks","date":"2020-01-17","arxiv_id":"2001.06216","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/graphlime-local-interpretable-model#ran","syntology_url":"https://syntology.ai/paper/2001.06216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06216"}},"official":null}},{"url":"/paper/a-real-time-global-inference-network-for-one","slug":"a-real-time-global-inference-network-for-one","title":"A Real-time Global Inference Network for One-stage Referring Expression Comprehension","date":"2019-12-07","arxiv_id":"1912.03478","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":9,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-real-time-global-inference-network-for-one#ran","syntology_url":"https://syntology.ai/paper/1912.03478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03478"}},"official":{"repos":["luogen1996/Real-time-Global-Inference-Network"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/soft-anchor-point-object-detection","slug":"soft-anchor-point-object-detection","title":"Soft Anchor-Point Object Detection","date":"2019-11-27","arxiv_id":"1911.12448","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/soft-anchor-point-object-detection#ran","syntology_url":"https://syntology.ai/paper/1911.12448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12448"}},"official":null}},{"url":"/paper/a-neural-network-with-feature-sparsity","slug":"a-neural-network-with-feature-sparsity","title":"LassoNet: A Neural Network with Feature Sparsity","date":"2019-07-29","arxiv_id":"1907.12207","repositories_listed":2,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":7,"n_honours":1,"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; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/a-neural-network-with-feature-sparsity#ran","syntology_url":"https://syntology.ai/paper/1907.12207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.12207"}},"official":{"repos":["ilemhadri/lassoNet"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/dlime-a-deterministic-local-interpretable","slug":"dlime-a-deterministic-local-interpretable","title":"DLIME: A Deterministic Local Interpretable Model-Agnostic Explanations Approach for Computer-Aided Diagnosis Systems","date":"2019-06-24","arxiv_id":"1906.10263","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/dlime-a-deterministic-local-interpretable#ran","syntology_url":"https://syntology.ai/paper/1906.10263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.10263"}},"official":{"repos":["rehmanzafar/dlime_experiments"],"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/interpretable-outcome-prediction-with-sparse","slug":"interpretable-outcome-prediction-with-sparse","title":"Interpretable Outcome Prediction with Sparse Bayesian Neural Networks in Intensive Care","date":"2019-05-07","arxiv_id":"1905.02599","repositories_listed":2,"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/interpretable-outcome-prediction-with-sparse#ran","syntology_url":"https://syntology.ai/paper/1905.02599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.02599"}},"official":{"repos":["microsoft/horseshoe-bnn"],"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/a-scalable-saliency-based-feature-selection","slug":"a-scalable-saliency-based-feature-selection","title":"A scalable saliency-based Feature selection method with instance level information","date":"2019-04-30","arxiv_id":"1904.13127","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/a-scalable-saliency-based-feature-selection#ran","syntology_url":"https://syntology.ai/paper/1904.13127","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.13127"}},"official":{"repos":["braisCB/SFS"],"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/semantically-tied-paired-cycle-consistency","slug":"semantically-tied-paired-cycle-consistency","title":"Semantically Tied Paired Cycle Consistency for Zero-Shot Sketch-based Image Retrieval","date":"2019-03-08","arxiv_id":"1903.03372","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/semantically-tied-paired-cycle-consistency#ran","syntology_url":"https://syntology.ai/paper/1903.03372","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03372"}},"official":{"repos":["AnjanDutta/sem-pcyc"],"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/feature-selective-anchor-free-module-for","slug":"feature-selective-anchor-free-module-for","title":"Feature Selective Anchor-Free Module for Single-Shot Object Detection","date":"2019-03-02","arxiv_id":"1903.00621","repositories_listed":4,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/feature-selective-anchor-free-module-for#ran","syntology_url":"https://syntology.ai/paper/1903.00621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.00621"}},"official":null}},{"url":"/paper/concrete-autoencoders-for-differentiable","slug":"concrete-autoencoders-for-differentiable","title":"Concrete Autoencoders for Differentiable Feature Selection and Reconstruction","date":"2019-01-27","arxiv_id":"1901.09346","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/concrete-autoencoders-for-differentiable#ran","syntology_url":"https://syntology.ai/paper/1901.09346","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.09346"}},"official":{"repos":["mfbalin/Concrete-Autoencoders"],"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/unsupervised-learning-with-contrastive-latent","slug":"unsupervised-learning-with-contrastive-latent","title":"Unsupervised learning with contrastive latent variable models","date":"2018-11-14","arxiv_id":"1811.06094","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unsupervised-learning-with-contrastive-latent#ran","syntology_url":"https://syntology.ai/paper/1811.06094","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06094"}},"official":{"repos":["kseverso/contrastive-LVM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/but-how-does-it-work-in-theory-linear-svm","slug":"but-how-does-it-work-in-theory-linear-svm","title":"But How Does It Work in Theory? Linear SVM with Random Features","date":"2018-09-12","arxiv_id":"1809.04481","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/but-how-does-it-work-in-theory-linear-svm#ran","syntology_url":"https://syntology.ai/paper/1809.04481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.04481"}},"official":{"repos":["syitong/randfourier"],"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/interpreting-and-explaining-deep-neural","slug":"interpreting-and-explaining-deep-neural","title":"AudioMNIST: Exploring Explainable Artificial Intelligence for Audio Analysis on a Simple Benchmark","date":"2018-07-09","arxiv_id":"1807.03418","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":0,"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/interpreting-and-explaining-deep-neural#ran","syntology_url":"https://syntology.ai/paper/1807.03418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03418"}},"official":{"repos":["soerenab/AudioMNIST"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/free-form-image-inpainting-with-gated","slug":"free-form-image-inpainting-with-gated","title":"Free-Form Image Inpainting with Gated Convolution","date":"2018-06-10","arxiv_id":"1806.03589","repositories_listed":30,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/free-form-image-inpainting-with-gated#ran","syntology_url":"https://syntology.ai/paper/1806.03589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03589"}},"official":{"repos":["JiahuiYu/generative_inpainting"],"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-to-explain-an-information-theoretic","slug":"learning-to-explain-an-information-theoretic","title":"Learning to Explain: An Information-Theoretic Perspective on Model Interpretation","date":"2018-02-21","arxiv_id":"1802.07814","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":2,"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-to-explain-an-information-theoretic#ran","syntology_url":"https://syntology.ai/paper/1802.07814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.07814"}},"official":{"repos":["Jianbo-Lab/L2X"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deepchess-end-to-end-deep-neural-network-for","slug":"deepchess-end-to-end-deep-neural-network-for","title":"DeepChess: End-to-End Deep Neural Network for Automatic Learning in Chess","date":"2017-11-27","arxiv_id":"1711.09667","repositories_listed":2,"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/deepchess-end-to-end-deep-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/1711.09667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.09667"}},"official":null}},{"url":"/paper/kernel-feature-selection-via-conditional","slug":"kernel-feature-selection-via-conditional","title":"Kernel Feature Selection via Conditional Covariance Minimization","date":"2017-07-04","arxiv_id":"1707.01164","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/kernel-feature-selection-via-conditional#ran","syntology_url":"https://syntology.ai/paper/1707.01164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1707.01164"}},"official":{"repos":["Jianbo-Lab/CCM"],"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/a-light-cnn-for-deep-face-representation-with","slug":"a-light-cnn-for-deep-face-representation-with","title":"A Light CNN for Deep Face Representation with Noisy Labels","date":"2015-11-09","arxiv_id":"1511.02683","repositories_listed":19,"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/a-light-cnn-for-deep-face-representation-with#ran","syntology_url":"https://syntology.ai/paper/1511.02683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.02683"}},"official":{"repos":["AlfredXiangWu/LightCNN","AlfredXiangWu/face_verification_experiment"],"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":["listed","official"]}}}],"record_sha256":"e920170b911c1d0d43896f83cf291a9db7aeb3b6250a8c15ac88c1b589a56ac2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}