pwc-archive/papers-with-abstracts huggingface dataset:
Unlocking Telemetry Potential: Self-Supervised Learning for Continuous Clinical Electrocardiogram Monitoring
Authors: Thomas Kite, Uzair Tahamid Siam, Brian Ayers, Nicholas Houstis, Aaron D Aguirre
Date: 2024-06-07 00:00:00
Tasks: Self-Supervised Learning

Machine learning (ML) applied to routine patient monitoring within intensive care units (ICUs) has the potential to improve care by providing clinicians with novel insights into each patient's health and expected response to interventions. This paper applies deep learning to a large volume of unlabeled electrocardiogram (ECG) telemetry signals, which are commonly used for continuous patient monitoring in hospitals but have important differences from the standard, single time-point 12-lead ECG used in many prior machine learning studies. We applied self-supervised learning to pretrain a spectrum of deep networks on approximately 147,000 hours of ECG telemetry data. Our approach leverages this dataset to train models that significantly improve performance on four distinct downstream tasks compared with direct supervised learning using labeled data. These pretrained models enable medically useful predictions and estimates in smaller patient cohorts that are typically limited by the scarcity of labels. Notably, we demonstrate that our pretrained networks can continuously annotate ECG telemetry signals, thereby providing monitoring capabilities that are often unavailable due to the requirement for specialized expertise and time-consuming professional annotations.
Co-Design of Low-Profile Linear Microstrip Arrays with Wide-Band Spatial Filtering Capabilities
Authors: Arianna Benoni, Marco Salucci, Andrea Massa
Date: 2024-06-07 00:00:00

The design of low-profile linear microstrip arrays with wide-band spatial filtering capabilities is dealt with. An innovative architecture, leveraging the angular selectivity of offset stacked patch (OSP) radiators, is proposed to implement phased arrays (PAs) with inter-element spacing larger than half-wavelength that feature remarkable grating lobes (GLs) suppression properties and an enhanced gain within a non-negligible down-looking scanning angular range. The PA layout is then obtained by optimizing the optimal micro-scale geometrical descriptors of the radiating elements so that the macro-scale electromagnetic (EM) features of the arising finite-size PA fulfill the user-defined requirements. A set of numerical test cases, concerned with a variation of the array size and its polarization, is presented to assess the capabilities, the flexibility, and the potentialities of the proposed spatial filtering technique (SFT) also in comparison with competitive state-of-the-art alternatives. The performance of a printed circuit board (PCB)-manufactured prototype are experimentally assessed, as well.
L-SFAN: Lightweight Spatially-focused Attention Network for Pain Behavior Detection
Authors: Jorge Ortigoso-Narro, Fernando Diaz-de-Maria, Mohammad Mahdi Dehshibi, Ana Tajadura-Jiménez
Date: 2024-06-07 00:00:00

Chronic Low Back Pain (CLBP) afflicts millions globally, significantly impacting individuals' well-being and imposing economic burdens on healthcare systems. While artificial intelligence (AI) and deep learning offer promising avenues for analyzing pain-related behaviors to improve rehabilitation strategies, current models, including convolutional neural networks (CNNs), recurrent neural networks, and graph-based neural networks, have limitations. These approaches often focus singularly on the temporal dimension or require complex architectures to exploit spatial interrelationships within multivariate time series data. To address these limitations, we introduce \hbox{L-SFAN}, a lightweight CNN architecture incorporating 2D filters designed to meticulously capture the spatial-temporal interplay of data from motion capture and surface electromyography sensors. Our proposed model, enhanced with an oriented global pooling layer and multi-head self-attention mechanism, prioritizes critical features to better understand CLBP and achieves competitive classification accuracy. Experimental results on the EmoPain database demonstrate that our approach not only enhances performance metrics with significantly fewer parameters but also promotes model interpretability, offering valuable insights for clinicians in managing CLBP. This advancement underscores the potential of AI in transforming healthcare practices for chronic conditions like CLBP, providing a sophisticated framework for the nuanced analysis of complex biomedical data.
Evaluating the Influence of Temporal Context on Automatic Mouse Sleep Staging through the Application of Human Models
Authors: Javier García Ciudad, Morten Mørup, Birgitte Rahbek Kornum, Alexander Neergaard Zahid
Date: 2024-06-06 00:00:00
Tasks: Sleep Staging

