No article text was recorded for this version.
combinatorial feature selection complexity
Version 2 of 2770 papers868 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Optimal Column Subset Selection by A-Star Search
- Blog: Feature Selection as a One-Player Game
- Blog: Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality
- Blog: A Comparative Evaluation of Anomaly Explanation Algorithms
- Blog: A Comprehensive Survey on Outlying Aspect Mining Methods
- Blog: Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms
- Blog: Combining adaBoost with a Hill-Climbing evolutionary feature search for efficient training of performant visual object detector
- Blog: Selling Data To a Machine Learner: Pricing via Costly Signaling
- Blog: Feature Cross Search via Submodular Optimization
- Blog: Learning sparse optimal rule fit by safe screening
- Blog: Input pruning for neural gas architectures
- Blog: Training for Extremum Determination of Function of Variables Measured in Names Scale
- Blog: Generating Skyline Datasets for Data Science Models
- Blog: Variable Selection for Kernel Two-Sample Tests
- Blog: Research on Machine Learning Feature Algorithm
- Blog: Selecting Efficient Features via a Hyper-Heuristic Approach
- Blog: Test cost and misclassification cost trade-off using reframing
- Blog: MISFEAT: Feature Selection for Subgroups with Systematic Missing Data
- Blog: Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisition
- Blog: Feature selection with test cost constraint
- Blog: Boosting for Efficient Model Selection for Syntactic Parsing
- Blog: Feature selection based on self-information and entropy measures for incomplete neighborhood decision systems
- Blog: An efficient bit-based feature selection method
- Blog: Towards Wide Learning: Experiments in Healthcare
- Blog: Beam Search based MAP Estimates for the Indian Buffet Process
- Blog: Exploiting Hidden Structure in Selecting Dimensions that Distinguish Vectors
- Blog: Learning Homophily Couplings from Non-IID Data for Joint Feature Selection and Noise-Resilient Outlier Detection
- Blog: Interpretable and Fair Boolean Rule Sets via Column Generation
- Blog: Identifying groups of variables with the potential of being large simultaneously
- Blog: Morphological Features for Parsing Morphologically-rich Languages: A Case of Arabic
- Blog: Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection
- Blog: On Input Selection with Reversible Jump Markov Chain Monte Carlo Sampling
- Blog: Open Problem: Efficient Online Sparse Regression
- Blog: Unifying Model Explainability and Robustness via Machine-Checkable Concepts
- Blog: Online Learning with Costly Features in Non-stationary Environments
- Blog: Indexing Cost Sensitive Prediction
- Blog: Feature Cross Search via Submodular Optimization
- Blog: Enumerating Distinct Decision Trees
- Blog: How Hard Is Science?
- Blog: Sampling approach to sparse approximation problem: determining degrees of freedom by simulated annealing
- Blog: Towards Rigorous Interpretations: a Formalisation of Feature Attribution
- Blog: Unit Selection Based on Counterfactual Logic
- Blog: Outlier Explanation via Sum-Product Networks
- Blog: Efficient Learning by Directed Acyclic Graph For Resource Constrained Prediction
- Blog: The power of feature clustering: An application to object detection
- Blog: Feature Importance Ranking for Deep Learning
- Blog: Gradient boosted feature selection
- Blog: Generalized Model Selection for Unsupervised Learning in High Dimensions
- Blog: Subset selection in sparse matrices
- Blog: New Statistical and Computational Results for Learning Junta Distributions
- Blog: Augmenting a Database Knowledge Representation for Natural Language Generation
- Blog: Multiscale Dictionary Learning for Estimating Conditional Distributions
- Blog: Convex Neural Networks
- Blog: Feature Design for Protein Interface hotspots using KFC2 and Rosetta
- Blog: BackboneLearn: A Library for Scaling Mixed-Integer Optimization-Based Machine Learning
- Blog: Local Subspace-Based Outlier Detection using Global Neighbourhoods
- Blog: Convex Relaxations for Subset Selection
- Blog: EBBA: An Enhanced Binary Bat Algorithm Integrated with Chaos Theory and Lévy Flight for Feature Selection
- Blog: Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR Prediction
- Blog: Does Sparsity Help in Learning Misspecified Linear Bandits?
Showing 60 of 770 papers.
History & citation
Current · Permanent link
- Reinforcement Learning for Automated Feature Transformation merged into this direction (100% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_combinatorial_feature_selection_complexi_0286effd,
title = {combinatorial feature selection complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-feature-selection-complexity/rdr_0286effde55f44c19394ada584466d07},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_combinatorial_feature_selection_complexi_0286effd_v2,
title = {combinatorial feature selection complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/combinatorial-feature-selection-complexity/rdr_0286effde55f44c19394ada584466d07/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}