量子位·2025-05-18 02:01Core Viewpoint - AlphaEvolve, developed by Google DeepMind and top scientists, has achieved a breakthrough in matrix multiplication efficiency, reducing the scalar multiplications for 4x4 matrices from 49 to 48, marking a significant advancement in computational mathematics [1][3][4]. Group 1: Breakthrough Achievements - AlphaEvolve's mathematical capabilities are compared to AlphaGo's legendary moves, indicating its high level of performance in algorithm discovery [2]. - The new algorithm not only solves complex mathematical problems but also enhances chip design and improves efficiency in data centers and AI training, achieving a 23% acceleration in matrix multiplication operations within the Gemini architecture [5][19]. Group 2: Technical Innovations - The key to AlphaEvolve's success lies in its ability to allow AI to "explore freely," leading to the discovery of a new algorithm that utilizes 48 scalar multiplications for 4x4 complex matrices [10][12]. - AlphaEvolve builds on the Alpha Tensor framework, incorporating evolutionary algorithms to iteratively generate and optimize candidate algorithms without relying on traditional heuristics [12][21]. Group 3: Algorithm Development Process - The research team utilized a two-year development of Alpha Tensor, which initially focused on Boolean matrices, and then expanded to complex matrices, leading to the discovery of a more efficient algorithm [11][14]. - The system's architecture allows for asynchronous distributed processing, enabling parallel evolution of different algorithms across multiple computational nodes [39][40]. Group 4: Evaluation and Optimization - An automated evaluation system is crucial for quantifying and selecting algorithms, ensuring continuous optimization through multi-dimensional metrics and feedback loops [30][31]. - The evaluation results guide further improvements, focusing on enhancing efficiency while maintaining accuracy in algorithm performance [35][36]. Group 5: Future Directions - The performance of AlphaEvolve is closely tied to advancements in foundational language models, suggesting that future improvements could enhance algorithm discovery efficiency [43]. - The system has shown potential for recursive self-improvement, indicating a path towards a self-optimizing loop that could significantly reduce computation time for complex problems [44][46].