Reduce the Complexity of the Polyhedron Minimization Using the Max Plus Pruning Method

Author(s):  
Yassamine Seladji
Keyword(s):  
2021 ◽  
pp. 1-21
Author(s):  
Andrei C. Apostol ◽  
Maarten C. Stol ◽  
Patrick Forré

We propose a novel pruning method which uses the oscillations around 0, i.e. sign flips, that a weight has undergone during training in order to determine its saliency. Our method can perform pruning before the network has converged, requires little tuning effort due to having good default values for its hyperparameters, and can directly target the level of sparsity desired by the user. Our experiments, performed on a variety of object classification architectures, show that it is competitive with existing methods and achieves state-of-the-art performance for levels of sparsity of 99.6 % and above for 2 out of 3 of the architectures tested. Moreover, we demonstrate that our method is compatible with quantization, another model compression technique. For reproducibility, we release our code at https://github.com/AndreiXYZ/flipout.


Genetika ◽  
2015 ◽  
Vol 47 (1) ◽  
pp. 289-294
Author(s):  
Ahmad Dadashpour ◽  
Asil Hassanpour ◽  
Reza Hojjat-Ansari ◽  
Behrooz Alinaghipour ◽  
Yousef Hamidoghli

In the first trial, study conducted to compare of yield between two shapes of pruning (curved and flat) of tea bushes (clone 100). After leaf harvesting, curved pruning bushes had more yield than flat pruning bushes. Thus curved pruning method can be advised to gardeners as a reliable and superior pruning method. In the secondary experiment, study was carried out to investigation of cutting?s losses in all head-cuttings and comparison between tow types bush in tea (100 and selective). Results showed that there is significant difference between 100 and selective clones at p?0.05. It means that obtained mean cutting?s losses by selective was less than 100 bushes.


Author(s):  
Achmad Naufal Wijaya Jofanda ◽  
Mohamad Yasin

Checkers is a board game that is played by two people which has a purpose to defeat the opponent by eating all the opponent's pieces or making the opponent unable to make a move. The sophistication of technology at this modern time makes the checkers game can be used on a computer even with a smartphone. The application of artificial intelligence in checkers games makes the game playable anywhere and anytime. Alpha Beta Pruning is an optimization technique from the Minimax Algorithm that can reduce the number of branch/node extensions to get better and faster step search results. In this study, a checkers game based on artificial intelligence will be developed using the alpha-beta pruning method. This research is expected to explain in detail how artificial intelligence works in a game. Alpha-beta pruning was chosen because it can search for the best steps quickly and precisely. This study tested 10 respondents to play this game. The results show that the player's win rate was 60% at the easy level, 40% at the medium level, and 20% at the hard level. Besides that, the level of interest in this game was 80% being entertained and 20% feeling ordinary.


Sign in / Sign up

Export Citation Format

Share Document