Seven papers authored by Computer Science researchers from Warwick have been accepted for publication at the 41st International Conference on Machine Learning, one of the top three global venues for machine learning research, which will be held on 21-27 July 2024 in Vienna, Austria:

• Agent-Specific Effects: A Causal Effect Propagation Analysis in Multi-Agent MDPs, by Stelios Triantafyllou, Aleksa Sukovic, Debmalya Mandal, and Goran Radanovic
• Dynamic Facility Location in High Dimensional Euclidean Spaces, by Sayan Bhattacharya, Gramoz Goranci, Shaofeng Jiang, Yi Qian, and Yubo Zhang (Accepted as a spotlight, among the top 13 percent of all accepted papers)
• High-Dimensional Kernel Methods under Covariate Shift: Data-Dependent Implicit Regularization, by Yihang Chen, Fanghui Liu, Taiji Suzuki, and Volkan Cevher
• Revisiting character-level adversarial attacks, by Elias Abad Rocamora, Yongtao Wu, Fanghui Liu, Grigorios Chrysos, and Volkan Cevher
• Reward Model Learning vs. Direct Policy Optimization: A Comparative Analysis of Learning from Human Preferences, by Andi Nika, Debmalya Mandal, Parameswaran Kamalaruban, Georgios Tzannetos, Goran Radanovic, and Adish Singla
• To Each (Textual Sequence) Its Own: Improving Memorized-Data Unlearning in Large Language Models, by George-Octavian Bărbulescu and Peter Triantafillou
• Towards Neural Architecture Search through Hierarchical Generative Modeling, by Lichuan Xiang, Łukasz Dudziak, Mohamed Abdelfattah, Abhinav Mehrotra, Nicholas Lane, and Hongkai Wen

We are happy to announce four promotions in the department:

• Dr Charilaos Efthymiou has been promoted to Associate Professor
• Dr Igor Carboni Oliveira has been promoted to Associate Professor
• Dr Hongkai Wen has been promoted to Professor
• Dr Weiren Yu has been promoted to Associate Professor

Many congratulations to our colleagues for all their achievements!

On this recent article in the Quanta magazine, Alex Dixon, who wrote in Haskell the first solver for the problem, commented:

For the past 50 years, Vector Addition Systems—a simple but powerful computational model—have been a topic of great interest in theoretical CS. The reachability problem in that model asks whether we can get from some configuration to another.

The problem sounds relatively easy on a first glance, and an exponential lower bound held firm for over 40 years. Work by excellent theoreticians, including familiar names from Warwick DCS, finally closed the difficulty of the problem in 2021, concluding that it is very, very difficult indeed.

One funded PhD position is available in the group of Dr Matthias C. Caro, who will join the Theory and Foundations group in the Department of Computer Science at the University of Warwick, UK, in Fall 2024. Candidates interested in the interactions between quantum computing and learning theory are encouraged to apply.

The Warwick CS theory group has strong ties with the Centre for Discrete Mathematics and its Applications (DIMAP) and, together with DIMAP, is one of the leading theory groups in Europe, with regular publications in top international conferences and journals in theoretical computer science. Moreover, the successful candidate will become a part of the exciting, interdisciplinary research initiative Warwick Quantum. Overall, the Department of Computer Science at Warwick offers an excellent research environment. It was ranked 4th in the latest UK research assessment in Research Excellence Framework (REF) in 2021.

PhD positions are available at the Theory and Foundations group in the Department of Computer Science, University of Warwick, UK. The group works on various aspects of theoretical computer science, including:

* automata and formal languages,
* logic and games,
* algorithmic game theory,
* online and dynamic algorithms,
* sublinear and streaming algorithms,
* parameterized complexity and structural graph theory,
* string algorithms,
* parallel algorithms,
* approximation algorithms,
* combinatorial and graph algorithms,
* random structures and randomized algorithms,
* computational complexity.

The group has strong ties with the Centre for Discrete Mathematics and its Applications (DIMAP), established in 2007 jointly with Warwick Mathematics Institute and Warwick Business School. Together with DIMAP, the group is one of the leading theory groups in Europe, with regular publications in top international conferences and journals in theoretical computer science.

The Department of Computer Science at Warwick offers an excellent research environment. It was ranked 4th in the latest UK research assessment in Research Excellence Framework (REF) in 2021. The University of Warwick is one of the founding members of the Alan Turing Institute.

The university campus is located on the border of two counties, West Midlands and Warwickshire, is about one hour train ride from London, and 15 minutes from Birmingham International Airport.

The applicants are expected to have a strong background in discrete mathematics, algorithms, or related topics with undergraduate and/or Master's degrees in Computer Science, Mathematics, or related disciplines. The position(s) will be fully funded, and the successful applicant(s) will be receiving a stipend at rate in line with current Research Councils UK rates.

If you are interested in this opening, please send an email to Dr Ramanujan Sridharan (r.maadapuzhi-sridharan@warwick.ac.uk) with a SINGLE .pdf file containing your CV and the names and email addresses of two references, by 24 November 2023. You are strongly encouraged to informally contact faculty members in the group you might want to work with prior to submitting your application.

Shortlisted candidates will be interviewed informally during the week of 4 December - 8 December, 2023.

List of faculty members in the group:

https://warwick.ac.uk/focs/people/<https://warwick.ac.uk/fac/sci/dcs/research/focs/people/>

Centre for Discrete Mathematics and its Applications:
https://warwick.ac.uk/dimap/<https://warwick.ac.uk/fac/cross_fac/dimap/>

Seven papers authored by Computer Science researchers from Warwick have been accepted for publication at the 37th Conference on Neural Information Processing Systems, 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, Hongkai Wen, and Guohao Lan
• Fully Dynamic k-Clustering in Õ(k) Update Time, by Sayan Bhattacharya, Martin Costa, Silvio Lattanzi, and Nikos Parotsidis
• Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks, by Jiayuan Ye, Zhenyu Zhu, Fanghui Liu, 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, Fanghui Liu, 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, Hongkai Wen, and Long Tran-Thanh
• Towards Unbounded Machine Unlearning, by Meghdad Kurmanji, Peter Triantafillou, and Eleni Triantafillou

We are delighted to announce that Peter Kiss, a PhD student in the Theory and Foundations Research Division, has received the best student paper award at European Symposium on Algorithms (ESA) 2023, for his joint work with Joakim Bilkstad 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.