Improved Algorithm for the Network Alignment Problem with Application to Binary Diffing

• URL: http://arxiv.org/abs/2112.15336v1
• Date: Fri, 31 Dec 2021 07:52:14 GMT
• Title: Improved Algorithm for the Network Alignment Problem with Application to Binary Diffing
• Authors: Elie Mengin (SAMM), Fabrice Rossi (CEREMADE)
• Abstract summary: We present a novel algorithm to address the Network Alignment problem. Experiments show that our proposed model outperforms other state-of-the-art solvers. We also propose an application of our method in order to address the Binary Diffing problem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we present a novel algorithm to address the Network Alignment problem. It is inspired from a previous message passing framework of Bayati et al. [2] and includes several modifications designed to significantly speed up the message updates as well as to enforce their convergence. Experiments show that our proposed model outperforms other state-of-the-art solvers. Finally, we propose an application of our method in order to address the Binary Diffing problem. We show that our solution provides better assignment than the reference differs in almost all submitted instances and outline the importance of leveraging the graphical structure of binary programs.

Related papers

• Understanding GNNs for Boolean Satisfiability through Approximation Algorithms [0.0]
  The paper deals with the interpretability of Graph Neural Networks in the context of Boolean Satisfiability. The goal is to demystify the internal workings of these models and provide insightful perspectives into their decision-making processes.
  arXiv  Detail & Related papers  (2024-08-27T21:47:09Z)
• Improving Subject-Driven Image Synthesis with Subject-Agnostic Guidance [62.15866177242207]
  We show that through constructing a subject-agnostic condition, one could obtain outputs consistent with both the given subject and input text prompts. Our approach is conceptually simple and requires only minimal code modifications, but leads to substantial quality improvements.
  arXiv  Detail & Related papers  (2024-05-02T15:03:41Z)
• Graph Convolutional Networks and Graph Attention Networks for Approximating Arguments Acceptability -- Technical Report [0.27624021966289597]
  We show how we can improve the performances of the Graph Convolutional Networks (GCNs) regarding both runtime and accuracy. Then, we show that it is possible to improve even more the efficiency of the approach by modifying the architecture of the network, using Graph Attention Networks (GATs) instead.
  arXiv  Detail & Related papers  (2024-04-29T13:12:08Z)
• Equivariant Deep Weight Space Alignment [54.65847470115314]
  We propose a novel framework aimed at learning to solve the weight alignment problem. We first prove that weight alignment adheres to two fundamental symmetries and then, propose a deep architecture that respects these symmetries.
  arXiv  Detail & Related papers  (2023-10-20T10:12:06Z)
• Network Alignment with Transferable Graph Autoencoders [79.89704126746204]
  We propose a novel graph autoencoder architecture designed to extract powerful and robust node embeddings. We prove that the generated embeddings are associated with the eigenvalues and eigenvectors of the graphs. Our proposed framework also leverages transfer learning and data augmentation to achieve efficient network alignment at a very large scale without retraining.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Graph Reinforcement Learning for Network Control via Bi-Level Optimization [37.00510744883984]
  We argue that data-driven strategies can automate this process and learn efficient algorithms without compromising optimality. We present network control problems through the lens of reinforcement learning and propose a graph network-based framework to handle a broad class of problems.
  arXiv  Detail & Related papers  (2023-05-16T03:20:22Z)
• Binary Diffing as a Network Alignment Problem via Belief Propagation [0.0]
  We introduce a new formulation of this problem as a particular instance of a graph edit problem over the call graphs of the programs. We show that this formulation is equivalent to a network alignment problem. We implement a prototype of our method, called QBinDiff, and propose an extensive evaluation which shows that our approach outperforms state of the art diffing tools.
  arXiv  Detail & Related papers  (2021-12-31T07:54:11Z)
• Weakly supervised cross-domain alignment with optimal transport [102.8572398001639]
  Cross-domain alignment between image objects and text sequences is key to many visual-language tasks. This paper investigates a novel approach for the identification and optimization of fine-grained semantic similarities between image and text entities.
  arXiv  Detail & Related papers  (2020-08-14T22:48:36Z)
• Taxonomy of Dual Block-Coordinate Ascent Methods for Discrete Energy Minimization [96.1052289276254]
  We consider the maximum-a-posteriori inference problem in discrete graphical models and study solvers based on the dual block-coordinate ascent rule. We map all existing solvers in a single framework, allowing for a better understanding of their design principles.
  arXiv  Detail & Related papers  (2020-04-16T15:49:13Z)
• Binary Neural Networks: A Survey [126.67799882857656]
  The binary neural network serves as a promising technique for deploying deep models on resource-limited devices. The binarization inevitably causes severe information loss, and even worse, its discontinuity brings difficulty to the optimization of the deep network. We present a survey of these algorithms, mainly categorized into the native solutions directly conducting binarization, and the optimized ones using techniques like minimizing the quantization error, improving the network loss function, and reducing the gradient error.
  arXiv  Detail & Related papers  (2020-03-31T16:47:20Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.