We study the problem of supervised linear dimensionality reduction, taking an information-theoretic viewpoint. The linear projection matrix is designed by maximizing the mutual information between the projected signal and the class label (based on a Shannon entropy measure). By harnessing a recent theoretical result on the gradient of mutual information, the above optimization problem can be solved directly using gradient descent, without requiring simplification of the objective function. Theoretical analysis and empirical comparison are made between the proposed method and two closely related methods (Linear Discriminant Analysis and Information Discriminant Analysis), and comparisons are also made with a method in which Renyi entropy is used to define the mutual information (in this case the gradient may be computed simply, under a special parameter setting). Relative to these alternative approaches, the proposed method achieves promising results on real datasets.
Kullback-Leibler Penalized Sparse Discriminant Analysis for Event-Related Potential Classification
Instituto de Investigación en Señales, Sistemas e Inteligencia Computacional, UNL, CONICET, FICH(信号、系统与智能计算研究所,国立利托拉尔大学,国家科学与技术研究理事会,水文与工程系);Facultad de Ingeniería, Universidad Nacional de Entre Ríos(国立恩特雷里奥斯大学工程学院);Instituto de Matemática Aplicada del Litoral, UNL, CONICET, FIQ(滨海应用数学研究所,国立利托拉尔大学,国家科学与技术研究理事会,化学工程系)
Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI
ShanghaiTech University(上海科技大学);Shenzhen Research Institute of Big Data(深圳大数据研究院);Peking University(北京大学);The Chinese University of Hong Kong (Shenzhen)(香港中文大学(深圳));Weizmann Institute of Science(魏茨曼科学研究所);Peng Cheng Laboratory(鹏城实验室)
Communication-Efficient Distributed SGD with Compressed Sensing
School of Engineering and Applied Sciences, Harvard University(哈佛大学工程与应用科学学院);School of Electrical, Computer and Energy Engineering, Arizona State University(亚利桑那州立大学电气、计算机与能源工程学院)
FedComLoc: Communication-Efficient Distributed Training of Sparse and Quantized Models
King Abdullah University of Science and Technology (KAUST)(国王阿卜杜勒-阿齐兹大学科学与技术学院);SDAIA-KAUST Center of Excellence in Data Science and Artificial Intelligence (SDAIA-KAUST AI)(SDAIA-KAUST数据科学与人工智能卓越中心)
Neuro-inspired Ensemble-to-Ensemble Communication Primitives for Sparse and Efficient ANNs
Archimedes, Athena Research Center(阿基米德研究中心);Harvard Medical School(哈佛医学院);University of Crete(希腊克里特大学);Foundation for Research and Technology-Hellas(希腊研究与技术基金会)
A Photonic-Circuits-Inspired Compact Network: Toward Real-Time Wireless Signal Classification at the Edge
Princeton University(普林斯顿大学);Queen’s University(女王大学);Vector Institute(矢量研究所);Lockheed AI center(洛克希德人工智能中心);the Chinese University of Hong Kong(香港中文大学)
CSI-BERT2: A BERT-inspired Framework for Efficient CSI Prediction and Classification in Wireless Communication and Sensing
Shenzhen Research Institute of Big Data(深圳大数据研究院);The Chinese University of Hong Kong (Shenzhen)(香港中文大学(深圳));Department of Electrical and Electronic Engineering(电子与电气工程系);Department of Information Science and Engineering(信息科学与工程系);KTH Royal Institute of Technology(皇家理工学院)
Hybrid Quantum-inspired Kolmogorov-Arnold Networks for Privacy-Aware Federated Biosignal Learning
National Taiwan University(台湾大学);National Center for High-Performance Computing(国家高速计算机中心);National Institutes of Applied Research(应用研究院);Brookhaven National Laboratory(布鲁克海文国家实验室);Korea Advanced Institute of Science and Technology(韩国科学技术院);Beth Israel Deaconess Medical Center(贝斯以色列女执事医疗中心);Harvard University(哈佛大学);National Yang Ming Chiao Tung University(国立阳明交通大学);National Center for Theoretical Sciences(国家理论科学中心)