Sparse models help in selecting fewer variables for efficient predictions.
problem Overfitting and high computational costs in learning models.
method Automated variable selection for sparse predictive models.
result Sparse models improve model efficiency and interpretability.
Sparse GEMINI selects relevant features for clustering without assumptions.
problem Feature selection in clustering with relevant clusters and variables.
method Discriminative clustering model maximizing GEMINI with l1 penalty.
result Sparse GEMINI selects relevant subsets of variables without prior hypotheses.
Sparse reduced-rank regression selects variables and ranks via manifold optimization.
problem Traditional rank selection fails when true rank is high.
method Sparse regularization and manifold optimization for rank and variable selection.
result Accurate estimation of coefficient parameter with high true rank.
Improves Group Lasso for categorical data by reducing dimensionality and selecting models.
problem Sparse modelling of categorical data is challenging, especially for high dimensions.
method Two-step procedure: first, reduce dimensionality using Group Lasso; second, select final model using an information criterion on clustered levels.
result The method produces a sparse solution and performs better than state-of-the-art algorithms in prediction accuracy and model dimension.
sgboost reduces variable selection bias in boosting with balanced group selection.
problem Reduces variable selection bias in boosting algorithms.
method Simulation-based approach to balance selection frequencies of base-learners.
result Demonstrates efficacy through simulations and flexible group variable selection.
New insights into variable selection with different model assumptions.
problem Sparse recovery with ℓ∞ error guarantees in variable selection. method Separation between oblivious and adaptive models of ℓ∞ sparse recovery. result Proves a surprising contrast between oblivious and adaptive models in ℓ∞ sparse recovery. New estimators improve sparse semiparametric additive modeling.
problem Sparse semiparametric additive modeling with structured sparsity.
method Combines group subset selection with shrinkage for nonconvex optimization.
result New estimators outperform alternatives in synthetic and real-world data.
A new knot selection method speeds up sparse Gaussian process approximations.
problem Efficiently selecting knots for sparse Gaussian processes.
method One-at-a-time Bayesian optimization for knot selection.
result Competitive performance with reduced computational cost.
Sparse feature selection has been demonstrated to be effective in handling high-dimensional data. While promising, most of the existing works use convex methods, which may be suboptimal in terms of the accuracy of feature selection and parameter estimation. In this paper, we expand a nonconvex paradigm to sparse group …
ControlBurn selects few features from tree ensembles for better model interpretability.
problem Improving model interpretability in machine learning models.
method Sparse tree ensembles with lasso optimization.
result ControlBurn selects feature-sparse subsets for better model interpretability.
OOMP selects features online for sparse linear regression.
problem Feature selection in high-dimensional sparse linear models.
method Online algorithm that alternates between feature selection and coefficient estimation.
result Theoretical guarantees and computational complexity analysis of OOMP.
We consider the bridge linear regression modeling, which can produce a sparse or non-sparse model. A crucial point in the model building process is the selection of adjusted parameters including a regularization parameter and a tuning parameter in bridge regression models. The choice of the adjusted parameters can be v…
New regularization scheme for FMs improves feature interaction selection.
problem Feature selection in FMs leads to loss of feature interactions.
method Proposes a new regularization scheme for FMs with upper bound of ℓ1 regularizer. result Improves feature interaction selection without restricting sparsity patterns.
Unified dynamic approach for sparse model selection improves efficiency and accuracy.
problem Sparse model selection challenges in various fields.
method Iterative regularization path using Mirror Descent or Linearized Bregman Iterations.
result Path consistency theory with no false positives and minimax optimal error rate.
Sparse text alignments learned via optimal transport improve model explainability.
problem Building self-explaining models by selecting relevant text pieces.
method Employing optimal transport to find minimal cost alignments, introducing constrained variants for sparsity.
result Sparse and interpretable alignments achieved, preserving prediction accuracy.
New GIC improves model selection for structured sparse models.
problem Model selection and regularization in high-dimensional scenarios.
method Proposes a new Generalized Information Criteria (GIC) for structured sparse models.
result Obtains non-asymptotic model selection bounds and sufficient conditions for model selection consistency.
Forward regression is a statistical model selection and estimation procedure which inductively selects covariates that add predictive power into a working statistical regression model. Once a model is selected, unknown regression parameters are estimated by least squares. This paper analyzes forward regression in high-…
Paper proposes a sparse synthetic control method to select important predictors.
problem Choosing and weighting predictors affects synthetic control estimator performance.
method Sparse synthetic control procedure that penalizes predictors, derived in a linear factor model.
result Sparse synthetic control achieves lower bias and better post-treatment performance.
New algorithm efficiently learns sparse causal graphs from time series data.
problem Learning sparse causal graphs from time series data efficiently and automatically selecting the number of edges.
method Cyclical coordinate descent algorithm with two non-parametric error metrics for LASSO coefficient selection.
result State-of-the-art performance on simulated and real datasets.
Sparse versions of principal component analysis (PCA) have imposed themselves as simple, yet powerful ways of selecting relevant features of high-dimensional data in an unsupervised manner. However, when several sparse principal components are computed, the interpretation of the selected variables is difficult since ea…
Transformers excel at sparse token selection, surpassing FCNs in both worst and average cases.
problem Sparse token selection task
method One-layer transformer trained with gradient descent
result Transformers learn sparse token selection and exhibit strong out-of-distribution length generalization
A scalable gradient-based framework for sparse portfolio selection.
problem Sparse minimum-variance portfolio selection with cardinality constraint.
method Gradient-based optimization with Boolean relaxation and tunable parameter.
result Matches commercial solvers in most instances, differing by a few assets with negligible error in portfolio variance.
Sparse PCA selects variables with FDR control for improved performance.
problem Sparse PCA selects irrelevant variables when maximizing explained variance.
method Proposes FDR-controlled selection using T-Rex selector.
result Significant performance improvement over traditional sparse PCA.
A sparse modeling is a major topic in machine learning and statistics. LASSO (Least Absolute Shrinkage and Selection Operator) is a popular sparse modeling method while it has been known to yield unexpected large bias especially at a sparse representation. There have been several studies for improving this problem such…
New approach selects sparse features without validation.
problem Overfitting and high storage/compute costs in AI models.
method Phase transition in probability of feature retrieval.
result Flexible approach for various models and loss functions.
Efficiently selects predictors in sparse regression without approximations.
problem High computational cost in subset selection for sparse regression.
method Conditional uncorrelation formula and efficient non-approximate method.
result Significant reduction in computational complexity for subset selection.
A nearly tight convex relaxation for sparse Naive Bayes features.
problem Feature selection in large-scale Naive Bayes classification.
method Proposes a convex relaxation for the combinatorial maximum-likelihood problem of feature selection in Naive Bayes.
result The convex relaxation bounds become tight as marginal feature contributions decrease, providing a nearly optimal solution.
The paper uses TDA to select stocks for a sparse portfolio, improving performance across market scenarios.
problem Sparse portfolio selection in financial markets.
method Topological data analysis (TDA) for clustering stock price movements.
result The TDA-based clustering strategy significantly enhances sparse portfolio performance.
Proposes a Bayesian approach for automatic node selection in sparse neural networks.
problem Reduces structural complexity and computational speedup in large-scale predictive models.
method Uses spike-and-slab Gaussian priors and variational Bayes approach for node selection.
result Establishes variational posterior consistency and optimal contraction rates for sparse networks.
ARGEN method improves variable selection and regularization in high-dimensional sparse models.
problem Constrained variable selection and regularization in high-dimensional sparse linear models.
method ARGEN penalty method, variable selection and regularization.
result ARGEN method has variable selection and estimation consistency under certain conditions.
VC-PCR improves prediction by clustering correlated variables.
problem Decreased prediction accuracy due to cluster structure in predictor variables.
method Supervised variable selection and clustering to integrate cluster information into a sparse modeling process.
result VC-PCR achieves better prediction, variable selection, and clustering performance.
Sparse multinomial logistic regression for multiclass classification with feature selection.
problem High-dimensional multiclass classification with a focus on sparse models.
method Penalized maximum likelihood with complexity penalty, feature selection using group Lasso and Slope classifiers.
result Achievement of minimax order in both small and large number of classes regimes.
Proposes a robust and sparse portfolio selection model to reduce estimation errors and transaction costs.
problem Reduces impact of estimation errors and fixed transaction costs in portfolio selection.
method Develops an efficient algorithm to solve a mixed integer problem with an ellipsoidal uncertainty set.
result Proves the convergence of the algorithm to at least a local minimizer with a locally linear convergence rate.
Introduces top-k regularization for better feature selection in machine learning.
problem Limited ability of existing feature selection methods to reconcile feature representativeness and inter-correlations.
method Top-k regularization, which induces a sub-architecture on the model's architecture to select informative features and model complex relationships. result Uniform approximation error bound for top-k regularization approximating high-dimensional sparse functions. Sparse nearest-centroid classifiers detect relevant features for classification.
problem Classifying data with low computational cost and feature selection.
method Proposes ℓ1 and ℓ2 sparse variants of nearest-centroid classifiers. result Training sparse classifiers can be done exactly and at quasi-linear cost.
New method selects variables for GP regression using sparse projection.
problem Identifying environmental factors affecting metal corrosion.
method Sparse projection of input variables, gradient descent optimization, non-convex marginal likelihood.
result Proposed method outperforms benchmarks in variable selection accuracy.
PASTIS selects minimal models from stochastic dynamics data.
problem Overfitting in model selection for stochastic dynamics.
method Combining likelihood-estimation statistics with extreme value theory.
result PASTIS reliably identifies minimal models, even with low sampling rates or error.
BPASGM uses sparse graphical models to optimize portfolio selection.
problem Portfolio optimization in high-dimensional settings with estimation error.
method BPASGM extends BPA to a sparse graphical model, screening assets for diversification.
result BPASGM portfolios outperform standard mean-variance portfolios in risk-adjusted performance.
In this paper, we address the challenging problem of selecting tuning parameters for high-dimensional sparse regression. We propose a simple and computationally efficient method, called path thresholding (PaTh), that transforms any tuning parameter-dependent sparse regression algorithm into an asymptotically tuning-fre…
New method selects sparse predictors in large LMMs.
problem Sparse learning for LMMs is computationally infeasible for large datasets.
method Developed an ℓ0 regularized method with coordinate descent and local search algorithms. result Method selects thousands of predictors in seconds to minutes.
SIAN bridges simple models to neural networks by identifying necessary feature combinations.
problem The gap between simple models and powerful neural networks in performance.
method Feature interaction detection and sparse selection algorithm.
result Competitive performance across multiple tabular datasets with optimal tradeoff.
Bayesian non-parametric model selects latent dimensions automatically.
problem Non-linear, sparse latent variable selection.
method Indian buffet process prior, random Fourier approximation, MCMC sampling.
result Superior performance on synthetic, biological, and text datasets.
Researchers expand on best subset selection theory, identifying key complexities.
problem Understanding model selection performance in high-dimensional sparse linear regression.
method Analyzing residualized signals, orthogonality, and spurious projections to establish margin conditions.
result Established necessary and sufficient margin conditions for BSS model consistency.
sBayFDNN bridges deep learning and functional data analysis for complex, structured data.
problem Challenges in functional data analysis, especially for complex, continuously structured data.
method Sparse Bayesian functional deep neural network (sBayFDNN) that learns adaptive functional embeddings and interpretable region selection.
result First theoretical guarantees for a Bayesian deep functional model, ensuring reliability and statistical rigor.
A DP method selects best sparse models in high dimensions efficiently.
problem Model selection in high-dimensional sparse linear regression under privacy constraints.
method Differential privacy (DP) with exponential mechanism and Metropolis-Hastings algorithm.
result The method identifies active features quickly under privacy constraints.
Sparse feature selection improves batch RL efficiency.
problem High-dimensional batch RL with many features.
method Sparse linear function approximation, Lasso, group Lasso, fitted Q-evaluation, fitted Q-iteration.
result Sparse feature selection makes batch RL more sample efficient.
HS-MoE selects sparse experts using adaptive priors and data-adaptive gating.
problem Sparse expert selection in mixture-of-experts architectures.
method Combines horseshoe prior with input-dependent gating for data-adaptive sparsity.
result Data-adaptive sparsity in expert usage.
A new method selects features efficiently for high-dimensional data.
problem High computational costs and memory requirements in high-dimensional data.
method QuickSelection uses the strength of neurons in sparse autoencoders to select features.
result QuickSelection achieves the best trade-off of accuracy, speed, and memory usage.