pwc-archive/papers-with-abstracts huggingface dataset:
Nash CoT: Multi-Path Inference with Preference Equilibrium
Authors: Ziqi Zhang, Cunxiang Wang, Xiong Xiao, Yue Zhang, Donglin Wang
Date: 2024-06-18 00:00:00
Tasks: Diversity, Question Answering

Chain of thought (CoT) is a reasoning framework that can enhance the performance of Large Language Models (LLMs) on complex inference tasks. In particular, among various studies related to CoT, multi-path inference stands out as a simple yet effective improvement. However, there is no optimal setting for the number of inference paths. Therefore, we have to increase the number of inference paths to obtain better results, which in turn increases the inference cost. To address this limitation, we can utilize question-related role templates to guide LLMs into relevant roles, thereby increasing the possibility of correct inferences for each path and further reducing dependence on the number of inference paths while improving reasoning accuracy. However, placing LLMs into specific roles may reduce their reasoning diversity and performance on a few tasks where role dependence is low. To alleviate the excessive immersion of the LLM into a specific role, we propose Nash CoT by constructing a game system on each path that balances the generation from role-specific LLMs' and the general LLMs' generation, thereby ensuring both effective role adoption and diversity in LLM generation further maintaining the performance of multi-path inference while reducing the requirement of the number of inference paths. We evaluate Nash CoT across various inference tasks, including Arabic Reasoning, Commonsense Question Answering, and Symbolic Inference, achieving results that are comparable to or better than those of multi-path CoT with the equal number of inference paths.
Scaling Law in Neural Data: Non-Invasive Speech Decoding with 175 Hours of EEG Data
Authors: Motoshige Sato, Kenichi Tomeoka, Ilya Horiguchi, Kai Arulkumaran, Ryota Kanai, Shuntaro Sasai
Date: 2024-07-10 00:00:00
Tasks: Decoder, EEG, Representation Learning

Brain-computer interfaces (BCIs) hold great potential for aiding individuals with speech impairments. Utilizing electroencephalography (EEG) to decode speech is particularly promising due to its non-invasive nature. However, recordings are typically short, and the high variability in EEG data has led researchers to focus on classification tasks with a few dozen classes. To assess its practical applicability for speech neuroprostheses, we investigate the relationship between the size of EEG data and decoding accuracy in the open vocabulary setting. We collected extensive EEG data from a single participant (175 hours) and conducted zero-shot speech segment classification using self-supervised representation learning. The model trained on the entire dataset achieved a top-1 accuracy of 48\% and a top-10 accuracy of 76\%, while mitigating the effects of myopotential artifacts. Conversely, when the data was limited to the typical amount used in practice ($\sim$10 hours), the top-1 accuracy dropped to 2.5\%, revealing a significant scaling effect. Additionally, as the amount of training data increased, the EEG latent representation progressively exhibited clearer temporal structures of spoken phrases. This indicates that the decoder can recognize speech segments in a data-driven manner without explicit measurements of word recognition. This research marks a significant step towards the practical realization of EEG-based speech BCIs.
UAV-assisted Unbiased Hierarchical Federated Learning: Performance and Convergence Analysis
Authors: Ruslan Zhagypar, Nour Kouzayha, Hesham ElSawy, Hayssam Dahrouj, Tareq Y. Al-Naffouri
Date: 2024-07-05 00:00:00
Tasks: Federated Learning

