Publications

2025

• Two-Stage MIMO Equalization for Long Haul Coupled Multi-Core Fiber Systems
  
  • Darweesh Jamal
  • Abouseif Akram
  • Rekaya Ben Othman Ghaya
  • Jaouën Yves
  • Klaimi Rami
  , 2025.
• Beyond Low-rank Decomposition: A Shortcut Approach for Efficient On-Device Learning
  
  • Nguyen Le-Trung
  • Quélennec Aël
  • Nguyen van Tam
  • Tartaglione Enzo
  , 2025, Forty-second International Conference on Machine Learning. On-device learning has emerged as a promising direction for AI development, particularly because of its potential to reduce latency issues and mitigate privacy risks associated with device-server communication, while improving energy efficiency. Despite these advantages, significant memory and computational constraints still represent major challenges for its deployment. Drawing on previous studies on low-rank decomposition methods that address activation memory bottlenecks in backpropagation, we propose a novel shortcut approach as an alternative. Our analysis and experiments demonstrate that our method can reduce activation memory usage, even up to 120.09× compared to vanilla training, while also reducing overall training FLOPs up to 1.86× when evaluated on traditional benchmarks.
• Winner-takes-all for Multivariate Probabilistic Time Series Forecasting
  
  • Cortés Adrien
  • Rehm Rémi
  • Letzelter Victor
  , 2025. We introduce TimeMCL, a method leveraging the Multiple Choice Learning (MCL) paradigm to forecast multiple plausible time series futures. Our approach employs a neural network with multiple heads and utilizes the Winner-Takes-All (WTA) loss to promote diversity among predictions. MCL has recently gained attention due to its simplicity and ability to address ill-posed and ambiguous tasks. We propose an adaptation of this framework for time-series forecasting, presenting it as an efficient method to predict diverse futures, which we relate to its implicit quantization objective. We provide insights into our approach using synthetic data and evaluate it on real-world time series, demonstrating its promising performance at a light computational cost.
• Assessing the Vulnerabilities of RISC-V using the gem5 Simulator
  
  • Khan Mahreen
  • Mushtaq Maria
  • Pacalet Renaud
  • Apvrille Ludovic
  , 2025. <div><p>Microarchitectural timing side-channel attacks exploit variations in execution times caused by the underlying hardware to extract sensitive information. These attacks leverage architectural features like caches, branch predictors, and speculative execution.</p></div>
• To Each Metric Its Decoding: Post-Hoc Optimal Decision Rules of Probabilistic Hierarchical Classifiers
  
  • Plaud Roman
  • Perez-Lebel Alexandre
  • Labeau Matthieu
  • Saillenfest Antoine
  • Bonald Thomas
  , 2025. Hierarchical classification offers an approach to incorporate the concept of mistake severity by leveraging a structured, labeled hierarchy. However, decoding in such settings frequently relies on heuristic decision rules, which may not align with task-specific evaluation metrics. In this work, we propose a framework for the optimal decoding of an output probability distribution with respect to a target metric. We derive optimal decision rules for increasingly complex prediction settings, providing universal algorithms when candidates are limited to the set of nodes. In the most general case of predicting a subset of nodes, we focus on rules dedicated to the hierarchical hF β scores, tailored to hierarchical settings. To demonstrate the practical utility of our approach, we conduct extensive empirical evaluations, showcasing the superiority of our proposed optimal strategies, particularly in underdetermined scenarios. These results highlight the potential of our methods to enhance the performance and reliability of hierarchical classifiers in real-world applications. The code is available at https://github.com/RomanPlaud/ hierarchical decision rules Sketch of the proof. Key elements of the decoding strategy are displayed in Algorithm 1. We give here some general insights on how the algorithm is derived.
