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,657 papers · 148 categories

Trend · papers per month

82163245326 · Jun 202019922001200920172026
48 results for high-dimensional regression

PROD method improves high-dimensional regression by handling strong correlations.

problem Violation of Irrepresentable Condition in LASSO for high-dimensional data.
method PROD procedure based on orthogonal decomposition of design matrix.
result PROD enhances performance of high-dimensional penalized regression.

Prevalidated ridge regression simplifies logistic regression for high-dimensional data.

problem Efficient probabilistic classification in high-dimensional data with logistic regression.
method Developed a prevalidated ridge regression model that matches logistic regression's performance but is more computationally efficient.
result Prevalidated ridge regression achieves similar classification error and log-loss to logistic regression for high-dimensional data.

Overview of high-dimensional time series regression methods.

problem Estimation and inference with high-dimensional time series data.
method Limit theory for high-dimensional dependent data, asymptotic theory for time series regression, statistical learning methods.
result Main limit theory results and asymptotic theory for high-dimensional time series regression.

Proposes GPLFR for predicting high-dimensional outputs with few data.

problem Predicting high-dimensional outputs from limited data.
method GPLFR combines Gaussian process and linear-Gaussian decoding for high-dimensional prediction.
result GPLFR outperforms existing methods in predicting high-dimensional outputs.

We simplify complex regression coefficients using linearization and feature comparison.

problem Interpreting high-dimensional regression coefficients from nonlinear responses.
method Developed a linearization method to derive feature coefficients and compare them with regression coefficients.
result Shows how regression coefficients relate to linearized feature coefficients and how they change under regularization.

Paper introduces semi-supervised linear extremile regression for high-dimensional data.

problem Challenges in high-dimensional extremile regression due to data sparsity and overfitting.
method Proposes semi-supervised learning for linear extremile regression, achieving n\sqrt{n}-consistency.
result Demonstrates improved estimation efficiency and performance in high-dimensional settings.

Boosting ridge regression for high-dimensional data classification reduces computational cost and improves learning time.

problem High computational demand of inverting regularised covariance matrix in ridge regression for high-dimensional problems.
method Train an ensemble of ridge regressors in randomly projected subspaces, then combine them using adaptive boosting.
result Effective in terms of learning time and improved predictive performance in some cases.

Unified derivation of high-dimensional linear models using stochastic gradient descent.

problem Performance analysis of high-dimensional linear models trained with stochastic gradient descent.
method Derivation of a deterministic equivalence for the two-point function of a random matrix resolvent.
result Unified understanding of model performance including previously known and novel results.

In this article the package High-dimensional Metrics (\texttt{hdm}) is introduced. It is a collection of statistical methods for estimation and quantification of uncertainty in high-dimensional approximately sparse models. It focuses on providing confidence intervals and significance testing for (possibly many) low-dim…

2016-08-01abs ↗pdf ↗

We study the problem of treatment effect estimation in randomized experiments with high-dimensional covariate information, and show that essentially any risk-consistent regression adjustment can be used to obtain efficient estimates of the average treatment effect. Our results considerably extend the range of settings …

2016-07-22abs ↗pdf ↗

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.

The package High-dimensional Metrics (\Rpackage{hdm}) is an evolving collection of statistical methods for estimation and quantification of uncertainty in high-dimensional approximately sparse models. It focuses on providing confidence intervals and significance testing for (possibly many) low-dimensional subcomponents…

2016-03-05abs ↗pdf ↗

Survey of SDR methods for high-dimensional regression and embedding.

problem Reducing dimensionality in high-dimensional data.
method Involves both statistical and machine learning approaches, covering inverse and forward regression methods.
result Supervised Kernel Dimension Reduction is equivalent to supervised PCA.

Study shows double descent curve in high-dimensional linear regression with random projections.

problem Understanding the generalization performance in high-dimensional settings with random projections.
method Fixed prediction problem, ridge regression estimator, minimum norm least-squares fit, random matrix theory, asymptotic equivalents.
result Exhibit a double descent curve for high-dimensional linear regression with random projections.

