We critically review three major theories of machine learning and provide a new theory according to which machines learn a function when the machines successfully compute it. We show that this theory challenges common assumptions in the statistical and the computational learning theories, for it implies that learning true probabilities is equivalent neither to obtaining a correct calculation of the true probabilities nor to obtaining an almost-sure convergence to them. We also briefly discuss some case studies from natural language processing and macroeconomics from the perspective of the new theory.
Rolling Day-Wise Mortality Prediction in Critically Ill Patients With AKI on CRRT Utilizing Machine Pressure Waveforms
University of Alabama at Birmingham(阿拉巴马大学伯明翰分校);University of Cincinnati(辛辛那提大学);Icahn School of Medicine at Mount Sinai(西奈山伊坎医学院);UT Southwestern Medical Center(德克萨斯大学西南医学中心)
Analyzing the Machine Learning Conference Review Process
University of California, Berkeley(加州大学伯克利分校);Princeton University(普林斯顿大学);Centennial High School(百年高中);Harvard University(哈佛大学);University of Maryland, College Park(马里兰大学帕克分校)
An Open Review of OpenReview: A Critical Analysis of the Machine Learning Conference Review Process
University of California, Berkeley(加州大学伯克利分校);Princeton University(普林斯顿大学);Centennial High School(百年高中);Harvard University(哈佛大学);University of Maryland, College Park(马里兰大学帕克分校);University of Maryland College Park(马里兰大学帕克分校)