• Assessing the Vulnerabilities of RISC-V using the gem5 Simulator (Access-Retired)
  
  • Khan Mahreen
  • Mushtaq Maria
  • Pacalet Renaud
  • Apvrille Ludovic
  , 2025. <div><p>Emerging RISC-V processors require rigorous security evaluation to address microarchitectural vulnerabilities inherent in their rapidly evolving ecosystem. A recent paper [Gea23] implemented both known and novel side-channel attacks targeting commercial RISC-V CPUs (U74 and C906). While this hardware-based research confirmed vulnerabilities, it could not provide detailed insights into attack dynamics. We bridge this gap using the gem5 simulation framework to systematically analyze side-channel attacks on RISC-V architectures. Our paper focuses on the accessretired attack, which exploits the unprivileged rdinstret instruction to infer protected filesystem data. By tracking retired instruction counts, attackers detect microarchitectural state differences caused by directory access checks. We utilize the gem5 simulator in full-system (FS) mode to capture kernel-level behaviors, allowing us to analyze critical performance metrics including instruction retirement, cache performance, and branch prediction statistics. This detailed simulationbased analysis is essential for understanding the behavior of the attack and for developing effective countermeasures. Advancing RISC-V security research with simulation tools like gem5 is thus a promising direction for mitigating future side-channel vulnerabilities.</p></div>
• DRST: a Non-Intrusive Framework for Performance Analysis in Softwarized Networks
  
  • Liu Qiong
  • Lin Jianke
  • Zhang Tianzhu
  • Linguaglossa Leonardo
  , 2025. <div><p>The last decade has witnessed the proliferation of network function virtualization (NFV) in the telco industry, thanks to its unparalleled flexibility, scalability, and cost-effectiveness. However, as the NFV infrastructure is shared by virtual network functions (VNFs), sporadic resource contentions are inevitable. Such contention makes it extremely challenging to guarantee the performance of the provisioned network services, especially in high-speed regimes (e.g., Gigabit Ethernet). Existing solutions typically rely on direct traffic analysis (e.g., packet-or flow-level measurements) to detect performance degradation and identify bottlenecks, which is not always applicable due to significant integration overhead and systemlevel constraints. This paper complements existing solutions with a lightweight, non-intrusive framework for online performance inference that easily adapts to drift (i.e., a change over time of the actual state of our system). Instead of direct data-plane collection, we reuse hardware features in the underlying NFV infrastructure, introducing negligible interference in the data-plane. Our Drift-Resilient and Self-Tuning (DRST) framework can be integrated into existing NFV systems with minimal engineering effort and operates without the need for predefined traffic models or VNF-specific customization. DRST is deployed via a lightweight MLOps pipeline that automates the adaptation under runtime drift. We show how DRST can deliver accurate performance inference or diagnose run-time bottleneck diagnose, as demonstrated through comprehensive evaluation across diverse NFV scenarios.</p></div>
• SimHawNet: a modified Hawkes process for temporal network simulation
  
  • Perez Mathilde
  • Romero Raphaël
  • Kang Bo
  • de Bie Tijl
  • Lijffijt Jefrey
  • Laclau Charlotte
  Data Mining and Knowledge Discovery, Springer, 2025, 39 (5), pp.48 (1-28 pages). Abstract Temporal networks allow representing connections between objects while incorporating the temporal dimension. While static network models can capture unchanging topological regularities, they often fail to model the effects associated with the causal generative process of the network that occurs in time. Hence, exploiting the temporal aspect of networks has been the focus of many recent studies. In this context, we propose a new framework for generative models of continuous-time temporal networks. We assume that the activation of the edges in a temporal network is driven by a specified temporal point process. This approach allows to directly model the waiting time between events while incorporating time-varying history-based features as covariates in the predictions. Coupled with a thinning algorithm designed for the simulation of point processes, SimHawNet enables simulation of the evolution of temporal networks in continuous time. Finally, we introduce a comprehensive evaluation framework to assess the performance of such an approach, in which we demonstrate that SimHawNet successfully simulates the evolution of networks with very different generative processes and achieves performance comparable to the state of the art, while being significantly faster. (10.1007/s10618-025-01119-1)
  DOI : 10.1007/s10618-025-01119-1
