It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
Abstract. The standard business model in the sponsored search marketplace is to sell click-throughs to the advertisers. This involves running an auction that allocates advertisemen...
Sai-Ming Li, Mohammad Mahdian, Randolph Preston Mc...
In this paper we propose an Rprop modification that builds on a mathematical framework for the convergence analysis to equip Rprop with a learning rates adaptation strategy that en...
Aristoklis D. Anastasiadis, George D. Magoulas, Mi...
One of the main dif culties in echo cancellation is the fact that the learning rate needs to vary according to conditions such as double-talk and echo path change. Several methods...