Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

145290435580 · Jun 202019922001200920172026
48 results for Grouped Variable Selection

Proposes a two-stage method for selecting correlated predictors in high-dimensional data.

problem Selecting correlated predictors in high-dimensional data with unknown group structures.
method Two-stage approach: variable clustering followed by group selection.
result The two-stage method improves prediction accuracy and active predictor selection.

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.

Transformers can learn optimal variable selection in group-sparse classification.

problem Understanding how transformers leverage attention to select relevant variables in group-sparse classification.
method Training a one-layer transformer using gradient descent to select variables from one group of input variables.
result A one-layer transformer can correctly leverage the attention mechanism to select variables, disregarding irrelevant ones.

Solar improves variable selection in high-dimensional data with complicated dependence structures.

problem Variable selection in ultrahigh dimensional data with severe multicollinearity and grouping effect issues.
method Subsample-ordered least angle regression (Solar) for ultrahigh dimensional data.
result Solar yields substantial improvements in sparsity, stability, and accuracy of variable selection compared to traditional methods.

ABM automates feature engineering and variable selection for loss-based models.

problem Improving model performance through better feature engineering and variable selection.
method ABM uses group and fused lasso regularization to automatically select cutting points and variables.
result ABM integrates feature engineering, variable selection, and model training.

Proposes a robust optimization method for selecting grouped variables robustly.

problem Selecting grouped variables under data perturbations for regression and classification.
method Distributionally Robust Optimization (DRO) with Wasserstein uncertainty set.
result Coefficients in the same group converge to the same value as sample correlation approaches 1.

Proposes a gradient-based variable selection method for binary classification in RKHS.

problem Variable selection in high-dimensional data analysis.
method Gradient-based representation of large-margin classifier with group-lasso penalty.
result Selection consistency and risk bound of the estimated classifier.

Proposes a neural network framework for feature selection in high-dimensional settings.

problem Challenges in feature selection and non-linear function estimation in high-dimensional settings.
method Sparse-input neural networks using group concave regularization.
result Establishes finite-sample guarantees for variable selection consistency and prediction accuracy.

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.

This article considers the problem of multi-group classification in the setting where the number of variables pp is larger than the number of observations nn. Several methods have been proposed in the literature that address this problem, however their variable selection performance is either unknown or suboptimal to…

2014-11-23abs ↗pdf ↗

The paper develops a test for independence of selected Gaussian variables after thresholding correlations.

problem Testing independence of selected Gaussian variables after thresholding correlations.
method The approach involves conditioning on the selection event and using a new characterization of the conditioning event in terms of canonical correlation.
result The proposed test has higher power than a naive approach that ignores selection effects.

Variable selection for models including interactions between explanatory variables often needs to obey certain hierarchical constraints. The weak or strong structural hierarchy requires that the existence of an interaction term implies at least one or both associated main effects to be present in the model. Lately, thi…

2014-11-17abs ↗pdf ↗

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.

Screening is the problem of finding a superset of the set of non-zero entries in an unknown p-dimensional vector β* given n noisy observations. Naturally, we want this superset to be as small as possible. We propose a novel framework for screening, which we refer to as Multiple Grouping (MuG), that groups variables, pe…

2012-08-09abs ↗pdf ↗

Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.

problem Complex multi-group classification problems with nonlinear decision boundaries and group-specific covariance patterns.
method MGQDA, a method based on quadratic discriminant analysis that projects predictors onto a lower-dimensional subspace.
result MGQDA achieves competitive or improved predictive performance compared to existing methods.

New algorithm solves complex variable selection problems in high dimensions.

problem Grouped variable selection in high-dimensional data.
method Optimal solutions for the ℓ0-regularized formulation using discrete optimization.
result Exact algorithms solve problems with 5 million features and 1000 observations in minutes to hours.

Flexible Cox model for time-dependent covariates with complex sparsity patterns.

problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.

SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.

problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.

Method selects valid IVs from a large set using clustering and test of overidentifying restrictions.

