Isabelle Guyon

Isabelle Guyon

Auto-generated profile, based on publicly available information

Isabelle Guyon

Université Paris Saclay

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 June 2022 in Patterns
Verified
Journal Article
Open access
ZXZhen Xu
Zhen Xu
Sergio EscaleraSergio Escalera
Sergio Escalera
APAdrien Pavão
Adrien Pavão
MRMagali Richard
Magali Richard
WTWei-Wei Tu
Wei-Wei Tu
IGIsabelle Guyon
Isabelle Guyon
Obtaining a standardized benchmark of computational methods is a major issue in data-science communities. Dedicated frameworks enabling fair benchmarking in a unified environment are yet to be developed. Here, we introduce Codabench, a meta-benchmark platform that is open sourced and community driven for benchmarking algorithms or software agents versus datasets or tasks. A public instance of Codabench is open to everyone free of charge and allows benchmark organizers to fairly compare submissions under the same setting (software, hardware, data, algorithms), with custom protocols and data formats. Codabench has unique features facilitating easy organization of flexible and reproducible benchmarks, such as the possibility of reusing templates of benchmarks and supplying compute resources on demand. Codabench has been used internally and externally on various applications, receiving more than 130 users and 2,500 submissions. As illustrative use cases, we introduce four diverse benchmarks covering graph machine learning, cancer heterogeneity, clinical diagnosis, and reinforcement learning.

4 September 2021 in Entropy
Verified
Journal Article
Open access
PDF file
KBKaran Bhanot
Karan Bhanot
Miao QiMiao Qi
Miao Qi
JEJohn Erickson
John Erickson
IGIsabelle Guyon
Isabelle Guyon
KBKristin Bennett
Kristin Bennett
Access to healthcare data such as electronic health records (EHR) is often restricted by laws established to protect patient privacy. These restrictions hinder the reproducibility of existing results based on private healthcare data and also limit new research. Synthetically-generated healthcare data solve this problem by preserving privacy and enabling researchers and policymakers to drive decisions and methods based on realistic data. Healthcare data can include information about multiple in- and out- patient visits of patients, making it a time-series dataset which is often influenced by protected attributes like age, gender, race etc. The COVID-19 pandemic has exacerbated health inequities, with certain subgroups experiencing poorer outcomes and less access to healthcare. To combat these inequities, synthetic data must “fairly” represent diverse minority subgroups such that the conclusions drawn on synthetic data are correct and the results can be generalized to real data. In this article, we develop two fairness metrics for synthetic data, and analyze all subgroups defined by protected attributes to analyze the bias in three published synthetic research datasets. These covariate-level disparity metrics revealed that synthetic data may not be representative at the univariate and multivariate subgroup-levels and thus, fairness should be addressed when developing data generation methods. We discuss the need for measuring fairness in synthetic healthcare data to enable the development of robust machine learning models to create more equitable synthetic healthcare datasets.

18 May 2019
Verified
Book Chapter
Open access
PDF file
IGIsabelle Guyon
Isabelle Guyon
LSLisheng Sun-Hosoya
Lisheng Sun-Hosoya
MBMarc Boullé
Marc Boullé
HEHugo Jair Escalante
Hugo Jair Escalante
Sergio EscaleraSergio Escalera
Sergio Escalera
EVEvelyne Viegas
Evelyne Viegas
The ChaLearn AutoML Challenge (The authors are in alphabetical order of last name, except the first author who did most of the writing and the second author who produced most of the numerical analyses and plots.) (NIPS 2015 – ICML 2016) consisted of six rounds of a machine learning competition of progressive difficulty, subject to limited computational resources. It was followed bya one-round AutoML challenge (PAKDD 2018). The AutoML setting differs from former model selection/hyper-parameter selection challenges, such as the one we previously organized for NIPS 2006: the participants aim to develop fully automated and computationally efficient systems, capable of being trained and tested without human intervention, with code submission. This chapter analyzes the results of these competitions and provides details about the datasets, which were not revealed to the participants. The solutions of the winners are systematically benchmarked over all datasets of all rounds and compared with canonical machine learning algorithms available in scikit-learn. All materials discussed in this chapter (data and code) have been made publicly available at http://automl.chalearn.org/ .

21 February 2014 in Machine Vision and Applications
Verified
Journal Article
Closed access
PDF file
IGIsabelle Guyon
Isabelle Guyon
VAVassilis Athitsos
Vassilis Athitsos
PJPat Jangyodsuk
Pat Jangyodsuk
HEHugo Jair Escalante
Hugo Jair Escalante

13 February 2023 in Computing and Software for Big Science
Verified
Journal Article
Open access
PDF file
SASabrina Amrouche
Sabrina Amrouche
LBLaurent Basara
Laurent Basara
PCPaolo Calafiura
Paolo Calafiura
DEDmitry Emeliyanov
Dmitry Emeliyanov
VEVictor Estrade
Victor Estrade
JVJean-Roch Vlimant
Jean-Roch Vlimant
This paper reports on the second “Throughput” phase of the Tracking Machine Learning (TrackML) challenge on the Codalab platform. As in the first “Accuracy” phase, the participants had to solve a difficult experimental problem linked to tracking accurately the trajectory of particles as e.g. created at the Large Hadron Collider (LHC): given $$O(10^5)$$ O ( 10 5 ) points, the participants had to connect them into $$O(10^4)$$ O ( 10 4 ) individual groups that represent the particle trajectories which are approximated helical. While in the first phase only the accuracy mattered, the goal of this second phase was a compromise between the accuracy and the speed of inference. Both were measured on the Codalab platform where the participants had to upload their software. The best three participants had solutions with good accuracy and speed an order of magnitude faster than the state of the art when the challenge was designed. Although the core algorithms were less diverse than in the first phase, a diversity of techniques have been used and are described in this paper. The performance of the algorithms is analysed in depth and lessons derived.

20 August 2020 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
JWJun Wan
Jun Wan
CLChi Lin
Chi Lin
LWLongyin Wen
Longyin Wen
YLYunan Li
Yunan Li
Qiguang MiaoQiguang Miao
Qiguang Miao
SLStan Z. Li
Stan Z. Li
The ChaLearn large-scale gesture recognition challenge has run twice in two workshops in conjunction with the International Conference on Pattern Recognition (ICPR) 2016 and International Conference on Computer Vision (ICCV) 2017, attracting more than 200 teams around the world. This challenge has two tracks, focusing on isolated and continuous gesture \nobreak recognition, respectively. It describes the creation of both benchmark datasets and analyzes the advances in large-scale gesture recognition based on these two datasets. In this article, we discuss the challenges of collecting large-scale ground-truth annotations of gesture recognition and provide a detailed analysis of the current methods for large-scale isolated and continuous gesture recognition. In addition to the recognition rate and mean Jaccard index (MJI) as evaluation metrics used in previous challenges, we introduce the corrected segmentation rate (CSR) metric to evaluate the performance of temporal segmentation for continuous gesture recognition. Furthermore, we propose a bidirectional long short-term memory (Bi-LSTM) method, determining video division points based on skeleton points. Experiments show that the proposed Bi-LSTM outperforms state-of-the-art methods with an absolute improvement of 8.1% (from 0.8917 to 0.9639) of CSR.