Related papers: A separation theorem for simple theories
We generalize the Unstable Formula Theorem characterization of stable theories from \citep{sh78}: that a theory $T$ is stable just in case any infinite indiscernible sequence in a model of $T$ is an indiscernible set. We use a generalized…
We study the problem of linear feature selection when features are highly correlated. Such settings pose two fundamental challenges. First, how should model similarity be defined? Simply counting features in common can be misleading: two…
String theory and supersymmetry are theoretical ideas that go beyond the standard model of particle physics and show promise for unifying all forces. After a brief introduction to supersymmetry, we discuss the prospects for its experimental…
Analyzing the covariance structure of data is a fundamental task of statistics. While this task is simple for low-dimensional observations, it becomes challenging for more intricate objects, such as multivariate functions. Here, the…
A consistent theory of supersymmetry breaking must have a hidden sector, an observable sector, and must be embedded in a locally supersymmetric theory which arises from string theory. For phenomenological reasons it must also transmit…
In this work, we present the equivalent of many theorems available for continuous time systems. In particular, the theory is applied to Averaging Theory and Separation of time scales. In particular the proofs developed for Averaging Theory…
Shearing with a finite shear rate a compressed granular system results in a region of grains flowing over a compact, static assembly. Perforce this region is dilated to a degree that depends on the shear rate, the loading pressure, gravity,…
Subspace clustering assumes that the data is sepa-rable into separate subspaces. Such a simple as-sumption, does not always hold. We assume that, even if the raw data is not separable into subspac-es, one can learn a representation…
Density modelling is the task of learning an unknown probability density function from samples, and is one of the central problems of unsupervised machine learning. In this work, we show that there exists a density modelling problem for…
We study Tao's finitary viewpoint of convergence in metric spaces, as captured by the notion of metastability. We adopt the perspective of continuous model theory. We show that, in essence, metastable convergence with a given rate is the…
Based on the work done in \cite{BV-Tind,DMS} in the o-minimal and geometric settings, we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forking-independent elements that is dense inside a…
We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…
This paper proves a new central limit theorem for a sample that exhibits two-way dependence and heterogeneity across clusters. Statistical inference for situations with both two-way dependence and cluster heterogeneity has thus far been an…
Real-world problems, for example in climate applications, often require causal reasoning on spatially gridded time series data or data with comparable structure. While the underlying system is often believed to behave similarly at different…
For fragments L of first-order logic (FO) with counting quantifiers, we consider the definability problem, which asks whether a given L-formula can be equivalently expressed by a formula in some fragment of L without counting, and the more…
We revisit the classical concept of near-decomposability in complex systems, introduced by Herbert Simon in his foundational article The Architecture of Complexity, by developing an explicit quantitative analysis based on singular…
In this paper we give characterizations of the super-stable theories, in terms of an external property called representation. In the sense of the representation property, the mentioned class of first-order theories can be regarded as "not…
We present an elementary and explicit proof of the separability criterion for continuous variable two-party Gaussian systems. Our proof is based on an elementary formulation of uncertainty relations and an explicit determination of…
A general theory of resource-bounded measurability and measure is developed. Starting from any feasible probability measure $\nu$ on the Cantor space $\C$ and any suitable complexity class $C \subseteq \C$, the theory identifies the subsets…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…