• Défi du GDR GPL ADaptation DYnamique et ConTinue ADDYCT
  
  • Laval Jannik
  • Philippe Jolan
  • Cariou Eric
  • Ameur-Boulifa Rabéa
  • Guérin Sylvain
  • Kouchnarenko Olga
  • Guermouche Nawal
  , 2025. L'adaptabilité est un enjeu majeur des systèmes complexes dans des environnements dynamiques. Ces environnements regroupent les architectures distribuées composées de systèmes "component-based" et les infrastructures déployées sur des plateformes hétérogènes à différentes échelles : Cloud, Fog, Edge, ou IoT. Tous ces systèmes doivent être capables d'ajuster leur configuration de manière autonome pour répondre à des évènements exogènes et/ou endogènes. Les systèmes logiciels doivent être considérés dès leur conception comme des systèmes durables en termes de temporalité (Système temps long, Cycle de vie, Couplage), de scalabilité (Granularité, Interfaces, Gestion massive de données) et d'hétérogénéité (Intégration, Interopérabilité). Ces challenges sont d'autant plus importants lorsque la taille du système est grande et couplée avec des artefacts matériels (IoT, CPS, Jumeaux numériques, Cloud...) L'objectif de ce défi est de modéliser, analyser et d'implémenter des moyens et des politiques d'adaptation pour des systèmes logiciels complexes (distribués, componentisés etc.). L'approche adoptée repose sur les boucles de contrôle MAPE-K, un modèle d'auto-adaptation autonome capable de s'ajuster dynamiquement à un environnement permettant de répondre à la nécessité d'intégrer les données collectées et leurs modèles de traitement, le système opérant et sa connexion avec son environnement, l'évolution dynamique et la nécessité de maintenir une représentation fidèle du comportement attendu.
• Deep Learning for Embedded Cybersecurity
  
  • Varillon Arnaud
  , 2025. Public-key cryptography is one of the core pillars of cybersecurity, in particular thanks to the authentication schemes it enables. It is embedded in many ubiquitous objects, such as hardware wallets. Side-channel attacks are one of the major threats to such devices. In particular, the advances in machine learning, and more specifically deep learning, which have marked the last ten years, seem likely to make such attacks remarkably effective. In such a hostile environment, assessing the true security level of devices intended for cryptographic use is of utmost importance: indeed, it has now even become vital to the smooth running of information systems.In this thesis, we have appraised the security, of implementations, reputed to be the more secure ones in the face of such attacks (“power” and “EM” channels), which manipulate the secret key bit by bit. Numerous contributions, which mainly use deep learning, have been published on this subject. Unfortunately, none of them provides any guarantee regarding the robustness of the device under study in the face of such attacks: each time, the method being described does not allow one to state with certainty that it is not possible to find a more powerful attack than that being presented. The security level of the latter devices is therefore potentially underestimated. More specifically, fundamental aspects of the classification task associated with any attack, such as the shape of its decision boundary or the optimality - in terms of attack performance - of the features derived from the sampling of the side-channel under consideration, are never addressed. Therefore, we have sought to find methodologies that are as close to optimality as possible given the conditions imposed by the exercise (for example, the possibility of configuring the key used by the target for in-depth analyses).Initially, assuming that an attacker can control the key that is parameterized in the target, only vertical attacks are considered. In this context, the optimal effectiveness of the joint use of NICV, for feature selection, and the perceptron, for classification, is highlighted from a theoretical point of view. In particular, the security of a cryptographic library hitherto considered robust (libecc) is called into question. Secondly, assuming that an attacker cannot set the key as he wishes in the target, yet still has a functionally perfect clone, another procedure is proposed for carrying out the security evaluation, this time using horizontal (collision-based) attacks based on an unsupervised learning technique which, because it requires (by definition) minimal training at most, is better suited to such a scenario. Compared to the state of the art, the approach followed is closer to optimality without however achieving it, but avenues are suggested to get there in the near future. Last, to validate these findings, experimental verifications have been carried out on a board (STM32F407) which features a Cortex-M4 processor that can be found in many hardware wallets (e.g. Trezor Model T). (10.70675/7f2d10c4z5f2fz4fd8zbe5cz578b4403bd27)
  DOI : 10.70675/7f2d10c4z5f2fz4fd8zbe5cz578b4403bd27
