糖心TV

Seven papers authored by Computer Science researchers from 糖心TV have been accepted for publication at the , the leading international venue for machine learning research, which will be held on 10-16 December 2023 in New Orleans, Louisiana, USA:

• EV-Eye: Rethinking High-frequency Eye Tracking through the Lenses of Event Cameras, by Guangrong Zhao, Yurun Yang, Jingwei Liu, Ning Chen, Yiran Shen, , and Guohao Lan
• Fully Dynamic k-Clustering in 脮(k) Update Time, by , , Silvio Lattanzi, and Nikos Parotsidis
• Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks, by Jiayuan Ye, Zhenyu Zhu, , Reza Shokri, and Volkan Cevher
• Learning a Neuron by a Shallow ReLU Network: Dynamics and Implicit Bias for Correlated Inputs, by Dmitry Chistikov, Matthias Englert, and Ranko Lazic
• On the Convergence of Shallow Transformers, by Yongtao Wu, , Grigorios Chrysos, and Volkan Cevher
• Towards Data-Agnostic Pruning At Initialization: What Makes a Good Sparse Mask? by Hoang Pham, The Anh Ta, Shiwei Liu, Lichuan Xiang, Dung Le, , and Long Tran-Thanh
• Towards Unbounded Machine Unlearning, by Meghdad Kurmanji, Peter Triantafillou, and Eleni Triantafillou

We are happy to announce that Dr Ayse Saliha Sunar has joined the Department of Computer Science as a Teaching Fellow. She completed her Master's degree on Intelligent Tutoring Systems at Nagoya University and her PhD on Big Educational Data Analysis and Recommender Systems at the University of Southampton.

She then gained experience in teaching in Turkey and in research collaboration, including European project proposals in Slovenia on integrating cutting-edge technologies into educational and other social contexts. Her current research interests include technology-enhanced learning to improve teachers' and faculties' pedagogical skills, as well as applications of natural language processing in classrooms and hybrid teaching models.

We welcome her to the department!

We are delighted to announce that , a PhD student in the Theory and Foundations Research Division, has received the best student paper award at , for his joint work with for the paper: "Incremental (1-eps)-approximate dynamic matching in O(poly(1/eps)) update time". The paper considers the problem of maintaining a large matching in a graph that is undergoing a sequence of edge insertions. They present an algorithm for this fundamental problem in dynamic graph algorithms, which has near-optimal approximation ratio and an update time that does not grow at all with the size of the input and is also polynomial in 1/\eps (the error parameter). In addition, their approach is simpler than previous algorithms on the same problem that achieved weaker guarantees.