A KAUST-led team in collaboration with Japan's National Institute of Informatics and Cray Inc. has implemented a new algorithm to harness the power of supercomputers. The algorithm integrates new singular value decomposition (SVD) codes into Cray LibSci scientific libraries, supporting machine learning and data de-noising applications. This was achieved through the Cray Center of Excellence (CCOE) at KAUST, established in 2015. Why it matters: The new algorithm helps to optimize the use of advanced supercomputing infrastructure in the region, specifically KAUST's Shaheen II, for computationally intensive AI applications.
KAUST researchers developed a machine learning algorithm to control a deformable mirror within the Subaru Telescope's exoplanet imaging camera, compensating for atmospheric turbulence. The algorithm, which computes a partial singular value decomposition (SVD), outperforms a standard SVD by a factor of four. The KAUST team received a best paper award at the PASC Conference for this work, which has already been deployed at the Subaru Telescope. Why it matters: This advancement enables sharper images of exoplanets, facilitating their identification and study, and showcases the impact of optimizing core linear algebra algorithms.
KAUST researchers collaborated with the Paris Observatory and the National Astronomical Observatory of Japan (NAOJ) to develop advanced Extreme-AO algorithms for habitable exoplanet imaging. The new algorithms, powered by KAUST's linear algebra code running on NVIDIA GPUs, optimize and anticipate atmospheric disturbances. The implemented Singular Value Decomposition (SVD) algorithm won an award at the PASC Conference 2018 and is used at the Subaru Telescope in Hawaii. Why it matters: This advancement enhances the ability to image exoplanets, potentially leading to breakthroughs in the search for habitable planets using ground-based telescopes.
Researchers introduce SALT, a parameter-efficient fine-tuning method for medical image segmentation that combines singular value adaptation with low-rank transformation. SALT selectively adapts influential singular values and complements this with a low-rank update for the remaining subspace. Experiments on five medical datasets show SALT outperforms state-of-the-art PEFT methods by 2-5% in Dice score with only 3.9% trainable parameters.
A new mini-batch strategy using aggregated relational data is proposed to fit the mixed membership stochastic blockmodel (MMSB) to large networks. The method uses nodal information and stochastic gradients of bipartite graphs for scalable inference. The approach was applied to a citation network with over two million nodes and 25 million edges, capturing explainable structure. Why it matters: This research enables more efficient community detection in massive networks, which is crucial for analyzing complex relationships in various domains, but this article has no clear connection to the Middle East.
KAUST is hosting a workshop on distributed training in November 2025, led by Professors Peter Richtarik and Marco Canini, focusing on scaling large models like LLMs and ViTs. Richtarik's team recently solved a 75-year-old problem in asynchronous optimization, developing time-optimal stochastic gradient descent algorithms. This research improves the speed and reliability of large model training and supports applications in distributed and federated learning. Why it matters: KAUST's focus on scalable AI and federated learning contributes to Saudi Arabia's Vision 2030 goals and addresses critical challenges in AI deployment and data privacy.
This talk discusses the asymptotic study of large asymmetric spiked tensor models. It explores connections between these models and equivalent random matrices constructed through contractions of the original tensor. Mohamed El Amine Seddik, currently a senior researcher at TII in Abu Dhabi, presented the work. Why it matters: The research provides theoretical foundations relevant to machine learning algorithms that leverage low-rank tensor structures, potentially impacting AI research and applications in the region.
KAUST Ph.D. student Jinhui Xiong won the best paper award at the 24th International Symposium on Vision, Modeling, and Visualization in Germany for his paper "Stochastic Convolutional Sparse Coding". The paper, co-authored with KAUST Professors Peter Richtárik and Wolfgang Heidrich, introduces a novel stochastic spatial-domain solver for Convolutional Sparse Coding (CSC). The proposed algorithm outperforms state-of-the-art solutions in terms of execution time and offers an improved representation for learning dictionaries from sample images. Why it matters: This award recognizes significant research in efficient image representation and dictionary learning, contributing to advancements in visual computing and AI at KAUST.