The development of the sixth generation (6G) of wireless networks is bound to streamline the transition of computation and learning towards the edge of the network. Hierarchical federated learning (HFL) becomes, therefore, a key paradigm to distribute learning across edge devices to reach global intelligence. In HFL, each edge device trains a local model using its respective data and transmits the updated model parameters to an edge server for local aggregation. The edge server, then, transmits the locally aggregated parameters to a central server for global model aggregation. The unreliability of communication channels at the edge and backhaul links, however, remains a bottleneck in assessing the true benefit of HFL-empowered systems. To this end, this paper proposes an unbiased HFL algorithm for unmanned aerial vehicle (UAV)-assisted wireless networks that counteracts the impact of unreliable channels by adjusting the update weights during local and global aggregations at UAVs and terrestrial base stations (BS), respectively. To best characterize the unreliability of the channels involved in HFL, we adopt tools from stochastic geometry to determine the success probabilities of the local and global model parameter transmissions. Accounting for such metrics in the proposed HFL algorithm aims at removing the bias towards devices with better channel conditions in the context of the considered UAV-assisted network.. The paper further examines the theoretical convergence guarantee of the proposed unbiased UAV-assisted HFL algorithm under adverse channel conditions. One of the developed approach's additional benefits is that it allows for optimizing and designing the system parameters, e.g., the number of UAVs and their corresponding heights. The paper results particularly highlight the effectiveness of the proposed unbiased HFL scheme as compared to conventional FL and HFL algorithms.
Science-Informed Deep Learning (ScIDL) With Applications to Wireless Communications
Authors: Atefeh Termehchi, Ekram Hossain, Isaac Woungang
Date: 2024-06-29 00:00:00
Tasks: Deep Learning

Given the extensive and growing capabilities offered by deep learning (DL), more researchers are turning to DL to address complex challenges in next-generation (xG) communications. However, despite its progress, DL also reveals several limitations that are becoming increasingly evident. One significant issue is its lack of interpretability, which is especially critical for safety-sensitive applications. Another significant consideration is that DL may not comply with the constraints set by physics laws or given security standards, which are essential for reliable DL. Additionally, DL models often struggle outside their training data distributions, which is known as poor generalization. Moreover, there is a scarcity of theoretical guidance on designing DL algorithms. These challenges have prompted the emergence of a burgeoning field known as science-informed DL (ScIDL). ScIDL aims to integrate existing scientific knowledge with DL techniques to develop more powerful algorithms. The core objective of this article is to provide a brief tutorial on ScIDL that illustrates its building blocks and distinguishes it from conventional DL. Furthermore, we discuss both recent applications of ScIDL and potential future research directions in the field of wireless communications.
Lossless data compression by large models
Authors: Ziguang Li, Chao Huang, Xuliang Wang, Haibo Hu, Cole Wyeth, Dongbo Bu, Quan Yu, Wen Gao, Xingwu Liu, Ming Li
Date: 2024-06-24 00:00:00
Tasks: Data Compression

Modern data compression methods are slowly reaching their limits after 80 years of research, millions of papers, and wide range of applications. Yet, the extravagant 6G communication speed requirement raises a major open question for revolutionary new ideas of data compression. We have previously shown all understanding or learning are compression, under reasonable assumptions. Large language models (LLMs) understand data better than ever before. Can they help us to compress data? The LLMs may be seen to approximate the uncomputable Solomonoff induction. Therefore, under this new uncomputable paradigm, we present LMCompress. LMCompress shatters all previous lossless compression algorithms, doubling the lossless compression ratios of JPEG-XL for images, FLAC for audios, and H.264 for videos, and quadrupling the compression ratio of bz2 for texts. The better a large model understands the data, the better LMCompress compresses.
Field-Enhanced Filtering in MIMO Learned Volterra Nonlinear Equalisation of Multi-Wavelength Systems
Authors: Nelson Castro, Sonia Boscolo, Andrew D. Ellis, Stylianos Sygletos
Date: 2024-06-23 00:00:00

We propose a novel MIMO-WDM Volterra-based nonlinear-equalisation scheme with adaptive time-domain nonlinear stages enhanced by filtering in both the power and optical signal waveforms. This approach efficiently captures the interplay between dispersion and non-linearity in each step, leading to $46\%$ complexity reduction for $9\times 9$-MIMO operation.
Belief Information based Deep Channel Estimation for Massive MIMO Systems
Authors: Jialong Xu, Liu Liu, Xin Wang, Lan Chen
Date: 2024-06-23 00:00:00

