arXiv subjects

Marius Paraschiv

Publications and source records attributed to Marius Paraschiv.

9 recordsLinked to original sources

arXiv2026

SatQNet: Satellite-assisted Quantum Network Entanglement Routing Using Directed Line Graph Neural Networks

Quantum networks are expected to become a key enabler for interconnecting quantum devices. In contrast to classical communication networks, however, information transfer in quantum networks is usually restricted to short distances due to physical constraints of entanglement distribution. Satellites can extend entanglement distribution over long distances, but routing in such networks is challenging because satellite motion and stochastic link generation create a highly dynamic quantum topology. Existing routing methods often rely on global topology information that quickly becomes outdated due to delays in the classical control plane, while decentralized methods typically act on incomplete local information. We propose SatQNet, a reinforcement learning approach for entanglement routing in satellite-assisted quantum networks that can be decentralized at runtime. Its key innovation is an edge-centric directed line graph neural network that performs local message passing on directed edge embeddings, enabling it to better capture link properties in high-degree and time-varying topologies. By exchanging messages with neighboring repeaters, SatQNet learns a local graph representation at runtime that supports agents in establishing high-fidelity end-to-end entanglements. Trained on random graphs, SatQNet outperforms heuristic and learning-based approaches across diverse settings, including a real-world European backbone topology, and generalizes to unseen topologies without retraining.

quant-ph↗

arXiv2025

RELiQ: Scalable Entanglement Routing via Reinforcement Learning in Quantum Networks

Quantum networks are becoming increasingly important because of advancements in quantum computing and quantum sensing, such as recent developments in distributed quantum computing and federated quantum machine learning. Routing entanglement in quantum networks poses several fundamental as well as technical challenges, including the high dynamicity of quantum network links and the probabilistic nature of quantum operations. Consequently, designing hand-crafted heuristics is difficult and often leads to suboptimal performance, especially if global network topology information is unavailable. In this paper, we propose RELiQ, a reinforcement learning-based approach to entanglement routing that only relies on local information and iterative message exchange. Utilizing a graph neural network, RELiQ learns graph representations and avoids overfitting to specific network topologies - a prevalent issue for learning-based approaches. Our approach, trained on random graphs, consistently outperforms existing local information heuristics and learning-based approaches when applied to random and real-world topologies. When compared to global information heuristics, our method achieves similar or superior performance because of its rapid response to topology changes.

quant-ph↗

arXiv2024

HyperGraphDis: Leveraging Hypergraphs for Contextual and Social-Based Disinformation Detection

In light of the growing impact of disinformation on social, economic, and political landscapes, accurate and efficient identification methods are increasingly critical. This paper introduces HyperGraphDis, a novel approach for detecting disinformation on Twitter that employs a hypergraph-based representation to capture (i) the intricate social structures arising from retweet cascades, (ii) relational features among users, and (iii) semantic and topical nuances. Evaluated on four Twitter datasets -- focusing on the 2016 U.S. Presidential election and the COVID-19 pandemic -- HyperGraphDis outperforms existing methods in both accuracy and computational efficiency, underscoring its effectiveness and scalability for tackling the challenges posed by disinformation dissemination. HyperGraphDis displays exceptional performance on a COVID-19-related dataset, achieving an impressive F1 score (weighted) of approximately 89.5%. This result represents a notable improvement of around 4% compared to the other state-of-the-art methods. Additionally, significant enhancements in computation time are observed for both model training and inference. In terms of model training, completion times are accelerated by a factor ranging from 2.3 to 7.6 compared to the second-best method across the four datasets. Similarly, during inference, computation times are 1.3 to 6.8 times faster than the state-of-the-art.

cs.SI↗

arXiv2021

A Unified Graph-Based Approach to Disinformation Detection using Contextual and Semantic Relations

As recent events have demonstrated, disinformation spread through social networks can have dire political, economic and social consequences. Detecting disinformation must inevitably rely on the structure of the network, on users particularities and on event occurrence patterns. We present a graph data structure, which we denote as a meta-graph, that combines underlying users' relational event information, as well as semantic and topical modeling. We detail the construction of an example meta-graph using Twitter data covering the 2016 US election campaign and then compare the detection of disinformation at cascade level, using well-known graph neural network algorithms, to the same algorithms applied on the meta-graph nodes. The comparison shows a consistent 3%-4% improvement in accuracy when using the meta-graph, over all considered algorithms, compared to basic cascade classification, and a further 1% increase when topic modeling and sentiment analysis are considered. We carry out the same experiment on two other datasets, HealthRelease and HealthStory, part of the FakeHealth dataset repository, with consistent results. Finally, we discuss further advantages of our approach, such as the ability to augment the graph structure using external data sources, the ease with which multiple meta-graphs can be combined as well as a comparison of our method to other graph-based disinformation detection frameworks.