Tensor Neural Networks improve regression accuracy and efficiency.

problem Nonparametric regression problems with complex, high-dimensional functions.
method Integrates statistical regression and numerical integration within a tensor neural network framework.
result Superior performance in approximation accuracy and generalization capacity compared to FFNs and RBNs.

Penalized (or regularized) regression, as represented by Lasso and its variants, has become a standard technique for analyzing high-dimensional data when the number of variables substantially exceeds the sample size. The performance of penalized regression relies crucially on the choice of the tuning parameter, which d…

2019-08-10abs ↗pdf ↗

Paper analyzes GLM-tron for high-dimensional ReLU regression, providing upper and lower bounds.

problem Learning a single ReLU neuron in high-dimensional settings with overparameterization.
method Perceptron-type algorithm GLM-tron, with finite-sample analysis.
result Sharp characterization of high-dimensional ReLU regression problems via GLM-tron, contrasting with SGD.

The paper analyzes how generated data improves adversarial training in high-dimensional regression.

problem Improving adversarial training in high-dimensional regression.
method Theoretical analysis of a two-stage training approach with generated data and pseudo-labels.
result Two-stage adversarial training achieves better performance than ridgeless training in high-dimensional linear regression.

Efficiently selects important variables in high-dimensional logistic regression.

problem Variable selection in high-dimensional logistic regression with binary responses.
method Developed a variational empirical Bayes approach for efficient model space marginal distribution.
result The variational approximation inherits strong selection consistency from the posterior distribution.

The paper tackles high-dimensional mixed linear regression with unknown parameters and proposes methods for estimation, confidence intervals, and hypothesis testing.

problem High-dimensional mixed linear regression with unknown parameters and covariance structure.
method Iterative high-dimensional EM algorithm for estimating regression vectors, debiased estimators for individual coordinates, and large-scale multiple testing procedure.
result Asymptotic normality of debiased estimators and FDR control for hypothesis testing.

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.

New method optimizes model selection in high-dimensional regression models.

problem Model selection in high-dimensional misspecified regression models with covariate shift.
method Importance-weighted orthogonal greedy algorithm (IWOGA) and high-dimensional importance-weighted information criterion (HDIWIC).
result IWOGA + HDIWIC achieves optimal convergence rates in terms of prediction error.

The nullspace and regularization impact high-dimensional linear regression interpretability.

problem Interpreting high-dimensional linear regression coefficients in complex data.
method Optimization formulation to compare coefficients and physical knowledge.
result Regularization and z-scoring choices affect interpretability and true coefficient closeness.

Paper tackles high-dimensional quantile regression with distribution shift using transfer learning.

problem Efficiency of knowledge transfer is severely impacted by distribution shift in high-dimensional regression.
method Proposes a novel transferable set and framework for three types of distribution shift: parameter, covariate, and residual.
result Establishes estimation error bounds and source detection consistency for the proposed method.

Improved VB algorithm for high-dimensional logistic regression with theoretical guarantees.

problem Sparse high-dimensional logistic regression model selection.
method Spike and slab variational Bayes approximation.
result Optimal convergence rates in 2\ell_2 and prediction loss for sparse truths.

New method for high-dimensional linear regression using empirical Bayes.

problem Estimating prior in high-dimensional linear regression.
method Variational empirical Bayes approach with NPMLE and mean field approximation.
result Established asymptotic consistency and computational efficiency of the method.

New method bounds high-dimensional regression without estimating design covariance.

problem High-dimensional linear regression with random design.
method Error-in-operator approach that incorporates design covariance into empirical risk minimization.
result Dimension-free bounds on excess prediction risk derived.

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.

Gaussian process regression loses locality in high dimensions, affecting molecular energy surface fitting.

problem Loss of locality in high-dimensional Gaussian process regression.
method Analysis of Matern family kernels and multi-zeta basis functions.
result The property of locality disappears in high dimensions, impacting regression quality.

Proposes using prior variable importance information in high-dimensional regression.