• Planning Socio-Emotional Response Generation for Conversational Agents
  
  • Vanel Lorraine
  , 2025. Conversational systems are now capable of producing impressive and generally relevant responses. However, we have no visibility or control over the socio-emotional strategies behind state-of-the-art large language models (LLMs). This poses a problem in terms of their transparency and thus their trustworthiness for critical applications, such as industrial customer service virtual agents. This thesis aims to develop socially intelligent conversational systems that can model the conversational dynamics of user and agent social behaviours. To train models in the role of customer service agents, we need to capture the various nuances of their speech patterns, which often combine emotional support and problem-solving skills. We design a multi-label approach, modelling the behaviours expressed in one speaker as a chronologically ordered sequence of socio-emotional labels, including emotions and conversational actions.We propose a two-module architecture. The planning module uses the dialogue's history to generate the best sequence of social and emotional strategies for the response. The generative module conditions the response generation according to the predicted sequence of labels to improve the quality of the final answer while allowing for transparency and controllability. To efficiently adapt the system to our use case, we require adequate datasets; however, no publicly available corpus meets all our criteria, including multi-label annotations and French task-oriented conversations. To address this, we introduce DATA-SERGE, a new corpus composed of French customer service conversations, annotated following a comprehensive multi-label scheme. Additionally, we observe that existing automatic metrics are lacking to properly evaluate such a system. We present a human evaluation protocol and new scores to fill this gap.We evaluate this architecture on both DailyDialog, an English open-domain dataset, and DATA-SERGe. The findings support our primary research hypothesis and demonstrate that, even in highly domain-specific contexts like French customer service data, planning sequences of labels has a positive impact on response generation. (10.70675/c2e3a23cze849z4048z8e41za3d1ad28a234)
  DOI : 10.70675/c2e3a23cze849z4048z8e41za3d1ad28a234
• RESCUE: Multi-Robot Planning Under Resource Uncertainty and Objective Criticality
  
  • Cordeiro Franco
  • Tardieu Samuel
  • Pautet Laurent
  , 2025, 37th Euromicro Conference on Real-Time Systems (ECRTS 2025), pp.5:1-5:23. Robot planning in distributed systems, such as drone fleets performing active perception missions, presents complex challenges. These missions require cooperation to achieve objectives like collecting sensor data or capturing images. Multi-robot systems offer significant advantages, including faster execution and increased robustness, as robots can compensate for individual failures. However, resource costs, affected by environmental factors such as wind or terrain, are highly uncertain, impacting battery consumption and overall performance. Mission objectives are often prioritized by criticality, such as retrieving data from low-battery sensors to prevent data loss. Addressing these priorities requires sophisticated scheduling to navigate high-dimensional state-action spaces. While heuristics are useful for approximating solutions, few approaches extend to multi-robot systems or adequately address cost uncertainty and criticality, particularly during replanning. The Mixed-Criticality (MC) paradigm, extensively studied in real-time scheduling, provides a framework for handling cost uncertainty by ensuring the completion of high-critical tasks. Despite its potential, the application of MC in distributed systems remains limited. To address the decision-making challenges faced by distributed robots operating under cost uncertainty and objective criticality, we propose four contributions: a comprehensive model integrating criticality, uncertainty, and robustness; distributed synchronization and replanning mechanisms; the incorporation of mixed-criticality principles into multi-robot systems; and enhanced resilience against robot failures. We evaluated our solution, named RESCUE, in a simulated scenario and show how it increases the robustness by reducing the oversizing of the system and completing up to 40% more objectives. We found an increase in resilience of the multi-robot system as our solution not only guaranteed the safe return of every non-faulty robot, but also reduced the effects of a faulty robot by up to 14%. We also computed the performance gain compared to using MCTS in a single robot of up to 2.31 for 5 robots. (10.4230/LIPIcs.ECRTS.2025.5)
  DOI : 10.4230/LIPIcs.ECRTS.2025.5
