Automated problem setting selection in multi-target prediction with AutoMTP

• URL: http://arxiv.org/abs/2104.09967v1
• Date: Mon, 19 Apr 2021 12:44:20 GMT
• Title: Automated problem setting selection in multi-target prediction with AutoMTP
• Authors: Dimitrios Iliadis, Bernard De Baets, Willem Waegeman
• Abstract summary: AutoMTP is an automated framework that performs algorithm selection for Multi-Target Prediction. It is realized by adopting a rule-based system for the algorithm selection step and a flexible neural network architecture.
• Score: 14.451046691298298
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Algorithm Selection (AS) is concerned with the selection of the best-suited algorithm out of a set of candidates for a given problem. The area of AS has received a lot of attention from machine learning researchers and practitioners, as positive results along this line of research can make expertise in ML more readily accessible to experts in other domains as well as to the general public. Another quickly expanding area is that of Multi-Target Prediction (MTP). The ability to simultaneously predict multiple target variables of diverse types makes MTP of interest for a plethora of applications. MTP embraces several subfields of machine learning, such as multi-label classification, multi-target regression, multi-task learning, dyadic prediction, zero-shot learning, network inference, and matrix completion. This work combines the two above-mentioned areas by proposing AutoMTP, an automated framework that performs algorithm selection for MTP. AutoMTP is realized by adopting a rule-based system for the algorithm selection step and a flexible neural network architecture that can be used for the several subfields of MTP.

Related papers

• Multi-Teacher Multi-Objective Meta-Learning for Zero-Shot Hyperspectral Band Selection [50.30291173608449]
  We propose a novel multi-objective meta-learning network (M$3$BS) for zero-shot hyperspectral band selection. In M$3$BS, a generalizable graph convolution network (GCN) is constructed to generate dataset-agnostic base. The acquired meta-knowledge can be directly transferred to unseen datasets without any retraining or fine-tuning.
  arXiv  Detail & Related papers  (2024-06-12T07:13:31Z)
• Scalable Mechanism Design for Multi-Agent Path Finding [87.40027406028425]
  Multi-Agent Path Finding (MAPF) involves determining paths for multiple agents to travel simultaneously and collision-free through a shared area toward given goal locations. Finding an optimal solution is often computationally infeasible, making the use of approximate, suboptimal algorithms essential. We introduce the problem of scalable mechanism design for MAPF and propose three strategyproof mechanisms, two of which even use approximate MAPF algorithms.
  arXiv  Detail & Related papers  (2024-01-30T14:26:04Z)
• Multi-Agent Reinforcement Learning for Microprocessor Design Space Exploration [71.95914457415624]
  Microprocessor architects are increasingly resorting to domain-specific customization in the quest for high-performance and energy-efficiency. We propose an alternative formulation that leverages Multi-Agent RL (MARL) to tackle this problem. Our evaluation shows that the MARL formulation consistently outperforms single-agent RL baselines.
  arXiv  Detail & Related papers  (2022-11-29T17:10:24Z)
• Explainable Model-specific Algorithm Selection for Multi-Label Classification [6.442438468509492]
  Multi-label classification (MLC) is an ML task of predictive modeling in which a data instance can simultaneously belong to multiple classes. Several MLC algorithms have been proposed in the literature, resulting in a meta-optimization problem. We investigate in this work the quality of an automated approach that uses characteristics of the datasets.
  arXiv  Detail & Related papers  (2022-11-21T07:42:11Z)
• Hyperparameter optimization in deep multi-target prediction [16.778802088570412]
  We offer a single AutoML framework for most problem settings that fall under the umbrella of multi-target prediction. Our work can be seen as the first attempt at offering a single AutoML framework for most problem settings that fall under the umbrella of multi-target prediction.
  arXiv  Detail & Related papers  (2022-11-08T16:33:36Z)
• Graph-Based Multi-Robot Path Finding and Planning [3.4260993997836753]
  Planning collision-free paths for multiple robots is important for real-world multi-robot systems. Recent advances have resulted in MAPF algorithms that can compute collision-free paths for hundreds of robots.
  arXiv  Detail & Related papers  (2022-06-22T18:47:00Z)
• Automatic Expert Selection for Multi-Scenario and Multi-Task Search [41.47107282896807]
  We propose a novel Automatic Expert Selection framework for Multi-scenario and Multi-task search, named AESM2. Experiments over two real-world large-scale datasets demonstrate the effectiveness of AESM2 over a battery of strong baselines. Online A/B test also shows substantial performance gain on multiple metrics.
  arXiv  Detail & Related papers  (2022-05-28T03:41:25Z)
• Controllable Pareto Multi-Task Learning [55.945680594691076]
  A multi-task learning system aims at solving multiple related tasks at the same time. With a fixed model capacity, the tasks would be conflicted with each other, and the system usually has to make a trade-off among learning all of them together. This work proposes a novel controllable multi-task learning framework, to enable the system to make real-time trade-off control among different tasks with a single model.
  arXiv  Detail & Related papers  (2020-10-13T11:53:55Z)
• Multi-path Neural Networks for On-device Multi-domain Visual Classification [55.281139434736254]
  This paper proposes a novel approach to automatically learn a multi-path network for multi-domain visual classification on mobile devices. The proposed multi-path network is learned from neural architecture search by applying one reinforcement learning controller for each domain to select the best path in the super-network created from a MobileNetV3-like search space. The determined multi-path model selectively shares parameters across domains in shared nodes while keeping domain-specific parameters within non-shared nodes in individual domain paths.
  arXiv  Detail & Related papers  (2020-10-10T05:13:49Z)
• Deep Multi-task Multi-label CNN for Effective Facial Attribute Classification [53.58763562421771]
  We propose a novel deep multi-task multi-label CNN, termed DMM-CNN, for effective Facial Attribute Classification (FAC) Specifically, DMM-CNN jointly optimize two closely-related tasks (i.e., facial landmark detection and FAC) to improve the performance of FAC by taking advantage of multi-task learning. Two different network architectures are respectively designed to extract features for two groups of attributes, and a novel dynamic weighting scheme is proposed to automatically assign the loss weight to each facial attribute during training.
  arXiv  Detail & Related papers  (2020-02-10T12:34:16Z)
• Learning NP-Hard Multi-Agent Assignment Planning using GNN: Inference on a Random Graph and Provable Auction-Fitted Q-learning [24.956507498394497]
  This paper explores the possibility of near-optimally solving multi-agent, multi-task NP-hard planning problems with time-dependent rewards using a learning-based algorithm.
  arXiv  Detail & Related papers  (2019-05-29T04:02:41Z)

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.