{"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","name":"feature selection","slug":"feature-selection","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":2971,"papers_with_code":707,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/hotel-sales","name":"Hotel","full_name":"Hospitality > Tourism > Hotel Demand/Sales","num_papers_in_archive":2}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":30,"rows_per_page":100,"shown":100,"of":2971,"of_with_code":707,"tagged_in_all":2971,"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":69,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":69,"listed_every_run_a_failure_of_syntologys_instrument":16,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/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/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"]}}},{"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/ugc-vqa-benchmarking-blind-video-quality","slug":"ugc-vqa-benchmarking-blind-video-quality","title":"UGC-VQA: Benchmarking Blind Video Quality Assessment for User Generated Content","date":"2020-05-29","arxiv_id":"2005.14354","repositories_listed":5,"syntology":null},{"url":"/paper/spsa-fsr-simultaneous-perturbation-stochastic","slug":"spsa-fsr-simultaneous-perturbation-stochastic","title":"SPSA-FSR: Simultaneous Perturbation Stochastic Approximation for Feature Selection and Ranking","date":"2018-04-16","arxiv_id":"1804.05589","repositories_listed":5,"syntology":null},{"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/block-model-guided-unsupervised-feature","slug":"block-model-guided-unsupervised-feature","title":"Block Model Guided Unsupervised Feature Selection","date":"2020-07-05","arxiv_id":"2007.02376","repositories_listed":4,"syntology":null},{"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/recurrent-deep-embedding-networks-for","slug":"recurrent-deep-embedding-networks-for","title":"Convolutional Embedded Networks for Population Scale Clustering and Bio-ancestry Inferencing","date":"2018-05-30","arxiv_id":"1805.12218","repositories_listed":4,"syntology":null},{"url":"/paper/fast-nonparametric-feature-selection-with","slug":"fast-nonparametric-feature-selection-with","title":"Nonparametric IPSS: Fast, flexible feature selection with false discovery control","date":"2024-10-03","arxiv_id":"2410.02208","repositories_listed":3,"syntology":null},{"url":"/paper/auto-encoding-or-auto-regression-a-reality","slug":"auto-encoding-or-auto-regression-a-reality","title":"Your Causal Self-Attentive Recommender Hosts a Lonely Neighborhood","date":"2024-06-04","arxiv_id":"2406.02048","repositories_listed":3,"syntology":null},{"url":"/paper/neural-interval-censored-cox-regression-with","slug":"neural-interval-censored-cox-regression-with","title":"Neural interval-censored survival regression with feature selection","date":"2022-06-14","arxiv_id":"2206.06885","repositories_listed":3,"syntology":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/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/semi-orthogonal-embedding-for-efficient","slug":"semi-orthogonal-embedding-for-efficient","title":"Semi-orthogonal Embedding for Efficient Unsupervised Anomaly Segmentation","date":"2021-05-31","arxiv_id":"2105.14737","repositories_listed":3,"syntology":null},{"url":"/paper/vest-automatic-feature-engineering-for","slug":"vest-automatic-feature-engineering-for","title":"VEST: Automatic Feature Engineering for Forecasting","date":"2020-10-14","arxiv_id":"2010.07137","repositories_listed":3,"syntology":null},{"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/sequential-feature-classification-in-the","slug":"sequential-feature-classification-in-the","title":"Sequential Feature Classification in the Context of Redundancies","date":"2020-04-01","arxiv_id":"2004.00658","repositories_listed":3,"syntology":null},{"url":"/paper/fair-kernel-regression-via-fair-feature","slug":"fair-kernel-regression-via-fair-feature","title":"Fair Kernel Regression via Fair Feature Embedding in Kernel Space","date":"2019-07-04","arxiv_id":"1907.02242","repositories_listed":3,"syntology":null},{"url":"/paper/a-debiased-mdi-feature-importance-measure-for","slug":"a-debiased-mdi-feature-importance-measure-for","title":"A Debiased MDI Feature Importance Measure for Random Forests","date":"2019-06-26","arxiv_id":"1906.10845","repositories_listed":3,"syntology":null},{"url":"/paper/algorithm-selection-for-collaborative","slug":"algorithm-selection-for-collaborative","title":"Algorithm Selection for Collaborative Filtering: the influence of graph metafeatures and multicriteria metatargets","date":"2018-07-23","arxiv_id":"1807.09097","repositories_listed":3,"syntology":null},{"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/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/distributed-and-parallel-time-series-feature","slug":"distributed-and-parallel-time-series-feature","title":"Distributed and parallel time series feature extraction for industrial big data applications","date":"2016-10-25","arxiv_id":"1610.07717","repositories_listed":3,"syntology":null},{"url":"/paper/comparative-evaluation-of-state-of-the-art","slug":"comparative-evaluation-of-state-of-the-art","title":"Comparative evaluation of state-of-the-art algorithms for SSVEP-based BCIs","date":"2016-02-02","arxiv_id":"1602.00904","repositories_listed":3,"syntology":null},{"url":"/paper/fast-and-accurate-sentiment-classification","slug":"fast-and-accurate-sentiment-classification","title":"Fast and accurate sentiment classification using an enhanced Naive Bayes model","date":"2013-05-27","arxiv_id":"1305.6143","repositories_listed":3,"syntology":null},{"url":"/paper/graph-neural-networks-for-jamming-source","slug":"graph-neural-networks-for-jamming-source","title":"Graph Neural Networks for Jamming Source Localization","date":"2025-06-01","arxiv_id":"2506.03196","repositories_listed":2,"syntology":null},{"url":"/paper/feature-selection-gates-with-gradient-routing","slug":"feature-selection-gates-with-gradient-routing","title":"Feature Selection Gates with Gradient Routing for Endoscopic Image Computing","date":"2024-10-07","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/relchanet-neural-network-feature-selection","slug":"relchanet-neural-network-feature-selection","title":"EntryPrune: Neural Network Feature Selection using First Impressions","date":"2024-10-03","arxiv_id":"2410.02344","repositories_listed":2,"syntology":null},{"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":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"4 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; 4 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":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/time-series-classification-with-random","slug":"time-series-classification-with-random","title":"Time series classification with random convolution kernels based transforms: pooling operators and input representations matter","date":"2024-09-02","arxiv_id":"2409.01115","repositories_listed":2,"syntology":null},{"url":"/paper/reproduction-of-ivfs-algorithm-for-high","slug":"reproduction-of-ivfs-algorithm-for-high","title":"Reproduction of IVFS algorithm for high-dimensional topology preservation feature selection","date":"2024-08-23","arxiv_id":"2409.12195","repositories_listed":2,"syntology":null},{"url":"/paper/ctrsvdd-a-benchmark-dataset-and-baseline","slug":"ctrsvdd-a-benchmark-dataset-and-baseline","title":"CtrSVDD: A Benchmark Dataset and Baseline Analysis for Controlled Singing Voice Deepfake Detection","date":"2024-06-04","arxiv_id":"2406.02438","repositories_listed":2,"syntology":null},{"url":"/paper/unveiling-hidden-factors-explainable-ai-for","slug":"unveiling-hidden-factors-explainable-ai-for","title":"Unveiling Hidden Factors: Explainable AI for Feature Boosting in Speech Emotion Recognition","date":"2024-06-01","arxiv_id":"2406.01624","repositories_listed":2,"syntology":null},{"url":"/paper/peach-pretrained-embedding-explanation-across","slug":"peach-pretrained-embedding-explanation-across","title":"PEACH: Pretrained-embedding Explanation Across Contextual and Hierarchical Structure","date":"2024-04-21","arxiv_id":"2404.13645","repositories_listed":2,"syntology":null},{"url":"/paper/integrated-path-stability-selection","slug":"integrated-path-stability-selection","title":"Integrated path stability selection","date":"2024-03-23","arxiv_id":"2403.15877","repositories_listed":2,"syntology":null},{"url":"/paper/erase-benchmarking-feature-selection-methods","slug":"erase-benchmarking-feature-selection-methods","title":"ERASE: Benchmarking Feature Selection Methods for Deep Recommender Systems","date":"2024-03-19","arxiv_id":"2403.12660","repositories_listed":2,"syntology":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/iotgem-generalizable-models-for-behaviour","slug":"iotgem-generalizable-models-for-behaviour","title":"IoTGeM: Generalizable Models for Behaviour-Based IoT Attack Detection","date":"2023-10-17","arxiv_id":"2401.01343","repositories_listed":2,"syntology":null},{"url":"/paper/exiffi-and-eif-interpretability-and-enhanced","slug":"exiffi-and-eif-interpretability-and-enhanced","title":"Enhancing Interpretability and Generalizability in Extended Isolation Forests","date":"2023-10-09","arxiv_id":"2310.05468","repositories_listed":2,"syntology":null},{"url":"/paper/p-rocket-pruning-random-convolution-kernels","slug":"p-rocket-pruning-random-convolution-kernels","title":"POCKET: Pruning Random Convolution Kernels for Time Series Classification from a Feature Selection Perspective","date":"2023-09-15","arxiv_id":"2309.08499","repositories_listed":2,"syntology":null},{"url":"/paper/cognitive-evolutionary-search-to-select","slug":"cognitive-evolutionary-search-to-select","title":"Cognitive Evolutionary Search to Select Feature Interactions for Click-Through Rate Prediction","date":"2023-08-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/learning-active-subspaces-and-discovering","slug":"learning-active-subspaces-and-discovering","title":"Learning Active Subspaces and Discovering Important Features with Gaussian Radial Basis Functions Neural Networks","date":"2023-07-11","arxiv_id":"2307.05639","repositories_listed":2,"syntology":null},{"url":"/paper/finding-the-pillars-of-strength-for-multi","slug":"finding-the-pillars-of-strength-for-multi","title":"Finding the Pillars of Strength for Multi-Head Attention","date":"2023-05-22","arxiv_id":"2305.14380","repositories_listed":2,"syntology":null},{"url":"/paper/bayesian-optimization-of-catalysts-with-in","slug":"bayesian-optimization-of-catalysts-with-in","title":"Bayesian Optimization of Catalysis With In-Context Learning","date":"2023-04-11","arxiv_id":"2304.05341","repositories_listed":2,"syntology":null},{"url":"/paper/fasten-an-efficient-adaptive-method-for","slug":"fasten-an-efficient-adaptive-method-for","title":"FAStEN: An Efficient Adaptive Method for Feature Selection and Estimation in High-Dimensional Functional Regressions","date":"2023-03-26","arxiv_id":"2303.14801","repositories_listed":2,"syntology":null},{"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":7,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"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) · 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":7,"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":0,"n_instrument":6,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"6 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; 6 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":0,"n_unverified":1,"ran_from_kinds":["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/transposed-variational-auto-encoder-with","slug":"transposed-variational-auto-encoder-with","title":"Transposed Variational Auto-encoder with Intrinsic Feature Learning for Traffic Forecasting","date":"2022-10-30","arxiv_id":"2211.00641","repositories_listed":2,"syntology":null},{"url":"/paper/coordinate-descent-for-slope","slug":"coordinate-descent-for-slope","title":"Coordinate Descent for SLOPE","date":"2022-10-26","arxiv_id":"2210.14780","repositories_listed":2,"syntology":null},{"url":"/paper/easyrec-an-easy-to-use-extendable-and","slug":"easyrec-an-easy-to-use-extendable-and","title":"EasyRec: An easy-to-use, extendable and efficient framework for building industrial recommendation systems","date":"2022-09-26","arxiv_id":"2209.12766","repositories_listed":2,"syntology":null},{"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":10,"n_instrument":1,"n_unverified":3,"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) · 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":2,"n_unverified":3,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/omicselector-automatic-feature-selection-and","slug":"omicselector-automatic-feature-selection-and","title":"OmicSelector: automatic feature selection and deep learning modeling for omic experiments","date":"2022-06-02","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/designing-the-topology-of-graph-neural","slug":"designing-the-topology-of-graph-neural","title":"Designing the Topology of Graph Neural Networks: A Novel Feature Fusion Perspective","date":"2021-12-29","arxiv_id":"2112.14531","repositories_listed":2,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/designing-the-topology-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2112.14531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14531"}},"official":{"repos":["automl-research/f2gnn"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/a-hybrid-ensemble-feature-selection-design","slug":"a-hybrid-ensemble-feature-selection-design","title":"A Hybrid Ensemble Feature Selection Design for Candidate Biomarkers Discovery from Transcriptome Profiles","date":"2021-07-31","arxiv_id":"2108.00290","repositories_listed":2,"syntology":null},{"url":"/paper/canonical-correlation-based-fast-feature","slug":"canonical-correlation-based-fast-feature","title":"Canonical-Correlation-Based Fast Feature Selection for Structural Health Monitoring","date":"2021-06-15","arxiv_id":"2106.08247","repositories_listed":2,"syntology":null},{"url":"/paper/paying-attention-to-astronomical-transients","slug":"paying-attention-to-astronomical-transients","title":"Paying Attention to Astronomical Transients: Introducing the Time-series Transformer for Photometric Classification","date":"2021-05-13","arxiv_id":"2105.06178","repositories_listed":2,"syntology":null},{"url":"/paper/a-user-guided-bayesian-framework-for-ensemble","slug":"a-user-guided-bayesian-framework-for-ensemble","title":"A User-Guided Bayesian Framework for Ensemble Feature Selection in Life Science Applications (UBayFS)","date":"2021-04-30","arxiv_id":"2104.14787","repositories_listed":2,"syntology":null},{"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/iotdevid-a-behaviour-based-fingerprinting","slug":"iotdevid-a-behaviour-based-fingerprinting","title":"IoTDevID: A Behavior-Based Device Identification Method for the IoT","date":"2021-02-17","arxiv_id":"2102.08866","repositories_listed":2,"syntology":null},{"url":"/paper/cifs-improving-adversarial-robustness-of-cnns","slug":"cifs-improving-adversarial-robustness-of-cnns","title":"CIFS: Improving Adversarial Robustness of CNNs via Channel-wise Importance-based Feature Selection","date":"2021-02-10","arxiv_id":"2102.05311","repositories_listed":2,"syntology":null},{"url":"/paper/classification-of-als-patients-based-on","slug":"classification-of-als-patients-based-on","title":"Classification of ALS patients based on acoustic analysis of sustained vowel phonations","date":"2020-12-14","arxiv_id":"2012.07347","repositories_listed":2,"syntology":null},{"url":"/paper/sequential-estimation-of-nonparametric","slug":"sequential-estimation-of-nonparametric","title":"Sequential estimation of Spearman rank correlation using Hermite series estimators","date":"2020-12-11","arxiv_id":"2012.06287","repositories_listed":2,"syntology":null},{"url":"/paper/quick-and-robust-feature-selection-the","slug":"quick-and-robust-feature-selection-the","title":"Quick and Robust Feature Selection: the Strength of Energy-efficient Sparse Training for Autoencoders","date":"2020-12-01","arxiv_id":"2012.00560","repositories_listed":2,"syntology":null},{"url":"/paper/rent-repeated-elastic-net-technique-for","slug":"rent-repeated-elastic-net-technique-for","title":"RENT -- Repeated Elastic Net Technique for Feature Selection","date":"2020-09-27","arxiv_id":"2009.12780","repositories_listed":2,"syntology":null},{"url":"/paper/supervised-multi-topology-network-cross","slug":"supervised-multi-topology-network-cross","title":"Supervised Multi-topology Network Cross-diffusion for Population-driven Brain Network Atlas Estimation","date":"2020-09-23","arxiv_id":"2009.11054","repositories_listed":2,"syntology":null},{"url":"/paper/a-rigorous-machine-learning-analysis-pipeline","slug":"a-rigorous-machine-learning-analysis-pipeline","title":"A Rigorous Machine Learning Analysis Pipeline for Biomedical Binary Classification: Application in Pancreatic Cancer Nested Case-control Studies with Implications for Bias Assessments","date":"2020-08-28","arxiv_id":"2008.12829","repositories_listed":2,"syntology":null},{"url":"/paper/vaem-a-deep-generative-model-for","slug":"vaem-a-deep-generative-model-for","title":"VAEM: a Deep Generative Model for Heterogeneous Mixed Type Data","date":"2020-06-21","arxiv_id":"2006.11941","repositories_listed":2,"syntology":null},{"url":"/paper/nonparametric-feature-impact-and-importance","slug":"nonparametric-feature-impact-and-importance","title":"Nonparametric Feature Impact and Importance","date":"2020-06-08","arxiv_id":"2006.04750","repositories_listed":2,"syntology":null},{"url":"/paper/a-random-forest-based-computational-model-for","slug":"a-random-forest-based-computational-model-for","title":"A random forest based computational model for predicting novel lncRNA-disease associations","date":"2020-03-27","arxiv_id":null,"repositories_listed":2,"syntology":null},{"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/cyber-attack-detection-thanks-to-machine","slug":"cyber-attack-detection-thanks-to-machine","title":"Cyber Attack Detection thanks to Machine Learning Algorithms","date":"2020-01-17","arxiv_id":"2001.06309","repositories_listed":2,"syntology":null},{"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/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/covariance-free-partial-least-squares-an","slug":"covariance-free-partial-least-squares-an","title":"Covariance-free Partial Least Squares: An Incremental Dimensionality Reduction Method","date":"2019-10-05","arxiv_id":"1910.02319","repositories_listed":2,"syntology":null},{"url":"/paper/can-i-trust-the-explainer-verifying-post-hoc-1","slug":"can-i-trust-the-explainer-verifying-post-hoc-1","title":"Can I Trust the Explainer? Verifying Post-hoc Explanatory Methods","date":"2019-10-04","arxiv_id":"1910.02065","repositories_listed":2,"syntology":null},{"url":"/paper/maximum-relevance-and-minimum-redundancy","slug":"maximum-relevance-and-minimum-redundancy","title":"Maximum Relevance and Minimum Redundancy Feature Selection Methods for a Marketing Machine Learning Platform","date":"2019-08-15","arxiv_id":"1908.05376","repositories_listed":2,"syntology":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/efficient-forward-architecture-search","slug":"efficient-forward-architecture-search","title":"Efficient Forward Architecture Search","date":"2019-05-31","arxiv_id":"1905.13360","repositories_listed":2,"syntology":null},{"url":"/paper/texture-selection-for-automatic-music-genre","slug":"texture-selection-for-automatic-music-genre","title":"Texture Selection for Automatic Music Genre Classification","date":"2019-05-28","arxiv_id":"1905.11959","repositories_listed":2,"syntology":null},{"url":"/paper/feature-selection-and-feature-extraction-in","slug":"feature-selection-and-feature-extraction-in","title":"Feature Selection and Feature Extraction in Pattern Analysis: A Literature Review","date":"2019-05-07","arxiv_id":"1905.02845","repositories_listed":2,"syntology":null},{"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/political-text-scaling-meets-computational","slug":"political-text-scaling-meets-computational","title":"Political Text Scaling Meets Computational Semantics","date":"2019-04-12","arxiv_id":"1904.06217","repositories_listed":2,"syntology":null},{"url":"/paper/190405675","slug":"190405675","title":"Beyond the Nucleus: Cytoplasmic Dominance in Follicular Thyroid Carcinoma Detection Using Single-Cell Raman Imaging Across Multiple Devices","date":"2019-04-11","arxiv_id":"1904.05675","repositories_listed":2,"syntology":null},{"url":"/paper/a-feature-selection-based-on-perturbation","slug":"a-feature-selection-based-on-perturbation","title":"A Feature Selection Based on Perturbation Theory","date":"2019-02-26","arxiv_id":"1902.09938","repositories_listed":2,"syntology":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/immigrate-a-margin-based-feature-selection","slug":"immigrate-a-margin-based-feature-selection","title":"IMMIGRATE: A Margin-based Feature Selection Method with Interaction Terms","date":"2018-10-05","arxiv_id":"1810.02658","repositories_listed":2,"syntology":null},{"url":"/paper/model-agnostic-supervised-local-explanations","slug":"model-agnostic-supervised-local-explanations","title":"Model Agnostic Supervised Local Explanations","date":"2018-07-09","arxiv_id":"1807.02910","repositories_listed":2,"syntology":null},{"url":"/paper/how-important-is-a-neuron","slug":"how-important-is-a-neuron","title":"How Important Is a Neuron?","date":"2018-05-30","arxiv_id":"1805.12233","repositories_listed":2,"syntology":null},{"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/benchmarking-relief-based-feature-selection","slug":"benchmarking-relief-based-feature-selection","title":"Benchmarking Relief-Based Feature Selection Methods for Bioinformatics Data Mining","date":"2017-11-22","arxiv_id":"1711.08477","repositories_listed":2,"syntology":null},{"url":"/paper/decision-stream-cultivating-deep-decision","slug":"decision-stream-cultivating-deep-decision","title":"Decision Stream: Cultivating Deep Decision Trees","date":"2017-04-25","arxiv_id":"1704.07657","repositories_listed":2,"syntology":null},{"url":"/paper/auditing-black-box-models-for-indirect","slug":"auditing-black-box-models-for-indirect","title":"Auditing Black-box Models for Indirect Influence","date":"2016-02-23","arxiv_id":"1602.07043","repositories_listed":2,"syntology":null},{"url":"/paper/feature-selection-a-data-perspective","slug":"feature-selection-a-data-perspective","title":"Feature Selection: A Data Perspective","date":"2016-01-29","arxiv_id":"1601.07996","repositories_listed":2,"syntology":null},{"url":"/paper/interpretable-bayesian-tensor-network-kernel","slug":"interpretable-bayesian-tensor-network-kernel","title":"Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection","date":"2025-07-15","arxiv_id":"2507.11136","repositories_listed":1,"syntology":null},{"url":"/paper/malware-classification-leveraging-nlp-machine","slug":"malware-classification-leveraging-nlp-machine","title":"Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy","date":"2025-06-19","arxiv_id":"2506.16224","repositories_listed":1,"syntology":null},{"url":"/paper/simple-is-what-you-need-for-efficient-and","slug":"simple-is-what-you-need-for-efficient-and","title":"Simple is what you need for efficient and accurate medical image segmentation","date":"2025-06-16","arxiv_id":"2506.13415","repositories_listed":1,"syntology":null},{"url":"/paper/permutation-free-high-order-interaction-tests","slug":"permutation-free-high-order-interaction-tests","title":"Permutation-Free High-Order Interaction Tests","date":"2025-06-06","arxiv_id":"2506.05963","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-unsupervised-feature-selection-via","slug":"scalable-unsupervised-feature-selection-via","title":"Scalable unsupervised feature selection via weight stability","date":"2025-06-06","arxiv_id":"2506.06114","repositories_listed":1,"syntology":null}],"syntology_records":25,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":85,"papers_where_code_ran_first_page":"/task/feature-selection/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":30,"url":"/task/feature-selection/papers/2","json":"/task/feature-selection/papers/2.json","rows":100},{"order":"archive","page":3,"of":30,"url":"/task/feature-selection/papers/3","json":"/task/feature-selection/papers/3.json","rows":100},{"order":"archive","page":4,"of":30,"url":"/task/feature-selection/papers/4","json":"/task/feature-selection/papers/4.json","rows":100},{"order":"archive","page":5,"of":30,"url":"/task/feature-selection/papers/5","json":"/task/feature-selection/papers/5.json","rows":100},{"order":"archive","page":6,"of":30,"url":"/task/feature-selection/papers/6","json":"/task/feature-selection/papers/6.json","rows":100},{"order":"archive","page":7,"of":30,"url":"/task/feature-selection/papers/7","json":"/task/feature-selection/papers/7.json","rows":100},{"order":"archive","page":8,"of":30,"url":"/task/feature-selection/papers/8","json":"/task/feature-selection/papers/8.json","rows":100},{"order":"archive","page":9,"of":30,"url":"/task/feature-selection/papers/9","json":"/task/feature-selection/papers/9.json","rows":100},{"order":"archive","page":10,"of":30,"url":"/task/feature-selection/papers/10","json":"/task/feature-selection/papers/10.json","rows":100},{"order":"archive","page":11,"of":30,"url":"/task/feature-selection/papers/11","json":"/task/feature-selection/papers/11.json","rows":100},{"order":"archive","page":12,"of":30,"url":"/task/feature-selection/papers/12","json":"/task/feature-selection/papers/12.json","rows":100},{"order":"archive","page":13,"of":30,"url":"/task/feature-selection/papers/13","json":"/task/feature-selection/papers/13.json","rows":100},{"order":"archive","page":14,"of":30,"url":"/task/feature-selection/papers/14","json":"/task/feature-selection/papers/14.json","rows":100},{"order":"archive","page":15,"of":30,"url":"/task/feature-selection/papers/15","json":"/task/feature-selection/papers/15.json","rows":100},{"order":"archive","page":16,"of":30,"url":"/task/feature-selection/papers/16","json":"/task/feature-selection/papers/16.json","rows":100},{"order":"archive","page":17,"of":30,"url":"/task/feature-selection/papers/17","json":"/task/feature-selection/papers/17.json","rows":100},{"order":"archive","page":18,"of":30,"url":"/task/feature-selection/papers/18","json":"/task/feature-selection/papers/18.json","rows":100},{"order":"archive","page":19,"of":30,"url":"/task/feature-selection/papers/19","json":"/task/feature-selection/papers/19.json","rows":100},{"order":"archive","page":20,"of":30,"url":"/task/feature-selection/papers/20","json":"/task/feature-selection/papers/20.json","rows":100},{"order":"archive","page":21,"of":30,"url":"/task/feature-selection/papers/21","json":"/task/feature-selection/papers/21.json","rows":100},{"order":"archive","page":22,"of":30,"url":"/task/feature-selection/papers/22","json":"/task/feature-selection/papers/22.json","rows":100},{"order":"archive","page":23,"of":30,"url":"/task/feature-selection/papers/23","json":"/task/feature-selection/papers/23.json","rows":100},{"order":"archive","page":24,"of":30,"url":"/task/feature-selection/papers/24","json":"/task/feature-selection/papers/24.json","rows":100},{"order":"archive","page":25,"of":30,"url":"/task/feature-selection/papers/25","json":"/task/feature-selection/papers/25.json","rows":100},{"order":"archive","page":26,"of":30,"url":"/task/feature-selection/papers/26","json":"/task/feature-selection/papers/26.json","rows":100},{"order":"archive","page":27,"of":30,"url":"/task/feature-selection/papers/27","json":"/task/feature-selection/papers/27.json","rows":100},{"order":"archive","page":28,"of":30,"url":"/task/feature-selection/papers/28","json":"/task/feature-selection/papers/28.json","rows":100},{"order":"archive","page":29,"of":30,"url":"/task/feature-selection/papers/29","json":"/task/feature-selection/papers/29.json","rows":100},{"order":"archive","page":30,"of":30,"url":"/task/feature-selection/papers/30","json":"/task/feature-selection/papers/30.json","rows":71},{"order":"ran","page":1,"of":1,"url":"/task/feature-selection/papers/ran/1","json":"/task/feature-selection/papers/ran/1.json","rows":85}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"efe115804ad9072d976e098535ad0a731e420db82c84bec4c6d201a3fc3ad7d6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}