randomHAR: Improving Ensemble Deep Learners for Human Activity Recognition with Sensor Selection and Reinforcement Learning

• URL: http://arxiv.org/abs/2307.07770v1
• Date: Sat, 15 Jul 2023 10:51:03 GMT
• Title: randomHAR: Improving Ensemble Deep Learners for Human Activity Recognition with Sensor Selection and Reinforcement Learning
• Authors: Yiran Huang, Yexu Zhou, Till Riedel, Likun Fang, Michael Beigl
• Abstract summary: The general idea behind randomHAR is training a series of deep learning models with the same architecture on randomly selected sensor data. In contrast to existing work, this approach optimize the ensemble process rather than the architecture of the constituent models. The experiment demonstrates that the proposed approach outperforms the state-of-the-art method, ensembleLSTM.
• Score: 4.5830802802139585
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Deep learning has proven to be an effective approach in the field of Human activity recognition (HAR), outperforming other architectures that require manual feature engineering. Despite recent advancements, challenges inherent to HAR data, such as noisy data, intra-class variability and inter-class similarity, remain. To address these challenges, we propose an ensemble method, called randomHAR. The general idea behind randomHAR is training a series of deep learning models with the same architecture on randomly selected sensor data from the given dataset. Besides, an agent is trained with the reinforcement learning algorithm to identify the optimal subset of the trained models that are utilized for runtime prediction. In contrast to existing work, this approach optimizes the ensemble process rather than the architecture of the constituent models. To assess the performance of the approach, we compare it against two HAR algorithms, including the current state of the art, on six HAR benchmark datasets. The result of the experiment demonstrates that the proposed approach outperforms the state-of-the-art method, ensembleLSTM.

Related papers

• A Human-Centered Approach for Improving Supervised Learning [0.44378250612683995]
  This paper shows how we can strike a balance between performance, time, and resource constraints. Another goal of this research is to make Ensembles more explainable and intelligible using the Human-Centered approach.
  arXiv  Detail & Related papers  (2024-10-14T10:27:14Z)
• Denoising Pre-Training and Customized Prompt Learning for Efficient Multi-Behavior Sequential Recommendation [69.60321475454843]
  We propose DPCPL, the first pre-training and prompt-tuning paradigm tailored for Multi-Behavior Sequential Recommendation. In the pre-training stage, we propose a novel Efficient Behavior Miner (EBM) to filter out the noise at multiple time scales. Subsequently, we propose to tune the pre-trained model in a highly efficient manner with the proposed Customized Prompt Learning (CPL) module.
  arXiv  Detail & Related papers  (2024-08-21T06:48:38Z)
• Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RL [106.82295532402335]
  Existing reinforcement learning algorithms suffer from computational intractability, strong statistical assumptions, and suboptimal sample complexity. We provide the first computationally efficient algorithm that attains rate-optimal sample complexity with respect to the desired accuracy level. Our algorithm, MusIK, combines systematic exploration with representation learning based on multi-step inverse kinematics.
  arXiv  Detail & Related papers  (2023-04-12T14:51:47Z)
• Active Learning Guided by Efficient Surrogate Learners [25.52920030051264]
  Re-training a deep learning model each time a single data point receives a new label is impractical. We introduce a new active learning algorithm that harnesses the power of a Gaussian process surrogate in conjunction with the neural network principal learner. Our proposed model adeptly updates the surrogate learner for every new data instance, enabling it to emulate and capitalize on the continuous learning dynamics of the neural network.
  arXiv  Detail & Related papers  (2023-01-07T01:35:25Z)
• Towards Robust Dataset Learning [90.2590325441068]
  We propose a principled, tri-level optimization to formulate the robust dataset learning problem. Under an abstraction model that characterizes robust vs. non-robust features, the proposed method provably learns a robust dataset.
  arXiv  Detail & Related papers  (2022-11-19T17:06:10Z)
• Efficient Deep Clustering of Human Activities and How to Improve Evaluation [53.08810276824894]
  We present a new deep clustering model for human activity re-cog-ni-tion (HAR) In this paper, we highlight several distinct problems with how deep HAR clustering models are evaluated. We then discuss solutions to these problems, and suggest standard evaluation settings for future deep HAR clustering models.
  arXiv  Detail & Related papers  (2022-09-17T14:12:42Z)
• Easy Ensemble: Simple Deep Ensemble Learning for Sensor-Based Human Activity Recognition [0.0]
  We propose Easy Ensemble (EE) for sensor-based human activity recognition (HAR) EE enables the easy implementation of deep ensemble learning in a single model. In addition, we propose input masking as a method for diversifying the input for EE.
  arXiv  Detail & Related papers  (2022-03-08T15:30:32Z)
• DEALIO: Data-Efficient Adversarial Learning for Imitation from Observation [57.358212277226315]
  In imitation learning from observation IfO, a learning agent seeks to imitate a demonstrating agent using only observations of the demonstrated behavior without access to the control signals generated by the demonstrator. Recent methods based on adversarial imitation learning have led to state-of-the-art performance on IfO problems, but they typically suffer from high sample complexity due to a reliance on data-inefficient, model-free reinforcement learning algorithms. This issue makes them impractical to deploy in real-world settings, where gathering samples can incur high costs in terms of time, energy, and risk. We propose a more data-efficient IfO algorithm
  arXiv  Detail & Related papers  (2021-03-31T23:46:32Z)
• Learning-to-Learn Personalised Human Activity Recognition Models [1.5087842661221904]
  We present a meta-learning methodology for learning to learn personalised HAR models for HAR. We introduce two algorithms, Personalised MAML and Personalised Relation Networks inspired by existing Meta-Learning algorithms. A comparative study shows significant performance improvements against the state-of-the-art Deep Learning algorithms and the Few-shot Meta-Learning algorithms in multiple HAR domains.
  arXiv  Detail & Related papers  (2020-06-12T21:11:59Z)
• Effective Human Activity Recognition Based on Small Datasets [11.521107108725188]
  We propose a HAR method that consists of three steps: (i) data transformation involving the generation of new features based on transforming of raw data, (ii) feature extraction involving the learning of a classifier based on the AdaBoost algorithm, and (iii) parameter determination and pattern recognition. The experimental results indicate that using the proposed method, human activities can be more accurately recognized even with smaller training data size.
  arXiv  Detail & Related papers  (2020-04-29T06:38:23Z)
• CONSAC: Robust Multi-Model Fitting by Conditional Sample Consensus [62.86856923633923]
  We present a robust estimator for fitting multiple parametric models of the same form to noisy measurements. In contrast to previous works, which resorted to hand-crafted search strategies for multiple model detection, we learn the search strategy from data. For self-supervised learning of the search, we evaluate the proposed algorithm on multi-homography estimation and demonstrate an accuracy that is superior to state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-08T17:37:01Z)

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.