GIDS reduces high-dimensional response and predictor spaces, improving interpretability and computational efficiency.
problem Challenges in modeling interactions among high-dimensional multimodal data.
method Graph Independence Dual Screening (GIDS) framework that reduces both response and predictor dimensions.
result GIDS reduces feature space to 9,000 CpGs and 2,000 transcripts, revealing coordinated regulatory mechanisms.
Develops a SAS approach for high-dimensional risk prediction using unlabeled data.
problem Challenges in risk modeling with EHR data due to lack of direct disease outcomes and high dimensionality.
method Surrogate Assisted Semi-supervised Learning (SAS) approach leveraging unlabeled and labeled data.
result Valid inference for predicted risk even when underlying model is dense and mis-specified.
This work studies finite-sample properties of the risk of the minimum-norm interpolating predictor in high-dimensional regression models. If the effective rank of the covariance matrix Σ of the p regression features is much larger than the sample size n, we show that the min-norm interpolating predictor is not de…
We consider selection of random predictors for high-dimensional regression problem with binary response for a general loss function. Important special case is when the binary model is semiparametric and the response function is misspecified under parametric model fit. Selection for such a scenario aims at recovering th…
New screening rules improve lasso model fitting efficiency.
problem Efficiently solving high-dimensional lasso problems.
method Look-ahead screening rules to discard predictors.
result Look-ahead screening rules outperform existing methods.
Paper examines LASSO for high-dimensional predictive regression, improving its performance in forecasting unemployment.
problem High-dimensional predictive regression with many predictors and unit roots.
method LASSO with new probabilistic bounds for consistency.
result LASSO maintains its asymptotic guarantee with standardized predictors and improves forecasting of unemployment.
Paper proposes SDDP for improving time series forecasting with high-dimensional predictors.
problem Improving time series forecasting with high-dimensional predictors.
method SDDP framework that incorporates target variable and lagged observations into factor extraction process.
result SDDP improves predictive accuracy in time series forecasting.
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.
Group model selection is the problem of determining a small subset of groups of predictors (e.g., the expression data of genes) that are responsible for majority of the variation in a response variable (e.g., the malignancy of a tumor). This paper focuses on group model selection in high-dimensional linear models, in w…
Study calibrates high-dimensional binary classifiers using angle between estimator and true weights.
problem Calibrating high-dimensional binary classifiers with provable properties.
method Interpolates with a chance classifier to construct well-calibrated predictor based on angle between estimator and true weights.
result Angular calibration approach is provably well-calibrated in high dimensions, minimizing Bregman divergence.
New method for tensor classification with missing data.
problem Handling incomplete tensor data in high-dimensional classification.
method High-dimensional tensor linear discriminant analysis with TGMM and Tensor LDA-MD.
result Established convergence rates and minimax optimal bounds for misclassification rate.
Paper proposes inference method for high-dimensional censored quantile regression.
problem Identifying heterogeneous effects of high-dimensional genetic biomarkers on survival outcomes.
method Combines low-dimensional model estimates based on multi-sample splittings and variable selection.
result Proposed estimator is consistent and asymptotically follows a Gaussian process.
Kernel Three-Pass Regression Filter improves forecasting efficiency for nonlinear dependencies.
problem Forecasting with high-dimensional predictors and latent factors.
method Developed a new estimator, Kernel Three-Pass Regression Filter (K3PRF), to address nonlinear dependencies.
result Empirically shows significant improvement in long-term forecasting performance.
Nested model averaging improves high-dimensional linear regression performance.
problem High-dimensional linear regression with predictor ordering impact.
method Combining model averaging with regularized estimators on the solution path.
result Nested model averaging with lasso and SLOPE outperforms competing methods.
High-dimensional data pose challenges in statistical learning and modeling. Sometimes the predictors can be naturally grouped where pursuing the between-group sparsity is desired. Collinearity may occur in real-world high-dimensional applications where the popular l1 technique suffers from both selection inconsisten…
A new method combines predictors and their lags using supervised PCA for dynamic forecasting.
problem Dynamic forecasting with many predictors.
method Supervised PCA with re-scaling and penalized methods.
result The method outperforms traditional PCA and diffusion-index approaches in prediction.
Develops a new method for uncertainty quantification in high-dimensional learning.
problem Challenges in uncertainty quantification in high-dimensional regression or learning problems.
method Data-driven approach for UQ that corrects bias terms from training data.
result Non-asymptotic confidence intervals that avoid overestimating uncertainty.
A new method for sparse regression models using graph structure.
problem Sparse regression models for high-dimensional data.
method Decomposes coefficient vector into latent variables, performs regularization on latent variables, uses proximal projection.
result Stable performance compared to other models, especially for high-dimensional data.
RI-based variable ranking and selection outperforms lasso in high-dimensional datasets.
problem Challenges in variable selection and model creation with correlated predictors.
method RI measures for feature ranking and selection, including CRI.Z.
result RI-based methods outperform lasso in high-dimensional datasets, especially with correlated predictors.
New bounds prevent degradation in high-dimensional signal estimation.
problem Statistical learning bounds degradation with increasing dimensionality.
method Investigates linear prediction rules under structural assumptions.
result Derives upper and lower bounds on generalization error.
Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.
problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.
Paper proposes efficient methods for forecasting with large datasets.
problem Forecasting with large, high-dimensional economic data sets.
method Bayesian hierarchical priors, factor graphs, message passing algorithms, Generalized Approximate Message Passing (GAMP).
result The proposed methods outperform traditional approaches in forecasting U.S. price inflation.
Paper develops a method to predict cancer patient survival using molecular profiles.
problem Accurately predicting cancer patient survival with complex survival-molecular profile relationships.
method Kernel Cox partially linear regression with a novel regularized garrotized kernel machine (RegGKM) method.
result The proposed method outperforms other methods in predicting survival accuracy.
Identifying homogeneous subgroups of variables can be challenging in high dimensional data analysis with highly correlated predictors. We propose a new method called Hexagonal Operator for Regression with Shrinkage and Equality Selection, HORSES for short, that simultaneously selects positively correlated variables and…
Self-supervised reward prediction improves RL in sparse reward settings.
problem Data efficiency and sparse reward signals in reinforcement learning.
method Learning a state representation for reward prediction and using it to shape rewards.
result Self-supervised reward prediction enhances RL algorithms in single-goal environments.
PEER tackles multi-response regression with incomplete outcomes efficiently.
problem Challenges in estimating, predicting, and computing with large-scale multi-response regression and incomplete outcomes.
method PEER converts multi-response regression into parallel univariate-response regressions.
result PEER achieves consistency in estimation, prediction, and variable selection.
PROBE algorithm efficiently solves sparse high-dimensional linear regression.
problem Sparse high-dimensional linear regression models with complex parameter spaces.
method Partitioned empirical Bayes ECM algorithm for computationally efficient MAP estimation.
result PROBE algorithm provides robust and efficient coordinate-wise optimization.
We consider a problem of data integration. Consider determining which genes affect a disease. The genes, which we call predictor objects, can be measured in different experiments on the same individual. We address the question of finding which genes are predictors of disease by any of the experiments. Our formulation i…
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 and ℓ2 penalties. result Achieves posterior concentration, variable selection consistency, and asymptotic normality.
Deep learning (DL) is a high dimensional data reduction technique for constructing high-dimensional predictors in input-output models. DL is a form of machine learning that uses hierarchical layers of latent features. In this article, we review the state-of-the-art of deep learning from a modeling and algorithmic persp…
Faced with distribution shift between training and test set, we wish to detect and quantify the shift, and to correct our classifiers without test set labels. Motivated by medical diagnosis, where diseases (targets) cause symptoms (observations), we focus on label shift, where the label marginal p(y) changes but the …
New analysis reveals masked self-supervised learning's effectiveness in extracting data structure.
problem Analyzing masked self-supervised learning in high-dimensional data.
method Developed precise high-dimensional analysis of masked modeling objectives.
result Identified phase transitions and structured regimes for masked self-supervised learning.
We consider forecasting a single time series using a large number of predictors in the presence of a possible nonlinear forecast function. Assuming that the predictors affect the response through the latent factors, we propose to first conduct factor analysis and then apply sufficient dimension reduction on the estimat…
ICODEN models survival data with interval-censored times using neural networks and ODEs.
problem Predicting time-to-event outcomes with interval-censored data, especially when models require strong assumptions or cannot handle high-dimensional predictors.
method ICODEN uses ordinary differential equations and deep neural networks to model the hazard function and cumulative hazard without proportional hazards assumption.
result ICODEN achieves satisfactory predictive accuracy across various simulation and real-world applications, handling high-dimensional predictors robustly.
LIT-LVM improves linear predictors by estimating interaction terms with latent vectors.
problem Accurately estimating coefficients for interaction terms in linear predictors.
method Structured regularization using latent vectors to represent features.
result LIT-LVM achieves superior prediction accuracy compared to other methods.
We consider forecasting a single time series when there is a large number of predictors and a possible nonlinear effect. The dimensionality was first reduced via a high-dimensional (approximate) factor model implemented by the principal component analysis. Using the extracted factors, we develop a novel forecasting met…
New theory explains how noisy, high-dimensional data can still lead to robust predictions.
problem Modern machine learning models achieve high performance with noisy, high-dimensional data.
method Synthesizes principles from Information Theory, Latent Factor Models, and Psychometrics to clarify predictive robustness.
result Predictive robustness arises from data architecture and model capacity, not just data cleanliness.
Proposes spBART for risk prediction using epigenetic signatures and covariates.
problem Complex high-dimensional epigenetic data and low-dimensional covariates for risk prediction.
method Semi-parametric Bayesian Additive Regression Trees (spBART) with cross-validation for variable selection.
result Achieves strong out-of-sample discrimination (AUC = 0.96) in held-out validation set.
In machine learning and data mining, linear models have been widely used to model the response as parametric linear functions of the predictors. To relax such stringent assumptions made by parametric linear models, additive models consider the response to be a summation of unknown transformations applied on the predict…
Bayesian approach controls FDR in high-dimensional models.
problem High-dimensional variable selection and inference.
method Adapted Mirror Statistic to Bayesian framework for FDR control.
result Effective FDR control without data splitting.
A transfer learning method builds high-dimensional models using disparate datasets.
problem Building comprehensive prediction models with small sample sizes and limited features.
method Transfer learning approach using external data to build a reduced model and apply calibration equations.
result Proposes a penalized generalized method of moment framework for inference and one-step estimation.
The paper forecasts corporate distress using a novel MIDAS logistic regression method.
problem Forecasting corporate distress with right-censored data, high-dimensional predictors, and mixed-frequency data.
method The paper introduces a novel high-dimensional censored MIDAS logistic regression method that handles censoring through inverse probability weighting and employs a sparse-group penalty for mixed-frequency predictors.
result The method achieves accurate estimation and superior performance in predicting financial distress of Chinese-listed firms.
T-Rex selector selects variables fast and controls FDR in high-dimensional data.
problem Variable selection in high-dimensional data with FDR control.
method Fused solutions of early terminated random experiments.
result FDR control at target level with high variable selection power.
A new screening rule improves SLOPE efficiency for high-dimensional data.
problem Efficiently selecting relevant predictors in high-dimensional data.
method Developed a screening rule for SLOPE based on its subdifferential.
result The screening rule improves SLOPE's performance significantly in high-dimensional settings.
We propose dimension reduction methods for sparse, high-dimensional multivariate response regression models. Both the number of responses and that of the predictors may exceed the sample size. Sometimes viewed as complementary, predictor selection and rank reduction are the most popular strategies for obtaining lower-d…
Random imputation is surprisingly effective for linear predictors in missing data scenarios.
problem The effectiveness of naive imputation in missing data scenarios for linear predictors.
method A unique random features model framework to study predictive performances.
result Naive imputation is negligible in bias for linear predictors under MCAR assumption.
Proposes a method for stable variable selection in high-dimensional data.
problem Challenges of variable selection in high-dimensional, correlated data.
method Resample-aggregate framework using diffusion models.
result Stable subset of predictors with calibrated stability scores.
AP-CDE uses NF to estimate high-dimensional conditional densities, improving interpretability.
problem Estimating conditional densities for high-dimensional responses like images.
method Extends NF neural networks to handle high-dimensional y with a latent z. result Improves interpretation of latent components, especially zP.