The Greedy Miser: Learning under Test-time Budgets

06/27/2012
by   Zhixiang Xu, et al.
0

As machine learning algorithms enter applications in industrial settings, there is increased interest in controlling their cpu-time during testing. The cpu-time consists of the running time of the algorithm and the extraction time of the features. The latter can vary drastically when the feature set is diverse. In this paper, we propose an algorithm, the Greedy Miser, that incorporates the feature extraction cost during training to explicitly minimize the cpu-time during testing. The algorithm is a straightforward extension of stage-wise regression and is equally suitable for regression or multi-class classification. Compared to prior work, it is significantly more cost-effective and scales to larger data sets.

READ FULL TEXT
research
10/09/2012

Cost-Sensitive Tree of Classifiers

Recently, machine learning algorithms have successfully entered large-sc...
research
01/14/2018

DCDistance: A Supervised Text Document Feature extraction based on class labels

Text Mining is a field that aims at extracting information from textual ...
research
05/19/2018

On testing substitutability

The papers hatfimmokomi11 and azizbrilharr13 propose algorithms for test...
research
04/12/2017

Deep-FExt: Deep Feature Extraction for Vessel Segmentation and Centerline Prediction

Feature extraction is a very crucial task in image and pixel (voxel) cla...
research
05/20/2017

SVM via Saddle Point Optimization: New Bounds and Distributed Algorithms

Support Vector Machine is one of the most classical approaches for class...
research
10/26/2018

An Acceleration Scheme to The Local Directional Pattern

This study seeks to improve the running time of the Local Directional Pa...
research
12/17/2017

Super-sparse Learning in Similarity Spaces

In several applications, input samples are more naturally represented in...

Please sign up or login with your details

Forgot password? Click here to reset