Search Results for author: Razvan Andonie

Found 7 papers, 3 papers with code

Information Plane Analysis Visualization in Deep Learning via Transfer Entropy

no code implementations1 Apr 2024 Adrian Moldovan, Angel Cataron, Razvan Andonie

Information Plane analysis is a visualization technique used to understand the trade-off between compression and information preservation in the context of the Information Bottleneck method by plotting the amount of information in the input data against the compressed representation.

Information Plane

Accelerating Convolutional Neural Network Pruning via Spatial Aura Entropy

no code implementations8 Dec 2023 Bogdan Musat, Razvan Andonie

We propose a novel method to improve MI computation for CNN pruning, using the spatial aura entropy.

Computational Efficiency Network Pruning

Pruning Convolutional Filters via Reinforcement Learning with Entropy Minimization

no code implementations8 Dec 2023 Bogdan Musat, Razvan Andonie

Structural pruning has become an integral part of neural network optimization, used to achieve architectural configurations which can be deployed and run more efficiently on embedded devices.

reinforcement-learning

Semiotic Aggregation in Deep Learning

no code implementations22 Apr 2021 Bogdan Musat, Razvan Andonie

To the extent of our knowledge, this is the first application of computational semiotics in the analysis and interpretation of deep neural networks.

Weighted Random Search for Hyperparameter Optimization

1 code implementation3 Apr 2020 Adrian-Catalin Florea, Razvan Andonie

We introduce an improved version of Random Search (RS), used here for hyperparameter optimization of machine learning algorithms.

Hyperparameter Optimization

Weighted Random Search for CNN Hyperparameter Optimization

1 code implementation30 Mar 2020 Razvan Andonie, Adrian-Catalin Florea

Nearly all model algorithms used in machine learning use two different sets of parameters: the training parameters and the meta-parameters (hyperparameters).

Hyperparameter Optimization

Big Holes in Big Data: A Monte Carlo Algorithm for Detecting Large Hyper-rectangles in High Dimensional Data

2 code implementations3 Apr 2017 Joseph Lemley, Filip Jagodzinski, Razvan Andonie

We present the first algorithm for finding holes in high dimensional data that runs in polynomial time with respect to the number of dimensions.

Computational Geometry Data Analysis, Statistics and Probability

Cannot find the paper you are looking for? You can Submit a new open access paper.