SearcharxivSearch

arXiv subjects

Ivan Martino

Publications and source records attributed to Ivan Martino.

At least 19 recordsLinked to original sources

Fragility, Robustness and Antifragility in Deep Learning

We propose a systematic analysis of deep neural networks (DNNs) based on a signal processing technique for network parameter removal, in the form of synaptic filters that identifies the fragility, robustness and antifragility characteristics of DNN parameters. Our proposed analysis investigates if the DNN performance is impacted negatively, invariantly, or positively on both clean and adversarially perturbed test datasets when the DNN undergoes synaptic filtering. We define three \textit{filtering scores} for quantifying the fragility, robustness and antifragility characteristics of DNN parameters based on the performances for (i) clean dataset, (ii) adversarial dataset, and (iii) the difference in performances of clean and adversarial datasets. We validate the proposed systematic analysis on ResNet-18, ResNet-50, SqueezeNet-v1.1 and ShuffleNet V2 x1.0 network architectures for MNIST, CIFAR10 and Tiny ImageNet datasets. The filtering scores, for a given network architecture, identify network parameters that are invariant in characteristics across different datasets over learning epochs. Vice-versa, for a given dataset, the filtering scores identify the parameters that are invariant in characteristics across different network architectures. We show that our synaptic filtering method improves the test accuracy of ResNet and ShuffleNet models on adversarial datasets when only the robust and antifragile parameters are selectively retrained at any given epoch, thus demonstrating applications of the proposed strategy in improving model robustness.

cs.LG

Adversarial Robustness in Deep Learning: Attacks on Fragile Neurons

We identify fragile and robust neurons of deep learning architectures using nodal dropouts of the first convolutional layer. Using an adversarial targeting algorithm, we correlate these neurons with the distribution of adversarial attacks on the network. Adversarial robustness of neural networks has gained significant attention in recent times and highlights intrinsic weaknesses of deep learning networks against carefully constructed distortion applied to input images. In this paper, we evaluate the robustness of state-of-the-art image classification models trained on the MNIST and CIFAR10 datasets against the fast gradient sign method attack, a simple yet effective method of deceiving neural networks. Our method identifies the specific neurons of a network that are most affected by the adversarial attack being applied. We, therefore, propose to make fragile neurons more robust against these attacks by compressing features within robust neurons and amplifying the fragile neurons proportionally.

cs.LG

Cooperative games on simplicial complexes

In this work, we define cooperative games on simplicial complexes, generalizing the study of probabilistic values of Weber and quasi-probabilistic values of Bilbao, Driessen, Jiménez Losada and Lebrón. Applications to Multi-Touch Attribution and the interpretability of the Machine-Learning prediction models motivate these new developments. We deal with the axiomatization provided by the $λ_i$-dummy and the monotonicity requirements together with a probabilistic form of the symmetric and the efficiency axioms. We also characterize combinatorially the set of probabilistic participation influences as the facet polytope of the simplicial complex.

math.CO

Efficiency Axioms for simplicial complexes

We study the notion of efficiency for cooperative games on simplicial complexes. In such games, the grand coalition $[n]$ may be forbidden, and, thus, it is a non-trivial problem to study the total number of payoff $v_Δ$ of a cooperative game $(Δ, v)$. We address this question in the more general setting, by characterizing the individual values that satisfy the general efficient requirement $v_Δ^{gen}$ for a generic efficiency assignment. The traditional and the probabilistic efficiency are treated as a special case of this general efficiency. Finally, we introduce a new notion of efficiency arising from the combinatorial and topological property of the simplicial complex $Δ$. The efficiency in this scenario is called simplicial and we characterize the individual values fulfilling this constraint.

math.CO

Probabilistic values for simplicial complexes

In this manuscript, we define and study probabilistic values for cooperative games on simplicial complexes. Inspired by the work of Weber "Probabilistic values for games", we establish the new theory step by step, following the classical axiomatization, i.e. using the linearity axiom, the dummy axiom, etc. Furthermore, we define Shapley values on simplicial complexes generalizing the classical notion in literature. Remarkably, the traditional axiomatization of Shapley values can be extended to this general setting for a rather interesting class of complexes that generalize the notion of vertex-transitive graphs and vertex-homogeneous simplicial complexes. These combinatorial objects are very popular in the literature because of the study of Evasiveness Conjecture in Complexity Theory.

math.CO

Motivic classes of classifying stacks of some semi-direct products

Let k be a field, let G be a finite group and let T be a split k-torus on which G acts multiplicatively, and for every m greater than 1 denote by T[m] the m-torsion subgroup of T. Under a suitable assumption on m, we show that the motivic class of the classifying stack of the semi-direct product of T[m] and G in K_0(Stacks_k) is trivial. As a consequence, we prove that the motivic class of BW is trivial for a large class of complex reflection groups W.

math.AG

Set of independencies and Tutte polynomial of matroids over a domain

In this work, we study matroids over a domain and several classical combinatorial and algebraic invariants related. We define their Grothendieck-Tutte polynomial $T_{\mathcal{M}}(x,y)$, extending the definition given by Fink and Moci in 2016, and we show that such polynomial has the classical deletion-contraction property. Moreover, we study the set of independencies for a realizable matroid over a domain, generalizing the definition of \emph{poset of torsions} $Gr(\mathcal{M})$ given by the second author in 2017. This is a union of identical simplicial posets as for (quasi-)arithmetic matroids. The new notions harmonize naturally through the face module $N_\mathcal{M}$ of the matroid over a domain. Whenever $Gr(\mathcal{M})$ is a finite poset, the Hilbert series $N_\mathcal{M}(t)$ of its face module is a specialization of the Tutte polynomial $T_{\mathcal{M}}(x,y)$. Further, for arrangements of codimension-one abelian subvarities of an elliptic curve admitting complex multiplication, we extend certain results of Bibby and we provide an algebraic interpretation of the elliptic Tutte polynomial.

