• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    An Adaptive Regularization Approach to Portfolio Optimization

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Ballal, Tarig
    Abdelrahman, Abdelrahman S.
    Muqaibel, Ali H.
    Al-Naffouri, Tareq Y. cc
    KAUST Department
    Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
    Electrical and Computer Engineering Program
    KAUST Grant Number
    OSR-CRG2019-4041
    Date
    2021-05-13
    Online Publication Date
    2021-05-13
    Print Publication Date
    2021-06-06
    Permanent link to this record
    http://hdl.handle.net/10754/669254
    
    Metadata
    Show full item record
    Abstract
    We address the portfolio optimization problem using the global minimum variance portfolio (GMVP). The GMVP gives the weights as a function of the inverse of the covariance matrix (CM) of the stock net returns in a closed-form. The matrix inversion operation usually intensifies the impact of noise when the matrix is ill-conditioned, which often happens when the sample covariance matrix (SCM) is used. A regularized sample covariance matrix (RSCM) is usually used to alleviate the problem. In this work, we address the regularization issue from a different perspective. We manipulate the expression of the GMVP weights to convert it to an inner product of two vectors; then, we focus on obtaining accurate estimations of these vectors. We show that this approach results in a formula similar to those of the RSCM based methods, yet with a different interpretation of the regularization parameter’s role. In the proposed approach, the regularization parameter is adjusted adaptively based on the current stock returns, which results in improved performance and enhanced robustness to noise. Our results demonstrate that, with proper regularization parameter tuning, the proposed adaptively regularized GMVP outperforms state-of-the-art RSCM methods in different test scenarios.
    Citation
    Ballal, T., Abdelrahman, A. S., Muqaibel, A. H., & Al-Naffouri, T. Y. (2021). An Adaptive Regularization Approach to Portfolio Optimization. ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). doi:10.1109/icassp39728.2021.9413865
    Sponsors
    This work was supported by the King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research (OSR) under Award OSR-CRG2019-4041.
    Publisher
    IEEE
    Conference/Event name
    ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
    ISBN
    9781728176055
    DOI
    10.1109/icassp39728.2021.9413865
    Additional Links
    https://ieeexplore.ieee.org/document/9413865/
    ae974a485f413a2113503eed53cd6c53
    10.1109/icassp39728.2021.9413865
    Scopus Count
    Collections
    Conference Papers; Electrical and Computer Engineering Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.