Related papers: On Weak Elimination of Hyperimaginaries and its Co…
Randomization inference (RI) is typically interpreted as testing Fisher's "sharp" null hypothesis that all unit-level effects are exactly zero. This hypothesis is often criticized as restrictive and implausible, making its rejection…
WIMPs, weakly-interacting massive particles, have been leading candidates for particle dark matter for decades, and they remain a viable and highly motivated possibility. In these lectures, I describe the basic motivations for WIMPs,…
The notion of robustness in XAI refers to the observed variations in the explanation of the prediction of a learned model with respect to changes in the input leading to that prediction. Intuitively, if the input being explained is modified…
L. Soukup formulated an abstract framework in his introductory paper for proving theorems about uncountable graphs by subdividing them by an increasing continuous chain of elementary submodels. The applicability of this method relies on the…
Methods for understanding the decisions of and mechanisms underlying deep neural networks (DNNs) typically rely on building intuition by emphasizing sensory or semantic features of individual examples. For instance, methods aim to visualize…
One of the fundamental cognitive abilities of humans is to quickly resolve uncertainty by generating hypotheses and testing them via active trials. Encountering a novel phenomenon accompanied by ambiguous cause-effect relationships, humans…
As machine learning and algorithmic decision making systems are increasingly being leveraged in high-stakes human-in-the-loop settings, there is a pressing need to understand the rationale of their predictions. Researchers have responded to…
A companion paper develops a framework in which probability measures are represented by distribution-kernel pairs (T,phi) with T a tempered distribution and phi a Schwartz kernel, so that weak moments of all orders exist unconditionally.…
In this extended abstract, we discuss the opportunity to formally verify that inference systems for probabilistic programming guarantee good performance. In particular, we focus on hybrid inference systems that combine exact and approximate…
Modeling of the dependence structure across heterogeneous data is crucial for Bayesian inference since it directly impacts the borrowing of information. Despite the extensive advances over the last two decades, most available proposals…
We prove some injectivity, torsion-free, and vanishing theorems for simple normal crossing pairs. Our results heavily depend on the theory of mixed Hodge structures on compact support cohomology groups. We also treat several basic…
In this work we present an analytical proof of cosmic censorship in a Kerr-like phantom wormhole (WH) which contains a singularity that is not protected by an event horizon. We show that the naked singularity of this space-time is causally…
An Independent Parallelism Theorem is proven in the theory of adhesive HLR categories. It shows the bijective correspondence between sequential independent and parallel independent direct derivations in the Weak Double-Pushout framework,…
Serializability is a well-understood correctness criterion that simplifies reasoning about the behavior of concurrent transactions by ensuring they are isolated from each other while they execute. However, enforcing serializable isolation…
We examine the minimal constraints imposed by the Weak Gravity Conjecture (WGC) on the particle spectrum of a quantum gravity theory. Towers of super-extremal states have previously been argued to be required for consistency of the WGC…
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…
It is shown that a Wishart matrix of standard complex normal random variables is asymptotically freely independent of an independent random matrix, under minimal conditions, in two different sense of asymptotic free independence.
The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and…
We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…
In this work, we consider the fundamental problem of reachability analysis over imperative programs with real variables. The reachability property requires that a program can reach certain target states during its execution. Previous works…