Related papers: Revisiting Locality in Binary-Integer Representati…
Most existing methods in binaural sound source localization rely on some kind of aggregation of phase-and level-difference cues in the time-frequency plane. While different ag-gregation schemes exist, they are often heuristic and suffer in…
The effect of genetic operators other than selection, such as mutation and recombination, on the genotype-phenotype map is considered. In particular, when the genotypic fitness landscape exhibits a ``symmetry'', i.e. many genotypes…
Because of the electromagnetic radiation produced during the merger, compact binary coalescences with neutron stars may result in multi-messenger observations. In order to follow up on the gravitational-wave signal with electromagnetic…
Invariance to nuisance transformations is one of the desirable properties of effective representations. We consider transformations that form a \emph{group} and propose an approach based on kernel methods to derive local group invariant…
This paper offers a review of the results concerning localization operators on modulation spaces, and related topics. However, our approach, based on the Grossmann-Royer transform, gives a new insight and (slightly) different proofs. We…
Geometric and Topological Deep Learning are rapidly growing research areas that enhance machine learning through the use of geometric and topological structures. Within this framework, Group Equivariant Non-Expansive Operators (GENEOs) have…
This paper proposes a new algorithm based on multi-scale stochastic local search with binary representation for training neural networks. In particular, we study the effects of neighborhood evaluation strategies, the effect of the number of…
Random binning features, introduced in the seminal paper of Rahimi and Recht (2007), are an efficient method for approximating a kernel matrix using locality sensitive hashing. Random binning features provide a very simple and efficient way…
The drift-barrier hypothesis states that random genetic drift constrains the refinement of a phenotype under natural selection. The influence of effective population size and the genome-wide deleterious mutation rate were studied…
A genetic algorithm (GA) is a search method that optimises a population of solutions by simulating natural evolution. Good solutions reproduce together to create better candidates. The standard GA assumes that any two solutions can mate.…
The persistence of life requires populations to adapt at a rate commensurate with the dynamics of their environment. Successful populations that inhabit highly variable environments have evolved mechanisms to increase the likelihood of…
Local regression is widely used to explore spatial heterogeneity, but anisotropic or effectively low-dimensional neighborhoods can produce ill-conditioned local solves, causing coefficient variation driven by numerical artifacts rather than…
We explore different gauge choices in the moving puncture formulation in order to improve the accuracy of a linear momentum measure evaluated on the horizon of the remnant black hole produced by the merger of a binary. In particular,…
We present a novel means of describing local image appearances using binary strings. Binary descriptors have drawn increasing interest in recent years due to their speed and low memory footprint. A known shortcoming of these representations…
We determine the possible masses and radii of the progenitors of white dwarfs in binaries from fits to detailed stellar evolution models and use these to reconstruct the mass-transfer phase in which the white dwarf was formed. We confirm…
We compare the evolution of binary systems evolved in the MESA stellar evolution code to those in the COSMIC population synthesis code. Our aim is to convey the robustness of the equations that model binary evolution in the COSMIC code,…
Optimal Mixing (OM) is a variation operator that integrates local search with genetic recombination. EAs with OM are capable of state-of-the-art optimization in discrete spaces, offering significant advantages over classic…
The standard genetic code is known to be robust to translation errors and point mutations. We studied how small modifications of the standard code affect its robustness. The robustness was assessed in terms of a proper stability function,…
Representation learning of geospatial locations remains a core challenge in achieving general geospatial intelligence, with increasingly diverging philosophies and techniques. While Earth observation paradigms excel at depicting locations…
This work discusses single-objective constrained genetic algorithm with floating-point, integer, binary and permutation representation. Floating-point genetic algorithm tuning with use of test functions is done and leads to a…