Learning anytime predictions in neural networks via adaptive loss balancing
This work considers the trade-off between accuracy and testtime computational cost of deep
neural networks (DNNs) via anytime predictions from auxiliary predictions. Specifically, we …
neural networks (DNNs) via anytime predictions from auxiliary predictions. Specifically, we …
[PDF][PDF] Classifier cascades and trees for minimizing feature evaluation cost
Abstract Machine learning algorithms have successfully entered industry through many real-
world applications (eg, search engines and product recommendations). In these …
world applications (eg, search engines and product recommendations). In these …
Speedboost: Anytime prediction with uniform near-optimality
A Grubb, D Bagnell - Artificial Intelligence and Statistics, 2012 - proceedings.mlr.press
We present SpeedBoost, a natural extension of functional gradient descent, for learning
anytime predictors, which automatically trade computation time for predictive accuracy by …
anytime predictors, which automatically trade computation time for predictive accuracy by …
Prediction-time efficient classification using feature computational dependencies
L Zhao, A Alipour-Fanid, M Slawski… - Proceedings of the 24th …, 2018 - dl.acm.org
As machine learning methods are utilized in more and more real-world applications
involving constraints on computational budgets, the systematic integration of such …
involving constraints on computational budgets, the systematic integration of such …
[PDF][PDF] Cost-sensitive dynamic feature selection
• Select the feature that yields the maximum immediate reward r (st, at)= margin (st, at)− cost
(st, at) λ= 1, cost scaled to [0, 1], H1N1= positive order feat. marg. cost reward 1 coughing …
(st, at) λ= 1, cost scaled to [0, 1], H1N1= positive order feat. marg. cost reward 1 coughing …
RDI-Net: relational dynamic inference networks
Dynamic inference networks, aimed at promoting computational efficiency, go along an
adaptive executing path for a given sample. Prevalent methods typically assign a router for …
adaptive executing path for a given sample. Prevalent methods typically assign a router for …
[PDF][PDF] Boosting on a budget: Sampling for feature-efficient prediction
L Reyzin - Proceedings of the 28th International Conference on …, 2011 - icml.cc
In this paper, we tackle the problem of feature-efficient prediction: classification using a
limited number of features per test example. We show that modifying an ensemble classifier …
limited number of features per test example. We show that modifying an ensemble classifier …
Optimization of activity-driven event detection for long-term ambulatory urodynamics
F Zareen, M Elazab, B Hanzlicek… - Proceedings of the …, 2024 - journals.sagepub.com
Lower urinary tract dysfunction (LUTD) is a debilitating condition that affects millions of
individuals worldwide, greatly diminishing their quality of life. The use of wireless, catheter …
individuals worldwide, greatly diminishing their quality of life. The use of wireless, catheter …
Efficient feature group sequencing for anytime linear prediction
We consider\textit {anytime} linear prediction in the common machine learning setting,
where features are in groups that have costs. We achieve anytime (or interruptible) …
where features are in groups that have costs. We achieve anytime (or interruptible) …
Large-scale cost-aware classification using feature computational dependency graph
With the rapid growth of real-time machine learning applications, the process of feature
selection and model optimization requires to integrate with the constraints on computational …
selection and model optimization requires to integrate with the constraints on computational …