Sparse Index Tracking With K-Sparsity or ϵ-Deviation Constraint via ℓ0-Norm Minimization
Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a market index. It can be considered as parameter learning in an adaptive system, in which we periodically update the selected assets and thei...
Saved in:
Published in | IEEE transaction on neural networks and learning systems Vol. 34; no. 12; pp. 10930 - 10943 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
United States
IEEE
01.12.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a market index. It can be considered as parameter learning in an adaptive system, in which we periodically update the selected assets and their investment percentages based on the sliding window approach. However, many existing algorithms for sparse index tracking cannot explicitly and directly control the number of assets or the tracking error. This article formulates sparse index tracking as two constrained optimization problems and then proposes two algorithms, namely, nonnegative orthogonal matching pursuit with projected gradient descent (NNOMP-PGD) and alternating direction method of multipliers for <inline-formula> <tex-math notation="LaTeX">\ell _{0} </tex-math></inline-formula>-norm (ADMM-<inline-formula> <tex-math notation="LaTeX">\ell _{0} </tex-math></inline-formula>). The NNOMP-PGD aims at minimizing the tracking error subject to the number of selected assets less than or equal to a predefined number. With the NNOMP-PGD, investors can directly and explicitly control the number of selected assets. The ADMM-<inline-formula> <tex-math notation="LaTeX">\ell _{0} </tex-math></inline-formula> aims at minimizing the number of selected assets subject to the tracking error that is upper bounded by a preset threshold. It can directly and explicitly control the tracking error. The convergence of the two proposed algorithms is also presented. With our algorithms, investors can explicitly and directly control the number of selected assets or the tracking error of the resultant portfolio. In addition, numerical experiments demonstrate that the proposed algorithms outperform the existing approaches. |
---|---|
AbstractList | Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a market index. It can be considered as parameter learning in an adaptive system, in which we periodically update the selected assets and their investment percentages based on the sliding window approach. However, many existing algorithms for sparse index tracking cannot explicitly and directly control the number of assets or the tracking error. This article formulates sparse index tracking as two constrained optimization problems and then proposes two algorithms, namely, nonnegative orthogonal matching pursuit with projected gradient descent (NNOMP-PGD) and alternating direction method of multipliers for l0 -norm (ADMM- l0 ). The NNOMP-PGD aims at minimizing the tracking error subject to the number of selected assets less than or equal to a predefined number. With the NNOMP-PGD, investors can directly and explicitly control the number of selected assets. The ADMM- l0 aims at minimizing the number of selected assets subject to the tracking error that is upper bounded by a preset threshold. It can directly and explicitly control the tracking error. The convergence of the two proposed algorithms is also presented. With our algorithms, investors can explicitly and directly control the number of selected assets or the tracking error of the resultant portfolio. In addition, numerical experiments demonstrate that the proposed algorithms outperform the existing approaches.Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a market index. It can be considered as parameter learning in an adaptive system, in which we periodically update the selected assets and their investment percentages based on the sliding window approach. However, many existing algorithms for sparse index tracking cannot explicitly and directly control the number of assets or the tracking error. This article formulates sparse index tracking as two constrained optimization problems and then proposes two algorithms, namely, nonnegative orthogonal matching pursuit with projected gradient descent (NNOMP-PGD) and alternating direction method of multipliers for l0 -norm (ADMM- l0 ). The NNOMP-PGD aims at minimizing the tracking error subject to the number of selected assets less than or equal to a predefined number. With the NNOMP-PGD, investors can directly and explicitly control the number of selected assets. The ADMM- l0 aims at minimizing the number of selected assets subject to the tracking error that is upper bounded by a preset threshold. It can directly and explicitly control the tracking error. The convergence of the two proposed algorithms is also presented. With our algorithms, investors can explicitly and directly control the number of selected assets or the tracking error of the resultant portfolio. In addition, numerical experiments demonstrate that the proposed algorithms outperform the existing approaches. Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a market index. It can be considered as parameter learning in an adaptive system, in which we periodically update the selected assets and their investment percentages based on the sliding window approach. However, many existing algorithms for sparse index tracking cannot explicitly and directly control the number of assets or the tracking error. This article formulates sparse index tracking as two constrained optimization problems and then proposes two algorithms, namely, nonnegative orthogonal matching pursuit with projected gradient descent (NNOMP-PGD) and alternating direction method of multipliers for [Formula Omitted]-norm (ADMM-[Formula Omitted]). The NNOMP-PGD aims at minimizing the tracking error subject to the number of selected assets less than or equal to a predefined number. With the NNOMP-PGD, investors can directly and explicitly control the number of selected assets. The ADMM-[Formula Omitted] aims at minimizing the number of selected assets subject to the tracking error that is upper bounded by a preset threshold. It can directly and explicitly control the tracking error. The convergence of the two proposed algorithms is also presented. With our algorithms, investors can explicitly and directly control the number of selected assets or the tracking error of the resultant portfolio. In addition, numerical experiments demonstrate that the proposed algorithms outperform the existing approaches. Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a market index. It can be considered as parameter learning in an adaptive system, in which we periodically update the selected assets and their investment percentages based on the sliding window approach. However, many existing algorithms for sparse index tracking cannot explicitly and directly control the number of assets or the tracking error. This article formulates sparse index tracking as two constrained optimization problems and then proposes two algorithms, namely, nonnegative orthogonal matching pursuit with projected gradient descent (NNOMP-PGD) and alternating direction method of multipliers for ℓ₀-norm (ADMM-ℓ₀). The NNOMP-PGD aims at minimizing the tracking error subject to the number of selected assets ≤ a predefined number. With the NNOMP-PGD, investors can directly and explicitly control the number of selected assets. The ADMM-ℓ₀ aims at minimizing the number of selected assets subject to the tracking error that is upper bounded by a preset threshold. It can directly and explicitly control the tracking error. The convergence of the two proposed algorithms is also presented. With our algorithms, investors can explicitly and directly control the number of selected assets or the tracking error of the resultant portfolio. In addition, numerical experiments demonstrate that the proposed algorithms outperform the existing approaches. Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a market index. It can be considered as parameter learning in an adaptive system, in which we periodically update the selected assets and their investment percentages based on the sliding window approach. However, many existing algorithms for sparse index tracking cannot explicitly and directly control the number of assets or the tracking error. This article formulates sparse index tracking as two constrained optimization problems and then proposes two algorithms, namely, nonnegative orthogonal matching pursuit with projected gradient descent (NNOMP-PGD) and alternating direction method of multipliers for <inline-formula> <tex-math notation="LaTeX">\ell _{0} </tex-math></inline-formula>-norm (ADMM-<inline-formula> <tex-math notation="LaTeX">\ell _{0} </tex-math></inline-formula>). The NNOMP-PGD aims at minimizing the tracking error subject to the number of selected assets less than or equal to a predefined number. With the NNOMP-PGD, investors can directly and explicitly control the number of selected assets. The ADMM-<inline-formula> <tex-math notation="LaTeX">\ell _{0} </tex-math></inline-formula> aims at minimizing the number of selected assets subject to the tracking error that is upper bounded by a preset threshold. It can directly and explicitly control the tracking error. The convergence of the two proposed algorithms is also presented. With our algorithms, investors can explicitly and directly control the number of selected assets or the tracking error of the resultant portfolio. In addition, numerical experiments demonstrate that the proposed algorithms outperform the existing approaches. |
Author | Leung, Chi-Sing So, Hing Cheung Li, Xiao Peng Shi, Zhang-Lei |
Author_xml | – sequence: 1 givenname: Xiao Peng orcidid: 0000-0002-5448-7219 surname: Li fullname: Li, Xiao Peng email: x.p.li@my.cityu.edu.hk organization: Department of Electrical Engineering, City University of Hong Kong, Hong Kong, China – sequence: 2 givenname: Zhang-Lei orcidid: 0000-0002-6637-4975 surname: Shi fullname: Shi, Zhang-Lei email: shizhanglei2010@163.com organization: College of Science, China University of Petroleum (East China), Qingdao, China – sequence: 3 givenname: Chi-Sing orcidid: 0000-0003-0962-6723 surname: Leung fullname: Leung, Chi-Sing email: eeleungc@cityu.edu.hk organization: Department of Electrical Engineering, City University of Hong Kong, Hong Kong, China – sequence: 4 givenname: Hing Cheung orcidid: 0000-0001-8396-7898 surname: So fullname: So, Hing Cheung email: hcso@ee.cityu.edu.hk organization: Department of Electrical Engineering, City University of Hong Kong, Hong Kong, China |
BackLink | https://www.ncbi.nlm.nih.gov/pubmed/35576417$$D View this record in MEDLINE/PubMed |
BookMark | eNpdkMtO20AUhkcoiKSBF2glNBKbbhzmzNWzrAK0UUNYEARSF9YYH5dJ43EY21Xpum_QZ-lz9B14EixuC87mXP5Pv47-d2QQ6oCEvAc2AWD2cLlYzM8nnHE-EWAgBbtFRhw0T7hI08HrbK6GZK9pVqwvzZSWdocMhVJGSzAj8u1842KDdBYK_EWX0V3_8OE7vfTtDf2aPIq-vaN1pP__JUf407vW14FO69C00fnQ0v5E7__8ZcmijhU99cFX_vcjtUu2S7ducO-5j8nFyfFy-iWZn32eTT_NE8-VbRPNSikhR1sCFLxwwpaY59qhyqWTOQPFCwnotFD9gmVqXG5FCsYpBrlAMSYfn3w3sb7tsGmzyjfXuF67gHXXZFxrpTRYo3v04A26qrsY-u8ynlqVphKk6qn9Z6rLKyyyTfSVi3fZS2w98OEJ8Ij4Kltj-ny5eABuXXvk |
CODEN | ITNNAL |
ContentType | Journal Article |
Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023 |
DBID | 97E RIA RIE NPM 7QF 7QO 7QP 7QQ 7QR 7SC 7SE 7SP 7SR 7TA 7TB 7TK 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8 |
DOI | 10.1109/TNNLS.2022.3171819 |
DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) PubMed Aluminium Industry Abstracts Biotechnology Research Abstracts Calcium & Calcified Tissue Abstracts Ceramic Abstracts Chemoreception Abstracts Computer and Information Systems Abstracts Corrosion Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts Materials Business File Mechanical & Transportation Engineering Abstracts Neurosciences Abstracts Solid State and Superconductivity Abstracts METADEX Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database Aerospace Database Materials Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Biotechnology and BioEngineering Abstracts MEDLINE - Academic |
DatabaseTitle | PubMed Materials Research Database Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Materials Business File Aerospace Database Engineered Materials Abstracts Biotechnology Research Abstracts Chemoreception Abstracts Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Civil Engineering Abstracts Aluminium Industry Abstracts Electronics & Communications Abstracts Ceramic Abstracts Neurosciences Abstracts METADEX Biotechnology and BioEngineering Abstracts Computer and Information Systems Abstracts Professional Solid State and Superconductivity Abstracts Engineering Research Database Calcium & Calcified Tissue Abstracts Corrosion Abstracts MEDLINE - Academic |
DatabaseTitleList | MEDLINE - Academic Materials Research Database PubMed |
Database_xml | – sequence: 1 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Computer Science |
EISSN | 2162-2388 |
EndPage | 10943 |
ExternalDocumentID | 35576417 9775642 |
Genre | orig-research Journal Article |
GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACIWK ACPRK AENEX AFRAH AGQYO AGSQL AHBIQ AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD IFIPE IPLJI JAVBF M43 MS~ O9- OCL PQQKQ RIA RIE RNS NPM 7QF 7QO 7QP 7QQ 7QR 7SC 7SE 7SP 7SR 7TA 7TB 7TK 7U5 8BQ 8FD F28 FR3 H8D JG9 JQ2 KR7 L7M L~C L~D P64 7X8 |
ID | FETCH-LOGICAL-i259t-60f441be9f11d2da39febb6ae5b4a4b0152d41ea635b01ef87ab93817a501b3e3 |
IEDL.DBID | RIE |
ISSN | 2162-237X 2162-2388 |
IngestDate | Thu Jul 10 22:11:14 EDT 2025 Mon Jun 30 05:46:00 EDT 2025 Mon Jul 21 05:46:38 EDT 2025 Wed Aug 27 02:07:45 EDT 2025 |
IsPeerReviewed | false |
IsScholarly | true |
Issue | 12 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-i259t-60f441be9f11d2da39febb6ae5b4a4b0152d41ea635b01ef87ab93817a501b3e3 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
ORCID | 0000-0002-6637-4975 0000-0001-8396-7898 0000-0003-0962-6723 0000-0002-5448-7219 |
PMID | 35576417 |
PQID | 2895884145 |
PQPubID | 85436 |
PageCount | 14 |
ParticipantIDs | ieee_primary_9775642 proquest_journals_2895884145 pubmed_primary_35576417 proquest_miscellaneous_2665561976 |
PublicationCentury | 2000 |
PublicationDate | 2023-12-01 |
PublicationDateYYYYMMDD | 2023-12-01 |
PublicationDate_xml | – month: 12 year: 2023 text: 2023-12-01 day: 01 |
PublicationDecade | 2020 |
PublicationPlace | United States |
PublicationPlace_xml | – name: United States – name: Piscataway |
PublicationTitle | IEEE transaction on neural networks and learning systems |
PublicationTitleAbbrev | TNNLS |
PublicationTitleAlternate | IEEE Trans Neural Netw Learn Syst |
PublicationYear | 2023 |
Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
SSID | ssj0000605649 |
Score | 2.5148654 |
Snippet | Sparse index tracking, as one of the passive investment strategies, is to track a benchmark financial index via constructing a portfolio with a few assets in a... |
SourceID | proquest pubmed ieee |
SourceType | Aggregation Database Index Database Publisher |
StartPage | 10930 |
SubjectTerms | Adaptive systems Algorithms Alternating direction method of multipliers (ADMM) Constraints Gradient methods index tracking Indexes Investment Investment strategy Matched pursuit Matching pursuit algorithms nonnegative orthogonal matching pursuit (NNOMP) Optimization Portfolios projected gradient descent (PGD) Signal processing algorithms sparse recovery Target tracking Tracking control Tracking errors |
Title | Sparse Index Tracking With K-Sparsity or ϵ-Deviation Constraint via ℓ0-Norm Minimization |
URI | https://ieeexplore.ieee.org/document/9775642 https://www.ncbi.nlm.nih.gov/pubmed/35576417 https://www.proquest.com/docview/2895884145 https://www.proquest.com/docview/2665561976 |
Volume | 34 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwEB0BJy7sS9lkJI64JI7jOEfEIrb2AohKHCo7mYgKkVaQXjjzB3wL38E_8CWMs_SAQOKWxFEWT5x5b-yZB7AndRp52iY8EdpwqRPJtYgyHmZJlIYxUQp0cchOV53dyote2JuC_UkuDCKWi8-w7TbLufx0mIxdqOyAsEpIeHkapom4Vblak3iKR7hclWhX-EpwEUS9JkfGiw9uut2ra2KDQhBJpd-x76qFkquNlPQbYZW_MWbpa07nodM8ZbXE5LE9Lmw7ef1RwPG_r7EAczXoZIfVV7IIU5gvwXwj6MDq8b0M99cj4rnIzl0JRUZuLHGBdHY3KB7YJS8bCbSz4TP7_ODH5FJLszIn-llKTRSMDrGvt3ePdwkLs84gHzzViZ4rcHt6cnN0xmv1BT4gSlRw5WUElSzGme-nIjVBnKG1ymBopZGWYIRIpY-GEAvtYKYjY2NX78-Enm8DDFZhJh_muA4MCcNYHSgdaZQyNSYIA5mgQuKWKlO2Bcuul_qjqsBGv-6gFmw1BunXI-ulTwTR5db6MmzB7qSZxoSb6DA5Dsd0jlJO9ZOQVgvWKkNOrt0YfeP3e27CrBOUrxasbMFM8TzGbYIdhd0pv7dvlzXUag |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NbtQwEB6VcoALBcrPQmmNxBFvY8d2nCMCqm27m0u3YiUOkZ1MxAqRrdrspWfeoM_S5-AdeBLG-dkDAqm3JI7y44kz3zf2zAfwTtkyiawveCGt48oWiluZVFxXRVLqlCgFhjjkLDOTc3Wy0IsteL_JhUHEdvEZjsNmO5dfrop1CJUdElbRhJfvwX3y-1p02VqbiEpEyNy0eFcKI7mMk8WQJROlh_Msm54RH5SSaCr9kEWoF0rONjFKDNIq_0eZrbc52oHZ8JzdIpPv43Xjx8X1XyUc7_oij-FRDzvZh-47eQJbWD-FnUHSgfUjfBe-nl0Q00V2HIooMnJkRQilsy_L5hs75W0jwXa2umS_bvkncqqtYVmQ_WzFJhpGh9jvnzcRzwgNs9myXv7oUz2fwfnR5_nHCe_1F_iSSFHDTVQRWPKYVkKUsnRxWqH3xqH2yilPQEKWSqAjzEI7WNnE-TRU_HM6Ej7G-Dls16saXwJDQjHexsYmFpUqnYt1rAo0SOzSVMaPYDf0Un7RldjI-w4awd5gkLwfW1c5UcSQXSuUHsHbTTONijDV4WpcrekcY4LuJ2GtEbzoDLm59mD0V_--5wE8mMxn03x6nJ2-hodBXr5bvrIH283lGt8QCGn8fvvt_QHVvtez |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Sparse+Index+Tracking+With+K-Sparsity+or+%CF%B5-Deviation+Constraint+via+%E2%84%930-Norm+Minimization&rft.jtitle=IEEE+transaction+on+neural+networks+and+learning+systems&rft.au=Li%2C+Xiao+Peng&rft.au=Shi%2C+Zhang-Lei&rft.au=Leung%2C+Chi-Sing&rft.au=So%2C+Hing+Cheung&rft.date=2023-12-01&rft.issn=2162-2388&rft.eissn=2162-2388&rft.volume=34&rft.issue=12&rft.spage=10930&rft_id=info:doi/10.1109%2FTNNLS.2022.3171819&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2162-237X&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2162-237X&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2162-237X&client=summon |