相关论文: Weak Evolvability Equals Strong Evolvability

Weak purifying selection, acting on many linked mutations, may play a major role in shaping patterns of molecular evolution in natural populations. Yet efforts to infer these effects from DNA sequence data are limited by our incomplete…

Recently, researches related to unsupervised disentanglement learning with deep generative models have gained substantial popularity. However, without introducing supervision, there is no guarantee that the factors of interest can be…

Robustness, the insensitivity of some of a biological system's functionalities to a set of distinct conditions, is intimately linked to fitness. Recent studies suggest that it may also play a vital role in enabling the evolution of species.…

This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence…

Robustness and evolvability are essential properties to the evolution of biological networks. To determine if a biological network is robust and/or evolvable, it is required to compare its functions before and after mutations. However, this…

In this work, new equivalences of topological statements and weaker axioms than ${\bf AC}$ are proven. This equivalences include the use of anti-properties. All this equivalences have been checked with a computer using the theorem proving…

We establish a weak-strong uniqueness result for the isentropic compressible Euler equations, that is: As long as a sufficiently regular solution exists, all energy-admissible weak solutions with the same initial data coincide with it. The…

We establish properties of a new type of fractal which has partial self similarity at all scales. For any collection of iterated functions systems with an associated probability distribution and any positive integer V there is a…

Kedem's Comment [arXiv:1402.1352] on our Letter [PRL 112, 040406 (2014)] contains only the criticism that we did not consider complex weak values. We point out follow-up work which uses the same analysis as in our Letter, includes any type…

Successive elimination of candidates is often a route to making manipulation intractable to compute. We prove that eliminating candidates does not necessarily increase the computational complexity of manipulation. However, for many voting…

We show how the characteristics of the evolutionary algorithm influence the evolvability of candidate solutions, i.e. the propensity of evolving individuals to generate better solutions as a result of genetic variation. More specifically,…

Weakly well-designed SPARQL patterns is a recent generalisation of well-designed patterns, which preserve good computational properties but also capture almost all patterns that appear in practice. Subsumption is one of static analysis…

Knowledge utilization is a critical aspect of LLMs, and understanding how they adapt to evolving knowledge is essential for their effective deployment. However, existing benchmarks are predominantly static, failing to capture the evolving…

Why evolvability appears to have increased over evolutionary time is an important unresolved biological question. Unlike most candidate explanations, this paper proposes that increasing evolvability can result without any pressure to adapt.…

We make two tiny corrections to our previous paper with the same title, and also obtain, as a bonus, something new.

The problem is addressed of defining the values of functions, whose variables tend to infinity, from the knowledge of these functions at asymptotically small variables close to zero. For this purpose, the extrapolation by means of different…

How many times have you tried to re-implement a past CAV tool paper, and failed? Reliably reproducing published scientific discoveries has been acknowledged as a barrier to scientific progress for some time but there remains only a small…

We find that a wide class of developing and decaying networks has scaling properties similar to those that were recently observed by Barab\'{a}si and Albert in the particular case of growing networks. The networks considered here evolve…

We establish the test which allows to show that a mean does not admit a weak-Hardy property. As a result we prove that Hardy and weak-Hardy properties are equivalent in the class of homogeneous, symmetric, repetition invariant, and Jensen…

The theory of evolvability, introduced by Valiant (2009), formalizes evolution as a constrained learning algorithm operating without labeled examples or structural knowledge. While theoretical work has established the evolvability of…