I'm a first-year Computer Science PhD student at the University of Maryland, College Park.
My research interests span machine learning, computational social science, and computational economics.
The Muffin Problem
Given m muffins and s students, how can the muffins be divided evenly among the students, such that we maximize the smallest piece of muffin? In pursuit of solving this challenge, I worked with Prof. William Gasarch and a team of students creating a battery of techniques, delving into combinatorics, algorithms, mixed integer programming, and topology. I developed a method that used combinatorial approaches to derive upper bounds on the smallest piece of muffin, for certain cases of m and s, and created an algorithm to automatically generate these bounds.
Aspects of our work were published in the 9th International Conference on FUN with Algorithms (FUN 2018), a premier conference in the use of algorithms for results that are amusing, but nonetheless “scientifically profound”. I am also a co-author of the book, Mathematical Muffin Morsels, published by World Scientific.
Multimodal Exercise Assistance
Helping individuals maintain exercise behaviors has long been a subject of study within health informatics. After seeing extensive research on mobile apps for this purpose, we decided to investigate the potential of smart speakers, such as the Amazon Echo. Together with my advisor, Prof. Eun Kyoung Choe, and our collaborator from Microsoft Research, Dr. Bongshin Lee, we developed a study comparing the effectiveness of smart speaker skills versus mobile apps in encouraging consistent exercise behavior. As the main investigator in this project, I was instrumental in our collective decisions on our study design, applying for IRB approval, and implementing the mobile app, smart speaker skill, and database to integrate the tracking data collected by either device.
We submitted this study proposal and successfully published it in the 2018 CHI Conference on Human Factors in Computing Systems, Late Breaking Works track, where I presented a poster on our work, as the first author.
GANs for Anomaly Detection
During the summer of 2018, I participated in the Indiana University-Purdue University of Indianapolis (IUPUI) Data Science NSF REU, conducting research with another undergraduate student and a graduate student under our advisor Prof. George Mohler. We further developed a technique for anomaly detection with generative adversarial networks (GANs). After finding lower-dimensional embeddings of image data with bidirectional GANs, we used the infinite-gaussian mixture model clustering algorithm to find an “anomalous” class. We applied this technique to human mobility data, successfully distinguishing different drivers based on their GPS data.
We have published and presented this work in the 5th National Symposium for NSF REU Research in Data Science, Systems, and Security as part of the 2018 IEEE Big Data Conference.
Smolyak, D., Gray, K., Badirli, S., & Mohler, G. "Coupled IGMM-GANs with Applications to Anomaly Detection in Human Mobility Data". ACM Transactions on Spatial Algorithms and Systems, 2020. (link)
Gasarch, W., Metz, E., Prinz, J., Smolyak, D. Mathematical Muffin Morsels. World Scientific, 2019. (link)
Smolyak, D., Lee, B., & Choe, E. K. "TandemTrack: Promoting Consistent Exercise Leveraging Multimodal Training and Tracking". Extended Abstracts of the CHI Conference on Human Factors in Computing Systems, 2018. (link)
Cui, G., Dickerson, J., Durvasula, N., Gasarch, W., Metz, E., Prinz, J., Raman, N., Smolyak, D. & Yoo, S. H. "A Muffin-Theorem Generator". International Conference on Fun with Algorithms (FUN), 2018. (link)
Canakci, B., Christenson, H., Fleischman, R., McNabb, N., & Smolyak, D. "On SAT Solvers and Ramsey-type Numbers". Presented at American Mathematical Society Fall Eastern Sectional Meeting, 2015. (link)
Feel free to reach out to me!
dsmolyak [at] umd [dot] edu
Copyright © Daniel Smolyak 2020