Automated Evolutionary Approach for the Design of Composite Machine Learning Pipelines

• URL: http://arxiv.org/abs/2106.15397v1
• Date: Sat, 26 Jun 2021 23:19:06 GMT
• Title: Automated Evolutionary Approach for the Design of Composite Machine Learning Pipelines
• Authors: Nikolay O. Nikitin, Pavel Vychuzhanin, Mikhail Sarafanov, Iana S. Polonskaia, Ilia Revin, Irina V. Barabanova, Gleb Maximov, Anna V. Kalyuzhnaya, Alexander Boukhanovsky
• Abstract summary: The proposed approach is aimed to automate the design of composite machine learning pipelines. It designs the pipelines with a customizable graph-based structure, analyzes the obtained results, and reproduces them. The software implementation on this approach is presented as an open-source framework.
• Score: 48.7576911714538
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The effectiveness of the machine learning methods for real-world tasks depends on the proper structure of the modeling pipeline. The proposed approach is aimed to automate the design of composite machine learning pipelines, which is equivalent to computation workflows that consist of models and data operations. The approach combines key ideas of both automated machine learning and workflow management systems. It designs the pipelines with a customizable graph-based structure, analyzes the obtained results, and reproduces them. The evolutionary approach is used for the flexible identification of pipeline structure. The additional algorithms for sensitivity analysis, atomization, and hyperparameter tuning are implemented to improve the effectiveness of the approach. Also, the software implementation on this approach is presented as an open-source framework. The set of experiments is conducted for the different datasets and tasks (classification, regression, time series forecasting). The obtained results confirm the correctness and effectiveness of the proposed approach in the comparison with the state-of-the-art competitors and baseline solutions.

Related papers

• Implicitly Guided Design with PropEn: Match your Data to Follow the Gradient [52.2669490431145]
  PropEn is inspired by'matching', which enables implicit guidance without training a discriminator. We show that training with a matched dataset approximates the gradient of the property of interest while remaining within the data distribution.
  arXiv  Detail & Related papers  (2024-05-28T11:30:19Z)
• Integration Of Evolutionary Automated Machine Learning With Structural Sensitivity Analysis For Composite Pipelines [0.38696580294804606]
  AutoML creates either fixed or flexible pipelines for a given machine learning problem. flexible pipelines can be structurally overcomplicated and have poor explainability. We propose the EVOSA approach that compensates for the negative points of flexible pipelines by incorporating a sensitivity analysis.
  arXiv  Detail & Related papers  (2023-12-22T15:39:03Z)
• End-to-End Meta-Bayesian Optimisation with Transformer Neural Processes [52.818579746354665]
  This paper proposes the first end-to-end differentiable meta-BO framework that generalises neural processes to learn acquisition functions via transformer architectures. We enable this end-to-end framework with reinforcement learning (RL) to tackle the lack of labelled acquisition data.
  arXiv  Detail & Related papers  (2023-05-25T10:58:46Z)
• Self Optimisation and Automatic Code Generation by Evolutionary Algorithms in PLC based Controlling Processes [0.0]
  A novel approach based on evolutionary algorithms is proposed to self optimise the system logic of complex processes. The presented approach is evaluated on an industrial liquid station process subject to a multi-objective problem.
  arXiv  Detail & Related papers  (2023-04-12T06:36:54Z)
• Improvement of Computational Performance of Evolutionary AutoML in a Heterogeneous Environment [0.0]
  We propose a modular approach to increase the quality of evolutionary optimization for modelling pipelines with a graph-based structure. The implemented algorithms are available as a part of the open-source framework FEDOT.
  arXiv  Detail & Related papers  (2023-01-12T15:59:04Z)
• HyperImpute: Generalized Iterative Imputation with Automatic Model Selection [77.86861638371926]
  We propose a generalized iterative imputation framework for adaptively and automatically configuring column-wise models. We provide a concrete implementation with out-of-the-box learners, simulators, and interfaces.
  arXiv  Detail & Related papers  (2022-06-15T19:10:35Z)
• SOLIS -- The MLOps journey from data acquisition to actionable insights [62.997667081978825]
  In this paper we present a unified deployment pipeline and freedom-to-operate approach that supports all requirements while using basic cross-platform tensor framework and script language engines. This approach however does not supply the needed procedures and pipelines for the actual deployment of machine learning capabilities in real production grade systems.
  arXiv  Detail & Related papers  (2021-12-22T14:45:37Z)
• Multi-Objective Evolutionary Design of CompositeData-Driven Models [0.0]
  The implemented approach is based on a parameter-free genetic algorithm for model design called GPComp@Free. The experimental results confirm that a multi-objective approach to the model design allows achieving better diversity and quality of obtained models.
  arXiv  Detail & Related papers  (2021-03-01T20:45:24Z)
• PipeSim: Trace-driven Simulation of Large-Scale AI Operations Platforms [4.060731229044571]
  We present a trace-driven simulation-based experimentation and analytics environment for large-scale AI systems. Analytics data from a production-grade AI platform developed at IBM are used to build a comprehensive simulation model. We implement the model in a standalone, discrete event simulator, and provide a toolkit for running experiments.
  arXiv  Detail & Related papers  (2020-06-22T19:55:37Z)
• Learning with Differentiable Perturbed Optimizers [54.351317101356614]
  We propose a systematic method to transform operations into operations that are differentiable and never locally constant. Our approach relies on perturbeds, and can be used readily together with existing solvers. We show how this framework can be connected to a family of losses developed in structured prediction, and give theoretical guarantees for their use in learning tasks.
  arXiv  Detail & Related papers  (2020-02-20T11:11:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.