Related papers: Nondeterministic unitary OBDDs
We introduce a new structural graph parameter called \emph{partial matching width}. For each (sufficiently large) integer $k \geq 1$, we introduce a class $\mathcal{G}_k$ of graphs of treewidth at most $k$ and max-degree $7$ such that for…
The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…
Algorithm unfolding or unrolling is the technique of constructing a deep neural network (DNN) from an iterative algorithm. Unrolled DNNs often provide better interpretability and superior empirical performance over standard DNNs in signal…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…
This paper studies a difference between Binary Decision Diagrams (BDDs) and Zero-suppressed BDDs (ZDDs) from a conceptual point of view. It is commonly understood that a BDD is a representation of a Boolean function, whereas a ZDD is a…
We present a framework to calculate large deviations for nonlinear functions of independent random variables supported on compact sets in Banach spaces, by extending the result in Chatterjee and Dembo [6]. Previous research on nonlinear…
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…
Neural ordinary differential equations (NODE) have garnered significant attention for their design of continuous-depth neural networks and the ability to learn data/feature dynamics. However, for high-dimensional systems, estimating…
We show that Neural Ordinary Differential Equations (ODEs) learn representations that preserve the topology of the input space and prove that this implies the existence of functions Neural ODEs cannot represent. To address these…
Despite achieving enormous success in predictive accuracy for visual classification problems, deep neural networks (DNNs) suffer from providing overconfident probabilities on out-of-distribution (OOD) data. Yet, accurate uncertainty…
Doppler-resilient complementary sequence sets (DRCSs) are crucial in modern communication and sensing systems in mobile environments. In this paper, we propose a new lower bound for the aperiodic ambiguity function (AF) of unimodular DRCSs…
Nonuniform tubular neighborhoods of curves in Euclidean n-space are studied by using weighted distance functions and generalizing the normal exponential map. Different notions of injectivity radii are introduced to investigate singular but…
We obtain characterizations of nonuniform dichotomies, defined by general growth rates, based on admissibility conditions. Additionally, we use the obtained characterizations to derive robustness results for the considered dichotomies. As…
In machine learning and big data, the optimization objectives based on set-cover, entropy, diversity, influence, feature selection, etc. are commonly modeled as submodular functions. Submodular (function) maximization is generally NP-hard,…
We give a unateness tester for functions of the form $f:[n]^d\rightarrow R$, where $n,d\in \mathbb{N}$ and $R\subseteq \mathbb{R}$ with query complexity $O(\frac{d\log (\max(d,n))}{\epsilon})$. Previously known unateness testers work only…
We consider neural networks with a single hidden layer and non-decreasing homogeneous activa-tion functions like the rectified linear units. By letting the number of hidden units grow unbounded and using classical non-Euclidean…
In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the…
We present a construction of harmonic functions on bounded domains for the spectral fractional Laplacian operator and we classify them in terms of their divergent profile at the boundary. This is used to establish and solve boundary value…
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…