Resultado da Busca
Avrim Blum is a machine learning theorist and a professor at the Toyota Technological Institute at Chicago (TTIC). He works on topics such as algorithmic fairness, online algorithms, and mechanism design.
Avrim Blum. Proceedings of the eleventh annual conference on Computational learning …. Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on …. Proceedings of the twelfth annual conference on Computational learning …. A Blum, P Chalasani, D Coppersmith, B Pulleyblank, P Raghavan, ... Proceedings of the twenty-sixth annual ...
Avrim Louis Blum (born 27 May 1966) is a computer scientist. In 2007, he was made a Fellow of the Association for Computing Machinery "for contributions to learning theory and algorithms." Blum attended MIT, where he received his Ph.D. in 1991 under professor Ron Rivest.
Dr. Blum is a theoretical computer scientist and machine learning expert who joined TTIC in 2017. He has worked on topics such as approximation algorithms, game theory, privacy, and fairness, and received several awards and honors.
Avrim Blum. Professor of Computer Science. School of Computer Science. Carnegie Mellon University. Pittsburgh, PA 15213-3891. On August 1, 2017 I joined TTI-Chicago as its new CAO. My new homepage is http://www.ttic.edu/blum. My new email address is [firstname] at ttic.edu. My main research interests are in machine learning theory ...
Avrim Blum, John Hopcroft, and Ravindran Kannan Thursday 27th February, 2020 This material has been published by Cambridge University Press as Foundations of Data Science by Avrim Blum, John Hopcroft, and Ravi Kannan. This pre-publication version is free to view and download for personal use only.
Avrim Blum, Kavya Ravichandran: Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem. CoRR abs/2404.01198 ( 2024) 2023. [j62] Maria-Florina Balcan, Avrim Blum, Dravyansh Sharma, Hongyang Zhang: An Analysis of Robustness of Non-Lipschitz Networks.
