SearcharxivSearch

arXiv subjects

Daniele Malpetti

Publications and source records attributed to Daniele Malpetti.

10 recordsLinked to original sources

FPLIER: Federated Pathway-Level Information Extractor

In transcriptomics, gene-set-aware factorization methods such as the Pathway Level Information Extractor (PLIER) are most effective when trained on large, heterogeneous expression compendia. Yet, many clinically relevant cohorts cannot be pooled into a single dataset due to privacy and governance constraints. We present FPLIER, a federated extension of PLIER that enables distributed training across multiple data holders while incorporating publicly available datasets. Through secure aggregation, FPLIER produces training updates algebraically equivalent to those of a centralized pooled-data approach while keeping expression data local. We evaluate FPLIER across multiple scenarios in two simulated consortia (from the K-CLIER and MultiPLIER studies) and demonstrate stable convergence. We further conduct a systematic analysis of membership inference attacks targeting both intermediate training statistics and the released model. Our results show that privacy risk is governed by the rank of the training expression matrix. Incorporating public data or reducing data dimensionality increases this rank, moving the system toward a full-rank regime in which training and non-training samples become indistinguishable to the attacker, and membership-inference performance approaches random guessing.

q-bio.QM

Tiny-DroNeRF: Tiny Neural Radiance Fields aboard Federated Learning-enabled Nano-drones

Sub-30g nano-sized aerial robots can leverage their agility and form factor to autonomously explore cluttered and narrow environments, like in industrial inspection and search and rescue missions. However, the price for their tiny size is a strong limit in their resources, i.e., sub-100 mW microcontroller units (MCUs) delivering $\sim$100 GOps/s at best, and memory budgets well below 100 MB. Despite these strict constraints, we aim to enable complex vision-based tasks aboard nano-drones, such as dense 3D scene reconstruction: a key robotic task underlying fundamental capabilities like spatial awareness and motion planning. Top-performing 3D reconstruction methods leverage neural radiance fields (NeRF) models, which require GBs of memory and massive computation, usually delivered by high-end GPUs consuming 100s of Watts. Our work introduces Tiny-DroNeRF, a lightweight NeRF model, based on Instant-NGP, and optimized for running on a GAP9 ultra-low-power (ULP) MCU aboard our nano-drones. Then, we further empower our Tiny-DroNeRF by leveraging a collaborative federated learning scheme, which distributes the model training among multiple nano-drones. Our experimental results show a 96% reduction in Tiny-DroNeRF's memory footprint compared to Instant-NGP, with only a 5.7 dB drop in reconstruction accuracy. Finally, our federated learning scheme allows Tiny-DroNeRF to train with an amount of data otherwise impossible to keep in a single drone's memory, increasing the overall reconstruction accuracy. Ultimately, our work combines, for the first time, NeRF training on an ULP MCU with federated learning on nano-drones.

cs.RO

Technical and Legal Aspects of Federated Learning in Bioinformatics: Applications, Challenges and Opportunities

Federated learning leverages data across institutions to improve clinical discovery while complying with data-sharing restrictions and protecting patient privacy. This paper provides a gentle introduction to this approach in bioinformatics, and is the first to review key applications in proteomics, genome-wide association studies (GWAS), single-cell and multi-omics studies in their legal as well as methodological and infrastructural challenges. As the evolution of biobanks in genetics and systems biology has proved, accessing more extensive and varied data pools leads to a faster and more robust exploration and translation of results. More widespread use of federated learning may have a similar impact in bioinformatics, allowing academic and clinical institutions to access many combinations of genotypic, phenotypic and environmental information that are undercovered or not included in existing biobanks.

q-bio.OT

Global Outlier Detection in a Federated Learning Setting with Isolation Forest

We present a novel strategy for detecting global outliers in a federated learning setting, targeting in particular cross-silo scenarios. Our approach involves the use of two servers and the transmission of masked local data from clients to one of the servers. The masking of the data prevents the disclosure of sensitive information while still permitting the identification of outliers. Moreover, to further safeguard privacy, a permutation mechanism is implemented so that the server does not know which client owns any masked data point. The server performs outlier detection on the masked data, using either Isolation Forest or its extended version, and then communicates outlier information back to the clients, allowing them to identify and remove outliers in their local datasets before starting any subsequent federated model training. This approach provides comparable results to a centralized execution of Isolation Forest algorithms on plain data.

cs.LG

Flotta: a Secure and Flexible Spark-inspired Federated Learning Framework

We present Flotta, a Federated Learning framework designed to train machine learning models on sensitive data distributed across a multi-party consortium conducting research in contexts requiring high levels of security, such as the biomedical field. Flotta is a Python package, inspired in several aspects by Apache Spark, which provides both flexibility and security and allows conducting research using solely machines internal to the consortium. In this paper, we describe the main components of the framework together with a practical use case to illustrate the framework's capabilities and highlight its security, flexibility and user-friendliness.

cs.LG

Multipartite entanglement in qudit hypergraph states

