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.
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.
The paper introduces ScoreAdv, a novel approach for generating natural adversarial examples (UAEs) using diffusion models. It incorporates an adversarial guidance mechanism and saliency maps to shift the sampling distribution and inject visual information. Experiments on ImageNet and CelebA datasets demonstrate state-of-the-art attack success rates, image quality, and robustness against defenses.
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.
A talk introduces a computational framework for learning a compact structured representation for real-world datasets, that is both discriminative and generative. It proposes to learn a closed-loop transcription between the distribution of a high-dimensional multi-class dataset and an arrangement of multiple independent subspaces, known as a linear discriminative representation (LDR). The optimality of the closed-loop transcription can be characterized in closed-form by an information-theoretic measure known as the rate reduction. Why it matters: The framework unifies concepts and benefits of auto-encoding and GAN and generalizes them to the settings of learning a both discriminative and generative representation for multi-class visual data.
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.
Pascal Fua from EPFL presented an approach to implementing convolutional neural nets that output complex 3D surface meshes. The method overcomes limitations in converting implicit representations to explicit surface representations. Applications include single view reconstruction, physically-driven shape optimization, and bio-medical image segmentation. Why it matters: This research advances geometric deep learning by enabling end-to-end trainable models for 3D surface mesh generation, with potential impact on various applications in computer vision and biomedical imaging in the region.