• Side-Channel Attack Detection using gem5 and Machine Learning: A Case Study on Fault-based Attacks in RISC-V
  
  • Khan Mahreen
  • Mushtaq Maria
  • Pacalet Renaud
  • Apvrille Ludovic
  , 2025. <div><p>Microarchitectural side-channel attacks pose a significant threat to modern computing architectures. This paper presents a machine learning-based methodology for detecting these attacks using the gem5 simulator, focusing on the recently discovered Flush+Fault attack [6] on RISC-V. Our approach follows a three-phase process. The first phase is data collection, where we simulate attack and non-attack scenarios in gem5 and extract microarchitectural features indicative of side-channel activity. The second phase is the training phase, where we utilize machine learning (ML) techniques to build a classification model capable of distinguishing between normal execution and attack patterns. The last phase is the testing phase, where we evaluate the trained model using various performance metrics to validate its accuracy and precision. To the best of our knowledge, this is the first detection framework for Flush+Fault attacks [6] on RISC-V, showcasing its effectiveness in mitigating emerging threats. Our results indicate that gem5 metrics combined with machine learning models can reliably detect Flush+Fault attacks, achieving 0.99 accuracy with random forest (RF), 0.96 with support vector machine (SVM), and 0.95 with naïve bayes (NB). Moreover, this methodology is adaptable to different side-channel attacks and architectures, making it a promising approach for strengthening microarchitectural security.</p></div>
• Side-Channel Attack Detection using gem5 and ML: A Case Study on Fault-based Attacks in RISC-V
  
  • Khan Mahreen
  • Mushtaq Maria
  • Pacalet Renaud
  • Apvrille Ludovic
  , 2025. <div><p>Microarchitectural timing side-channel attacks exploit variations in execution times caused by the underlying hardware to extract sensitive information. These attacks leverage architectural features like caches and branch predictors. For thorough analysis, we use Gem5 simulations to analyze Flush+Fault attack behavior on RISC-V.</p></div>
• Neural networks for solition prediction in optical communication
  
  • Mukhopadhyay Meghna
  • Thedrez Bruno
  , 2025. <div><p>We study a neural network approach for predicting the number of solitons in WDM signals, extending it to the computation of the nonlinear Fourier transform eigenvalues in the case of Satsuma-Yajima signals.</p></div>
• First Order Logic with Fuzzy Semantics for Describing and Recognizing Nerves in Medical Images
  
  • Bloch Isabelle
  • Bonnot Enzo
  • Gori Pietro
  • La Barbera Giammarco
  • Sarnacki Sabine
  , 2025. This article deals with the description and recognition of fiber bundles, in particular nerves, in medical images, based on the anatomical description of the fiber trajectories. To this end, we propose a logical formalization of this anatomical knowledge. The intrinsically imprecise description of nerves, as found in anatomical textbooks, leads us to propose fuzzy semantics combined with first-order logic. We define a language representing spatial entities, relations between these entities and quantifiers. A formula in this language is then a formalization of the natural language description. The semantics are given by fuzzy representations in a concrete domain and satisfaction degrees of relations. Based on this formalization, a spatial reasoning algorithm is proposed for segmentation and recognition of nerves from anatomical and diffusion magnetic resonance images, which is illustrated on pelvic nerves in pediatric imaging, enabling surgeons to plan surgery.
• Quantum-aware network planning and integration
  
  • Ware Cédric
  • Lourdiane Mounia
  , 2025. In order to broaden the adoption of highly-demanded quantum functionalities such as QKD, there is a need for having quantum signals coexist with classical traffic over the same physical medium, typically optical fibers in already-deployed networks. Beyond the experimental point-to-point demonstrations of the past few years, efforts are now underway to integrate QKD at the network level: developing interfaces with the software-defined-network ecosystem; but also network planning tools that satisfy physical-layer contraints jointly on the classical and quantum signals. We have found that in certain situations, naïve network planning prioritizing quantum traffic drastically degrades classical capacity, whereas a quantum-aware wavelength assignment heuristic allows coexistence with minimal impact on both capacities. More such techniques will be required to enable widespread deployment of QKD and other future quantum functionalities. (10.1109/ICTON67126.2025.11125476)
  DOI : 10.1109/ICTON67126.2025.11125476
