An underdetermined linear system of equations Ax = b with non-negativity constraint x 0 is considered. It is shown that for matrices A with a row-span intersecting the positive o...
Alfred M. Bruckstein, Michael Elad, Michael Zibule...
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
In many applications, data appear with a huge number of instances as well as features. Linear Support Vector Machines (SVM) is one of the most popular tools to deal with such larg...
Cho-Jui Hsieh, Kai-Wei Chang, Chih-Jen Lin, S. Sat...
We present new algorithms for inverse optimal control (or inverse reinforcement learning, IRL) within the framework of linearlysolvable MDPs (LMDPs). Unlike most prior IRL algorit...
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...