In human sleep staging models, augmenting the temporal context of the input to the range of tens of minutes has recently demonstrated performance improvement. In contrast, the temporal context of mouse sleep staging models is typically in the order of tens of seconds. While long-term time patterns are less clear in mouse sleep, increasing the temporal context further than that of the current mouse sleep staging models might still result in a performance increase, given that the current methods only model very short term patterns. In this study, we examine the influence of increasing the temporal context in mouse sleep staging up to 15 minutes in three mouse cohorts using two recent and high-performing human sleep staging models that account for long-term dependencies. These are compared to two prominent mouse sleep staging models that use a local context of 12 s and 20 s, respectively. An increase in context up to 28 s is observed to have a positive impact on sleep stage classification performance, especially in REM sleep. However, the impact is limited for longer context windows. One of the human sleep scoring models, L-SeqSleepNet, outperforms both mouse models in all cohorts. This suggests that mouse sleep staging can benefit from more temporal context than currently used.
Waveform Learning under Phase Noise Impairment for Sub-THz Communications
Authors: Dileepa Marasinghe, Le Hang Nguyen, Jafar Mohammadi, Yejian Chen, Thorsten Wild, Nandana Rajatheva
Date: 2024-06-05 00:00:00

The large untapped spectrum in sub-THz allows for ultra-high throughput communication to realize many seemingly impossible applications in 6G. Phase noise (PN) is one key hardware impairment, which is accentuated as we increase the frequency and bandwidth. Furthermore, the modest output power of the power amplifier demands limits on peak to average power ratio (PAPR) signal design. In this work, we design a PN-robust, low PAPR single-carrier (SC) waveform by geometrically shaping the constellation and adapting the pulse shaping filter pair under practical PN modeling and adjacent channel leakage ratio (ACLR) constraints for a given excess bandwidth. We optimize the waveforms under conventional and state-of-the-art PN-aware demappers. Moreover, we introduce a neural-network (NN) demapper enhancing transceiver adaptability. We formulate the waveform optimization problem in its augmented Lagrangian form and use a back-propagation-inspired technique to obtain a design that is numerically robust to PN, while adhering to PAPR and ACLR constraints. The results substantiate the efficacy of the method, yielding up to 2.5 dB in the required Eb/N0 under stronger PN along with a PAPR reduction of 0.5 dB. Moreover, PAPR reductions up to 1.2 dB are possible with competitive BLER and SE performance in both low and high PN conditions.
A Multi-resolution Low-rank Tensor Decomposition
Authors: Sergio Rozada, Antonio G. Marques
Date: 2024-05-27 00:00:00
Tasks: Tensor Decomposition

The (efficient and parsimonious) decomposition of higher-order tensors is a fundamental problem with numerous applications in a variety of fields. Several methods have been proposed in the literature to that end, with the Tucker and PARAFAC decompositions being the most prominent ones. Inspired by the latter, in this work we propose a multi-resolution low-rank tensor decomposition to describe (approximate) a tensor in a hierarchical fashion. The central idea of the decomposition is to recast the tensor into \emph{multiple} lower-dimensional tensors to exploit the structure at different levels of resolution. The method is first explained, an alternating least squares algorithm is discussed, and preliminary simulations illustrating the potential practical relevance are provided.
Optimizing Sparse Mean-Reverting Portfolio
Authors: Sung Min Yoon
Date: 2024-06-24 00:00:00

Mean-reverting behavior of individuals assets is widely known in financial markets. In fact, we can construct a portfolio that has mean-reverting behavior and use it in trading strategies to extract profits. In this paper, we show that we are able to find the optimal weights of stocks to construct portfolio that has the fastest mean-reverting behavior. We further add minimum variance and sparsity constraints to the optimization problem and transform into Semidefinite Programming (SDP) problem to find the optimal weights. Using the optimal weights, we empirically compare the performance of contrarian strategies between non-sparse mean-reverting portfolio and sparse mean-reverting portfolio to argue that the latter provides higher returns when we take into account of transaction costs.
Graphical Conditions ensuring Equality between Differential and Mean Stochastic Dynamics
Authors: Hugo Buscemi, François Fages
Date: 2024-06-26 00:00:00

Complex systems can be advantageously modeled by formal reaction systems (RS), a.k.a. chemical reaction networks in chemistry. Reaction-based models can indeed be interpreted in a hierarchy of semantics, depending on the question at hand, most notably by Ordinary Differential Equations (ODEs), Continuous Time Markov Chains (CTMCs), discrete Petri nets and asynchronous Boolean transition systems. The last three semantics can be easily related in the framework of abstract interpretation. The first two are classically related by Kurtz's limit theorem which states that if reactions are density-dependent families, then, as the volume goes to infinity, the mean reactant concentrations of the CTMC tends towards the solution of the ODE. In the more realistic context of bounded volumes, it is easy to show, by moment closure, that the restriction to reactions with at most one reactant ensures similarly that the mean of the CTMC trajectories is equal to the solution of the ODE at all time points. In this paper, we generalize that result in presence of polyreactant reactions, by introducing the Stoichiometric Influence and Modification Graph (SIMG) of an RS, and by showing that the equality between the two interpretations holds for the variables that belong to distinct SIMG ancestors of polyreactant reactions. We illustrate this approach with several examples. Evaluation on BioModels reveals that the condition for all variables is satisfied on models with no polymolecular reaction only. However, our theorem can be applied selectively to certain variables of the model to provide insights into their behaviour within more complex systems. Interestingly, we also show that the equality holds for a basic oscillatory RS implementing the sine and cosine functions of time.
Quantitative Aspects, Engineering and Optimization of Bacterial Sensor Systems
Authors: Florian Anderl, Gabriela Salvadori, Mladen Veletic, Fernanda Cristina Petersen, Ilangko Balasingham
Date: 2024-06-24 00:00:00
Tasks: Sensitivity

