DR
D. Remmelzwaal
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
2 records found
1
Learning to Curve
Exploring Metafeature-Driven Learning Curve Prediction
Learning curves in machine learning are useful tools to steer data acquisition and early stopping, representing the relation between training data quantity and performance. In existing literature, prediction of these learning curves largely relies on extrapolating from an initial set of observed performances and does not consider the characteristics of the underlying dataset, dubbed "metafeatures". Existing research of the utility of these metafeatures in the domain of learning curve prediction is sparse. Further, when it comes to measuring the fitness of predictions, the vast majority of literature uses Mean Squared Error. Different loss functions are seldom considered, and comparisons between different loss functions are not made.
In this Master Thesis we showcase metafeature-driven learning curve prediction by training two metalearners on a synthetic database of learning curves. We show that these metalearners strongly outperform the problem-average curve, which is indicative of meaningful task learning. The learning curves predictions produced by these metalearners perform comparable to curves obtained through direct curve fitting methods.
These results are obtained using 33 metafeatures. Four metafeature categories, comprising 12 metafeatures, are newly introduced in this research. Of these categories, we show high utility for three: Bayes Error, Negentropy and Surrogate Bayes. Of these, the Bayes Error shows highest utility. The best performing category of metafeature was the landmarkers, reinforcing their usage in literature.
We further show that the effect of chosen loss function on the shape of directly fitted curves on learning curve data is present but minor. The most notable difference appears in the exponent, where using a squared loss function yields a slightly lower (negative) exponent for power laws compared to the Mean Absolute Error. These trends do not readily appear to affect the shape of the resulting learning curve.
Evaluation or real-world data using the CC18-Database yielded no strong performance, suggesting that the synthetic learning curve database is not reflective of real problem datasets. Further research is needed to ascertain the nature of this discrepancy. ...
In this Master Thesis we showcase metafeature-driven learning curve prediction by training two metalearners on a synthetic database of learning curves. We show that these metalearners strongly outperform the problem-average curve, which is indicative of meaningful task learning. The learning curves predictions produced by these metalearners perform comparable to curves obtained through direct curve fitting methods.
These results are obtained using 33 metafeatures. Four metafeature categories, comprising 12 metafeatures, are newly introduced in this research. Of these categories, we show high utility for three: Bayes Error, Negentropy and Surrogate Bayes. Of these, the Bayes Error shows highest utility. The best performing category of metafeature was the landmarkers, reinforcing their usage in literature.
We further show that the effect of chosen loss function on the shape of directly fitted curves on learning curve data is present but minor. The most notable difference appears in the exponent, where using a squared loss function yields a slightly lower (negative) exponent for power laws compared to the Mean Absolute Error. These trends do not readily appear to affect the shape of the resulting learning curve.
Evaluation or real-world data using the CC18-Database yielded no strong performance, suggesting that the synthetic learning curve database is not reflective of real problem datasets. Further research is needed to ascertain the nature of this discrepancy. ...
Learning curves in machine learning are useful tools to steer data acquisition and early stopping, representing the relation between training data quantity and performance. In existing literature, prediction of these learning curves largely relies on extrapolating from an initial set of observed performances and does not consider the characteristics of the underlying dataset, dubbed "metafeatures". Existing research of the utility of these metafeatures in the domain of learning curve prediction is sparse. Further, when it comes to measuring the fitness of predictions, the vast majority of literature uses Mean Squared Error. Different loss functions are seldom considered, and comparisons between different loss functions are not made.
In this Master Thesis we showcase metafeature-driven learning curve prediction by training two metalearners on a synthetic database of learning curves. We show that these metalearners strongly outperform the problem-average curve, which is indicative of meaningful task learning. The learning curves predictions produced by these metalearners perform comparable to curves obtained through direct curve fitting methods.
These results are obtained using 33 metafeatures. Four metafeature categories, comprising 12 metafeatures, are newly introduced in this research. Of these categories, we show high utility for three: Bayes Error, Negentropy and Surrogate Bayes. Of these, the Bayes Error shows highest utility. The best performing category of metafeature was the landmarkers, reinforcing their usage in literature.
We further show that the effect of chosen loss function on the shape of directly fitted curves on learning curve data is present but minor. The most notable difference appears in the exponent, where using a squared loss function yields a slightly lower (negative) exponent for power laws compared to the Mean Absolute Error. These trends do not readily appear to affect the shape of the resulting learning curve.
Evaluation or real-world data using the CC18-Database yielded no strong performance, suggesting that the synthetic learning curve database is not reflective of real problem datasets. Further research is needed to ascertain the nature of this discrepancy.
In this Master Thesis we showcase metafeature-driven learning curve prediction by training two metalearners on a synthetic database of learning curves. We show that these metalearners strongly outperform the problem-average curve, which is indicative of meaningful task learning. The learning curves predictions produced by these metalearners perform comparable to curves obtained through direct curve fitting methods.
These results are obtained using 33 metafeatures. Four metafeature categories, comprising 12 metafeatures, are newly introduced in this research. Of these categories, we show high utility for three: Bayes Error, Negentropy and Surrogate Bayes. Of these, the Bayes Error shows highest utility. The best performing category of metafeature was the landmarkers, reinforcing their usage in literature.
We further show that the effect of chosen loss function on the shape of directly fitted curves on learning curve data is present but minor. The most notable difference appears in the exponent, where using a squared loss function yields a slightly lower (negative) exponent for power laws compared to the Mean Absolute Error. These trends do not readily appear to affect the shape of the resulting learning curve.
Evaluation or real-world data using the CC18-Database yielded no strong performance, suggesting that the synthetic learning curve database is not reflective of real problem datasets. Further research is needed to ascertain the nature of this discrepancy.
Locality mapping captures the displacement imposed by a mirroring surface in anamorphic art. Establishing this mapping for a physical mirror, however, is a difficult task. Applying pattern matching on the distorted reflection is a promising technique, though existing pattern matching strategies are often ill equipped for this particular task. This paper proposes a novel pattern- and pattern matching strategy designed to provide robustness against the artifacts introduced by mirror anamorphosis. The resulting approach, though computationally intense, is able to provide an arbitrary quantity of anchor points given the necessary image quality.
...
...
Locality mapping captures the displacement imposed by a mirroring surface in anamorphic art. Establishing this mapping for a physical mirror, however, is a difficult task. Applying pattern matching on the distorted reflection is a promising technique, though existing pattern matching strategies are often ill equipped for this particular task. This paper proposes a novel pattern- and pattern matching strategy designed to provide robustness against the artifacts introduced by mirror anamorphosis. The resulting approach, though computationally intense, is able to provide an arbitrary quantity of anchor points given the necessary image quality.