paper-with-me

홈 › Papers

Bayesian representation learning with oracle constraints

2015-06-16 · Theofanis Karaletsos, Serge Belongie, Gunnar Rätsch

Representation learning systems typically rely on massive amounts of labeled data in order to be trained to high accuracy. Recently, high-dimensional parametric models like neural networks have succeeded in building rich representations using either compressive, reconstructive or supervised criteria. However, the semantic structure inherent in observations is oftentimes lost in the process. Human perception excels at understanding semantics but cannot always be expressed in terms of labels. Thus, \emph{oracles} or \emph{human-in-the-loop systems}, for example crowdsourcing, are often employed to generate similarity constraints using an implicit similarity function encoded in human perception. In this work we propose to combine \emph{generative unsupervised feature learning} with a \emph{probabilistic treatment of oracle information like triplets} in order to transfer implicit privileged oracle knowledge into explicit nonlinear Bayesian latent factor models of the observations. We use a fast variational algorithm to learn the joint model and demonstrate applicability to a well-known image dataset. We show how implicit triplet information can provide rich information to learn representations that outperform previous metric learning approaches as well as generative models without this side-information in a variety of predictive tasks. In addition, we illustrate that the proposed approach compartmentalizes the latent spaces semantically which allows interpretation of the latent variables.

📄 PDF Abstract BibTeX arXiv:1506.05011

Code (0)

등록된 구현이 없습니다.

Tasks

Metric LearningRepresentation LearningTriplet

Similar Papers 제목 키워드 기반

Learning Bayesian networks with ancestral constraints

2016-12-01 · NeurIPS 2016 12 · Eunice Yuh-Jie Chen, Yujia Shen, Arthur Choi, Adnan Darwiche

We consider the problem of learning Bayesian networks optimally, when subject to background knowledge in the form of ancestral constraints. Our approach is based on a recently proposed framework for optimal structure lea…

Contextual Linear Bandits under Noisy Features: Towards Bayesian Oracles

2017-03-03 · Jung-hun Kim, Se-Young Yun, Minchan Jeong, Jun Hyun Nam 외

We study contextual linear bandit problems under feature uncertainty, where the features are noisy and have missing entries. To address the challenges posed by this noise, we analyze Bayesian oracles given the observed n…

Multi-Armed Bandits

An Oracle Inequality for Quasi-Bayesian Non-Negative Matrix Factorization

2016-01-06 · Pierre Alquier, Benjamin Guedj

The aim of this paper is to provide some theoretical understanding of quasi-Bayesian aggregation methods non-negative matrix factorization. We derive an oracle inequality for an aggregated estimator. This result holds fo…

OracleFusion: Assisting the Decipherment of Oracle Bone Script with Structurally Constrained Semantic Typography

2025-06-26 · Caoshuo Li, Zengmao Ding, Xiaobin Hu, Bang Li 외

As one of the earliest ancient languages, Oracle Bone Script (OBS) encapsulates the cultural records and intellectual expressions of ancient civilizations. Despite the discovery of approximately 4,500 OBS characters, onl…

DeciphermentLarge Language ModelMultimodal Large Language ModelVisual Localization

Sparse Portfolio selection via Bayesian Multiple testing

2017-04-17 · Sourish Das, Rituparna Sen

We presented Bayesian portfolio selection strategy, via the $k$ factor asset pricing model. If the market is information efficient, the proposed strategy will mimic the market; otherwise, the strategy will outperform the…