4 papers
Adaptively Pruning Features for Boosted Decision Trees
Maryam Aziz, Jesse Anderton, Javed Aslam
Boosted decision trees enjoy popularity in a variety of applications; however, for large-scale datasets, the cost of training a decision tree in each round can be prohibitively exp…
Revealing the Basis: Ordinal Embedding Through Geometry
Jesse Anderton, Virgil Pavlu, Javed Aslam
Ordinal Embedding places n objects into R^d based on comparisons such as "a is closer to b than c." Current optimization-based approaches suffer from scalability problems and an ab…
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence
Maryam Aziz, Jesse Anderton, Emilie Kaufmann +1
We consider the problem of near-optimal arm identification in the fixed confidence setting of the infinitely armed bandit problem when nothing is known about the arm reservoir dist…
Measuring Human-perceived Similarity in Heterogeneous Collections
Jesse Anderton, Pavel Metrikov, Virgil Pavlu +1
We present a technique for estimating the similarity between objects such as movies or foods whose proper representation depends on human perception. Our technique combines a modes…