Multi-Property Synthesis

• URL: http://arxiv.org/abs/2601.10651v1
• Date: Thu, 15 Jan 2026 18:18:33 GMT
• Title: Multi-Property Synthesis
• Authors: Christoph Weinhuber, Yannik Schnitzer, Alessandro Abate, David Parker, Giuseppe De Giacomo, Moshe Y. Vardi,
• Abstract summary: We study synthesis with multiple properties, where satisfying all properties may be impossible.<n>Instead of enumerating subsets of properties, we compute in one fixed-point computation the relation between product-game states and the goal sets that are realizable from them.
• Score: 69.79949693440426
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study LTLf synthesis with multiple properties, where satisfying all properties may be impossible. Instead of enumerating subsets of properties, we compute in one fixed-point computation the relation between product-game states and the goal sets that are realizable from them, and we synthesize strategies achieving maximal realizable sets. We develop a fully symbolic algorithm that introduces Boolean goal variables and exploits monotonicity to represent exponentially many goal combinations compactly. Our approach substantially outperforms enumeration-based baselines, with speedups of up to two orders of magnitude.

Related papers

• Multi-agent imitation learning with function approximation: Linear Markov games and beyond [63.14746189846806]
  We present the first theoretical analysis of multi-agent imitation learning (MAIL) in linear Markov games.<n>We show that it is possible to replace the state-action level "all policy deviation concentrability coefficient" with a concentrability coefficient defined at the feature level.<n>We propose a deep MAIL interactive algorithm which clearly outperforms BC on games such as Tic-Tac-Toe and Connect4.
  arXiv  Detail & Related papers  (2026-02-26T09:50:15Z)
• High-Performance Exact Synthesis of Two-Qubit Quantum Circuits [0.0]
  We present an exact synthesis framework for two-qubit circuits over the Clifford+$T$ gate set.<n>Our approach exhausts a bounded search space, exploits algebraic canonicalization to avoid redundancy, and constructs a lookup table of optimal implementations that turns synthesis into a query.
  arXiv  Detail & Related papers  (2026-01-27T03:57:04Z)
• MergeDNA: Context-aware Genome Modeling with Dynamic Tokenization through Token Merging [65.07273789940116]
  This paper introduces a hierarchical architecture that jointly optimize a dynamic genomic tokenizer and latent Transformers with context-aware pre-training tasks.<n> MergeDNA achieves superior performance on three popular DNA benchmarks and several multi-omics tasks with fine-tuning or zero-shot evaluation.
  arXiv  Detail & Related papers  (2025-11-17T19:27:41Z)
• Unifying Feature and Cost Aggregation with Transformers for Semantic and Visual Correspondence [51.54175067684008]
  This paper introduces a Transformer-based integrative feature and cost aggregation network designed for dense matching tasks. We first show that feature aggregation and cost aggregation exhibit distinct characteristics and reveal the potential for substantial benefits stemming from the judicious use of both aggregation processes. Our framework is evaluated on standard benchmarks for semantic matching, and also applied to geometric matching, where we show that our approach achieves significant improvements compared to existing methods.
  arXiv  Detail & Related papers  (2024-03-17T07:02:55Z)
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms [64.10576998630981]
  We show the first tight characterization of the optimal Hessian-dependent sample complexity. A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances. The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
  arXiv  Detail & Related papers  (2023-06-21T17:03:22Z)
• Linearization Algorithms for Fully Composite Optimization [61.20539085730636]
  This paper studies first-order algorithms for solving fully composite optimization problems convex compact sets. We leverage the structure of the objective by handling differentiable and non-differentiable separately, linearizing only the smooth parts.
  arXiv  Detail & Related papers  (2023-02-24T18:41:48Z)
• PropertyDAG: Multi-objective Bayesian optimization of partially ordered, mixed-variable properties for biological sequence design [42.92794039060737]
  We present PropertyDAG, a framework that operates on top of the traditional multi-objective BO to impose this desired ordering on the objectives. We demonstrate its performance over multiple simulated active learning iterations on a penicillin production task, toy numerical problem, and a real-world antibody design task.
  arXiv  Detail & Related papers  (2022-10-08T19:42:16Z)
• Orchestrated Value Mapping for Reinforcement Learning [15.000818334408805]
  We present a class of reinforcement learning algorithms based on two distinct principles. The first principle enables incorporating specific properties into the value estimator that can enhance learning. The second principle, on the other hand, allows for the value function to be represented as a composition of multiple utility functions.
  arXiv  Detail & Related papers  (2022-03-14T15:13:44Z)
• Multiset Signal Processing and Electronics [1.0152838128195467]
  Multisets are intuitive extensions of the traditional concept of sets that allow repetition of elements. Recent generalizations of multisets to real-valued functions have paved the way to a number of interesting implications and applications. It is proposed that effective multiset operations capable of high performance self and cross-correlation can be obtained with relative simplicity in either discrete or integrated circuits.
  arXiv  Detail & Related papers  (2021-11-13T11:50:00Z)
• Learning Aggregation Functions [78.47770735205134]
  We introduce LAF (Learning Aggregation Functions), a learnable aggregator for sets of arbitrary cardinality. We report experiments on semi-synthetic and real data showing that LAF outperforms state-of-the-art sum- (max-) decomposition architectures.
  arXiv  Detail & Related papers  (2020-12-15T18:28:53Z)
• Practical Bayesian Optimization of Objectives with Conditioning Variables [1.0497128347190048]
  We consider the more general case where a user is faced with multiple problems that each need to be optimized conditional on a state variable. Similarity across objectives boosts optimization of each objective in two ways. We propose a framework for conditional optimization: ConBO.
  arXiv  Detail & Related papers  (2020-02-23T22:06:26Z)

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.