Stochastic Sequential Search in Very-High-Dimensional Feature Selection
Petr Somol, Jiří Grim
cs.LG, cs.CV, stat.ML
Submitted: 2026-08-02
Comments: 23 pages, 5 figures, 2 tables. Ancillary files: a standalone implementation of sSFFS (MIT license, verified bit-identical to the reference implementation), a checksum-verified converter building the exact experiment datasets from the UCI originals, the derived Reuters-21578 term matrix used in the experiments (research use only), and the configuration files of all experiments
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Lazier Than Lazy Greedy
- Randomized Greedy Learning for Non-monotone Stochastic Submodular Maximization Under Full-bandit Feedback
- Performance-Complexity Tradeoffs in Greedy Weak Submodular Maximization with Random Sampling
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks