Oracle inequality for sparse trace regression models with exponential -mixing errors
From MaRDI portal
Oracle inequality for sparse trace regression models with exponential \(\beta\)-mixing errors
Cites work
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Estimating beta-mixing coefficients via histograms
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Generalized high-dimensional trace regression via nuclear norm regularization
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3701854 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Lasso for sparse linear regression with exponentially \(\beta\)-mixing errors
- Lasso guarantees for \(\beta \)-mixing heavy-tailed time series
- Nearly unbiased variable selection under minimax concave penalty
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Probability inequalities.
- Rates of convergence for empirical processes of stationary mixing sequences
- Sparse trace norm regularization
- Square-root Lasso for high-dimensional sparse linear systems with weakly dependent errors
- Trace regression model with simultaneously low rank and row(column) sparse parameter
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(3)
This page was built for publication: Oracle inequality for sparse trace regression models with exponential \(\beta\)-mixing errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063342)