• Stein's method for max-stable random vectors
  
  • Costacèque Bruno
  • Decreusefond Laurent
  , 2025. Motivated by the omnipresence of extreme value distributions in limit theorems involving extremes of random processes, we adapt Stein's method to include these laws as possible target distributions. We do so by using the generator approach of Stein's method, which is possible thanks to a recently introduced family of semi-groups. We study the corresponding Stein solution and its properties when the working distance is either the smooth Wasserstein distance or the Kolmogorov distance. We make use of those results to bound the distance between two max-stable random vectors, as well as to get a rate of convergence for the de Haan-LePage series in smooth Wasserstein distance. (10.48550/arXiv.2507.00463)
  DOI : 10.48550/arXiv.2507.00463
• Cyberattacks Detection in Cooperative Intelligent Transportation System (C-ITS)
  
  • Wehby Ayoub
  , 2025. Modern vehicles are becoming smarter, communicating with each other to enhance traffic flow and improve safety. However, this connectivity also exposes them to cyberattacks, particularly Distributed Denial of Service (DDoS) attacks where malicious actors overwhelm vehicular networks with fake messages, disrupting real-time communication between cars. This can lead to issues ranging from navigation failures to serious accidents. This research focuses on a specific type of DDoS attack that exploits Cooperative Awareness Messages (CAMs), which cars use to share their location and speed. We propose an approach for a distributed Intrusion Detection System (IDS) designed to mitigate DDoS attacks in a connected car environment. Initially, we assessed the impact of CAM-DDoS attacks on connected cars through various simulation scenarios. These scenarios revealed a decrease in the CAM broadcast rate from legitimate cars and an accumulation of invalid data. Subsequently, we proposed a distributed architecture for an IDS and assessed the effectiveness of three supervised ensemble learning algorithms against these attacks. Given the challenge of generalizability in machine learning models, we also evaluated the robustness of our DDoS detection approach against other types of DDoS attacks, such as JamDDoS. The results show that all DDoS messages were processed uniformly, which explains the models' robust performance against studied DDoS attacks. Additionally, we demonstrated how a DDoS attack can be transformed into a Sybil DDoS attack that avoids DDoS detectors in a safety-critical connected car environment. To address this, we developed and evaluated an optimized data-handling approach that serves as the foundation for our proposed ensemble hard voting detection model. The results obtained demonstrate an effective attack detection with reduced false alarms against Sybil DDoS attacks.
• Arithmétisation de la partie entière et applications à la cryptographie
  
  • Berthet Pierre-Augustin
  • Tavernier Cédric
  , 2025. Dans ce travail nous proposons une méthodologie pour calculer la partie entière à l'aide uniquement d'additions et de multiplications, la rendant ainsi compatible avec le chiffrement homomorphe.
• Cartographier l'intelligence artificielle : collecte et analyse d'un corpus de chartes et manifestes sur l'éthique de l'IA
  
  • Viard Tiphaine
  • Delarue Simon
  • Gornet Mélanie
  • Boritchev Maria
  , 2025. Nous présentons ici un corpus de 436 chartes et manifestes au sujet de l'éthique de l'intelligence artificielle, ainsi qu'une analyse discursive de celui-ci, permettant de comprendre les enjeux autour desquels le monde social de l'éthique de l'IA se structure. Nous mettons à disposition le corpus, sa documentation, et le code permettant son analyse.
• Rapid Thermalization of Dissipative Many-Body Dynamics of Commuting Hamiltonians
  
  • Kochanowski Jan
  • Alhambra Álvaro
  • Capel Ángela
  • Rouzé Cambyse
  Communications in Mathematical Physics, Springer Verlag, 2025, 406 (8), pp.176. Abstract Quantum systems typically reach thermal equilibrium rather quickly when coupled to a thermal environment. The usual way of bounding the speed of this process is by estimating the spectral gap of the dissipative generator. However the gap, by itself, does not always yield a reasonable estimate for the thermalization time in many-body systems: without further structure, a uniform lower bound on it only constrains the thermalization time to grow polynomially with system size. Here, instead, we show that for a large class of geometrically-2-local models of Davies generators with commuting Hamiltonians, the thermalization time is much shorter than one would naïvely estimate from the gap: at most logarithmic in the system size. This yields the so-called rapid mixing of dissipative dynamics. The result is particularly relevant for 1D systems, for which we prove rapid thermalization with a system size independent decay rate only from a positive gap in the generator. We also prove that systems in hypercubic lattices of any dimension, and exponential graphs, such as trees, have rapid mixing at high enough temperatures. We do this by introducing a novel notion of clustering which we call “strong local indistinguishability” based on a max-relative entropy, and then proving that it implies a lower bound on the modified logarithmic Sobolev inequality (MLSI) for nearest neighbour commuting models. This has consequences for the rate of thermalization towards Gibbs states, and also for their relevant Wasserstein distances and transportation cost inequalities. Along the way, we show that several measures of decay of correlations on Gibbs states of commuting Hamiltonians are equivalent, a result of independent interest. At the technical level, we also show a direct relation between properties of Davies and Schmidt dynamics, that allows to transfer results of thermalization between both. (10.1007/s00220-025-05353-y)
  DOI : 10.1007/s00220-025-05353-y
