{"title":"Stable Outlier-Robust Signal Recovery Over Networks: A Convex Analytic Approach Using Minimax Concave Loss","authors":"Maximilian H. V. Tillmann;Masahiro Yukawa","doi":"10.1109/TSIPN.2024.3451992","DOIUrl":null,"url":null,"abstract":"This paper presents a mathematically rigorous framework of remarkably-robust signal recovery over networks. The proposed framework is based on the \n<italic>minimax concave (MC)</i>\n loss, which is a weakly convex function so that it attains i) remarkable outlier-robustness and ii) guarantee of convergence to a solution of the posed problem. We present a novel problem formulation which involves an auxiliary vector so that the formulation accommodates statistical properties of signal, noise, and outliers. We show the conditions to guarantee convexity of the local and global objectives. Via reformulation, the distributed triangularly preconditioned primal-dual algorithm is applied to the posed problem. The numerical examples show that our proposed formulation exhibits remarkable robustness under devastating outliers as well as outperforming the existing methods. Comparisons between the local and global convexity conditions are also presented.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"690-705"},"PeriodicalIF":3.0000,"publicationDate":"2024-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Information Processing over Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10659192/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents a mathematically rigorous framework of remarkably-robust signal recovery over networks. The proposed framework is based on the
minimax concave (MC)
loss, which is a weakly convex function so that it attains i) remarkable outlier-robustness and ii) guarantee of convergence to a solution of the posed problem. We present a novel problem formulation which involves an auxiliary vector so that the formulation accommodates statistical properties of signal, noise, and outliers. We show the conditions to guarantee convexity of the local and global objectives. Via reformulation, the distributed triangularly preconditioned primal-dual algorithm is applied to the posed problem. The numerical examples show that our proposed formulation exhibits remarkable robustness under devastating outliers as well as outperforming the existing methods. Comparisons between the local and global convexity conditions are also presented.
期刊介绍:
The IEEE Transactions on Signal and Information Processing over Networks publishes high-quality papers that extend the classical notions of processing of signals defined over vector spaces (e.g. time and space) to processing of signals and information (data) defined over networks, potentially dynamically varying. In signal processing over networks, the topology of the network may define structural relationships in the data, or may constrain processing of the data. Topics include distributed algorithms for filtering, detection, estimation, adaptation and learning, model selection, data fusion, and diffusion or evolution of information over such networks, and applications of distributed signal processing.