Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
Abstract— Despite its simplicity (two controllers and otherwise LQG), Witsenhausen’s counterexample is one of the long-standing open problems in stochastic distributed control....
One of the main obstacles to the widespread use of artijcial neural networks is the difJiculty of adequately define valuesfor their free parameters. This article discusses how Rad...
Estefane G. M. de Lacerda, Teresa Bernarda Ludermi...
We consider the problem of optimality, in a minimax sense, and adaptivity to the margin and to regularity in binary classification. We prove an oracle inequality, under the margin ...
Abstract. In this paper, we propose a framework for learning the parameters of registration cost functions ? such as the tradeoff between the regularization and image similiarity t...
B. T. Thomas Yeo, Mert R. Sabuncu, Polina Gollan...