Data-free parameter pruning for Deep Neural Networks

Deep Neural nets (NNs) with millions of parameters are at the heart of many state-of-the-art computer vision systems today. However, recent works have shown that much smaller models can achieve similar levels of performance. In this work, we address the problem of pruning parameters in a trained NN model. Instead of removing individual weights one at a time as done in previous works, we remove one neuron at a time. We show how similar neurons are redundant, and propose a systematic way to remove them. Our experiments in pruning the densely connected layers show that we can remove upto 85\% of the total parameters in an MNIST-trained network, and about 35\% for AlexNet without significantly affecting performance. Our method can be applied on top of most networks with a fully connected layer to give a smaller network.Comment: BMVC 201

Theory and Techniques for Synthesizing a Family of Graph Algorithms

Although Breadth-First Search (BFS) has several advantages over Depth-First Search (DFS) its prohibitive space requirements have meant that algorithm designers often pass it over in favor of DFS. To address this shortcoming, we introduce a theory of Efficient BFS (EBFS) along with a simple recursive program schema for carrying out the search. The theory is based on dominance relations, a long standing technique from the field of search algorithms. We show how the theory can be used to systematically derive solutions to two graph algorithms, namely the Single Source Shortest Path problem and the Minimum Spanning Tree problem. The solutions are found by making small systematic changes to the derivation, revealing the connections between the two problems which are often obscured in textbook presentations of them.Comment: In Proceedings SYNT 2012, arXiv:1207.055

(Anti-)chiral Superfield Approach to Nilpotent Symmetries: Self-Dual Chiral Bosonic Theory

We exploit the beauty and strength of the symmetry invariant restrictions on the (anti-)chiral superfields to derive the Becchi-Rouet-Stora-Tyutin (BRST), anti-BRST and (anti-)co-BRST symmetry transformations in the case of a two (1+1)-dimensional (2D) self-dual chiral bosonic field theory within the framework of augmented (anti-)chiral superfield formalism. Our 2D ordinary theory is generalized onto a (2, 2)-dimensional supermanifold which is parameterized by the superspace variable Z^M = (x^\mu, \theta, \bar\theta) where x^\mu (with \mu = 0, 1) are the ordinary 2D bosonic coordinates and (\theta,\, \bar\theta) are a pair of Grassmannian variables with their standard relationships: \theta^2 = {\bar\theta}^2 =0, \theta\,\bar\theta + \bar\theta\theta = 0. We impose the (anti-)BRST and (anti-)co-BRST invariant restrictions on the (anti-)chiral superfields (defined on the (anti-)chiral (2, 1)-dimensional super-submanifolds of the above general (2, 2)-dimensional supermanifold) to derive the above nilpotent symmetries. We do not exploit the mathematical strength of the (dual-)horizontality conditions anywhere in our present investigation. We also discuss the properties of nilpotency, absolute anticommutativity and (anti-)BRST and (anti-)co-BRST symmetry invariance of the Lagrangian density within the framework of our augmented (anti-)chiral superfield formalism. Our observation of the absolute anticommutativity property is a completely novel result in view of the fact that we have considered only the (anti-)chiral superfields in our present endeavor.Comment: LaTeX file, 20 pages, journal reference is give

Counterfactual quantum certificate authorization

We present a multi-partite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.Comment: 6 pages, 2 figures, close to the published versio