Related papers: Formalizing the Cryptographic Migration Problem

Related papers

Bridging Visualization and Optimization: Multimodal Large Language Models on Graph-Structured Combinatorial Optimization [56.17811386955609]
Graph-structured challenges are inherently difficult due to their nonlinear and intricate nature. In this study, we propose transforming graphs into images to preserve their higher-order structural features accurately. By combining the innovative paradigm powered by multimodal large language models with simple search techniques, we aim to develop a novel and effective framework.
arXiv Detail & Related papers (2025-01-21T08:28:10Z)
Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption [0.0]
Quantum homomorphic encryption (QHE) is an emerging technology that facilitates secure computation on quantum data without revealing the underlying information. We reinterpret QHE schemes through classical-quantum circuits, enhancing efficiency and addressing previous limitations related to key computations. Our approach eliminates the need for exponential key preparation by calculating keys in real-time during simulation, leading to a linear complexity in classically controlled gates.
arXiv Detail & Related papers (2024-12-02T20:50:48Z)
Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z)
The Foundations of Tokenization: Statistical and Computational Concerns [51.370165245628975]
Tokenization is a critical step in the NLP pipeline. Despite its recognized importance as a standard representation method in NLP, the theoretical underpinnings of tokenization are not yet fully understood. The present paper contributes to addressing this theoretical gap by proposing a unified formal framework for representing and analyzing tokenizer models.
arXiv Detail & Related papers (2024-07-16T11:12:28Z)
ALPINE: Unveiling the Planning Capability of Autoregressive Learning in Language Models [48.559185522099625]
Planning is a crucial element of both human intelligence and contemporary large language models (LLMs) This paper investigates the emergence of planning capabilities in Transformer-based LLMs via their next-word prediction mechanisms.
arXiv Detail & Related papers (2024-05-15T09:59:37Z)
MergeNet: Knowledge Migration across Heterogeneous Models, Tasks, and Modalities [72.68829963458408]
We present MergeNet, which learns to bridge the gap of parameter spaces of heterogeneous models. The core mechanism of MergeNet lies in the parameter adapter, which operates by querying the source model's low-rank parameters. MergeNet is learned alongside both models, allowing our framework to dynamically transfer and adapt knowledge relevant to the current stage.
arXiv Detail & Related papers (2024-04-20T08:34:39Z)
Migrating Software Systems towards Post-Quantum-Cryptography -- A Systematic Literature Review [2.4739484546803334]
A migration to post-quantum-cryptography (PQC) is necessary for networks and their components. Recent standardization efforts already push quantum-safe networking forward. However, the literature is still not in consensus about definitions and best practices.
arXiv Detail & Related papers (2024-04-19T12:43:32Z)
Masked Thought: Simply Masking Partial Reasoning Steps Can Improve Mathematical Reasoning Learning of Language Models [102.72940700598055]
In reasoning tasks, even a minor error can cascade into inaccurate results. We develop a method that avoids introducing external resources, relying instead on perturbations to the input. Our training approach randomly masks certain tokens within the chain of thought, a technique we found to be particularly effective for reasoning tasks.
arXiv Detail & Related papers (2024-03-04T16:21:54Z)
It Is Time To Steer: A Scalable Framework for Analysis-driven Attack Graph Generation [50.06412862964449]
Attack Graph (AG) represents the best-suited solution to support cyber risk assessment for multi-step attacks on computer networks. Current solutions propose to address the generation problem from the algorithmic perspective and postulate the analysis only after the generation is complete. This paper rethinks the classic AG analysis through a novel workflow in which the analyst can query the system anytime.
arXiv Detail & Related papers (2023-12-27T10:44:58Z)
Lattice real-time simulations with learned optimal kernels [49.1574468325115]
We present a simulation strategy for the real-time dynamics of quantum fields inspired by reinforcement learning. It builds on the complex Langevin approach, which it amends with system specific prior information.
arXiv Detail & Related papers (2023-10-12T06:01:01Z)
A Framework for Migrating to Post-Quantum Cryptography: Security Dependency Analysis and Case Studies [3.890207460112498]
cryptography, once deemed secure for decades, are now at risk of being compromised. There is an urgent need to migrate to quantum-resistant cryptographic systems. We present a comprehensive framework designed to assist enterprises with this transition.
arXiv Detail & Related papers (2023-07-13T01:51:15Z)
Unitary Complexity and the Uhlmann Transformation Problem [41.67228730328207]
We introduce a framework for unitary synthesis problems, including notions of reductions and unitary complexity classes. We use this framework to study the complexity of transforming one entangled state into another via local operations. Our framework for unitary complexity thus provides new avenues for studying the computational complexity of many natural quantum information processing tasks.
arXiv Detail & Related papers (2023-06-22T17:46:39Z)
Faith and Fate: Limits of Transformers on Compositionality [109.79516190693415]
We investigate the limits of transformer large language models across three representative compositional tasks. These tasks require breaking problems down into sub-steps and synthesizing these steps into a precise answer. Our empirical findings suggest that transformer LLMs solve compositional tasks by reducing multi-step compositional reasoning into linearized subgraph matching.
arXiv Detail & Related papers (2023-05-29T23:24:14Z)
Enhancing SMT-based Weighted Model Integration by Structure Awareness [10.812681884889697]
Weighted Model Integration (WMI) emerged as a unifying formalism for probabilistic inference in hybrid domains. We develop an algorithm that combines SMT-based enumeration, an efficient technique in formal verification, with an effective encoding of the problem structure.
arXiv Detail & Related papers (2023-02-13T08:55:12Z)
Reflection Equivariant Quantum Neural Networks for Enhanced Image Classification [0.7232471205719458]
We build new machine learning models which explicitly respect the symmetries inherent in their data, so-called geometric quantum machine learning (GQML) We find that these networks are capable of consistently and significantly outperforming generic ansatze on complicated real-world image datasets.
arXiv Detail & Related papers (2022-12-01T04:10:26Z)
Bayesian Inference of Transition Matrices from Incomplete Graph Data with a Topological Prior [1.2891210250935143]
We derive an analytically tractable Bayesian method that uses repeated interactions and a topological prior to infer transition matrices data-efficiently. We show that it recovers the transition probabilities with higher accuracy and that it is robust even in cases when the knowledge of the topological constraint is partial.
arXiv Detail & Related papers (2022-10-27T13:17:47Z)
SMT-based Weighted Model Integration with Structure Awareness [18.615397594541665]
We develop an algorithm that combines SMT-based enumeration, an efficient technique in formal verification, with an effective encoding of the problem structure. This allows our algorithm to avoid generating redundant models, resulting in substantial computational savings.
arXiv Detail & Related papers (2022-06-28T09:46:17Z)
Investigating internal migration with network analysis and latent space representations: An application to Turkey [0.0]
We provide an in-depth investigation into the structure and dynamics of the internal migration in Turkey from 2008 to 2020. We identify a set of classical migration laws and examine them via various methods for signed network analysis, ego network analysis, representation learning, temporal stability analysis, and network visualization. The findings show that, in line with the classical migration laws, most migration links are geographically bounded with several exceptions involving cities with large economic activity.
arXiv Detail & Related papers (2022-01-10T18:58:02Z)
Bayesian Inductive Learner for Graph Resiliency under uncertainty [1.9254132307399257]
We propose a Bayesian graph neural network-based framework for identifying critical nodes in a large graph. The fidelity and the gain in computational complexity offered by the framework are illustrated.
arXiv Detail & Related papers (2020-12-26T07:22:29Z)
Multilayer Clustered Graph Learning [66.94201299553336]
We use contrastive loss as a data fidelity term, in order to properly aggregate the observed layers into a representative graph. Experiments show that our method leads to a clustered clusters w.r.t. We learn a clustering algorithm for solving clustering problems.
arXiv Detail & Related papers (2020-10-29T09:58:02Z)
Adversarial Attack on Community Detection by Hiding Individuals [68.76889102470203]
We focus on black-box attack and aim to hide targeted individuals from the detection of deep graph community detection models. We propose an iterative learning framework that takes turns to update two modules: one working as the constrained graph generator and the other as the surrogate community detection model.
arXiv Detail & Related papers (2020-01-22T09:50:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.