Name
Abstract | ||
|---|---|---|
Instance embeddings are an efficient and versatile image representation that facilitates applications like recognition, verification, retrieval, and clustering. Many metric learning methods represent the input as a single point in the embedding space. Often the distance between points is used as a proxy for match confidence. However, this can fail to represent uncertainty arising when the input is ambiguous, e.g., due to occlusion or blurriness. This work addresses this issue and explicitly models the uncertainty by hedging the location of each input in the embedding space. We introduce the hedged instance embedding (HIB) in which embeddings are modeled as random variables and the model is trained under the variational information bottleneck principle. Empirical results on our new N-digit MNIST dataset show that our method leads to the desired behavior of hedging its bets across the embedding space upon encountering ambiguous inputs. This results in improved performance for image matching and classification tasks, more structure in the learned embedding space, and an ability to compute a per-exemplar uncertainty measure that is correlated with downstream performance. |
Year | Venue | Field |
|---|---|---|
2018 | ICLR | Random variable,MNIST database,Embedding,Pattern recognition,Image matching,Image representation,Hedge (finance),Artificial intelligence,Information bottleneck method,Cluster analysis,Mathematics,Machine learning |
DocType | Volume | Citations |
Journal | abs/1810.00319 | 0 |
PageRank | References | Authors |
0.34 | 8 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seong Joon Oh | 1 | 0 | 0.34 |
| Michael Kuperberg | 2 | 7589 | 529.66 |
| Jiyan Pan | 3 | 0 | 0.68 |
| Joseph Roth | 4 | 21 | 1.75 |
| Florian Schroff | 5 | 757 | 32.72 |
| andrew c gallagher | 6 | 720 | 32.17 |