1 code implementation • 11 Jul 2023 • Hugo Cisneros
This thesis makes the following key contributions: the development of a general complexity metric that we apply to search for complex systems that exhibit growth of complexity, the introduction of a coarse-graining method to study computations in large-scale complex systems, and the development of a metric for learning efficiency as well as a benchmark dataset for evaluating the speed of learning algorithms.
1 code implementation • 8 Nov 2022 • David Herel, Hugo Cisneros, Tomas Mikolov
Our method outperforms existing sentence encoders used in adversarial attacks by achieving 1. 2x - 5. 1x better real attack success rate.
2 code implementations • 29 Sep 2022 • Hugo Cisneros, Josef Sivic, Tomas Mikolov
In this paper, we introduce a benchmark of increasingly difficult tasks together with a data efficiency metric to measure how quickly machine learning models learn from training data.
no code implementations • 1 Apr 2021 • Hugo Cisneros, Josef Sivic, Tomas Mikolov
Emergent processes in complex systems such as cellular automata can perform computations of increasing complexity, and could possibly lead to artificial evolution.
1 code implementation • 4 Nov 2019 • Hugo Cisneros, Josef Sivic, Tomas Mikolov
In this paper we propose an approach for measuring growth of complexity of emerging patterns in complex systems such as cellular automata.
no code implementations • 19 Mar 2019 • Xavier Tannier, Nicolas Paris, Hugo Cisneros, Christel Daniel, Matthieu Doutreligne, Catherine Duclos, Nicolas Griffon, Claire Hassen-Khodja, Ivan Lerner, Adrien Parrot, Éric Sadou, Cyrina Saussol, Pascal Vaillant
Materials and Methods: The first method is a weakly supervised method using an unlabeled corpus (MIMIC) to build a silver standard, by producing semi-automatically a small and very precise set of rules to detect some samples of positive and negative patients.