← Search

Anton Osokin

10 accepted papers

2020

OS2D: One-Stage One-Shot Object Detection by Matching Anchor Features

ECCV 2020poster

In this paper, we consider the task of one-shot object detection, which consists in detecting objects defined by a single demonstration. Differently from the standard object detection, the classes of objects used for training and testing do not overlap. We build the one-stage system that performs lo…

2018

Quantifying Learning Guarantees for Convex but Inconsistent Surrogates

NeurIPS 2018poster

We study consistency properties of machine learning methods based on minimizing convex surrogates. We extend the recent framework of Osokin et al. (2017) for the quantitative analysis of consistency properties to the case of inconsistent surrogates. Our key technical contribution consists in a new l…

Cited by 5SourcePDFScholar
2018

SEARNN: Training RNNs with global-local losses

ICLR 2018poster

We propose SEARNN, a novel training algorithm for recurrent neural networks (RNNs) inspired by the "learning to search" (L2S) approach to structured prediction. RNNs have been widely successful in structured prediction applications such as machine translation or parsing, and are commonly trained usi…

2017

On Structured Prediction Theory with Calibrated Convex Surrogate Losses

NeurIPS 2017oral

We provide novel theoretical insights on structured prediction in the context of efficient convex surrogate loss minimization with consistency guarantees. For any task loss, we construct a convex surrogate that can be optimized via stochastic gradient descent and we prove tight bounds on the so-call…

2016

Breaking Sticks and Ambiguities with Adaptive Skip-gram

AISTATS 2016poster

The recently proposed Skip-gram model is a powerful method for learning high-dimensional word representations that capture rich semantic relationships between words. However, Skip-gram as well as most prior work on learning word representations does not take into account word ambiguity and maintain…

2016

Minding the Gaps for Block Frank-Wolfe Optimization of Structured SVMs

ICML 2016poster

In this paper, we propose several improvements on the block-coordinate Frank-Wolfe (BCFW) algorithm from Lacoste-Julien et al. (2013) recently used to optimize the structured support vector machine (SSVM) objective in the context of structured prediction, though it has wider applications. The key in…

Cited by 90SourcePDFScholar