skip to main content

Title: Adaptive sparse tiling for sparse matrix multiplication
Award ID(s):
1816793 1645599
Author(s) / Creator(s):
; ; ; ;
Date Published:
Journal Name:
Proceedings of the 24th ACM Symposium on Principles and Practice of Parallel Programming
Page Range / eLocation ID:
300 to 314
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Deep Neural Network (DNN) trained by the gradient descent method is known to be vulnerable to maliciously perturbed adversarial input, aka. adversarial attack. As one of the countermeasures against adversarial attacks, increasing the model capacity for DNN robustness enhancement was discussed and reported as an effective approach by many recent works. In this work, we show that shrinking the model size through proper weight pruning can even be helpful to improve the DNN robustness under adversarial attack. For obtaining a simultaneously robust and compact DNN model, we propose a multi-objective training method called Robust Sparse Regularization (RSR), through the fusion of various regularization techniques, including channel-wise noise injection, lasso weight penalty, and adversarial training. We conduct extensive experiments to show the effectiveness of RSR against popular white-box (i.e., PGD and FGSM) and black-box attacks. Thanks to RSR, 85 % weight connections of ResNet-18 can be pruned while still achieving 0.68 % and 8.72 % improvement in clean- and perturbed-data accuracy respectively on CIFAR-10 dataset, in comparison to its PGD adversarial training baseline. 
    more » « less
  2. Abstract Erdős [7] proved that the Continuum Hypothesis (CH) is equivalent to the existence of an uncountable family $\mathcal {F}$ of (real or complex) analytic functions, such that $\big \{ f(x) \ : \ f \in \mathcal {F} \big \}$ is countable for every x . We strengthen Erdős’ result by proving that CH is equivalent to the existence of what we call sparse analytic systems of functions. We use such systems to construct, assuming CH, an equivalence relation $\sim $ on $\mathbb {R}$ such that any ‘analytic-anonymous’ attempt to predict the map $x \mapsto [x]_\sim $ must fail almost everywhere. This provides a consistently negative answer to a question of Bajpai-Velleman [2]. 
    more » « less
  3. We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These algorithms extend the classical trace test in numerical algebraic geometry. Our results rely on both the analysis of the structure of sparse resultants as well as an extension of Esterov’s results on monodromy groups of sparse systems.

    more » « less