Fast Physical Activity Suggestions: Efficient Hyperparameter Learning in Mobile Health

• URL: http://arxiv.org/abs/2012.11646v1
• Date: Mon, 21 Dec 2020 19:17:31 GMT
• Title: Fast Physical Activity Suggestions: Efficient Hyperparameter Learning in Mobile Health
• Authors: Marianne Menictas and Sabina Tomkins and Susan Murphy
• Abstract summary: We propose an algorithm for providing physical activity suggestions in mHealth settings. We show improvements over state of the art approaches both in speed and accuracy of up to 99% and 56% respectively.
• Score: 1.9788007735185449
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Users can be supported to adopt healthy behaviors, such as regular physical activity, via relevant and timely suggestions on their mobile devices. Recently, reinforcement learning algorithms have been found to be effective for learning the optimal context under which to provide suggestions. However, these algorithms are not necessarily designed for the constraints posed by mobile health (mHealth) settings, that they be efficient, domain-informed and computationally affordable. We propose an algorithm for providing physical activity suggestions in mHealth settings. Using domain-science, we formulate a contextual bandit algorithm which makes use of a linear mixed effects model. We then introduce a procedure to efficiently perform hyper-parameter updating, using far less computational resources than competing approaches. Not only is our approach computationally efficient, it is also easily implemented with closed form matrix algebraic updates and we show improvements over state of the art approaches both in speed and accuracy of up to 99% and 56% respectively.

Related papers

• Efficient Deformable Tissue Reconstruction via Orthogonal Neural Plane [58.871015937204255]
  We introduce Fast Orthogonal Plane (plane) for the reconstruction of deformable tissues. We conceptualize surgical procedures as 4D volumes, and break them down into static and dynamic fields comprised of neural planes. This factorization iscretizes four-dimensional space, leading to a decreased memory usage and faster optimization.
  arXiv  Detail & Related papers  (2023-12-23T13:27:50Z)
• Improving Gradient Methods via Coordinate Transformations: Applications to Quantum Machine Learning [0.0]
  Machine learning algorithms heavily rely on optimization algorithms based on gradients, such as gradient descent and alike. The overall performance is dependent on the appearance of local minima and barren plateaus, which slow-down calculations and lead to non-optimal solutions. In this paper we introduce a generic strategy to accelerate and improve the overall performance of such methods, allowing to alleviate the effect of barren plateaus and local minima.
  arXiv  Detail & Related papers  (2023-04-13T18:26:05Z)
• Improved Algorithms for Neural Active Learning [74.89097665112621]
  We improve the theoretical and empirical performance of neural-network(NN)-based active learning algorithms for the non-parametric streaming setting. We introduce two regret metrics by minimizing the population loss that are more suitable in active learning than the one used in state-of-the-art (SOTA) related work.
  arXiv  Detail & Related papers  (2022-10-02T05:03:38Z)
• Contextual Bandits with Large Action Spaces: Made Practical [48.28690486203131]
  We present the first efficient, general-purpose algorithm for contextual bandits with continuous, linearly structured action spaces. Our algorithm makes use of computational oracles for supervised learning, and (ii) optimization over the action space, and achieves sample complexity, runtime, and memory independent of the size of the action space.
  arXiv  Detail & Related papers  (2022-07-12T21:01:48Z)
• Light-weight Deformable Registration using Adversarial Learning with Distilling Knowledge [17.475408305030278]
  We introduce a new Light-weight Deformable Registration network that significantly reduces the computational cost while achieving competitive accuracy. In particular, we propose a new adversarial learning with distilling knowledge algorithm that successfully leverages meaningful information from the effective but expensive teacher network to the student network. The extensively experimental results on different public datasets show that our proposed method achieves state-of-the-art accuracy while significantly faster than recent methods.
  arXiv  Detail & Related papers  (2021-10-04T09:59:01Z)
• OASIS: An Active Framework for Set Inversion [4.014524824655106]
  We introduce a novel method for solving the set inversion problem by formulating it as a binary classification problem. We focus on active learning, a family of new and powerful techniques which can achieve the same level of accuracy with fewer data points compared to traditional learning methods.
  arXiv  Detail & Related papers  (2021-05-31T15:04:43Z)
• Efficient Hyperparameter Optimization for Physics-based Character Animation [1.2183405753834562]
  We propose a novel Curriculum-based Multi-Fidelity Bayesian Optimization framework (CMFBO) for efficient hyperparameter optimization of DRL-based character control systems. We show that our algorithm results in at least 5x efficiency gain comparing to author-released settings in DeepMimic.
  arXiv  Detail & Related papers  (2021-04-26T06:46:36Z)
• Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm [97.66038345864095]
  We propose a new hyperparameter optimization method with zeroth-order hyper-gradients (HOZOG) Specifically, we first formulate hyperparameter optimization as an A-based constrained optimization problem. Then, we use the average zeroth-order hyper-gradients to update hyper parameters.
  arXiv  Detail & Related papers  (2021-02-17T21:03:05Z)
• Evolving Reinforcement Learning Algorithms [186.62294652057062]
  We propose a method for meta-learning reinforcement learning algorithms. The learned algorithms are domain-agnostic and can generalize to new environments not seen during training. We highlight two learned algorithms which obtain good generalization performance over other classical control tasks, gridworld type tasks, and Atari games.
  arXiv  Detail & Related papers  (2021-01-08T18:55:07Z)
• A Data and Compute Efficient Design for Limited-Resources Deep Learning [68.55415606184]
  equivariant neural networks have gained increased interest in the deep learning community. They have been successfully applied in the medical domain where symmetries in the data can be effectively exploited to build more accurate and robust models. Mobile, on-device implementations of deep learning solutions have been developed for medical applications. However, equivariant models are commonly implemented using large and computationally expensive architectures, not suitable to run on mobile devices. In this work, we design and test an equivariant version of MobileNetV2 and further optimize it with model quantization to enable more efficient inference.
  arXiv  Detail & Related papers  (2020-04-21T00:49:11Z)
• Streamlined Empirical Bayes Fitting of Linear Mixed Models in Mobile Health [3.8974425658660596]
  A mobile health (mHealth) application designed to increase physical activity must make contextually relevant suggestions to motivate users. We propose an algorithm which provides users with contextualized and personalized physical activity suggestions. We show improvements over state of the art approaches both in speed and accuracy of up to 99% and 56% respectively.
  arXiv  Detail & Related papers  (2020-03-28T19:57:55Z)

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.