In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

[Q]: Visual representation is crucial for a visual tracking method’s performances. Conventionally, visual representations adopted in visual tracking rely on hand-crafted computer vision descriptors. These descriptors were developed generically without considering tracking-specific information. In this paper, we propose to learn complex-valued invariant representations from tracked sequential image patches, via strong temporal slowness constraint and stacked convolutional autoencoders. The deep slow local representations are learned offline on unlabeled data and transferred to the observational model of our proposed tracker. The proposed observational model retains old training samples to alleviate drift, and collect negative samples which are coherent with target’s motion pattern for better discriminative tracking. With the learned representation and online training samples, a logistic regression classifier is adopted to distinguish target from background, and retrained online to adapt to appearance changes. Subsequently, the observational model is integrated into a particle filter framework to peform visual tracking. Experimental results on various challenging benchmark sequences demonstrate that the proposed tracker performs favourably against several state-of-the-art trackers.
[A]: Self-taught learning of a deep invariant representation for visual tracking via temporal slowness principle


[Q]: Conditional probabilities are a core concept in machine learning. For ex-<lb>ample, optimal prediction of a label Y given an inputX corresponds to maximizing<lb>the conditional probability of Y given X . A common approach to inference tasks<lb>is learning a model of conditional probabilities. However, these models are often<lb>based on strong assumptions (e.g., log-linear models), and hence their estimate of<lb>conditional probabilities is not robust and is highly dependent on the validity of<lb>their assumptions.<lb>Here we propose a framework for reasoning about conditional probabilities without<lb>assuming anything about the underlying distributions, except knowledge of their<lb>second order marginals, which can be estimated from data. We show how this<lb>setting leads to guaranteed bounds on conditional probabilities, which can be calcu-<lb>lated efficiently in a variety of settings, including structured-prediction. Finally, we<lb>apply them to semi-supervised deep learning, obtaining results competitive with<lb>variational autoencoders.
[A]: Robust Conditional Probabilities


[Q]: This paper studies theoretically and empirically a method of turning machinelearning algorithms into probabilistic predictors that automatically enjoys a property of validity (perfect calibration) and is computationally efficient. The price to pay for perfect calibration is that these probabilistic predictors produce imprecise (in practice, almost precise for large data sets) probabilities. When these imprecise probabilities are merged into precise probabilities, the resulting predictors, while losing the theoretical property of perfect calibration, are consistently more accurate than the existing methods in empirical studies. The conference version of this paper is to appear in Advances in Neural Information Processing Systems 28, 2015.
[A]:
Large-scale probabilistic prediction with and without validity guarantees