Search Results for author:
Found 5 papers, 0 papers with code
Relational Boosted Regression Trees
Many tasks use data housed in relational databases to train boosted regression tree models.
Relational Algorithms for k-means Clustering
Few relational algorithms are known and this paper offers techniques for designing relational algorithms as well as characterizing their limitations.
A Relational Gradient Descent Algorithm For Support Vector Machine Training
We consider gradient descent like algorithms for Support Vector Machine (SVM) training when the data is in relational form.
Approximate Aggregate Queries Under Additive Inequalities
In contrast, we show that the situation with two additive inequalities is quite different, by showing that it is NP-hard to evaluate simple aggregation queries, with two additive inequalities, with any bounded relative error.
On Coresets for Regularized Loss Minimization
Our main result is that if the regularizer's effect does not become negligible as the norm of the hypothesis scales, and as the data scales, then a uniform sample of modest size is with high probability a coreset.