In the next generation wireless communication system, transmission rates should continue to rise to support emerging scenarios, e.g., the immersive communications. From the perspective of communication system evolution, multiple-input multiple-output (MIMO) technology remains pivotal for enhancing transmission rates. However, current MIMO systems rely on inserting pilot signals to achieve accurate channel estimation. As the increase of transmit stream, the pilots consume a significant portion of transmission resources, severely reducing the spectral efficiency. In this correspondence, we propose a belief information based mechanism. By introducing a plug-and-play belief information module, existing single-antenna channel estimation networks could be seamlessly adapted to multi-antenna channel estimation and fully exploit the spatial correlation among multiple antennas. Experimental results demonstrate that the proposed method can either improve 1 ~ 2 dB channel estimation performance or reduce 1/3 ~ 1/2 pilot overhead, particularly in bad channel conditions.
Model-based learning for multi-antenna multi-frequency location-to-channel mapping
Authors: Baptiste Chatelier, Vincent Corlay, Matthieu Crussière, Luc Le Magoarou
Date: 2024-06-17 00:00:00

Years of study of the propagation channel showed a close relation between a location and the associated communication channel response. The use of a neural network to learn the location-to-channel mapping can therefore be envisioned. The Implicit Neural Representation (INR) literature showed that classical neural architecture are biased towards learning low-frequency content, making the location-to-channel mapping learning a non-trivial problem. Indeed, it is well known that this mapping is a function rapidly varying with the location, on the order of the wavelength. This paper leverages the model-based machine learning paradigm to derive a problem-specific neural architecture from a propagation channel model. The resulting architecture efficiently overcomes the spectral-bias issue. It only learns low-frequency sparse correction terms activating a dictionary of high-frequency components. The proposed architecture is evaluated against classical INR architectures on realistic synthetic data, showing much better accuracy. Its mapping learning performance is explained based on the approximated channel model, highlighting the explainability of the model-based machine learning paradigm.
Spectral Toolkit of Algorithms for Graphs: Technical Report (2)
Authors: Peter Macgregor, He Sun
Date: 2024-06-06 00:00:00
Tasks: Clustering, Density Estimation

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient graph algorithms. This technical report presents the newly implemented component on locality sensitive hashing, kernel density estimation, and fast spectral clustering. The report includes a user's guide to the newly implemented algorithms, experiments and demonstrations of the new functionality, and several technical considerations behind our development.
Accelerating Mobile Edge Generation (MEG) by Constrained Learning
Authors: Xiaoxia Xu, Yuanwei Liu, Xidong Mu, Hong Xing, Arumugam Nallanathan
Date: 2024-07-09 00:00:00
Tasks: Denoising, Image Generation

A novel accelerated mobile edge generation (MEG) framework is proposed for generating high-resolution images on mobile devices. Exploiting a large-scale latent diffusion model (LDM) distributed across edge server (ES) and user equipment (UE), cost-efficient artificial intelligence generated content (AIGC) is achieved by transmitting low-dimensional features between ES and UE. To reduce overheads of both distributed computations and transmissions, a dynamic diffusion and feature merging scheme is conceived. By jointly optimizing the denoising steps and feature merging ratio, the image generation quality is maximized subject to latency and energy consumption constraints. To address this problem and tailor LDM sub-models, a low-complexity MEG acceleration protocol is developed. Particularly, a backbone meta-architecture is trained via offline distillation. Then, dynamic diffusion and feature merging are determined in online channel environment, which can be viewed as a constrained Markov Decision Process (MDP). A constrained variational policy optimization (CVPO) based MEG algorithm is further proposed for constraint-guaranteed learning, namely MEG-CVPO. Numerical results verify that: 1) The proposed framework can generate 1024$\times$1024 high-quality images over noisy channels while reducing over $40\%$ latency compared to conventional generation schemes. 2) The developed MEG-CVPO effectively mitigates constraint violations, thus flexibly controlling the trade-off between image distortion and generation costs.
Adaptive Backstepping and Non-singular Sliding Mode Control for Quadrotor UAVs with Unknown Time-varying Uncertainties
Authors: Arezo Shevidi, Hashim A. Hashim
Date: 2024-07-09 00:00:00
Tasks: LEMMA, Position

