Search Results for author:
Found 11 papers, 4 papers with code
On the Robustness of Neural Collapse and the Neural Collapse of Robustness
Neural Collapse refers to the curious phenomenon in the end of training of a neural network, where feature vectors and classification weights converge to a very simple geometrical arrangement (a simplex).
Kernels, Data & Physics
Lecture notes from the course given by Professor Julia Kempe at the summer school "Statistical physics of Machine Learning" in Les Houches.
Wavelets Beat Monkeys at Adversarial Robustness
2) Replacing the front-end VOneBlock by an off-the-shelf parameter-free Scatternet followed by simple uniform Gaussian noise can achieve much more substantial adversarial robustness without adversarial training.
What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness?
The adversarial vulnerability of neural nets, and subsequent techniques to create robust models have attracted significant attention; yet we still lack a full understanding of this phenomenon.
ImpressLearn: Continual Learning via Combined Task Impressions
Starting from existing work on network masking (Wortsman et al., 2020), we show that simply learning a linear combination of a small number of task-specific supermasks (impressions) on a randomly initialized backbone network is sufficient to both retain accuracy on previously learned tasks, as well as achieve high accuracy on unseen tasks.
Can we achieve robustness from data alone?
In parallel, we revisit prior work that also focused on the problem of data optimization for robust classification \citep{Ily+19}, and show that being robust to adversarial attacks after standard (gradient descent) training on a suitable dataset is more challenging than previously thought.
The NTK Adversary: An Approach to Adversarial Attacks without any Model Access
In particular, in the regime where the Neural Tangent Kernel theory holds, we derive a simple, but powerful strategy for attacking models, which in contrast to prior work, does not require any access to the model under attack, or any trained replica of it for that matter.
Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity
Neural network pruning is a fruitful area of research with surging interest in high sparsity regimes.
Quantum random walks - an introductory overview
This article aims to provide an introductory survey on quantum random walks.
Quantum Physics Data Structures and Algorithms
Quantum Walks On Graphs
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world.
Quantum Physics
Universal simulation of Markovian quantum dynamics
Although the conditions for performing arbitrary unitary operations to simulate the dynamics of a closed quantum system are well understood, the same is not true of the more general class of quantum operations (also known as superoperators) corresponding to the dynamics of open quantum systems.
Quantum Physics
