Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohamed Fakhfakh

dblp:219/8308 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2024
0009-0002-8264-0150ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Deep learning architectures and training · 50% Probabilistic and Bayesian machine learning · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
activation function
0.812024
Bayesian Optimization for Sparse Neural Networks With Trainable Activation Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Probabilistic and Bayesian machine learning › deep probabilistic models › bayesian deep learning
bayesian neural networks
0.812024
Bayesian Optimization for Sparse Neural Networks With Trainable Activation Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
bayesian parameter estimation
0.812024
Bayesian Optimization for Sparse Neural Networks With Trainable Activation Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Deep learning architectures and training › activation function
trainable activation function
0.812024
Bayesian Optimization for Sparse Neural Networks With Trainable Activation Functions · IEEE Trans. Pattern Anal. Mach. Intell. 2024

Methods — techniques the papers use, named apart from their topics

markov chain monte carlo · 0.8bayesian inference · 0.8
YearPublicationVenuePosition
2024 Bayesian Optimization for Sparse Neural Networks With Trainable Activation Functions
abstract
In the literature on deep neural networks, there is considerable interest in developing activation functions that can enhance neural network performance. In recent years, there has been renewed scientific interest in proposing activation functions that can be trained throughout the learning process, as they appear to improve network performance, especially by reducing overfitting. In this paper, we propose a trainable activation function whose parameters need to be estimated. A fully Bayesian model is developed to automatically estimate from the learning data both the model weights and activation function parameters. An MCMC-based optimization scheme is developed to build the inference. The proposed method aims to solve the aforementioned problems and improve convergence time by using an efficient sampling scheme that guarantees convergence to the global maximum. The proposed scheme has been tested across a diverse datasets, encompassing both classification and regression tasks, and implemented in various CNN architectures to demonstrate its versatility and effectiveness. Promising results demonstrate the usefulness of our proposed approach in improving models accuracy due to the proposed activation function and Bayesian estimation of the parameters.
Mohamed Fakhfakh, Lotfi Chaâri
IEEE Trans. Pattern Anal. Mach. Intell.1
2023 A fully automatic Bayesian model for adaptive activation functions in artificial neural networks
abstract
There is a significant focus in deep neural networks on finding activation functions that can enhance network performance. Scientists are also interested in developing flexible activation functions that can adapt during training to avoid overfitting and provide reliable parameter learning.This paper presents a Bayesian algorithm that employs Markov Chain Monte Carlo (MCMC) to estimate activation function parameters and model weights. This algorithm accelerates convergence through effective sampling and evaluates its effectiveness on two datasets, achieving high accuracy with low complexity.
Mohamed Fakhfakh, Lotfi Chaâri
INISTA1
2022 Efficient Bayesian Learning of Sparse Deep Artificial Neural Networks
Mohamed Fakhfakh, Bassem Bouaziz, Lotfi Chaâri, Faïez Gargouri
IDA1