{"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/5","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":5,"pages_in_order":30,"rows_per_page":100,"rows":[401,500],"of":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":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","prev":"/task/feature-selection/papers/4","next":"/task/feature-selection/papers/6","papers":[{"url":"/paper/novel-optimized-crow-search-algorithm-for","slug":"novel-optimized-crow-search-algorithm-for","title":"Novel optimized crow search algorithm for feature selection","date":"2022-04-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/standardized-evaluation-of-machine-learning","slug":"standardized-evaluation-of-machine-learning","title":"Standardized Evaluation of Machine Learning Methods for Evolving Data Streams","date":"2022-04-28","arxiv_id":"2204.13625","repositories_listed":1,"syntology":null},{"url":"/paper/autofield-automating-feature-selection-in","slug":"autofield-automating-feature-selection-in","title":"AutoField: Automating Feature Selection in Deep Recommender Systems","date":"2022-04-19","arxiv_id":"2204.09078","repositories_listed":1,"syntology":null},{"url":"/paper/joint-multi-view-unsupervised-feature","slug":"joint-multi-view-unsupervised-feature","title":"Joint Multi-view Unsupervised Feature Selection and Graph Learning","date":"2022-04-18","arxiv_id":"2204.08247","repositories_listed":1,"syntology":null},{"url":"/paper/sdgcca-supervised-deep-generalized-canonical","slug":"sdgcca-supervised-deep-generalized-canonical","title":"SDGCCA: Supervised Deep Generalized Canonical Correlation Analysis for Multi-omics Integration","date":"2022-04-17","arxiv_id":"2204.09045","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-based-feature-selection-to","slug":"correlation-based-feature-selection-to","title":"Correlation-based feature selection to identify functional dynamics in proteins","date":"2022-04-06","arxiv_id":"2204.02770","repositories_listed":1,"syntology":null},{"url":"/paper/feature-robustness-and-sex-differences-in","slug":"feature-robustness-and-sex-differences-in","title":"Feature robustness and sex differences in medical imaging: a case study in MRI-based Alzheimer's disease detection","date":"2022-04-04","arxiv_id":"2204.01737","repositories_listed":1,"syntology":null},{"url":"/paper/taking-rocket-on-an-efficiency-mission","slug":"taking-rocket-on-an-efficiency-mission","title":"Taking ROCKET on an Efficiency Mission: Multivariate Time Series Classification with LightWaveS","date":"2022-04-04","arxiv_id":"2204.01379","repositories_listed":1,"syntology":null},{"url":"/paper/i-razor-a-neural-input-razor-for-feature","slug":"i-razor-a-neural-input-razor-for-feature","title":"i-Razor: A Differentiable Neural Input Razor for Feature Selection and Dimension Search in DNN-Based Recommender Systems","date":"2022-04-01","arxiv_id":"2204.00281","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-feature-selection","slug":"quantum-feature-selection","title":"Feature Selection on Quantum Computers","date":"2022-03-24","arxiv_id":"2203.13261","repositories_listed":1,"syntology":null},{"url":"/paper/reccover-detecting-causal-confusion-for","slug":"reccover-detecting-causal-confusion-for","title":"ReCCoVER: Detecting Causal Confusion for Explainable Reinforcement Learning","date":"2022-03-21","arxiv_id":"2203.11211","repositories_listed":1,"syntology":null},{"url":"/paper/auco-resnet-an-end-to-end-network-for-covid","slug":"auco-resnet-an-end-to-end-network-for-covid","title":"AUCO ResNet: an end-to-end network for Covid-19 pre-screening from cough and breath","date":"2022-03-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/an-effective-way-for-cross-market","slug":"an-effective-way-for-cross-market","title":"An Effective Way for Cross-Market Recommendation with Hybrid Pre-Ranking and Ranking Models","date":"2022-03-02","arxiv_id":"2203.00897","repositories_listed":1,"syntology":null},{"url":"/paper/evoprunedeeptl-an-evolutionary-pruning-model","slug":"evoprunedeeptl-an-evolutionary-pruning-model","title":"EvoPruneDeepTL: An Evolutionary Pruning Model for Transfer Learning based Deep Neural Networks","date":"2022-02-08","arxiv_id":"2202.03844","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-with-maximal-relevance-and","slug":"feature-selection-with-maximal-relevance-and","title":"Feature Selection With Maximal Relevance and Minimal Supervised Redundancy","date":"2022-02-07","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-and-selective-hidden-embeddings","slug":"contrastive-and-selective-hidden-embeddings","title":"Contrastive and Selective Hidden Embeddings for Medical Image Segmentation","date":"2022-01-21","arxiv_id":"2201.08779","repositories_listed":1,"syntology":null},{"url":"/paper/synthetic-aperture-imaging-with-events-and","slug":"synthetic-aperture-imaging-with-events-and","title":"Synthetic Aperture Imaging With Events and Frames","date":"2022-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/shrimp-sparser-random-feature-models-via","slug":"shrimp-sparser-random-feature-models-via","title":"SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning","date":"2021-12-07","arxiv_id":"2112.04002","repositories_listed":1,"syntology":null},{"url":"/paper/lightweight-attentional-feature-fusion-for","slug":"lightweight-attentional-feature-fusion-for","title":"Lightweight Attentional Feature Fusion: A New Baseline for Text-to-Video Retrieval","date":"2021-12-03","arxiv_id":"2112.01832","repositories_listed":1,"syntology":null},{"url":"/paper/improving-random-walk-rankings-with-feature","slug":"improving-random-walk-rankings-with-feature","title":"Improving random walk rankings with feature selection and imputation","date":"2021-11-29","arxiv_id":"2111.15635","repositories_listed":1,"syntology":null},{"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/gmsrf-net-an-improved-generalizability-with","slug":"gmsrf-net-an-improved-generalizability-with","title":"GMSRF-Net: An improved generalizability with global multi-scale residual fusion network for polyp segmentation","date":"2021-11-20","arxiv_id":"2111.10614","repositories_listed":1,"syntology":null},{"url":"/paper/inter-domain-fusion-for-enhanced-intrusion","slug":"inter-domain-fusion-for-enhanced-intrusion","title":"Inter-Domain Fusion for Enhanced Intrusion Detection in Power Systems: An Evidence Theoretic and Meta-Heuristic Approach","date":"2021-11-20","arxiv_id":"2111.10484","repositories_listed":1,"syntology":null},{"url":"/paper/surrogate-assisted-genetic-algorithm-for","slug":"surrogate-assisted-genetic-algorithm-for","title":"Surrogate-Assisted Genetic Algorithm for Wrapper Feature Selection","date":"2021-11-17","arxiv_id":"2111.09074","repositories_listed":1,"syntology":null},{"url":"/paper/simplifying-approach-to-node-classification","slug":"simplifying-approach-to-node-classification","title":"Simplifying approach to Node Classification in Graph Neural Networks","date":"2021-11-12","arxiv_id":"2111.06748","repositories_listed":1,"syntology":null},{"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/why-stable-learning-works-a-theory-of","slug":"why-stable-learning-works-a-theory-of","title":"A Theoretical Analysis on Independence-driven Importance Weighting for Covariate-shift Generalization","date":"2021-11-03","arxiv_id":"2111.02355","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/why-stable-learning-works-a-theory-of#ran","syntology_url":"https://syntology.ai/paper/2111.02355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02355"}},"official":{"repos":["windxrz/independence-driven-iw"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/learning-generative-models-for-valid","slug":"learning-generative-models-for-valid","title":"Multivariate rank via entropic optimal transport: sample efficiency and generative modeling","date":"2021-10-29","arxiv_id":"2111.00043","repositories_listed":1,"syntology":null},{"url":"/paper/a-self-adaptive-weighted-differential","slug":"a-self-adaptive-weighted-differential","title":"A Self-adaptive Weighted Differential Evolution Approach for Large-scale Feature Selection","date":"2021-10-27","arxiv_id":"2110.14166","repositories_listed":1,"syntology":null},{"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/identifying-stroke-indicators-using-rough","slug":"identifying-stroke-indicators-using-rough","title":"Identifying Stroke Indicators Using Rough Sets","date":"2021-10-19","arxiv_id":"2110.10152","repositories_listed":1,"syntology":null},{"url":"/paper/result-diversification-by-multi-objective","slug":"result-diversification-by-multi-objective","title":"Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees","date":"2021-10-18","arxiv_id":"2110.09332","repositories_listed":1,"syntology":null},{"url":"/paper/robust-representation-and-efficient-feature","slug":"robust-representation-and-efficient-feature","title":"Robust Representation and Efficient Feature Selection Allows for Effective Clustering of SARS-CoV-2 Variants","date":"2021-10-18","arxiv_id":"2110.09622","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-genetic-programming-using-gpus","slug":"accelerating-genetic-programming-using-gpus","title":"Accelerating Genetic Programming using GPUs","date":"2021-10-15","arxiv_id":"2110.11226","repositories_listed":1,"syntology":null},{"url":"/paper/fold-r-a-toolset-for-automated-inductive","slug":"fold-r-a-toolset-for-automated-inductive","title":"FOLD-R++: A Scalable Toolset for Automated Inductive Learning of Default Theories from Mixed Data","date":"2021-10-15","arxiv_id":"2110.07843","repositories_listed":1,"syntology":null},{"url":"/paper/deep-unsupervised-feature-selection-by","slug":"deep-unsupervised-feature-selection-by","title":"Deep Unsupervised Feature Selection by Discarding Nuisance and Correlated Features","date":"2021-10-11","arxiv_id":"2110.05306","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-for-recommender-systems","slug":"feature-selection-for-recommender-systems","title":"Feature Selection for Recommender Systems with Quantum Computing","date":"2021-10-11","arxiv_id":"2110.05089","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-on-a-flare-forecasting","slug":"feature-selection-on-a-flare-forecasting","title":"Feature Selection on a Flare Forecasting Testbed: A Comparative Study of 24 Methods","date":"2021-09-30","arxiv_id":"2109.14770","repositories_listed":1,"syntology":null},{"url":"/paper/deep-neural-networks-with-controlled-variable","slug":"deep-neural-networks-with-controlled-variable","title":"Deep neural networks with controlled variable selection for the identification of putative causal genetic variants","date":"2021-09-29","arxiv_id":"2109.14719","repositories_listed":1,"syntology":null},{"url":"/paper/non-stationary-gaussian-process-discriminant","slug":"non-stationary-gaussian-process-discriminant","title":"Non-stationary Gaussian process discriminant analysis with variable selection for high-dimensional functional data","date":"2021-09-29","arxiv_id":"2109.14171","repositories_listed":1,"syntology":null},{"url":"/paper/real-time-multi-level-neonatal-heart-and-lung","slug":"real-time-multi-level-neonatal-heart-and-lung","title":"Real-Time Multi-Level Neonatal Heart and Lung Sound Quality Assessment for Telehealth Applications","date":"2021-09-29","arxiv_id":"2109.15127","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-scale-adaptive-networks-for","slug":"structure-aware-scale-adaptive-networks-for","title":"Structure-aware scale-adaptive networks for cancer segmentation in whole-slide images","date":"2021-09-26","arxiv_id":"2109.12617","repositories_listed":1,"syntology":null},{"url":"/paper/patron-exploring-respiratory-signal-derived","slug":"patron-exploring-respiratory-signal-derived","title":"PATRON: Exploring respiratory signal derived from non-contact face videos for face anti-spoofing","date":"2021-09-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-model-agnostic-random-subspace","slug":"optimizing-model-agnostic-random-subspace","title":"Optimizing model-agnostic Random Subspace ensembles","date":"2021-09-07","arxiv_id":"2109.03099","repositories_listed":1,"syntology":null},{"url":"/paper/mrsqm-fast-time-series-classification-with","slug":"mrsqm-fast-time-series-classification-with","title":"MrSQM: Fast Time Series Classification with Symbolic Representations","date":"2021-09-02","arxiv_id":"2109.01036","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-sentence-level-end-to-end-speech","slug":"beyond-sentence-level-end-to-end-speech","title":"Beyond Sentence-Level End-to-End Speech Translation: Context Helps","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/combining-machine-learning-classifiers-for","slug":"combining-machine-learning-classifiers-for","title":"Combining Machine Learning Classifiers for Stock Trading with Effective Feature Extraction","date":"2021-07-28","arxiv_id":"2107.13148","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-in-information-criteria","slug":"transfer-learning-in-information-criteria","title":"Transfer Learning in Information Criteria-based Feature Selection","date":"2021-07-06","arxiv_id":"2107.02847","repositories_listed":1,"syntology":null},{"url":"/paper/controlburn-feature-selection-by-sparse","slug":"controlburn-feature-selection-by-sparse","title":"ControlBurn: Feature Selection by Sparse Forests","date":"2021-07-01","arxiv_id":"2107.00219","repositories_listed":1,"syntology":null},{"url":"/paper/feature-grouping-and-sparse-principal","slug":"feature-grouping-and-sparse-principal","title":"Feature Grouping and Sparse Principal Component Analysis with Truncated Regularization","date":"2021-06-25","arxiv_id":"2106.13685","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-dictionary-learning-for-unsupervised","slug":"low-rank-dictionary-learning-for-unsupervised","title":"Low-rank Dictionary Learning for Unsupervised Feature Selection","date":"2021-06-21","arxiv_id":"2106.11102","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-bayesian-learning-via-stepwise","slug":"sparse-bayesian-learning-via-stepwise","title":"Sparse Bayesian Learning via Stepwise Regression","date":"2021-06-11","arxiv_id":"2106.06095","repositories_listed":1,"syntology":null},{"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/cervical-cytology-classification-using-pca","slug":"cervical-cytology-classification-using-pca","title":"Cervical Cytology Classification Using PCA & GWO Enhanced Deep Features Selection","date":"2021-06-09","arxiv_id":"2106.04919","repositories_listed":1,"syntology":null},{"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/sirius-a-mutual-information-tool-for","slug":"sirius-a-mutual-information-tool-for","title":"Sirius: Visualization of Mixed Features as a Mutual Information Network Graph","date":"2021-06-09","arxiv_id":"2106.05260","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-meta-feature-selection-for-the","slug":"evaluating-meta-feature-selection-for-the","title":"Evaluating Meta-Feature Selection for the Algorithm Recommendation Problem","date":"2021-06-07","arxiv_id":"2106.03954","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-the-robustness-of-nmf-algorithms","slug":"analysis-of-the-robustness-of-nmf-algorithms","title":"Analysis of the robustness of NMF algorithms","date":"2021-06-04","arxiv_id":"2106.02213","repositories_listed":1,"syntology":null},{"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/hyperspectral-band-selection-for","slug":"hyperspectral-band-selection-for","title":"Hyperspectral Band Selection for Multispectral Image Classification with Convolutional Networks","date":"2021-06-01","arxiv_id":"2106.00645","repositories_listed":1,"syntology":null},{"url":"/paper/bounded-logit-attention-learning-to-explain","slug":"bounded-logit-attention-learning-to-explain","title":"Bounded logit attention: Learning to explain image classifiers","date":"2021-05-31","arxiv_id":"2105.14824","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-neural-networks-with-simple","slug":"improving-graph-neural-networks-with-simple","title":"Improving Graph Neural Networks with Simple Architecture Design","date":"2021-05-17","arxiv_id":"2105.07634","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-projection-neural-network-for","slug":"an-efficient-projection-neural-network-for","title":"An efficient projection neural network for $\\ell_1$-regularized logistic regression","date":"2021-05-12","arxiv_id":"2105.05449","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-invase-enhanced-breast","slug":"uncertainty-aware-invase-enhanced-breast","title":"Uncertainty-aware INVASE: Enhanced Breast Cancer Diagnosis Feature Selection","date":"2021-05-04","arxiv_id":"2105.02693","repositories_listed":1,"syntology":null},{"url":"/paper/implementation-of-naive-bayes-and-gini-index","slug":"implementation-of-naive-bayes-and-gini-index","title":"Implementation of Naïve Bayes and Gini Index for Spam Email Classification","date":"2021-05-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-mutual-information-gradient","slug":"stochastic-mutual-information-gradient","title":"Stochastic Mutual Information Gradient Estimation for Dimensionality Reduction Networks","date":"2021-05-01","arxiv_id":"2105.00191","repositories_listed":1,"syntology":null},{"url":"/paper/structured-sparse-non-negative-matrix","slug":"structured-sparse-non-negative-matrix","title":"Structured Sparse Non-negative Matrix Factorization with L20-Norm for scRNA-seq Data Analysis","date":"2021-04-27","arxiv_id":"2104.13171","repositories_listed":1,"syntology":null},{"url":"/paper/instance-wise-causal-feature-selection-for","slug":"instance-wise-causal-feature-selection-for","title":"Instance-wise Causal Feature Selection for Model Interpretation","date":"2021-04-26","arxiv_id":"2104.12759","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-thermal-inertial-slam-with","slug":"graph-based-thermal-inertial-slam-with","title":"Graph-based Thermal-Inertial SLAM with Probabilistic Neural Networks","date":"2021-04-15","arxiv_id":"2104.07196","repositories_listed":1,"syntology":null},{"url":"/paper/3d-human-body-reshaping-with-anthropometric","slug":"3d-human-body-reshaping-with-anthropometric","title":"3D Human Body Reshaping with Anthropometric Modeling","date":"2021-04-05","arxiv_id":"2104.01762","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-graph-neural-network-search-from","slug":"rethinking-graph-neural-network-search-from","title":"Rethinking Graph Neural Architecture Search from Message-passing","date":"2021-03-26","arxiv_id":"2103.14282","repositories_listed":1,"syntology":null},{"url":"/paper/feature-selection-for-multivariate-time","slug":"feature-selection-for-multivariate-time","title":"Feature Selection for Multivariate Time Series via Network Pruning","date":"2021-02-11","arxiv_id":"2102.06024","repositories_listed":1,"syntology":null},{"url":"/paper/orthogonal-least-squares-based-fast-feature","slug":"orthogonal-least-squares-based-fast-feature","title":"Orthogonal Least Squares Based Fast Feature Selection for Linear Classification","date":"2021-01-21","arxiv_id":"2101.08539","repositories_listed":1,"syntology":null},{"url":"/paper/classifying-scientific-publications-with-bert","slug":"classifying-scientific-publications-with-bert","title":"Classifying Scientific Publications with BERT -- Is Self-Attention a Feature Selection Method?","date":"2021-01-20","arxiv_id":"2101.08114","repositories_listed":1,"syntology":null},{"url":"/paper/curvature-based-feature-selection-with","slug":"curvature-based-feature-selection-with","title":"Curvature-based Feature Selection with Application in Classifying Electronic Health Records","date":"2021-01-10","arxiv_id":"2101.03581","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-multilingual-transformers-for-hate","slug":"leveraging-multilingual-transformers-for-hate","title":"Leveraging Multilingual Transformers for Hate Speech Detection","date":"2021-01-08","arxiv_id":"2101.03207","repositories_listed":1,"syntology":null},{"url":"/paper/dame-flame-a-python-library-providing-fast","slug":"dame-flame-a-python-library-providing-fast","title":"dame-flame: A Python Library Providing Fast Interpretable Matching for Causal Inference","date":"2021-01-06","arxiv_id":"2101.01867","repositories_listed":1,"syntology":null},{"url":"/paper/more-powerful-and-general-selective-inference","slug":"more-powerful-and-general-selective-inference","title":"More Powerful and General Selective Inference for Stepwise Feature Selection using the Homotopy Continuation Approach","date":"2020-12-25","arxiv_id":"2012.13545","repositories_listed":1,"syntology":null},{"url":"/paper/improving-sample-and-feature-selection-with","slug":"improving-sample-and-feature-selection-with","title":"Improving Sample and Feature Selection with Principal Covariates Regression","date":"2020-12-22","arxiv_id":"2012.12253","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-preserving-unsupervised-feature","slug":"similarity-preserving-unsupervised-feature","title":"Similarity Preserving Unsupervised Feature Selection based on Sparse Learning","date":"2020-12-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/e2e-fs-an-end-to-end-feature-selection-method","slug":"e2e-fs-an-end-to-end-feature-selection-method","title":"E2E-FS: An End-to-End Feature Selection Method for Neural Networks","date":"2020-12-14","arxiv_id":"2012.07671","repositories_listed":1,"syntology":null},{"url":"/paper/active-feature-selection-for-the-mutual","slug":"active-feature-selection-for-the-mutual","title":"Active Feature Selection for the Mutual Information Criterion","date":"2020-12-13","arxiv_id":"2012.06979","repositories_listed":1,"syntology":null},{"url":"/paper/sparse-encoding-for-more-interpretable-1","slug":"sparse-encoding-for-more-interpretable-1","title":"Sparse encoding for more-interpretable feature-selecting representations in probabilistic matrix factorization","date":"2020-12-08","arxiv_id":"2012.04171","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-object-detection-in-scale","slug":"towards-better-object-detection-in-scale","title":"Towards Better Object Detection in Scale Variation with Adaptive Feature Selection","date":"2020-12-06","arxiv_id":"2012.03265","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-drifting-features","slug":"analysis-of-drifting-features","title":"Analysis of Drifting Features","date":"2020-12-01","arxiv_id":"2012.00499","repositories_listed":1,"syntology":null},{"url":"/paper/learning-feature-sparse-principal-subspace","slug":"learning-feature-sparse-principal-subspace","title":"Learning Feature Sparse Principal Subspace","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mate-plugging-in-model-awareness-to-task","slug":"mate-plugging-in-model-awareness-to-task","title":"MATE: Plugging in Model Awareness to Task Embedding for Meta Learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-framework-for-authorial-clustering-of","slug":"a-framework-for-authorial-clustering-of","title":"A Framework for Authorial Clustering of Shorter Texts in Latent Semantic Spaces","date":"2020-11-30","arxiv_id":"2011.15038","repositories_listed":1,"syntology":null},{"url":"/paper/discriminatory-expressions-to-produce","slug":"discriminatory-expressions-to-produce","title":"Discriminatory Expressions to Produce Interpretable Models in Short Documents","date":"2020-11-27","arxiv_id":"2012.02104","repositories_listed":1,"syntology":null},{"url":"/paper/debinet-debiasing-linear-models-with","slug":"debinet-debiasing-linear-models-with","title":"DebiNet: Debiasing Linear Models with Nonlinear Overparameterized Neural Networks","date":"2020-11-01","arxiv_id":"2011.00417","repositories_listed":1,"syntology":null},{"url":"/paper/bear-sketching-bfgs-algorithm-for-ultra-high","slug":"bear-sketching-bfgs-algorithm-for-ultra-high","title":"BEAR: Sketching BFGS Algorithm for Ultra-High Dimensional Feature Selection in Sublinear Memory","date":"2020-10-26","arxiv_id":"2010.13829","repositories_listed":1,"syntology":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/factorization-machines-with-regularization","slug":"factorization-machines-with-regularization","title":"Factorization Machines with Regularization for Sparse Feature Interactions","date":"2020-10-19","arxiv_id":"2010.09225","repositories_listed":1,"syntology":null},{"url":"/paper/fractal-autoencoders-for-feature-selection","slug":"fractal-autoencoders-for-feature-selection","title":"Fractal Autoencoders for Feature Selection","date":"2020-10-19","arxiv_id":"2010.09430","repositories_listed":1,"syntology":null},{"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/adaptive-feature-selection-for-end-to-end","slug":"adaptive-feature-selection-for-end-to-end","title":"Adaptive Feature Selection for End-to-End Speech Translation","date":"2020-10-16","arxiv_id":"2010.08518","repositories_listed":1,"syntology":null},{"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/on-feature-selection-using-anisotropic","slug":"on-feature-selection-using-anisotropic","title":"On Feature Selection Using Anisotropic General Regression Neural Network","date":"2020-10-12","arxiv_id":"2010.05744","repositories_listed":1,"syntology":null},{"url":"/paper/nonnegative-spectral-analysis-with-adaptive","slug":"nonnegative-spectral-analysis-with-adaptive","title":"Joint Adaptive Graph and Structured Sparsity Regularization for Unsupervised Feature Selection","date":"2020-10-09","arxiv_id":"2010.05454","repositories_listed":1,"syntology":null},{"url":"/paper/identifying-spurious-correlations-for-robust","slug":"identifying-spurious-correlations-for-robust","title":"Identifying Spurious Correlations for Robust Text Classification","date":"2020-10-06","arxiv_id":"2010.02458","repositories_listed":1,"syntology":null}],"record_sha256":"6223da9b515597708ec987f229dced829fd8bd29a02e87fdcde6379703136ef7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}