Bacterial sensor systems can be used for the detection and measurement of molecular signal concentrations. The dynamics of the sensor directly depend on the biological properties of the bacterial sensor cells; manipulation of these features in the wet lab enables the engineering and optimization of the bacterial sensor kinetics. This necessitates the development of biologically meaningful computational models for bacterial sensors comprising a variety of different molecular mechanisms, which further facilitates a systematic and quantitative evaluation of optimization strategies. In this work, we dissect the detection chain of bacterial sensors from a mathematical perspective from which we derive, supported by wet-lab data, a complete computational model for a Streptococcus mutans-based bacterial sensor as a case example. We address the engineering of bacterial sensors by investigating the impact of altered bacterial cell properties on the sensor response characteristics, specifically sensor sensitivity and response signal intensity. This is achieved through a sensitivity analysis targeting both the steady-state and transient sensor response characteristics. Alongside the demonstration of suitability of our methodological approach, our analysis shows that an increase of sensor sensitivity, through a targeted manipulation of bacterial physiology, often comes at the cost of generally diminished sensor response intensity.
Evolving reservoir computers reveals bidirectional coupling between predictive power and emergent dynamics
Authors: Hanna M. Tolle, Andrea I Luppi, Anil K. Seth, Pedro A. M. Mediano
Date: 2024-06-27 00:00:00
Tasks: Prediction

Biological neural networks can perform complex computations to predict their environment, far above the limited predictive capabilities of individual neurons. While conventional approaches to understanding these computations often focus on isolating the contributions of single neurons, here we argue that a deeper understanding requires considering emergent dynamics - dynamics that make the whole system "more than the sum of its parts". Specifically, we examine the relationship between prediction performance and emergence by leveraging recent quantitative metrics of emergence, derived from Partial Information Decomposition, and by modelling the prediction of environmental dynamics in a bio-inspired computational framework known as reservoir computing. Notably, we reveal a bidirectional coupling between prediction performance and emergence, which generalises across task environments and reservoir network topologies, and is recapitulated by three key results: 1) Optimising hyperparameters for performance enhances emergent dynamics, and vice versa; 2) Emergent dynamics represent a near sufficient criterion for prediction success in all task environments, and an almost necessary criterion in most environments; 3) Training reservoir computers on larger datasets results in stronger emergent dynamics, which contain task-relevant information crucial for performance. Overall, our study points to a pivotal role of emergence in facilitating environmental predictions in a bio-inspired computational architecture.
Multiscale Functional Connectivity: Exploring the brain functional connectivity at different timescales
Authors: Manuel Morante, Kristian Frølich, Naveed Ur Rehman
Date: 2024-06-27 00:00:00
Tasks: Functional Connectivity

Human brains exhibit highly organized multiscale neurophysiological dynamics. Understanding those dynamic changes and the neuronal networks involved is critical for understanding how the brain functions in health and disease. Functional Magnetic Resonance Imaging (fMRI) is a prevalent neuroimaging technique for studying these complex interactions. However, analyzing fMRI data poses several challenges. Furthermore, most approaches for analyzing Functional Connectivity (FC) still rely on preprocessing or conventional methods, often built upon oversimplified assumptions. On top of that, those approaches often ignore frequency-related information despite evidence showing that fMRI data contain rich information that spans multiple timescales. This study introduces a novel methodology, Multiscale Functional Connectivity (MFC), to analyze fMRI data by decomposing the fMRI into their intrinsic modes, allowing us to separate the neurophysiological activation patterns at multiple timescales while separating them from other interfering components. Additionally, the proposed approach accounts for the natural nonlinear and nonstationary nature of fMRI and the particularities of each individual in a data-driven way. We evaluated the performance of our proposed methodology using three fMRI experiments. Our results demonstrate that our novel approach effectively separates the fMRI data into different timescales while identifying highly reliable functional connectivity patterns across individuals. In addition, we further extended our knowledge of how the FC for these three experiments spans among different timescales.
A principled framework to assess the information-theoretic fitness of brain functional sub-circuits
Authors: Duy Duong-Tran, Nghi Nguyen, Shizhuo Mu, Jiong Chen, Jingxuan Bao, Frederick Xu, Sumita Garai, Jose Cadena-Pico, Alan David Kaplan, Tianlong Chen, Yize Zhao, Li Shen, Joaquín Goñi
Date: 2024-06-26 00:00:00
Tasks: valid

