activity
20142023
most citedWhen and How to Fool Explainable Models (and Humans) with Adversarial Examples

28 citations · 91 across the 19 of their papers we have counts for

collaborators
Showing cs.NEShow all

5 papers · 1 filter

cs.NE2023

Neuroevolutionary algorithms driven by neuron coverage metrics for semi-supervised classification

Roberto Santana, Ivan Hidalgo-Cenalmor, Unai Garciarena +2

In some machine learning applications the availability of labeled instances for supervised classification is limited while unlabeled instances are abundant. Semi-supervised learnin…

cs.NE2021

Redefining Neural Architecture Search of Heterogeneous Multi-Network Models by Characterizing Variation Operators and Model Components

Unai Garciarena, Roberto Santana, Alexander Mendiburu

With neural architecture search methods gaining ground on manually designed deep neural networks -even more rapidly as model sophistication escalates-, the research trend shifts to…

cs.NE2017★ 9 cited

Gray-box optimization and factorized distribution algorithms: where two worlds collide

Roberto Santana

The concept of gray-box optimization, in juxtaposition to black-box optimization, revolves about the idea of exploiting the problem structure to implement more efficient evolutiona…

cs.NE2015★ 1 cited

Computing factorized approximations of Pareto-fronts using mNM-landscapes and Boltzmann distributions

Roberto Santana, Alexander Mendiburu, Jose A. Lozano

NM-landscapes have been recently introduced as a class of tunable rugged models. They are a subset of the general interaction models where all the interactions are of order less or…

cs.NE2015★ 9 cited

MOEA/D-GM: Using probabilistic graphical models in MOEA/D for solving combinatorial optimization problems

Murilo Zangari de Souza, Roberto Santana, Aurora Trinidad Ramirez Pozo +1

Evolutionary algorithms based on modeling the statistical dependencies (interactions) between the variables have been proposed to solve a wide range of complex problems. These algo…