Publication
Implementation d'un algorithme de reduction de taille des reseaux de neurones
Abstract
This document describes the implementation of a neuron pruning method with pyTorch, and analyzes the results obtained by applying this method on convolutional and residual networks. The performance of the algorithm is measured in different test cases and with varying parameters.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related concepts (26)
Euler method
In mathematics and computational science, the Euler method (also called the forward Euler method) is a first-order numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. It is the most basic explicit method for numerical integration of ordinary differential equations and is the simplest Runge–Kutta method. The Euler method is named after Leonhard Euler, who first proposed it in his book Institutionum calculi integralis (published 1768–1870).
Iterative method
In computational mathematics, an iterative method is a mathematical procedure that uses an initial value to generate a sequence of improving approximate solutions for a class of problems, in which the n-th approximation is derived from the previous ones. A specific implementation with termination criteria for a given iterative method like gradient descent, hill climbing, Newton's method, or quasi-Newton methods like BFGS, is an algorithm of the iterative method.
Heun's method
In mathematics and computational science, Heun's method may refer to the improved or modified Euler's method (that is, the explicit trapezoidal rule), or a similar two-stage Runge–Kutta method. It is named after Karl Heun and is a numerical procedure for solving ordinary differential equations (ODEs) with a given initial value. Both variants can be seen as extensions of the Euler method into two-stage second-order Runge–Kutta methods.
Related publications (128)
SIMPLE HIERARCHICAL PLANNING WITH DIFFUSION
Diffusion-based generative methods have proven effective in modeling trajectories with offline datasets. However, they often face computational challenges and can falter in generalization, especially in capturing temporal abstractions for long- horizon tas ...
2024Micropreparative Gel Electrophoresis for Purification of Nanoscale Bioconjugates
Ardemis Anoush Boghossian, Sayyed Hashem Sajjadi, Yahya Rabbani, Shang-Jung Wu, Vitalijs Zubkovs
Conventional techniques for purifying macromolecular conjugates often require complex and costly installments that are inaccessible to most laboratories. In this work, we develop a one-step micropreparative method based on a trilayered polyacrylamide gel e ...
2024Electroadhesive gripping system and method for gripping an object
Herbert Shea, Vito Cacucciolo, Krishna Manaswi Digumarti
An electroadhesive gripping system and a method for gripping and manipulating an object are disclosed. The invention provides a novel approach particularly useful to pick fabrics or otherwise flat and flexible objects including a method relying on electroa ...
2023Related MOOCs (16)
Algebra (part 1)
Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.
Algebra (part 1)
Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.
Algebra (part 2)
Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.