Researchers from MBZUAI and King's College London have developed a new prompting strategy called self-guided exploration to improve LLM performance on combinatorial problems. The method was tested on complex challenges like the traveling salesman problem. The findings will be presented at the 38th Annual Conference on Neural Information Processing Systems (NeurIPS) in Vancouver. Why it matters: This research could lead to practical applications of LLMs in industries like logistics, planning, and scheduling by offering new approaches to computationally complex problems.
This article discusses a talk by Gábor Lugosi on "network archaeology," specifically the problems of root finding and broadcasting in large networks. The talk addresses discovering the past of dynamically growing networks when only a present-day snapshot is observed. Lugosi's research interests include machine learning theory, nonparametric statistics, and random structures. Why it matters: Understanding the evolution and origins of networks is crucial for various applications, including analyzing social networks, biological systems, and the spread of information.
Alexander Gasnikov from the Moscow Institute of Physics and Technology presented a talk on open problems in convex optimization. The talk covered stochastic averaging vs stochastic average approximation, saddle-point problems and accelerated methods, homogeneous federated learning, and decentralized optimization. Gasnikov's research focuses on optimization algorithms and he has published in NeurIPS, ICML, EJOR, OMS, and JOTA. Why it matters: While the talk itself isn't directly related to GCC AI, understanding convex optimization is crucial for advancing machine learning algorithms used in the region.
MBZUAI researchers presented a study at NAACL 2024 analyzing errors made by open-source LLMs when solving math word problems. The study, led by Ekaterina Kochmar and KV Aditya Srivatsa, investigates characteristics that make math word problems difficult for machines. Llama2-70B was used to test the ability of LLMs to solve these problems, revealing that LLMs can perform math operations correctly but still give the wrong answer. Why it matters: The research aims to improve AI's ability to understand and solve math word problems, potentially leading to better educational applications and teaching methods.
Abu Dhabi's Technology Innovation Institute (TII) has developed a new quantum optimization solver in collaboration with NVIDIA, Los Alamos National Laboratory, and Caltech. The solver addresses large-scale combinatorial optimization problems using a small number of qubits, encoding over 7000 variables with only 17 qubits. Published in Nature Communications, the research demonstrates a hybrid quantum-classical algorithm with a novel encoding scheme that maximizes the use of quantum resources. Why it matters: This advancement marks a significant step toward practical quantum computing applications in the UAE and beyond, particularly in solving complex optimization challenges across various sectors.
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.
CINVESTAV-IPN's Computer Science Department hosted a seminar by Prof. Francisco Rodriguez-Henriquez on isogeny-based key exchange protocols. The talk reviewed Supersingular Isogeny-based Diffie-Hellman (SIDH) and Commutative Supersingular Isogeny-based Diffie-Hellman (CSIDH). Isogeny-based protocols offer short key sizes but have higher latency compared to other post-quantum cryptosystems. Why it matters: This seminar contributes to the exploration of post-quantum cryptography, an important area for ensuring data security against future quantum computing threats.
Prof. Daniel Panario gave a seminar on irreducible polynomials over finite fields and their applications in cryptography. The seminar covered how finite fields are used as basic components in many cryptographic applications. It surveyed families of irreducible polynomials and commented on their properties. Why it matters: The talk highlights the mathematical foundations and ongoing research relevant to cryptographic implementations in the region.