In systems and network neuroscience, many common practices in brain connectomic analysis are often not properly scrutinized. One such practice is mapping a predetermined set of sub-circuits, like functional networks (FNs), onto subjects' functional connectomes (FCs) without adequately assessing the information-theoretic appropriateness of the partition. Another practice that goes unchallenged is thresholding weighted FCs to remove spurious connections without justifying the chosen threshold. This paper leverages recent theoretical advances in Stochastic Block Models (SBMs) to formally define and quantify the information-theoretic fitness (e.g., prominence) of a predetermined set of FNs when mapped to individual FCs under different fMRI task conditions. Our framework allows for evaluating any combination of FC granularity, FN partition, and thresholding strategy, thereby optimizing these choices to preserve important topological features of the human brain connectomes. By applying to the Human Connectome Project with Schaefer parcellations at multiple levels of granularity, the framework showed that the common thresholding value of 0.25 was indeed information-theoretically valid for group-average FCs despite its previous lack of justification. Our results pave the way for the proper use of FNs and thresholding methods and provide insights for future research in individualized parcellations.
Strong, but not weak, noise correlations are beneficial for population coding
Authors: Gabriel Mahuas, Thomas Buffet, Olivier Marre, Ulisse Ferrari, Thierry Mora
Date: 2024-06-26 00:00:00

Neural correlations play a critical role in sensory information coding. They are of two kinds: signal correlations, when neurons have overlapping sensitivities, and noise correlations from network effects and shared noise. It is commonly thought that stimulus and noise correlations should have opposite signs to improve coding. However, experiments from early sensory systems and cortex typically show the opposite effect, with many pairs of neurons showing both types of correlations to be positive and large. Here, we develop a theory of information coding by correlated neurons which resolves this paradox. We show that noise correlations are always beneficial if they are strong enough, unless neurons are perfectly correlated by the stimulus. Extensive tests on retinal recordings under different visual stimuli confirm our predictions. Finally, using neuronal recordings and modeling, we show that for high dimensional stimuli noise correlation benefits the encoding of fine-grained details of visual stimuli, at the expense of large-scale features, which are already well encoded.
Comparing fingers and gestures for bci control using an optimized classical machine learning decoder
Authors: D. Keller, M. J. Vansteensel, S. Mehrkanoon, M. P. Branco
Date: 2024-06-25 00:00:00
Tasks: Decoder, Feature Engineering

Severe impairment of the central motor network can result in loss of motor function, clinically recognized as Locked-in Syndrome. Advances in Brain-Computer Interfaces offer a promising avenue for partially restoring compromised communicative abilities by decoding different types of hand movements from the sensorimotor cortex. In this study, we collected ECoG recordings from 8 epilepsy patients and compared the decodability of individual finger flexion and hand gestures with the resting state, as a proxy for a one-dimensional brain-click. The results show that all individual finger flexion and hand gestures are equally decodable across multiple models and subjects (>98.0\%). In particular, hand movements, involving index finger flexion, emerged as promising candidates for brain-clicks. When decoding among multiple hand movements, finger flexion appears to outperform hand gestures (96.2\% and 92.5\% respectively) and exhibit greater robustness against misclassification errors when all hand movements are included. These findings highlight that optimized classical machine learning models with feature engineering are viable decoder designs for communication-assistive systems.
Applications of interpretable deep learning in neuroimaging: a comprehensive review
Authors: Lindsay Munroe, Mariana da Silva, Faezeh Heidari, Irina Grigorescu, Simon Dahan, Emma C. Robinson, Maria Deprez, Po-Wah So
Date: 2024-05-30 00:00:00
Tasks: Deep Learning

Clinical adoption of deep learning models has been hindered, in part, because the black-box nature of neural networks leads to concerns regarding their trustworthiness and reliability. These concerns are particularly relevant in the field of neuroimaging due to the complex brain phenotypes and inter-subject heterogeneity often encountered. The challenge can be addressed by interpretable deep learning (iDL) methods that enable the visualisation and interpretation of the inner workings of deep learning models. This study systematically reviewed the literature on neuroimaging applications of iDL methods and critically analysed how iDL explanation properties were evaluated. Seventy-five studies were included, and ten categories of iDL methods were identified. We also reviewed five properties of iDL explanations that were analysed in the included studies: biological validity, robustness, continuity, selectivity, and downstream task performance. We found that the most popular iDL approaches used in the literature may be sub-optimal for neuroimaging data, and we discussed possible future directions for the field.