We study entanglement properties of hypergraph states in arbitrary finite dimension. We compute multipartite entanglement of elementary qudit hypergraph states, namely those endowed with a single maximum-cardinality hyperedge. We show that, analogously to the qubit case, also for arbitrary dimension there exists a lower bound for multipartite entanglement of connected qudit hypergraph states; this is given by the multipartite entanglement of an equal-dimension elementary hypergraph state featuring the same number of qudits as the largest-cardinality hyperedge. We highlight interesting differences between prime and non-prime dimension in the entanglement features.

quant-ph

Multipartite entanglement detection for hypergraph states

We study the entanglement properties of quantum hypergraph states of $n$ qubits, focusing on multipartite entanglement. We compute multipartite entanglement for hypergraph states with a single hyperedge of maximum cardinality, for hypergraph states endowed with all possible hyperedges of cardinality equal to $n-1$ and for those hypergraph states with all possible hyperedges of cardinality greater than or equal to $n-1$. We then find a lower bound to the multipartite entanglement of a generic quantum hypergraph state. We finally apply the multipartite entanglement results to the construction of entanglement witness operators, able to detect genuine multipartite entanglement in the neighbourhood of a given hypergraph state. We first build entanglement witnesses of the projective type, then propose a class of witnesses based on the stabilizer formalism, hence called stabilizer witnesses, able to reduce the experimental effort from an exponential to a linear growth in the number of local measurement settings with the number of qubits.

quant-ph

Auxiliary-Field Monte Carlo for lattice bosons: tackling strong interactions and frustration

We introduce a new numerical technique -- bosonic auxiliary-field Monte Carlo (bAFMC) -- which allows to calculate the thermal properties of large lattice-boson systems within a systematically improvable semiclassical approach, and which is virtually applicable to any bosonic model. Our method amounts to a decomposition of the lattice into clusters, and to an Ansatz for the density matrix of the system in the form of a cluster-separable state -- with non-entangled, yet classically correlated clusters. This approximation eliminates any sign problem, and can be systematically improved upon by using clusters of growing size. Extrapolation in the cluster size allows to reproduce numerically exact results for the superfluid transition of hardcore bosons on the square lattice, and to provide a solid quantitative prediction for the superfluid and chiral transition of hardcore bosons on the frustrated triangular lattice.

cond-mat.str-el

Quantum mean-field approximation for lattice quantum models: truncating quantum correlations, and retaining classical ones

In a recent work [D. Malpetti and T. Roscilde, arXiv:1605.04223] we have shown that in quantum many-body systems at finite temperature, two-point correlations can be formally separated into a thermal part, and a quantum part -- and that generically quantum correlations decay exponentially at finite temperature, with a characteristic, temperature-dependent quantum coherence length. The existence of these two different forms of correlation in quantum many-body systems suggests the possibility of formulating an approximation which affects quantum correlations only, without preventing the correct description of classical fluctuations at all length scales. Focusing on lattice boson and quantum Ising models, we make use of the path-integral formulation of quantum statistical mechanics to introduce such an approximation -- that we dub \emph{quantum mean-field} (QMF) approach, and which can be readily generalized to a cluster form (cluster QMF or cQMF). The cQMF approximation reduces to cluster mean-field theory at $T=0$, while at any finite temperature it produces a family of systematically improved, semi-classical approximations to the quantum statistical mechanics of the lattice theory at hand. Contrary to standard MF approximations, the correct nature of thermal critical phenomena is captured by any cluster size. In the two exemplary cases of the two-dimensional quantum Ising model and of two-dimensional quantum rotors, we study systematically the convergence of the cQMF approximation towards the exact result, and show that the convergence is typically linear or sub-linear in the { boundary-to-bulk ratio} of the clusters as $T\to 0$, while it becomes faster than linear as $T$ grows. These results pave the way towards the development of semi-classical numerical approaches based on an approximate, { yet} systematically improved account of quantum correlations.

cond-mat.stat-mech

Quantum correlations, separability and quantum coherence length in equilibrium many-body systems

Non-locality is a fundamental trait of quantum many-body systems, both at the level of pure states, as well as at the level of mixed states. Due to non-locality, mixed states of any two subsystems are correlated in a stronger way than what can be accounted for by considering correlated probabilities of occupying some microstates. In the case of equilibrium mixed states, we explicitly build two-point quantum correlation functions, which capture the specific, superior correlations of quantum systems at finite temperature, and which are directly { accessible to experiments when correlating measurable properties}. When non-vanishing, these correlation functions rule out a precise form of separability of the equilibrium state. In particular, we show numerically that quantum correlation functions generically exhibit a finite \emph{quantum coherence length}, dictating the characteristic distance over which degrees of freedom cannot be considered as separable. This coherence length is completely disconnected from the correlation length of the system -- as it remains finite even when the correlation length of the system diverges at finite temperature -- and it unveils the unique spatial structure of quantum correlations.

cond-mat.stat-mech