Balancing Statistical and Computational Precision: A General Theory and Applications to Sparse Regression
Modern technologies are generating ever-increasing amounts of data. Making use of these data requires methods that are both statistically sound and computationally efficient. Typically, the statistical and computational aspects are treated separately. In this paper, we propose an approach to entangle these two aspects in the context of regularized estimation. Applying our approach to sparse and group-sparse regression, we show that it can improve on standard pipelines both statistically and computationally.
Code (0)
등록된 구현이 없습니다.
Tasks
Astronomyfeature selectionregressionSimilar Papers 제목 키워드 기반
An introduction to computational complexity and statistical learning theory applied to nuclear models
The fact that we can build models from data, and therefore refine our models with more data from experiments, is usually given for granted in scientific inquiry. However, how much information can we extract, and how prec…
Learning TheoryCovariate Adjusted Precision Matrix Estimation via Nonconvex Optimization
We propose a nonconvex estimator for the covariate adjusted precision matrix estimation problem in the high dimensional regime, under sparsity constraints. To solve this estimator, we propose an alternating gradient…
High Dimensional Multivariate Regression and Precision Matrix Estimation via Nonconvex Optimization
We propose a nonconvex estimator for joint multivariate regression and precision matrix estimation in the high dimensional regime, under sparsity constraints. A gradient descent algorithm with hard thresholding is develo…
regressionVocal Bursts Intensity PredictionNear-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic
The detection of anomalous activity in graphs is a statistical problem that arises in many applications, such as network surveillance, disease outbreak detection, and activity monitoring in social networks. Beyond its wi…
Anomaly DetectionPrecision autotuning for linear solvers via contextual bandit-based RL
We propose a reinforcement learning (RL) framework for adaptive precision tuning for linear solvers, which can be extended to general algorithms. The framework is formulated as a contextual bandit problem and solved usin…
Computational EfficiencyReinforcement Learning