Research map / Learning theory and algorithms / Matrix and tensor methods
Group SLOPE Penalized Low-Rank Tensor Regression
Yang Chen, Ziyan Luo
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use SLOPE-type penalty (TgSLOPE) instead of group LASSO (TgLASSO) to control TgFDR | LROD tensor regression · Synthetic Gaussian design, p=2000 | TgFDR: 0.891 -> 0.007 | Improved |
| add sparse group penalty (TgSLOPE) to TLRR without sparsity penalty (ablation) | TLRR · Synthetic Gaussian design, p=2000 | TgFDR: 0.980 -> 0.007 | Improved |
| solve TgSLOPE with pDCAe instead of block majorization minimization (TBMM), CPU time | TgSLOPE · Synthetic Gaussian design, p=2000 | CPU time (s): 2.242 -> 1.081 | Improved |
| solve TgSLOPE with pDCAe instead of TBMM, CPU time | TgSLOPE · Synthetic Gaussian design, p=4000 | CPU time (s): 6.104 -> 2.962 | Improved |
| use pDCAe instead of TBMM on HBC data with tolerance 1e-6 | TgSLOPE · HBC data, tolerance 1e-6 | CPU time (s): 668.040 -> 99.964 | Improved |
| use TgSLOPE instead of TBMM, discovered features | HBC data · HBC data, tolerance 1e-4 | Discovery: 242.50 -> 47.95 | Improved |
| use TgSLOPE instead of TgLASSO, prediction error | HBC data · HBC data, tolerance 1e-6 | MSPE: 0.0861 -> 0.0838 | Improved |
| add sparsity (TgSLOPE) versus no sparse penalty (TLRR), feature selection on HBC (ablation) | TLRR · HBC data, tolerance 1e-4 | Discovery: 536.30 -> 47.95 | Improved |
| increase model size p from 2000 to 6000 (ablation) | TgSLOPE · Synthetic Gaussian design | TgFDR: 0.007 -> 0.014 | Hurt |
| use TgSLOPE versus TgLASSO on estimation error at p=2000 | TgLASSO · Synthetic Gaussian design, p=2000 | RgEE: 3.44e-2 -> 5.59e-2 | Hurt |
Closest papers by meaning
- Non-Convex Projected Gradient Descent for Generalized Low-Rank Tensor Regression (JMLR 2019 · similarity 0.89)
- High-Dimensional Tensor Regression With Oracle Properties (ICML 2025 · similarity 0.88)
- Guaranteed Nonconvex Low-Rank Tensor Estimation via Scaled Gradient Descent (JMLR 2026 · similarity 0.88)
- Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation from Incomplete Measurements (JMLR 2022 · similarity 0.87)
- Computational and Statistical Guarantees for Tensor-on-Tensor Regression With Tensor Train Decomposition (TPAMI 2025 · similarity 0.87)
- Low-Rank Tensor Transitions (LoRT) for Transferable Tensor Regression (ICML 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
