TASK DEFINITION: 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.
PROBLEM: We propose a localized approach to multiple kernel learning that can be formulated as a convex optimization problem over a given cluster structure. For which we obtain generalization error guarantees and derive an optimization algorithm based on the Fenchel dual representation. Experiments on real-world datasets from the application domains of computational biology and computer vision show that convex localized multiple kernel learning can achieve higher prediction accuracies than its global and non-convex local counterparts.

SOLUTION: Localized Multiple Kernel Learning—A Convex Approach

PROBLEM: There is a brief description of the probabilistic causal graph model for representing, reasoning with, and learn­ ing causal structure using Bayesian networks. It is then argued that this model is closely related to how humans reason with and learn causal structure. It is shown that studies in psychology on discounting (reasoning concern­ ing how the presence of one cause of an effect makes an­ other cause less probable) support the hypothesis that humans reach the same judgments as algorithms for do­ ing inference in Bayesian networks. Next, it is shown how studies by Piaget indicate that humans learn causal structure by observing the same independencies and de­ pendencies as those used by certain algorithms for learn­ ing the structure of a Bayesian network. Based on this indication, a subjective definition of causality is for­ warded. Finally, methods for further testing the accu­ racy of these claims are discussed.

SOLUTION: THE CoGNITIVE PROCESSING OF CAUSAL KNOWLEDGE

PROBLEM: Inverse optimal control, also known as inverse reinforcement learning, is the problem of recovering an unknown reward function in a Markov decision process from expert demonstrations of the optimal policy. We introduce a probabilistic inverse optimal control algorithm that scales gracefully with task dimensionality, and is suitable for large, continuous domains where even computing a full policy is impractical. By using a local approximation of the reward function, our method can also drop the assumption that the demonstrations are globally optimal, requiring only local optimality. This allows it to learn from examples that are unsuitable for prior methods.

SOLUTION:
Continuous Inverse Optimal Control with Locally Optimal Examples