This paper presents a novel quaternion-based nonsingular control system for underactuated vertical-take-off and landing (VTOL) Unmanned Aerial Vehicles (UAVs). Position and attitude tracking is challenging regarding singularity and accuracy. Quaternion-based Adaptive Backstepping Control (QABC) is developed to tackle the underactuated issues of UAV control systems in a cascaded way. Leveraging the virtual control (auxiliary control) developed in the QABC, desired attitude components and required thrust are produced. Afterwards, we propose Quaternion-based Sliding Mode Control (QASMC) to enhance the stability and mitigate chattering issues. The sliding surface is modified to avoid singularity compared to conventional SMC. To improve the robustness of controllers, the control parameters are updated using adaptation laws. Furthermore, the asymptotic stability of translational and rotational dynamics is guaranteed by utilizing Lyapunov stability and Barbalet Lemma. Finally, the comprehensive comparison results are provided to verify the effectiveness of the proposed controllers in the presence of unknown time-varying parameter uncertainties and significant initial errors. Keywords: Non-singular Sliding Mode Control, Adaptive Backstepping Control, Unit-quaternion, Drones, Unmanned Aerial Vehicles, Asymptotic Stability, Position and Orientation Control
Precision Agriculture: Ultra-Compact Sensor and Reconfigurable Antenna for Joint Sensing and Communication
Authors: Ali Raza, Rasool Keshavarz, Negin Shariati
Date: 2024-07-10 00:00:00

In this paper, a joint sensing and communication system is presented for smart agriculture. The system integrates an Ultra-compact Soil Moisture Sensor (UCSMS) for precise sensing, along with a Pattern Reconfigurable Antenna (PRA) for efficient transmission of information to the base station. A multiturn complementary spiral resonator (MCSR) is etched onto the ground plane of a microstrip transmission line to achieve miniaturization. The UCSMS operates at 180 MHz with a 3-turn complementary spiral resonator (3-CSR), at 102 MHz with a 4- turn complementary spiral resonator (4-CSR), and at 86 MHz with a 5-turn complementary spiral resonator (5-CSR). Due to its low resonance frequency, the proposed UCSMS is insensitive to variations in the Volume Under Test (VUT) of soil. A probe-fed circular patch antenna is designed in the Wireless Local Area Network (WLAN) band (2.45 GHz) with a maximum measured gain of 5.63 dBi. Additionally, four varactor diodes are integrated across the slots on the bottom side of the substrate to achieve pattern reconfiguration. Six different radiation patterns have been achieved by using different bias conditions of the diodes. In standby mode, PRA can serve as a means for Wireless Power Transfer (WPT) or Energy Harvesting (EH) to store power in a battery. This stored power can then be utilized to bias the varactor diodes. The combination of UCSMS and PRA enables the realization of a joint sensing and communication system. The proposed system's planar and simple geometry, along with its high sensitivity of 2.05 %, makes it suitable for smart agriculture applications. Moreover, the sensor is adaptive and capable of measuring the permittivity of various Material Under Test (MUT) within the range of 1 to 23.
Estimation of the lateral mis-registrations of the GRAVITY + adaptive optics system
Authors: Anthony Berdeu, H. Bonnet, J. -B. Le Bouquin, C. Édouard, T. Gomes, P. Shchekaturov, R. Dembet, T. Paumard, S. Oberti, J. Kolb, F. Millour, P. Berio, O. Lai, F. Eisenhauer, P. Garcia, C. Straubmeier, L. Kreidberg, S. Hönig, D. Defrère
Date: 2024-07-10 00:00:00

Context. The GRAVITY+ upgrade implies a complete renewal of its adaptive optics (AO) systems. Its complex design, featuring moving components between the deformable mirrors and the wavefront sensors, requires the monitoring and auto-calibrating of the lateral mis-registrations of the system while in operation. Aims. For preset and target acquisition, large lateral registration errors must be assessed in open loop to bring the system to a state where the AO loop closes. In closed loop, these errors must be monitored and corrected, without impacting the science. Methods. With respect to the first requirement, our method is perturbative, with two-dimensional modes intentionally applied to the system and correlated to a reference interaction matrix. For the second requirement, we applied a non-perturbative approach that searches for specific patterns in temporal correlations in the closed loop telemetry. This signal is produced by the noise propagation through the AO loop. Results. Our methods were validated through simulations and on the GRAVITY+ development bench. The first method robustly estimates the lateral mis-registrations, in a single fit and with a sub-subaperture resolution while in an open loop. The second method is not absolute, but it does successfully bring the system towards a negligible mis-registration error, with a limited turbulence bias. Both methods proved to robustly work on a system still under development and not fully characterised. Conclusions. Tested with Shack-Hartmann wavefront sensors, the proposed methods are versatile and easily adaptable to other AO instruments, such as the pyramid, which stands as a baseline for all future AO systems. The non-perturbative method, not relying on an interaction matrix model and being sparse in the Fourier domain, is particularly suitable to the next generation of AO systems for extremely large telescopes that will present an unprecedented level of complexity and numbers of actuators.
Impact of dendritic non-linearities on the computational capabilities of neurons
Authors: Clarissa Lauditi, Enrico M. Malatesta, Fabrizio Pittorino, Carlo Baldassi, Nicolas Brunel, Riccardo Zecchina
Date: 2024-07-10 00:00:00

