Youssef Achenchabe, Ph.D.

Youssef Achenchabe, Ph.D.

Paris, Île-de-France, France
2 k abonnés + de 500 relations

À propos

https://youssefach.github.io/

🎓 Academic Expertise
I hold a Ph.D. in Machine…

Activité

S’inscrire pour voir toute l’activité

Expérience

  • Graphique Euranova

    Euranova

    Ville de Paris, Île-de-France, France

  • -

    Paris, Île-de-France, France

  • -

    Paris, Île-de-France, France

Formation

  • Graphique Université Paris-Saclay

    Université Paris-Saclay

    -

    Activités et associations :Orange Labs

    Ph.D. under the supervision of Prof. Antoine Cornuéjols & Dr. Alexis Bondu focused on Machine learning-based early decision-making on time series.

  • -

    GPA: 4.0/4.0
    ▪ Functional / Imperative programming, Computer architectures, Networks, Databases, Object oriented programming (Java & python).
    ▪ Theory of integration, Functional analysis, Linear algebra, Optimization, Differential Calculus, Sparse linear algerba.
    ▪ Machine learning, Convex Optimization, Probability and Statistics, Geometric Modeling,
    ▪ Graph Theory, Optimal Control, Krylov methods, Discrete Global Optimization, Iterative methods for linear Algebra, Large scale…

    GPA: 4.0/4.0
    ▪ Functional / Imperative programming, Computer architectures, Networks, Databases, Object oriented programming (Java & python).
    ▪ Theory of integration, Functional analysis, Linear algebra, Optimization, Differential Calculus, Sparse linear algerba.
    ▪ Machine learning, Convex Optimization, Probability and Statistics, Geometric Modeling,
    ▪ Graph Theory, Optimal Control, Krylov methods, Discrete Global Optimization, Iterative methods for linear Algebra, Large scale sparse linear Algebra.
    ▪ BigData tools (Hadoop & Spark), Cloud Computing (Aws), Grid Computing (MPI), High performance parallel programming (OpenMP), Theory of distributed systems.
    ▪ Economic context and management, Simulation of Business Administration, Computer Law, Organizing and Structuring of Companies, basic Accounting and Financial Management.

  • -

    Two-year undergraduate program prior to the highly selective entrance examination to the French most prestigious graduate schools of Engineering.