problem Selecting valid instrumental variables from a large set of candidates.
method Agglomerative hierarchical clustering combined with a test of overidentifying restrictions.
result Achieves oracle properties when the largest group of IVs is valid.

We investigate structured sparsity methods for variable selection in regression problems where the target depends nonlinearly on the inputs. We focus on general nonlinear functions not limiting a priori the function space to additive models. We propose two new regularizers based on partial derivatives as nonlinear equi…

2018-05-16abs ↗pdf ↗

We consider the empirical risk minimization problem for linear supervised learning, with regularization by structured sparsity-inducing norms. These are defined as sums of Euclidean norms on certain subsets of variables, extending the usual 1\ell_1-norm and the group 1\ell_1-norm by allowing the subsets to overlap. T…

2009-04-22abs ↗pdf ↗

Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between the selected features and the class labels is maximized. Despite …

2018-11-29abs ↗pdf ↗

We consider multi-task learning, which simultaneously learns related prediction tasks, to improve generalization performance. We factorize a coefficient matrix as the product of two matrices based on a low-rank assumption. These matrices have sparsities to simultaneously perform variable selection and learn and overlap…

2018-02-13abs ↗pdf ↗

Variable selection for high-dimensional linear models has received a lot of attention lately, mostly in the context of l1-regularization. Part of the attraction is the variable selection effect: parsimonious models are obtained, which are very suitable for interpretation. In terms of predictive power, however, these re…

2009-06-19abs ↗pdf ↗

In variable or graph selection problems, finding a right-sized model or controlling the number of false positives is notoriously difficult. Recently, a meta-algorithm called Stability Selection was proposed that can provide reliable finite-sample control of the number of false positives. Its benefits were demonstrated …

2017-12-13abs ↗pdf ↗

In machine learning, Feature Selection (FS) is a major part of efficient algorithm. It fuels the algorithm and is the starting block for our prediction. In this paper, we present a new method, called Optimal Coordinate Ascent (OCA) that allows us selecting features among block and individual features. OCA relies on coo…

2018-11-29abs ↗pdf ↗

We consider the problem of sparse variable selection in nonparametric additive models, with the prior knowledge of the structure among the covariates to encourage those variables within a group to be selected jointly. Previous works either study the group sparsity in the parametric setting (e.g., group lasso), or addre…

2012-06-18abs ↗pdf ↗

Proposes a group-splicing algorithm for efficient BSGS in high-dimensional settings.

problem Efficiently selecting a small part of non-overlapping groups for best interpretability in high-dimensional settings.
method Iteratively detects relevant groups and excludes irrelevant ones using a novel group information criterion.
result Certifiable polynomial-time algorithm for identifying the optimal subset of groups with high probability.

In this paper we consider the problem of grouped variable selection in high-dimensional regression using 1q\ell_1-\ell_q regularization (1q1\leq q \leq \infty), which can be viewed as a natural generalization of the 12\ell_1-\ell_2 regularization (the group Lasso). The key condition is that the dimensionality pnp_n can…

2008-02-11abs ↗pdf ↗

Proposes novel wSVMs for sparse learning and accurate probability estimation.

problem Sparse features with redundant noise limit the performance of existing wSVMs.
method Develops 1\ell^1-norm and elastic net regularized wSVMs for automatic variable selection and probability estimation.
result Elastic net regularized wSVMs achieve superior performance in variable selection and probability estimation.

Exclusive Lasso improves survival prediction in cancer datasets.

problem Enhanced survival prediction in cancer datasets with high-dimensional genomic and clinical data.
method Proposes Exclusive Lasso regularization for feature selection in Cox regression models for grouped variables.
result Demonstrates improved survival prediction performance using Exclusive Lasso compared to standard Cox regression.

Proposes HDBEN for heteroscedastic regression with improved sparsity and variance modeling.

problem Violation of constant error variance in high-dimensional regression.
method HDBEN framework using hierarchical Bayesian priors with 1\ell_1 and 2\ell_2 penalties.
result Achieves posterior concentration, variable selection consistency, and asymptotic normality.