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...
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
Abstract. Multi-hop wireless networks provide a quick and easy way for networking when we need a temporary network or when cabling is difficult. The 802.11 Medium Access Control (M...
Socio-technical developments in computing have resulted in the emergence of innovative mobile systems which exploit the information available on the Internet to optimize the perfo...
Pravin Pawar, Bert-Jan van Beijnum, Hermie Hermens...
Linear projection equations arise in many optimization problems and have important applications in science and engineering. In this paper, we present a recurrent neural network fo...