Decentralized Byzantine-resilient dictionary learning

DOI10.1002/STA4.70102MaRDI QIDQ7231091zbMATH OpenFDO

Authors X. Liu, Weidong Liu, Xiaojun Mao

Publication date 21 April 2026

Published in Stat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/STA4.70102

zbMATH Keywords

Byzantine failuredecentralized optimizationdictionary learningsignal compression and reconstruction

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
• Byzantine-resilient decentralized stochastic optimization with robust aggregation rules
• Byzantine-robust distributed online learning: taming adversarial participants in an adversarial environment
• Byzantine-robust distributed sparse learning for M-estimation
• Decentralized dictionary learning over time-varying digraphs
• Dictionary Learning Over Distributed Models
• Locality-sensitive dictionary learning for sparse representation based classification
• Online learning for matrix factorization and sparse coding
• Source Separation of Convolutive and Noisy Mixtures Using Audio-Visual Dictionary Learning and Probabilistic Time-Frequency Masking
• Variance reduced median-of-means estimator for Byzantine-robust distributed inference

This page was built for publication: Decentralized Byzantine-resilient dictionary learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231091)