We determine those universal classes of lattices which generate a decidable discriminator variety when augmented by a ternary discriminator term. They are the locally finite universal classes whose finite members are almost homogeneous.

We introduce the “Energy-based Generative Adversarial Network” model (EBGAN) which views the discriminator as an energy function that attributes low energies to the regions near the data manifold and higher energies to other regions. Similar to the probabilistic GANs, a generator is seen as being trained to produce contrastive samples with minimal energies, while the discriminator is trained to...

We determine precisely those locally finite varieties of unary algebras of finite type which, when augmented by a ternary discriminator, generate a variety with a decidable theory.

We introduce the “Energy-based Generative Adversarial Network” model (EBGAN) which views the discriminator as an energy function that associates low energies with the regions near the data manifold and higher energies with other regions. Similar to the probabilistic GANs, a generator is trained to produce contrastive samples with minimal energies, while the discriminator is trained to assign hi...

We propose to extend the original generative adversarial networks (GANs) framework to multiple discriminators and omit, or dropout, the feedback of each discriminator with same probability at the end of each batch. Our approach forces the generator to not rely on a given discriminator to learn how to produce realistic looking samples, but, instead, on a dynamic ensemble of adversaries. This pro...

Let /C be a class of (universal) algebras of fixed type. /C* denotes the class obtained by augmenting each member of K, by the ternary discriminator function (/(x,y, z) = x if x / ?/, ^(x,x,z) = 2:), while V(/C*) is the closure of /C* under the formation of subalgebras, homomorphic images, and arbitrary Cartesian products. For example, the class of Boolean algebras is definitionally equivalent ...

We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a characterization of structurally complete discriminator varieties. An interesting corollary in logic follows: Let L be a propositional logic/deductive system ...

This paper describes a proposed algorithm for speech/music discrimination, which works on data directly taken from MPEG encoded bitstream thus avoiding the computationally difficult decoding-encoding process. The method is based on thresholding of features derived from the modulation envelope of the frequency-limited audio signal. The discriminator is tested on more than 2 hours of audio data, ...

We establish a connection between skew Boolean algebras and Church algebras. We prove that the set of all semicentral elements in a right Church algebra forms a right-handed skew Boolean algebra for the properly defined operations. The main result of this paper states that the variety of all semicentral right Church algebras of type τ is term equivalent to the variety of right-handed skew Boole...