English
Related papers

Related papers: VC-dimensions Between Partially Ordered Sets and T…

200 papers

In this note, we derive an improved upper bound for the VC-dimension of neural networks with polynomial activation functions. This improved bound is based on a result of Rojas on the number of connected components of a semi-algebraic set.

Optimization and Control · Mathematics 2007-05-23 J. Maurice Rojas , M. Vidyasagar

Largest theoretical contribution to Neural Networks comes from VC Dimension which characterizes the sample complexity of classification model in a probabilistic view and are widely used to study the generalization error. So far in the…

Machine Learning · Computer Science 2024-09-05 Linu Pinto , Sasi Gopalan

We prove that the global dimension of the complex algebra of the monoid of all partial functions on an n-set is $n-1$ for all $n\geq 1$. This is also the global dimension of the complex algebra of the category of all epimorphisms between…

Representation Theory · Mathematics 2018-10-23 Itamar Stein

A set S of vertices in a graph G resolves G if every vertex is uniquely determined by its vector of distances to the vertices in S. The metric dimension of G is the minimum cardinality of a resolving set of G. This paper studies the metric…

The main goal of this paper has a double purpose. On the one hand, we propose a new definition in order to compute the fractal dimension of a subset respect to any fractal structure, which completes the theory of classical box-counting…

Chaotic Dynamics · Physics 2010-07-23 M. Fernández-Martínez , M. A Sánchez-Granero

In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (Later, we consider arbitrary binary functional/relational…

Combinatorics · Mathematics 2020-02-24 Laurent Lyaudet

In this paper we study the cardinality of the dot product set generated by two subsets of vector spaces over finite fields. We notice that the results on the dot product problems for one set can be simply extended to two sets. Let E and F…

Combinatorics · Mathematics 2014-01-28 Doowon Koh , Youngjin Pi

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis…

Data Structures and Algorithms · Computer Science 2016-06-22 Karl Bringmann , László Kozma , Shay Moran , N. S. Narayanaswamy

We study dimensions of sumsets and iterated sumsets and provide natural conditions which guarantee that a set $F \subseteq \mathbb{R}$ satisfies $\overline{\dim}_\text{B} F+F > \overline{\dim}_\text{B} F$ or even $\dim_\text{H} n F \to 1$.…

Metric Geometry · Mathematics 2021-03-26 Jonathan M. Fraser , Douglas C. Howroyd , Han Yu

Comparing the functional behavior of neural network models, whether it is a single network over time or two (or more networks) during or post-training, is an essential step in understanding what they are learning (and what they are not),…

Computer Vision and Pattern Recognition · Computer Science 2022-11-10 Xingjian Zhen , Zihang Meng , Rudrasis Chakraborty , Vikas Singh

The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…

Optimization and Control · Mathematics 2020-01-28 Vu Trung Hieu

The fractionalization of global symmetry charges is a striking hallmark of topological quantum order. Here, we discuss the fractionalization of subsystem symmetries in two-dimensional topological phases. In line with previous no-go…

Strongly Correlated Electrons · Physics 2022-08-09 David T. Stephen , Arpit Dua , José Garre-Rubio , Dominic J. Williamson , Michael Hermele

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…

Combinatorics · Mathematics 2012-11-20 Mike Develin , Matthew Macauley , Victor Reiner

We extend some recent results on the Hausdorff convergence of level-sets for total variation regularized linear inverse problems. Dimensions higher than two and measurements in Banach spaces are considered. We investigate the relation…

Optimization and Control · Mathematics 2021-06-09 José A. Iglesias , Gwenael Mercier

For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where…

Combinatorics · Mathematics 2011-03-21 Mohsen Jannesari , Behnaz Omoomi

For $n\geq 3$ and $r\geq n$, we show that there are rank-$r$ vector bundles on $\mathbb{P}^n$ with arbitrary homological dimension. We apply the Bernstein-Gel'fand-Gel'fand correspondence to translate the vector bundle question into a…

Algebraic Geometry · Mathematics 2023-12-22 Kaiying Hou

Estimates of the fractal dimension $D$ of the set of galaxies in the universe, based on ever improving data sets, tend to settle on $D\approx 2$. This result raised a raging debate due to its glaring contradiction with astrophysical models…

Nonlocal and fractional-order models capture effects that classical partial differential equations cannot describe; for this reason, they are suitable for a broad class of engineering and scientific applications that feature multiscale or…

Analysis of PDEs · Mathematics 2021-10-08 Marta D'Elia , Mamikon Gulian , Hayley Olson , George Em Karniadakis

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

Combinatorics · Mathematics 2024-09-24 Gal Gross

A critical set in an $n \times n$ Latin square is a minimal set of entries that uniquely identifies it among all Latin squares of the same size. It is conjectured by Nelder in 1979, and later independently by Mahmoodian, and Bate and van…

Combinatorics · Mathematics 2016-09-16 Hamed Hatami , Yingjie Qian