Related papers: On definable J-sets
We define a class of subsets of a topological space that coincides with the class of compact saturated subsets when the space is sober, and with enough good properties when the space is not sober. This class is introduced especially in view…
Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution…
We show that the Jacobians of prestable curves over toroidal varieties always admit N\'eron models. These models are rarely quasi-compact or separated, but we also give a complete classification of quasi-compact separated group-models of…
It is widely believed that engineering a model to be invariant/equivariant improves generalisation. Despite the growing popularity of this approach, a precise characterisation of the generalisation benefit is lacking. By considering the…
Several recent works have empirically observed that Convolutional Neural Nets (CNNs) are (approximately) invertible. To understand this approximate invertibility phenomenon and how to leverage it more effectively, we focus on a theoretical…
This paper establishes alternative characterizations of very expressive classes of existential rule sets with decidable query entailment. We consider the notable class of greedy bounded-treewidth sets (gbts) and a new, generalized variant,…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
We investigate systems of transitive models of ZFC which are elementarily embeddable into each other and the influence of definability properties on such systems.
A $G$-invariant version of definable Tietze extension theorem for definably complete structures is proved when a definably compact definable topological group $G$ acts definably and continuously on the definable set.
Several methods have recently been developed for joint structure learning of multiple (related) graphical models or networks. These methods treat individual networks as exchangeable, such that each pair of networks are equally encouraged to…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
In this paper, we investigate structural properties of finite groups that are detected by certain group invariants arising from Dijkgraaf--Witten theory, a topological quantum field theory, in one space and one time dimension. In this…
We prove the basic properties of determinantal semi-invariants for presentation spaces over any finite dimensional hereditary algebra over any field. These include the virtual generic decomposition theorem, stability theorem and the…
Although deep neural networks are effective on supervised learning tasks, they have been shown to be brittle. They are prone to overfitting on their training distribution and are easily fooled by small adversarial perturbations. In this…
We characterize the identified sets of a wide range of stochastic choice models, including random utility, various models of boundedly-rational behavior, and dynamic discrete choice. In each of these settings, we show two distributions over…
A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…
We examine the selective screenability property in topological groups. In the metrizable case we also give characterizations in terms of the Haver property and finitary Haver property respectively relative to left-invariant metrics. We…
Convolutional networks trained on large supervised dataset produce visual features which form the basis for the state-of-the-art in many computer-vision problems. Further improvements of these visual features will likely require even larger…
We show that $ZF+DC+$"all Turing invariant sets of reals have the perfect set property" implies that all sets of reals have the perfect set property. We also show that this result generalizes to all countable analytic equivalence relations.
Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…