problem Using vague prior information on variable importance in high-dimensional settings.
method Fit a sequence of models indicated by the prior importance orderings, using ridge or Lasso regression.
result Cross-validation can select the best estimator from a sequence of models, with a logarithmic cost compared to the unknown best.

Paper introduces a new IV regression method for mixed-frequency data.

problem Estimating high-dimensional slope parameters in mixed-frequency data.
method Tikhonov-regularized estimator for high-dimensional linear IV regression.
result High-dimensional slope parameter can be accurately estimated using a low-frequency instrumental variable.

AIHT improves online high-dimensional quantile regression by separating support discovery and refinement.

problem Online high-dimensional quantile regression with structural sparsity.
method Adaptive Iterative Hard Thresholding (AIHT) alternates stochastic updates with adaptive hard-thresholding steps.
result AIHT achieves logarithmic regret for the sliding-window objective in high-dimensional settings.

Paper addresses high-dimensional linear regression with missing data, proposing efficient and nearly unbiased estimators.

problem High-dimensional linear regression with blockwise missing covariates and partially observed responses.
method Proposes a computationally efficient estimator and nearly unbiased debiased estimators using blockwise imputation and estimating equations.
result Asymptotically valid confidence intervals and statistical tests constructed based on debiased estimators.

Paper proposes differentially private quantile regression for high-dimensional data.

problem Privacy concerns in big data with heterogeneous sensitive personal information.
method Newton-type transformation for reformulating quantile regression into an OLS problem; iterative updates for estimation; debiased estimator for inference; communication-efficient bootstrap.
result Near-optimal statistical accuracy and formal privacy guarantees achieved.

Study ridge regression for non-identically distributed data with varying variances.

problem Investigate high-dimensional regression with non-identical data variance.
method Propose a random effect model and use tools from random matrix theory.
result Highlight the double descent phenomenon in high-dimensional regression for certain variance profiles.

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.

Develops a fast algorithm for high-dimensional LASSO penalized quantile regression.

problem Computational challenges in high-dimensional 1\ell_1 penalized quantile regression.
method Pathwise coordinate descent algorithm to solve exact coordinatewise minimum of the nonsmooth loss function.
result Algorithm runs faster than existing alternatives and maintains estimation accuracy.

EP method speeds up Bayesian probit regression in high dimensions.

problem Computational challenges in high-dimensional Bayesian probit regression.
method Adapting EP approximation to multivariate Gaussian prior and skew-normal distribution.
result EP routine is computationally feasible in high-dimensional settings.

Lecture notes on advanced linear regression methods.

problem Understanding the properties of linear regression estimators in high dimensions.
method Proposition-proof exploration of least squares, ridgeless, ridge, and lasso estimators.
result Detailed analysis of the existence, uniqueness, relations, computation, and non-asymptotic properties of these estimators.

Aggregates predictions from multiple regression models using random projections and kernel methods.

problem Combining predictions from multiple regression models to improve accuracy.
method Random projection of high-dimensional feature space, followed by kernel-based consensual aggregation.
result The aggregation scheme performs similarly to using the original high-dimensional features, with high probability.

High-dimensional regression models struggle with resampling methods.

problem Estimating uncertainty in high-dimensional supervised regression tasks.
method Investigation of bootstrap, subsampling, and jackknife methods in high-dimensional generalized linear models.
result Resampling methods exhibit double-descent behavior and are inconsistent in high dimensions.

Study high-dimensional Bayesian linear regression using variational inference.

problem High-dimensional Bayesian linear regression with product priors.
method Non-linear large deviations theory and variational inference.
result Unique optimizer in variational problem governs posterior distribution under separation condition.

Active learning improves GP regression on complex, high-dimensional data.

problem Improving Gaussian Process regression in high-dimensional spaces with discontinuous functions.
method Combines manifold learning with active learning to optimize data selection and reduce dimensionality.
result Superior performance over random learning in synthetic data experiments.

A new R package for high-dimensional regression and precision matrix estimation.

problem High-dimensional linear regression and precision matrix estimation challenges.
method flare package implements various regression methods and extensions for sparse precision matrix estimation.
result The flare package is efficient and scalable for large problems.