112 citations · 386 across the 16 of their papers we have counts for
5 papers · 1 filter
Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
Sebastian Bruch, Aditya Krishnan, Franco Maria Nardini
Clustering-based nearest neighbor search is an effective method in which points are partitioned into geometric shards to form an index, with only a few shards searched during query…
Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library
Mathieu Guillame-Bert, Sebastian Bruch, Richard Stotz +1
Yggdrasil Decision Forests is a library for the training, serving and interpretation of decision forest models, targeted both at research and production work, implemented in C++, a…
Modeling Text with Decision Forests using Categorical-Set Splits
Mathieu Guillame-Bert, Sebastian Bruch, Petr Mitrichev +2
Decision forest algorithms typically model data by learning a binary tree structure recursively where every node splits the feature space into two sub-regions, sending examples int…
Learning Representations for Axis-Aligned Decision Forests through Input Perturbation
Sebastian Bruch, Jan Pfeifer, Mathieu Guillame-bert
Axis-aligned decision forests have long been the leading class of machine learning algorithms for modeling tabular data. In many applications of machine learning such as learning-t…
An Alternative Cross Entropy Loss for Learning-to-Rank
Sebastian Bruch
Listwise learning-to-rank methods form a powerful class of ranking algorithms that are widely adopted in applications such as information retrieval. These algorithms learn to rank…