相关论文: Weak Evolvability Equals Strong Evolvability

Weak values arise in quantum theory when the result of a weak measurement is conditioned on a subsequent strong measurement. The majority of the trials are discarded, leaving only very few successful events. Intriguingly those can display a…

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

Two pretrained neural networks are deemed equivalent if they yield similar outputs for the same inputs. Equivalence checking of neural networks is of great importance, due to its utility in replacing learning-enabled components with…

We derive a simple lower bound for the multi-version coding problem formulated in [1]. We also propose simple algorithms that almost match the lower bound derived. Another lower bound is proven for an extended version of the multi-version…

Large language models (LLMs) have made impressive progress in natural language processing. These models rely on proper human instructions (or prompts) to generate suitable responses. However, the potential of LLMs are not fully harnessed by…

Large language models (LLMs) are increasingly used to evolve programs and multi-agent systems, yet most existing approaches rely on overwrite-based mutations that maintain only a single candidate at a time. Such methods discard useful…

We introduce a new type of homotopy relation for digitally continuous functions which we call ``strong homotopy.'' Both digital homotopy and strong homotopy are natural digitizations of classical topological homotopy: the difference between…

Strong equivalence between knowledge bases ensures the possibility of replacing one with the other without affecting reasoning outcomes, in any given context. This makes it a crucial property in nonmonotonic formalisms. In particular, the…

Given a constraint $c$ assumed to hold on a database $B$ and an update $u$ to be performed on $B$, we address the following question: will $c$ still hold after $u$ is performed? When $B$ is a relational database, we define a confluent…

The usual way of defining weak equivalences for simplicial presheaves is to require an isomorphism on all sheaves of homotopy groups. We unravel some of the machinery here, and give a more concrete description in terms of local homotopy…

The EM training algorithm of the classical i-vector extractor is often incorrectly described as a maximum-likelihood method. The i-vector model is however intractable: the likelihood itself and the hidden-variable posteriors needed for the…

Some simple nonlinear recursions which can be completely managed are identified and the behaviour of all their solutions is ascertained.

Despite their success, deep networks have been shown to be highly susceptible to perturbations, often causing significant drops in accuracy. In this paper, we investigate model robustness on perturbed inputs by studying the performance of…

By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.

We consider weakly coupled LQ optimal control problems and derive estimates on the sensitivity of the optimal value function in dependence of the coupling strength. In order to improve these sensitivity estimates a "coupling adapted" norm…

Development of energy and performance-efficient embedded software is increasingly relying on application of complex transformations on the critical parts of the source code. Designers applying such nontrivial source code transformations are…

Mainstream software applications and tools are the configurable platforms with an enormous number of parameters along with their values. Certain settings and possible interactions between these parameters may harden (or soften) the security…

Valiant's (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold functions and their various subclasses, such as conjunctions…

In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the…

Orderability, weak orderability and the existence of continuous weak selections on filter spaces (i.e., spaces with a single non-isolated point) and their products are discussed. We prove that a closed continuous image X of a suborderable…