How neurons integrate the myriad synaptic inputs scattered across their dendrites is a fundamental question in neuroscience. Multiple neurophysiological experiments have shown that dendritic non-linearities can have a strong influence on synaptic input integration. These non-linearities have motivated mathematical descriptions of single neuron as a two-layer computational units, which have been shown to increase substantially the computational abilities of neurons, compared to linear dendritic integration. However, current analytical studies are restricted to neurons with unconstrained synaptic weights and unplausible dendritic non-linearities. Here, we introduce a two-layer model with sign-constrained synaptic weights and a biologically plausible form of dendritic non-linearity, and investigate its properties using both statistical physics methods and numerical simulations. We find that the dendritic non-linearity enhances both the number of possible learned input-output associations and the learning velocity. We characterize how capacity and learning speed depend on the implemented non-linearity and the levels of dendritic and somatic inhibition. We calculate analytically the distribution of synaptic weights in networks close to maximal capacity, and find that a large fraction of zero-weight ('silent' or 'potential') synapses naturally emerge in neurons with sign-constrained synapses, as a consequence of non-linear dendritic integration. Non-linearly induced sparsity comes with a second central advantage for neuronal information processing, i.e. input and synaptic noise robustness. We test our model on standard real-world benchmark datasets and observe empirically that the non-linearity provides an enhancement in generalization performance, showing that it enables to capture more complex input/output relations.
Prototype Analysis in Hopfield Networks with Hebbian Learning
Authors: Hayden McAlister, Anthony Robins, Lech Szymanski
Date: 2024-05-29 00:00:00

We discuss prototype formation in the Hopfield network. Typically, Hebbian learning with highly correlated states leads to degraded memory performance. We show this type of learning can lead to prototype formation, where unlearned states emerge as representatives of large correlated subsets of states, alleviating capacity woes. This process has similarities to prototype learning in human cognition. We provide a substantial literature review of prototype learning in associative memories, covering contributions from psychology, statistical physics, and computer science. We analyze prototype formation from a theoretical perspective and derive a stability condition for these states based on the number of examples of the prototype presented for learning, the noise in those examples, and the number of non-example states presented. The stability condition is used to construct a probability of stability for a prototype state as the factors of stability change. We also note similarities to traditional network analysis, allowing us to find a prototype capacity. We corroborate these expectations of prototype formation with experiments using a simple Hopfield network with standard Hebbian learning. We extend our experiments to a Hopfield network trained on data with multiple prototypes and find the network is capable of stabilizing multiple prototypes concurrently. We measure the basins of attraction of the multiple prototype states, finding attractor strength grows with the number of examples and the agreement of examples. We link the stability and dominance of prototype states to the energy profile of these states, particularly when comparing the profile shape to target states or other spurious states.
R. A. Fisher's Exact Test Revisited
Authors: Martin Mugnier
Date: 2024-07-09 00:00:00

This note provides a conceptual clarification of Ronald Aylmer Fisher's (1935) pioneering exact test in the context of the Lady Testing Tea experiment. It unveils a critical implicit assumption in Fisher's calibration: the taster minimizes expected misclassification given fixed probabilistic information. Without similar assumptions or an explicit alternative hypothesis, the rationale behind Fisher's specification of the rejection region remains unclear.