We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
The expectation maximization (EM) algorithm is a popular algorithm for parameter estimation in models with hidden variables. However, the algorithm has several non-trivial limitat...
Variable selection is an important and practical problem that arises in analysis of many high-dimensional datasets. Convex optimization procedures that arise from relaxing the NP-...
With increasingly conceiving learning as a social activity, technological support must become more aware of the social context of the individual in order to be able to provide adeq...
This paper proposes a two-phase example-based machine translation methodology which develops translation templates from examples and then translates using template matching. This ...