math.CO

On the codimension of Noether-Lefshetz loci for toric threefolds

In this manuscript we sharpen the lower bound on the codimension of the irreducible components of the Noether-Lefschetz locus of surfaces in projective toric threefolds given in [BG17]. We also provide a simpler proof of Theorem 4.11 in [BG17], which allows one to avoid some technical assumptions.

math.AG

Finite Groups Generated in Low Real Codimension

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$. We generalize the notion of finite reflection groups. We say that a group $G$ is generated (resp. strictly generated) in codimension $k$ if it is generated by its elements that fix point-wise a subspace of codimension at most $k$ (resp. precisely $k$). If $G$ is generated in codimension two, we show that the intersection lattice of $\mathcal{A}^G$ is atomic. We prove that the alternating subgroup $\mathsf{Alt}(W)$ of a reflection group $W$ is strictly generated in codimension two, moreover, the subspace arrangement of $\mathsf{Alt}(W)$ is the truncation at rank two of the reflection arrangement $\mathcal{A}^W$. Further, we compute the intersection lattice of all finite subgroups of $GL_3(\mathbb{R})$, and moreover, we emphasize the groups that are "minimally generated in real codimension two", i.e, groups that are strictly generated in codimension two but have no real reflection representations. We also provide several examples of groups generated in higher codimension.

math.CO

Cohen-Macaulay Property of pinched Veronese Rings

In this work, we study the Betti numbers of pinched Veronese rings, by means of the reduced homology of squarefree divisor complexes. We characterize when these rings are Cohen-Macaulay and we the study the shape of the Betti tables for the pinched Veronese in the two variables. As a byproduct we obtain information on the linearity of such rings. Moreover, in the last section we compute the canonical modules of the Veronese modules.

math.AC

Face module for realizable Z-matroids

In this work, we define the face module for a realizable matroid over Z. Its Hilbert series is, indeed, the expected specialization of the Grothendieck - Tutte polynomial defined by Fink and Moci. This work will appear in 'Contributions to Discrete Mathematics'

math.CO

Systematic Discovery of Runge-Kutta Methods through Algebraic Varieties

This work presents a new evolutionary optimization algorithm in theoretical mathematics with important applications in scientific computing. The use of the evolutionary algorithm is justified by the difficulty of the study of the parametrization of an algebraic variety, an important problem in algebraic geometry. We illustrate an application, Evo-Runge-Kutta, in a problem of numerical analysis. Results show the design and the optimization of particular algebraic variety, the explicit s levels Runge-Kutta methods of order q. The mapping between algebraic geometry and evolutionary optimization is direct, and we expect that many open problems will be modelled in the same way.

math.AG

The Ekedahl Invariants for finite groups

In 2009 Ekedahl introduced certain cohomological invariants of finite groups which are naturally related to the Noether Problem. We show that these invariants are trivial for every finite group in GL_3(k) and for the fifth discrete Heisenberg group H_5. Moreover in the case of finite linear groups with abelian projective reduction, these invariants satisfy a recurrence relation in a certain Grothendieck group for abelian groups.

math.AG

Introduction to the Ekedahl Invariants

In 2009 T. Ekedahl introduced certain cohomological invariants for finite groups. In this work we introduce these invariants and we show some of their properties. We also give an equivalent definition for such invariants.

math.AG

Syzygies of the Veronese modules

We study the minimal free resolution of the Veronese modules of the polynomial ring in n variables, by giving a formula for the Betti numbers in terms of the reduced homology of some skeleton of a simplicial complex. We characterize when they are Cohen-Macaulay and we give a sufficient condition for the linearity of their minimal free resolution. We also conjecture that in 2 variables the Veronese modules have always pure resolutions. In addition, we give a closed formula for their Hilbert series. As an application of our results, we calculate the complete Betti diagrams of the Veronese subrings in three variables with degree 4 and 5, and in four variables with degree 3.

math.AC

On the variety of linear recurrences and numerical semigroups

In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords: numerical semigroups, linear recurrences, generating function.

math.AC

Regular sequences of power sums and complete symmetric polynomials

In this article, we carry out the investigation for regular sequences of symmetric polynomials in the polynomial ring in three and four variable. Any two power sum element in $\mathbb{C}[x_1,x_2,...,x_n]$ for $n \geq 3$ always form a regular sequence and we state the conjecture when $p_a,p_b,p_c$ for given positive integers $a<b<c$ forms a regular sequence in $\mathbb{C}[x_1,x_2,x_3,x_4]$. We also provide evidence for this conjecture by proving it in special instances. We also prove that any sequence of power sums of the form $p_{a}, p_{a+1},..., p_{a+ m-1},p_b$ with $m <n-1$ forms a regular sequence in $\mathbb{C}[x_1,x_2,...,x_n]$. We also provide partial evidence in support of conjecture's given by Conca, Krattenthaler and Watanabe on regular sequences of symmetric polynomials.

math.AC

Vertex Collapsing and Cut Ideals

In this work we study how some elementary graph operations (like the disjoint union) and the collapse of two vertices modify the cut ideal of a graph. They pave the way for reducing the cut ideal of every graph to the cut ideal of smaller ones. To deal with the collapse operation we generalize the definition of cut ideal given in literature, introducing the concepts of edge labeling and edge multiplicity: in fact we state the \emph{non-classical behavior} of the cut ideal. Moreover we show the transformation of the toric map hidden behind these operations.

math.CO