When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
—When building software systems, developers have to weigh the benefits of using one specific solution approach against the risks and costs of using another one. This process is...
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
This paper studies the optimization of observation channels (stochastic kernels) in partially observed stochastic control problems. In particular, existence, continuity, and convex...