Streamlined Empirical Bayes Fitting of Linear Mixed Models in Mobile
Health
- URL: http://arxiv.org/abs/2003.12881v1
- Date: Sat, 28 Mar 2020 19:57:55 GMT
- Title: Streamlined Empirical Bayes Fitting of Linear Mixed Models in Mobile
Health
- Authors: Marianne Menictas, Sabina Tomkins, Susan A Murphy
- Abstract summary: 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.
- Score: 3.8974425658660596
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To effect behavior change a successful algorithm must make high-quality
decisions in real-time. For example, a mobile health (mHealth) application
designed to increase physical activity must make contextually relevant
suggestions to motivate users. While machine learning offers solutions for
certain stylized settings, such as when batch data can be processed offline,
there is a dearth of approaches which can deliver high-quality solutions under
the specific constraints of mHealth. We propose an algorithm which provides
users with contextualized and personalized physical activity suggestions. This
algorithm is able to overcome a challenge critical to mHealth that complex
models be trained efficiently. We propose a tractable streamlined empirical
Bayes procedure which fits linear mixed effects models in large-data settings.
Our procedure takes advantage of sparsity introduced by hierarchical random
effects to efficiently learn the posterior distribution of a linear mixed
effects model. A key contribution of this work is that we provide explicit
updates in order to learn both fixed effects, random effects and
hyper-parameter values. We demonstrate the success of this approach in a mobile
health (mHealth) reinforcement learning application, a domain in which fast
computations are crucial for real time interventions. 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
- LightPure: Realtime Adversarial Image Purification for Mobile Devices Using Diffusion Models [1.6035624867835674]
This paper introduces LightPure, a new method that enhances adversarial image purification.
It improves the accuracy of existing purification methods and provides notable enhancements in speed and computational efficiency.
Our results show that LightPure can outperform existing methods by up to 10x in terms of latency.
arXiv Detail & Related papers (2024-08-31T03:45:57Z) - DynaMMo: Dynamic Model Merging for Efficient Class Incremental Learning for Medical Images [0.8213829427624407]
Continual learning, the ability to acquire knowledge from new data while retaining previously learned information, is a fundamental challenge in machine learning.
We propose Dynamic Model Merging, DynaMMo, a method that merges multiple networks at different stages of model training to achieve better computational efficiency.
We evaluate DynaMMo on three publicly available datasets, demonstrating its effectiveness compared to existing approaches.
arXiv Detail & Related papers (2024-04-22T11:37:35Z) - dugMatting: Decomposed-Uncertainty-Guided Matting [83.71273621169404]
We propose a decomposed-uncertainty-guided matting algorithm, which explores the explicitly decomposed uncertainties to efficiently and effectively improve the results.
The proposed matting framework relieves the requirement for users to determine the interaction areas by using simple and efficient labeling.
arXiv Detail & Related papers (2023-06-02T11:19:50Z) - 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) - Federated Offline Reinforcement Learning [55.326673977320574]
We propose a multi-site Markov decision process model that allows for both homogeneous and heterogeneous effects across sites.
We design the first federated policy optimization algorithm for offline RL with sample complexity.
We give a theoretical guarantee for the proposed algorithm, where the suboptimality for the learned policies is comparable to the rate as if data is not distributed.
arXiv Detail & Related papers (2022-06-11T18:03:26Z) - 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) - An Adaptive Framework for Learning Unsupervised Depth Completion [59.17364202590475]
We present a method to infer a dense depth map from a color image and associated sparse depth measurements.
We show that regularization and co-visibility are related via the fitness of the model to data and can be unified into a single framework.
arXiv Detail & Related papers (2021-06-06T02:27:55Z) - Fast Physical Activity Suggestions: Efficient Hyperparameter Learning in
Mobile Health [1.9788007735185449]
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.
arXiv Detail & Related papers (2020-12-21T19:17:31Z) - Differentiable Causal Discovery from Interventional Data [141.41931444927184]
We propose a theoretically-grounded method based on neural networks that can leverage interventional data.
We show that our approach compares favorably to the state of the art in a variety of settings.
arXiv Detail & Related papers (2020-07-03T15:19:17Z) - Active Learning for Gaussian Process Considering Uncertainties with
Application to Shape Control of Composite Fuselage [7.358477502214471]
We propose two new active learning algorithms for the Gaussian process with uncertainties.
We show that the proposed approach can incorporate the impact from uncertainties, and realize better prediction performance.
This approach has been applied to improving the predictive modeling for automatic shape control of composite fuselage.
arXiv Detail & Related papers (2020-04-23T02:04:53Z) - 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)
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.