A Eureka machine that thinks like nature and explores what AI cannot

原始链接: https://iisc.ac.in/a-eureka-machine-that-thinks-like-nature-and-explores-what-ai-cannot/

一个包括印度科学理工学院(IISc)和圣路易斯华盛顿大学研究人员在内的多机构团队,开发出了一款突破性的神经形态伊辛机(Ising machine),标志着计算领域正从依赖摩尔定律的传统模式向外转型。这项发表在《自然-通讯》上的研究,介绍了一种利用福勒-诺德海姆(Fowler-Nordheim)量子隧穿物理效应的神经形态自动编码器,用于在复杂且崎岖的能量地形中进行导航。 尽管当前的人工智能擅长生成式任务,但在处理组合优化问题(如蛋白质折叠、复杂物流和密码学等计算领域中最“困难”的前沿问题)时往往表现吃力。这种新架构通过模拟自然过程,而非仅仅进行计算,从而在寻找最优解方面架起了桥梁。通过在FPGA板上实现这一架构,团队打造出了一个基于CMOS的可扩展系统,能够保证渐近收敛至最优解。 这项研究得益于在班加罗尔、特柳赖德和卡波卡恰举办的多次研讨会,展现了全球性的合作成果。研究表明,计算能力的下一次飞跃将不再取决于更小的制程节点,而是源于从根本上不同、且受大脑启发的架构,这种架构有能力解决目前即使是最先进的人工智能也无法处理的难题。

```Hacker News新 | 往期 | 评论 | 提问 | 展示 | 招聘 | 提交登录一个像自然一样思考并探索人工智能无法触及领域的“尤里卡机器” (iisc.ac.in)23 点 由 kunalsin9h 发布于 1 小时前 | 隐藏 | 往期 | 收藏 | 讨论 帮助 指南 | 常见问题 | 列表 | API | 安全 | 法律 | 申请 YC | 联系 搜索: ```
相关文章

原文

Neuromorphic Ising machine implemented on an FPGA board rapidly explores rugged energy landscapes with exponentially many competing possibilities, enabling fast discovery of near-optimal solutions for complex optimisation problems such as protein folding, where the search evolves from an unfolded chain through intermediate molten-globule states toward the most stable folded structure.

The hardest computational problems are not waiting for faster chips – they are waiting for machines that compute in a fundamentally different way.

A multi-institution team, emerging from the Telluride Neuromorphic and Cognition Engineering workshop in Colorado, and the Bangalore Neuromorphic Engineering Workshop (BNEW) at IISc, has built a neuromorphic computer that combines quantum-tunnelling physics with a brain-inspired architecture to find solutions to hard mathematical problems. Published in Nature Communications, the work introduces a new direction in quantum-inspired computing built on CMOS technology.

Today, AI models may have the capability to write novels and even steer a spacecraft. But give them a logistics network, a microchip to route, or a cryptographic lock, and they stall. These are combinatorial problems – among the most consequential unsolved frontiers in computing. The new study suggests that a neuromorphic autoencoder with a Fowler-Nordheim annealer can solve these problems at scale, with a guarantee of asymptotic convergence to the optimal solution.

Such an autoencoder does not simply compute a solution – it searches for one, the way natural processes navigate a complex energy landscape to settle into stability.

For decades, Moore’s law delivered the exponential gains that made “buy a faster computer” a viable strategy for tackling complex problems. But that era is approaching its limits. The next order of magnitude will not come from smaller process nodes, rather from architectures that think and compute differently.

The collaborative study was led by Shantanu Chakrabartty, Professor at Washington University in St Louis, whose research group has been investigating Fowler-Nordheim based neuromorphic architectures for many years. The team includes Chetan Singh Thakur, Professor at the Department of Electronic Systems Engineering, IISc. Other institutions involved in this research include Heidelberg University in Germany, The Johns Hopkins University in Baltimore and The University of California in Santa Cruz.

This work therefore represents a community of neuromorphic engineers from around the globe, who regularly meet and brainstorm ideas at the Bangalore Neuromorphic Engineering Workshop in Asia, the Telluride Neuromorphic Engineering Workshop in the Americas, and the CapoCaccia Neuromorphic Workshop in Europe. Together, they are shaping a new generation of machines designed for the hardest problems in computing.

REFERENCE:
Ahsan F, Maiti S, Chen Z, Kaiser J, Nandi A, Srivatsav M, Schemmel J, Andreou AG, Eshraghian J, Thakur CS, Chakrabartty S, Higher-order neuromorphic Ising machines—autoencoders and Fowler-Nordheim annealers are all you need for scalability, Nature Communications (2026).
https://doi.org/10.1038/s41467-026-71937-4

WEBSITE:
https://labs.dese.iisc.ac.in/neuronics/

 

联系我们 contact @ memedata.com