KAUST Ph.D. student Lukas Larisch won the Parameterized Algorithms and Computational Experiments (PACE) 2017 Challenge in the Optimal Tree Decomposition Challenge, solving more instances than competitors. He received the award at the International Symposium on Parameterized and Exact Computation (IPEC 2017) in Vienna, Austria. Larisch is pursuing his Ph.D. at KAUST and working in the University's Extreme Computing Research Center, focusing on acoustics and graph structure theory. Why it matters: This recognition highlights KAUST's contribution to advanced computer science research and its ability to attract and foster talented researchers in niche areas like parameterized complexity.
MBZUAI PhD graduate William de Vazelhes is researching hard-thresholding algorithms to enable AI to work from smaller datasets. His work focuses on optimization algorithms that simplify data, making it easier to analyze and work with, useful for energy-saving and deploying AI models on low-memory devices. He demonstrated that his approach can obtain results similar to those of convex algorithms in many usual settings. Why it matters: This research could broaden AI accessibility by reducing computational costs, and has potential applications in sectors like finance, particularly for portfolio management under budgetary constraints.
Kimon Fountoulakis from the University of Waterloo presented a talk on machine learning on graphs, covering node classification and algorithmic reasoning. The talk discussed the limitations and strengths of graph neural networks (GNNs). It also covered novel optimal architectures for node classification and the ability of looped GNNs to execute classical algorithms. Why it matters: Understanding GNN capabilities is crucial for advancing AI applications in areas like recommendation systems and drug discovery that rely on relational data.
The National Institute of Standards and Technology (NIST) has been evaluating Post-Quantum Cryptography proposals since 2017. Lattice-based schemes have emerged as efficient candidates for Key Encapsulation Mechanisms (KEM) and Digital Signatures. This talk will cover the core operations within lattice-based schemes and efficient implementation strategies. Why it matters: As quantum computing advances, exploring and standardizing post-quantum cryptography is crucial for maintaining secure communication and data protection in the future.
The article discusses parameter-efficient fine-tuning methods for large NLP models, highlighting their importance due to the increasing size and computational demands of state-of-the-art language models. It provides an overview of these methods, presenting them in a unified view to emphasize their similarities and differences. Indraneil, a PhD candidate at TU Darmstadt's UKP Lab, is researching parameter-efficient fine-tuning, sparsity, and conditional computation methods to improve LLM performance in multilingual, multi-task settings. Why it matters: Efficient fine-tuning techniques are crucial for democratizing access to and accelerating the deployment of large language models in the region and beyond.
A cryptanalysis team at the UAE's Cryptography Research Center (CRC) has set new records in computation by decrypting a McEliece ciphertext without the secret key at INRIA’s McEliece decoding challenge, taking first and second place. The record computation took about 31.4 days on a cluster using 256 CPU-cores. The team also achieved top ranks in decoding quasi-cyclic codes and ternary codes, used in post-quantum cryptography. Why it matters: This achievement demonstrates the UAE's growing capabilities in advanced cryptography research and its contributions to the global effort to develop quantum-resistant algorithms.
The article mentions several KAUST faculty and staff, including Matteo Parsani (Assistant Professor of Applied Mathematics), Teofilo Abrajano (Director of Sponsored Research), and David Keyes (Director of the Extreme Computing Research Center). It also references a talk by NASA Senior Scientist Mark Carpenter at the SIAM CSE 2017 conference. The article includes a photograph of King Abdullah bin Abdulaziz Al Saud. Why it matters: This appears to be general information about KAUST faculty and activities, but lacks specific details on research or AI developments.
This paper addresses exploration in reinforcement learning (RL) in unknown environments with sparse rewards, focusing on maximum entropy exploration. It introduces a game-theoretic algorithm for visitation entropy maximization with improved sample complexity of O(H^3S^2A/ε^2). For trajectory entropy, the paper presents an algorithm with O(poly(S, A, H)/ε) complexity, showing the statistical advantage of regularized MDPs for exploration. Why it matters: The research offers new techniques to reduce the sample complexity of RL, potentially enhancing the efficiency of AI agents in complex environments.