• Clustering cell nuclei on microgrooves for disease diagnosis using deep learning
  
  • Roellinger Bettina
  • Thenier Francois
  • Leclech Claire
  • Coirault Catherine
  • Angelini Elsa
  • Barakat Abdul I
  Scientific Reports, Nature Publishing Group, 2025, 15 (1), pp.22476 (1-13). Various diseases including laminopathies and certain types of cancer are associated with abnormal nuclear mechanical properties that influence cellular and nuclear deformations in complex environments. Recently, microgroove substrates designed to mimic the anisotropic topography of the basement membrane have been shown to induce 3D nuclear deformations in various adherent cell types. Importantly, these deformations are different in myoblasts derived from laminopathy patients from those in cells derived from normal individuals. Here we assess the ability of a Variational Autoencoder (VAE) and a Gaussian Mixture Model (GMM) to cluster patches of nuclei of both wildtype myoblasts and myoblasts with laminopathy-associated mutations cultured on microgroove substrates, and we explore the impact of image processing parameters on clustering performance. We show that a standard VAE with GMM is able to cluster nuclei based on their morphologies and degrees of deformations and that these clusters correspond to either wildtype myoblasts or myoblasts with LMNA mutations. The current results suggest that combining deep learning techniques with microgroove substrates enables automatic classification of nuclear deformations and thus provides a promising approach for easy and rapid diagnosis of pathologies that involve abnormalities in nuclear deformation. (10.1038/s41598-025-05788-2)
  DOI : 10.1038/s41598-025-05788-2
• Neurosymbolic Methods for Dynamic Knowledge Graphs
  
  • Alam Mehwish
  • Gesese Genet Asefa
  • Paris Pierre-Henri
  , 2025. Knowledge graphs (KGs) have recently been used for many tools and applications, making them rich resources in structured format. However, in the real world, KGs grow due to the additions of new knowledge in the form of entities and relations, making these KGs dynamic. This chapter formally defines several types of dynamic KGs and summarizes how these KGs can be represented. Additionally, many neurosymbolic methods have been proposed for learning representations over static KGs for several tasks such as KG completion and entity alignment. This chapter further focuses on neurosymbolic methods for dynamic KGs with or without temporal information. More specifically, it provides an insight into neurosymbolic methods for dynamic (temporal or non-temporal) KG completion and entity alignment tasks. It further discusses the challenges of current approaches and provides some future directions. (10.3233/FAIA250223)
  DOI : 10.3233/FAIA250223
• Neurosymbolic Methods for Rule Mining
  
  • Ławrynowicz Agnieszka
  • Galárraga Luis
  • Alam Mehwish
  • Jaulmes Bérénice
  • Zeman Václav
  • Kliegr Tomáš
  , 2025, pp.1-22. In this chapter, we address the problem of rule mining, beginning with essential background information, including measures of rule quality. We then explore various rule mining methodologies, categorized into three groups: inductive logic programming, path sampling and generalization, and linear programming. Following this, we delve into neurosymbolic methods, covering topics such as the integration of deep learning with rules, the use of embeddings for rule learning, and the application of large language models in rule learning. (10.3233/FAIA250224)
  DOI : 10.3233/FAIA250224