cs.SI↗

arXiv2020

Computing the Relative Value of Spatio-Temporal Data in Wholesale and Retail Data Marketplaces

Spatio-temporal information is used for driving a plethora of intelligent transportation, smart-city, and crowd-sensing applications. Since data is now considered a valuable production factor, data marketplaces have appeared to help individuals and enterprises bring it to market to satisfy the ever-growing demand. In such marketplaces, several sources may need to combine their data in order to meet the requirements of different applications. In this paper we study the problem of estimating the relative value of different spatio-temporal datasets combined in wholesale and retail marketplaces for the purpose of predicting demand in metropolitan areas. Using as case studies large datasets of taxi rides from Chicago and New York, we ask questions such as "When does it make sense for different taxi companies to combine their data?", and "How should different companies be compensated for the data that they share?". We then turn our attention to the even harder problem of establishing the relative value of the data brought to retail marketplaces by individual drivers. Overall, we show that simplistic but popular approaches for estimating the relative value of data, such as using volume, or the ``leave-one-out'' heuristic, are inaccurate. Instead, more complex notions of value from economics and game-theory, such as the Shapley value need to be employed if one wishes to capture the complex effects of mixing different datasets on the accuracy of forecasting algorithms. Applying the Shapley value to large datasets from many sources is, of course, computationally challenging. We resort to structured sampling and manage to compute accurately the importance of thousands of data sources. We show that the relative value of the data held by different taxi companies and drivers may differ substantially, and that its relative ranking may change from district to district within a metropolitan area.

cs.SI↗

arXiv2019

Valuating User Data in a Human-Centric Data Economy

The idea of paying people for their data is increasingly seen as a promising direction for resolving privacy debates, improving the quality of online data, and even offering an alternative to labor-based compensation in a future dominated by automation and self-operating machines. In this paper we demonstrate how a Human-Centric Data Economy would compensate the users of an online streaming service. We borrow the notion of the Shapley value from cooperative game theory to define what a fair compensation for each user should be for movie scores offered to the recommender system of the service. Since determining the Shapley value exactly is computationally inefficient in the general case, we derive faster alternatives using clustering, dimensionality reduction, and partial information. We apply our algorithms to a movie recommendation data set and demonstrate that different users may have a vastly different value for the service. We also analyze the reasons that some movie ratings may be more valuable than others and discuss the consequences for compensating users fairly.

cs.SI↗

arXiv2018

Proving genuine multiparticle entanglement from separable nearest-neighbor marginals

We address the question of whether or not global entanglement of a quantum state can be inferred from local properties. Specifically, we are interested in genuinely multiparticle entangled states whose two-body marginals are all separable, but where the entanglement can be proven using knowledge of a subset of the marginals only. Using an iteration of semidefinite programs we prove that for any possible marginal configuration up to six particles multiqubit states with the desired properties can be found. We then present a method to construct states with the same properties for more particles in higher dimensions.

quant-ph↗

arXiv2017

Exploiting Nontrivial Connectivity for Automatic Speech Recognition

Nontrivial connectivity has allowed the training of very deep networks by addressing the problem of vanishing gradients and offering a more efficient method of reusing parameters. In this paper we make a comparison between residual networks, densely-connected networks and highway networks on an image classification task. Next, we show that these methodologies can easily be deployed into automatic speech recognition and provide significant improvements to existing models.

cs.SD↗

arXiv2016

Generalized Effective Operator Formalism for Decaying Systems

Systems of neutral kaons can be used to observe entanglement and the violation of Bell inequalities. The decay of these particles poses some problems, however, and recently an effective formalism for treating such systems has been derived. We generalize this formalism and make it applicable to other quantum systems that can be made to behave in a similar manner. As examples, we discuss two possible implementations of the generalized formalism using trapped ions such as $^{171}$Yb or $^{172}$Yb, which may be used to simulate kaonic behavior in a quantum optical system.

quant-ph↗