Publications

  • SANGEA: Scalable and Attributed Network Generation

    ACML'23

    We propose SANGEA, a sizeable synthetic graph generation framework which extends the applicability of any synthetic graph generator to large graphs allowing us to perform generative model training and sampling for graphs up to 90,000 nodes and 450,000 edges. Our experiments show that the generated graphs achieve high utility on downstream tasks such as link prediction. In addition, we provide a privacy assessment to show that, even though they have excellent utility, they also achieve…

    We propose SANGEA, a sizeable synthetic graph generation framework which extends the applicability of any synthetic graph generator to large graphs allowing us to perform generative model training and sampling for graphs up to 90,000 nodes and 450,000 edges. Our experiments show that the generated graphs achieve high utility on downstream tasks such as link prediction. In addition, we provide a privacy assessment to show that, even though they have excellent utility, they also achieve reasonable privacy scores.

    Voir la publication
  • Open challenges for Machine Learning based Early Decision-Making research

    SIGKDD

    More and more applications require early decisions, i.e. taken as soon
    as possible from partially observed data. However, the later a decision is
    made, the more its accuracy tends to improve, since the description of the
    problem to hand is enriched over time. Such a compromise between the
    earliness and the accuracy of decisions has been particularly studied in
    the field of Early Time Series Classification. This paper introduces a more
    general problem, called Machine Learning…

    More and more applications require early decisions, i.e. taken as soon
    as possible from partially observed data. However, the later a decision is
    made, the more its accuracy tends to improve, since the description of the
    problem to hand is enriched over time. Such a compromise between the
    earliness and the accuracy of decisions has been particularly studied in
    the field of Early Time Series Classification. This paper introduces a more
    general problem, called Machine Learning based Early Decision Making
    (ML-EDM), which consists in optimizing the decision times of models in
    a wide range of settings where data is collected over time. After defining
    the ML-EDM problem, ten challenges are identified and proposed to the
    scientific community to further research in this area. These challenges
    open important application perspectives, discussed in this paper.

    Voir la publication
  • Early and Revocable Time Series Classification

    IJCNN

    Many approaches have been proposed for early classification of time series in light of its
    significance in a wide range of applications including healthcare, transportation and fi-
    nance. Until now, the early classification problem has been dealt with by considering only
    irrevocable decisions. This paper introduces a new problem called early and revocable time
    series classification, where the decision maker can revoke its earlier decisions based on the
    new available measurements.…

    Many approaches have been proposed for early classification of time series in light of its
    significance in a wide range of applications including healthcare, transportation and fi-
    nance. Until now, the early classification problem has been dealt with by considering only
    irrevocable decisions. This paper introduces a new problem called early and revocable time
    series classification, where the decision maker can revoke its earlier decisions based on the
    new available measurements. In order to formalize and tackle this problem, we propose a
    new cost-based framework and derive two new approaches from it. The first approach does
    not consider explicitly the cost of changing decision, while the second one does. Exten-
    sive experiments are conducted to evaluate these approaches on a large benchmark of real
    datasets. The empirical results obtained convincingly show (i ) that the ability of revok-
    ing decisions significantly improves performance over the irrevocable regime, and (ii ) that
    taking into account the cost of changing decision brings even better results in general.

    Voir la publication
  • ECOTS: Early Classification in Open Time Series

    ACML'22

    Learning to predict ahead of time events in open time series
    is challenging. While Early Classification of Time Series (ECTS) tack-
    les the problem of balancing online the accuracy of the prediction with
    the cost of delaying the decision when the individuals are time series
    of finite length with a unique label for the whole time series. Surpris-
    ingly, this trade-off has never been investigated for open time series with
    undetermined length and with different classes for each…

    Learning to predict ahead of time events in open time series
    is challenging. While Early Classification of Time Series (ECTS) tack-
    les the problem of balancing online the accuracy of the prediction with
    the cost of delaying the decision when the individuals are time series
    of finite length with a unique label for the whole time series. Surpris-
    ingly, this trade-off has never been investigated for open time series with
    undetermined length and with different classes for each subsequence of
    the same time series. In this paper, we propose a principled method to
    adapt any technique for ECTS to the Early Classification in Open Time
    Series (ECOTS). We show how the classifiers must be constructed and
    what the decision triggering system becomes in this new scenario. We
    address the challenge of decision making in the predictive maintenance
    field. We illustrate our methodology by transforming two state-of-the-art
    ECTS algorithms for the ECOTS scenario and report numerical experi-
    ments on a real dataset for predictive maintenance that demonstrate the
    practicality of the novel approach.

    Voir la publication
  • Early Classification of Time Series: Cost-based multiclass Algorithms

    DSAA

    Early classification of time series assigns each time series to one of a set of pre-defined classes using as few measurements as possible while preserving a high accuracy. This implies solving online the trade-off between the earliness and the prediction accuracy. This has been formalized in previous work where a cost-based framework taking into account both the cost of misclassification and the cost of delaying the decision has been proposed. The best resulting method, called Economy- γ , is…

    Early classification of time series assigns each time series to one of a set of pre-defined classes using as few measurements as possible while preserving a high accuracy. This implies solving online the trade-off between the earliness and the prediction accuracy. This has been formalized in previous work where a cost-based framework taking into account both the cost of misclassification and the cost of delaying the decision has been proposed. The best resulting method, called Economy- γ , is unfortunately so far limited to binary classification problems. This paper presents a set of six new methods that extend the Economy- γ method in order to solve multiclass classification problems. Extensive experiments on 33 datasets allowed us to compare the performance of the six proposed approaches to the state-of-the-art one. The results show that: (i) all proposed methods perform significantly better than the state of the art one; (ii) the best way to extend Economy- γ to multiclass problems is to use a confidence score, either the Gini index or the maximum probability.

    Voir la publication
  • Early classification of time series

    Machine learning journal

    An increasing number of applications require to recognize the class of an incoming time series as quickly as possible without unduly compromising the accuracy of the prediction. In this paper, we put forward a new optimization criterion which takes into account both the cost of misclassification and the cost of delaying the decision. Based on this optimization criterion, we derived a family of non-myopic algorithms which try to anticipate the expected future gain in information in balance with…

    An increasing number of applications require to recognize the class of an incoming time series as quickly as possible without unduly compromising the accuracy of the prediction. In this paper, we put forward a new optimization criterion which takes into account both the cost of misclassification and the cost of delaying the decision. Based on this optimization criterion, we derived a family of non-myopic algorithms which try to anticipate the expected future gain in information in balance with the cost of waiting. In one class of algorithms, unsupervised-based, the expectations use the clustering of time series, while in a second class, supervised-based, time series are grouped according to the confidence level of the classifier used to label them. Extensive experiments carried out on real datasets using a large range of delay cost functions show that the presented algorithms are able to solve the earliness vs. accuracy trade-off, with the supervised partition based approaches faring better than the unsupervised partition based ones. In addition, all these methods perform better in a wide variety of conditions than a state of the art method based on a myopic strategy which is recognized as being very competitive. Furthermore, our experiments show that the non-myopic feature of the proposed approaches explains in large part the obtained performances.

    Voir la publication

Projets

Prix et distinctions

  • SQLI Toulouse Hackathon

    SQLI

    This was a competition in which five teams had to create original and innovative solutions to fully wield office 365 and its API. We developed a project management application using NodeJs, Angular, Office 365 web services platform (ranked 2nd)

  • The Merit Scholarship Awarded by the OCP Foundation

    -

    It is a merit scholarship worth 15500€ given to Moroccan students who have joined one of the top graduate engineering schools (Grandes écoles) in France.

Langues

  • Amazigh

    Bilingue ou langue natale

  • French

    Bilingue ou langue natale

  • English

    Capacité professionnelle complète

  • Arabic

    Bilingue ou langue natale

  • German

    Notions

Plus d’activités de Youssef

Voir le profil complet de Youssef

  • Découvrir vos relations en commun
  • Être mis en relation
  • Contacter Youssef directement
Devenir membre pour voir le profil complet

Autres profils similaires

Ajoutez de nouvelles compétences en suivant ces cours