A Mérnöki és Üzleti Intelligencia Kutatólaboratórium meghív minden érdeklődőt Algo Carè (Department of Information Engineering, University of Brescia, Italy) 2018. június 13-án 10 órakor kezdődő, 'A Coverage Theory for Least-Squares Decisions' című előadására.
Az előadás absztraktja: Since its early applications by Gauss and Legendre around 1800, the least-squares method has been used in countless applications, and is today a standard tool in many fields, including control theory, system identification, machine learning, econometrics, etc. In this talk, we refer to least-squares as a methodology to make decisions based on a finite sample of data. For example, the problem of deciding the location of a station that serves a population can be addressed as follows: sample a set of potential clients and then choose the location by minimising the sum of quadratic cost functions representing the squared home-service distances, possibly weighted by some client-dependent penalisation parameter. Once the location of the service station has been determined based on a sample, one can wonder how good the decision is for the rest of the population. For example, one can evaluate the costs – as measured by the home-service distance – paid by the individuals in the sample, and ask how representative these costs are of the level of dissatisfaction of the whole population. In spite of the popularity of the least-squares method and the many theoretical investigations related to it, this problem has so far received little attention from the statistical community. In this talk, we start considering the question as to whether the empirical proportion of members in the sample that pay a cost above a given value is a valid statistic for quantifying the proportion of the whole population that pays a cost above that given value. The answer to this question is "no", because the least-squares solution has a bias towards making small the cost for the members in the sample. However, we will show that, by introducing suitable margins, valid and tight statistics can be obtained which hold true distribution-free, that is, these statistics can be applied without using any extra knowledge on how the population distributes. In the course of the seminar, this result will be put in the wider context of the quest for guaranteed data-driven decision methods, with references to recent applications, such as control and machine learning algorithms.
Az előadással kapcsolatos legfontosabb publikáció: A. Carè, S. Garatti, M. C. Campi: “A Coverage Theory for Least Squares”, Journal of the Royal Statistical Society: Series B (Statistical Methodology), 7-9(5):1367-1389, 2017
Az előadóról: Algo Carè received the Ph.D. degree in informatics and automation engineering from the University of Brescia, Italy, in 2013. He is currently a Research Fellow with the Department of Information Engineering at the same university. He spent two years at The University of Melbourne, Melbourne, VIC, Australia, as a Research Fellow in system identification with the Department of Electrical and Electronic Engineering. Dr. Carè was a recipient of a two-year ERCIM Fellowship in 2016 that he spent at the Institute for Computer Science and Control (SZTAKI), Hungarian Academy of Sciences (MTA), Budapest, Hungary, and at the Multiscale Dynamics Group, National Research Institute for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands. He received the triennial Stochastic Programming Student Paper Prize by the Stochastic Programming Society for the period 2013 – 2016. His current research interests include data-driven decision methods, system identification, and learning theory.
Az előadás nyelve: angol.
Az esemény nyilvános, minden érdeklődőt szeretettel látunk!