IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v433y2022ics0096300322005070.html
   My bibliography  Save this article

Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer

Author

Listed:
  • Mao, Xianpeng
  • Yang, Yuning

Abstract

Best sparse tensor rank-1 approximation consists of finding a projection of a given data tensor onto the set of sparse rank-1 tensors, which is important in sparse tensor decomposition and related problems. Existing models used ℓ0 or ℓ1 norms to pursue sparsity. In this work, we first construct a truncated exponential induced regularizer to encourage sparsity, and prove that this regularizer admits a reweighted property. Lower bounds for nonzero entries and upper bounds for the number of nonzero entries of the stationary points of the associated optimization problem are studied. By using the reweighted property of the regularizer, we develop an iteratively reweighted algorithm for solving the problem, and establish its convergence to a stationary point without any assumption. In particular, we show that if the parameter of the regularizer is small enough, then the support of the iterative points will be fixed after finitely many steps. Numerical experiments illustrate the effectiveness of the proposed model and algorithm.

Suggested Citation

  • Mao, Xianpeng & Yang, Yuning, 2022. "Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer," Applied Mathematics and Computation, Elsevier, vol. 433(C).
    • Handle: RePEc:eee:apmaco:v:433:y:2022:i:c:s0096300322005070
    DOI: 10.1016/j.amc.2022.127433
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322005070
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127433?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xianpeng Mao & Yuning Yang, 2022. "Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors," Journal of Global Optimization, Springer, vol. 84(1), pages 229-253, September.
    2. Fan J. & Li R., 2001. "Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 1348-1360, December.
    3. Will Wei Sun & Lexin Li, 2019. "Dynamic Tensor Clustering," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 114(528), pages 1894-1907, October.
    4. Junhui Wang, 2010. "Consistent selection of the number of clusters via crossvalidation," Biometrika, Biometrika Trust, vol. 97(4), pages 893-904.
    5. Will Wei Sun & Junwei Lu & Han Liu & Guang Cheng, 2017. "Provable sparse tensor decomposition," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(3), pages 899-916, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xianpeng Mao & Yuning Yang, 2022. "Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors," Journal of Global Optimization, Springer, vol. 84(1), pages 229-253, September.
    2. Li, Gen, 2020. "Generalized Co-clustering Analysis via Regularized Alternating Least Squares," Computational Statistics & Data Analysis, Elsevier, vol. 150(C).
    3. Ke, Baofang & Zhao, Weihua & Wang, Lei, 2023. "Smoothed tensor quantile regression estimation for longitudinal data," Computational Statistics & Data Analysis, Elsevier, vol. 178(C).
    4. Tutz, Gerhard & Pößnecker, Wolfgang & Uhlmann, Lorenz, 2015. "Variable selection in general multinomial logit models," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 207-222.
    5. Xu, Yang & Zhao, Shishun & Hu, Tao & Sun, Jianguo, 2021. "Variable selection for generalized odds rate mixture cure models with interval-censored failure time data," Computational Statistics & Data Analysis, Elsevier, vol. 156(C).
    6. Emmanouil Androulakis & Christos Koukouvinos & Kalliopi Mylona & Filia Vonta, 2010. "A real survival analysis application via variable selection methods for Cox's proportional hazards model," Journal of Applied Statistics, Taylor & Francis Journals, vol. 37(8), pages 1399-1406.
    7. Singh, Rakhi & Stufken, John, 2024. "Factor selection in screening experiments by aggregation over random models," Computational Statistics & Data Analysis, Elsevier, vol. 194(C).
    8. Lili Pan & Ziyan Luo & Naihua Xiu, 2017. "Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 104-118, October.
    9. Gerhard Tutz & Moritz Berger, 2018. "Tree-structured modelling of categorical predictors in generalized additive regression," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 737-758, September.
    10. Chenchuan (Mark) Li & Ulrich K. Müller, 2021. "Linear regression with many controls of limited explanatory power," Quantitative Economics, Econometric Society, vol. 12(2), pages 405-442, May.
    11. Shuichi Kawano, 2014. "Selection of tuning parameters in bridge regression models via Bayesian information criterion," Statistical Papers, Springer, vol. 55(4), pages 1207-1223, November.
    12. Hang Yu & Yuanjia Wang & Donglin Zeng, 2023. "A general framework of nonparametric feature selection in high‐dimensional data," Biometrics, The International Biometric Society, vol. 79(2), pages 951-963, June.
    13. Qianyun Li & Runmin Shi & Faming Liang, 2019. "Drug sensitivity prediction with high-dimensional mixture regression," PLOS ONE, Public Library of Science, vol. 14(2), pages 1-18, February.
    14. Shuang Zhang & Xingdong Feng, 2022. "Distributed identification of heterogeneous treatment effects," Computational Statistics, Springer, vol. 37(1), pages 57-89, March.
    15. Jun Zhu & Hsin‐Cheng Huang & Perla E. Reyes, 2010. "On selection of spatial linear models for lattice data," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 72(3), pages 389-402, June.
    16. Zak-Szatkowska, Malgorzata & Bogdan, Malgorzata, 2011. "Modified versions of the Bayesian Information Criterion for sparse Generalized Linear Models," Computational Statistics & Data Analysis, Elsevier, vol. 55(11), pages 2908-2924, November.
    17. Lam, Clifford, 2008. "Estimation of large precision matrices through block penalization," LSE Research Online Documents on Economics 31543, London School of Economics and Political Science, LSE Library.
    18. Soave, David & Lawless, Jerald F., 2023. "Regularized regression for two phase failure time studies," Computational Statistics & Data Analysis, Elsevier, vol. 182(C).
    19. Ping Wu & Xinchao Luo & Peirong Xu & Lixing Zhu, 2017. "New variable selection for linear mixed-effects models," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 69(3), pages 627-646, June.
    20. Jianqing Fan & Xu Han, 2017. "Estimation of the false discovery proportion with unknown dependence," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(4), pages 1143-1164, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:433:y:2022:i:c:s0096300322005070. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.