相关论文: Limited bisimulations for nondeterministic fuzzy t…

Numerous neuro-symbolic approaches have recently been proposed typically with the goal of adding symbolic knowledge to the output layer of a neural network. Ideally, such losses maximize the probability that the neural network's predictions…

We discuss an expansion of the detection probabilities of biphoton states in terms of increasing orders of the joint spectral amplitude. The expansion enables efficient time- or frequency-resolved numerical simulations involving quantum…

With the previous notions of bisimulation presented in literature, to check if two quantum processes are bisimilar, we have to instantiate the free quantum variables of them with arbitrary quantum states, and verify the bisimilarity of…

In this work we propose a framework to address the issue of state dependent nonlinear equality-constrained state estimation using Bayesian filtering. This framework is constructed specifically for a linear approximation of Bayesian…

An important constraint of Fuzzy Inference Systems (FIS) is their structured rules defined based on evaluating all input variables. Indeed, the length of all fuzzy rules and the number of input variables are equal. However, in many…

This paper presents and analyzes an incremental algorithm for the construction of Acyclic Non-deterministic Finite-state Automata (NFA). Automata of this type are quite useful in computational linguistics, especially for storing lexicons.…

Pretrained foundation models offer substantial benefits for a wide range of downstream tasks, which can be one of the most potential techniques to access artificial general intelligence. However, scaling up foundation transformers for…

Multiscale dynamics are ubiquitous in applications of modern science. Because of time scale separation between relatively small set of slowly evolving variables and (typically) much larger set of rapidly changing variables, direct numerical…

Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-rigorous statistical mechanics ideas have inspired a message passing algorithm called Belief Propagation Guided Decimation for finding satisfying…

We propose an approximation of nonlinear renewal equations by means of ordinary differential equations. We consider the integrated state, which is absolutely continuous and satisfies a delay differential equation. By applying the…

Simulation-based verification algorithms can provide formal safety guarantees for nonlinear and hybrid systems. The previous algorithms rely on user provided model annotations called discrepancy function, which are crucial for computing…

The aim of this paper is twofold: In the first part, we leverage recent results on scenario design to develop randomized algorithmsfor approximating the image set of a nonlinear mapping, that is, a (possibly noisy) mapping of a set via a…

In this paper we consider the problem of finding a maximum weight set subject to a $k$-extendible constraint in the data stream model. The only non-trivial algorithm known for this problem to date---to the best of our knowledge---is a…

Quantum fidelity is a central tool in quantum information, quantifying how much two quantum states are similar. Here we propose a limit formula for the quantum fidelity between a mixed state and a pure state. As an example of an…

Relief algorithm is a feature selection algorithm used in binary classification proposed by Kira and Rendell, and its computational complexity remarkable increases with both the scale of samples and the number of features. In order to…

We use tools from random matrix theory to study the multi-spiked tensor model, i.e., a rank-$r$ deformation of a symmetric random Gaussian tensor. In particular, thanks to the nature of local optimization methods used to find the maximum…

Probabilistic bisimulation is a fundamental notion of process equivalence for probabilistic systems. Among others, it has important applications including formalizing the anonymity property of several communication protocols. There is a lot…

This work aims to provide an alternative approach to modeling a two-state system (qubit) coupled to a nonlinear oscillator. Within a single algebraic scheme based upon the f-deformed oscillator description, hard and soft nonlinearities are…

We study a class of filters -- discrete finite-state transition systems employed as incremental stream transducers -- that have application to robotics: e.g., to model combinatorial estimators and also as concise encodings of feedback…

There has been a growing interest in defining models of automata enriched with time, such as finite automata extended with clocks (timed automata). In this paper, we study deterministic timed finite state machines (TFSMs), i.e., finite…