← Search

Nataly Brukhim

8 accepted papers

2023

A Unified Model and Dimension for Interactive Estimation

NeurIPS 2023poster

We study an abstract framework for interactive learning called interactive estimation in which the goal is to estimate a target from its ``similarity'' to points queried by the learner. We introduce a combinatorial measure called Dissimilarity dimension which largely captures learnability in our mod…

Cited by 0Source ↗PDF ↗Scholar ↗
2023

Multiclass Boosting: Simple and Intuitive Weak Learning Criteria

NeurIPS 2023poster

We study a generalization of boosting to the multiclass setting. We introduce a weak learning condition for multiclass classification that captures the original notion of weak learnability as being “slightly better than random guessing”. We give a simple and efficient boosting algorithm, that does n…

Cited by 6Source ↗PDF ↗Scholar ↗
2021

Multiclass Boosting and the Cost of Weak Learning

NeurIPS 2021poster

Boosting is an algorithmic approach which is based on the idea of combining weak and moderately inaccurate hypotheses to a strong and accurate one. In this work we study multiclass boosting with a possibly large number of classes or categories. Multiclass boosting can be formulated in…

Cited by 14Source ↗PDF ↗Scholar ↗
2018

Following High-level Navigation Instructions on a Simulated Quadcopter with Imitation Learning

RSS 2018poster

We introduce a method for following high-level navigation instructions by mapping directly from images, instructions and pose estimates to continuous low-level velocity commands for real-time control. The Grounded Semantic Mapping Network (GSMN) is a fully-differentiable neural network architecture…