Nov 2026· IEEE Transactions on Very Large Scale Integration (vlsi) Systems· Vol 34, pp. 3604-3608· 0 citations· 17 references
Abstract
Spiking neural networks (SNNs) enable efficient on-chip learning but face a critical hardware challenge due to the computational asymmetry between small-kernel convolution operations in the feed-forward (FF) stage and large-kernel ones in the weight-gradient (WG) stage. Directly mapping these conflicting patterns onto a static architecture disrupts data locality, typically necessitating either disjoint processing units or redundant data movement, which severely compromises energy efficiency. This brief presents an architecture for unified learning in SNN (AULiS), a sparsity-aware accelerator supporting low-cost BFloat16 local learning (LL) via reconfigurable engines. Its core innovation is an algorithm-architecture codesign. We reformulate the WG stage into broadcast multiplications and map it to an output-stationary (OS) dataflow, newly applied to WG, complementing the weight-stationary (WS) dataflow used for FF. This strategy matches the distinct data-reuse characteristics of each stage: locking weights during FF and weight gradients during WG, allowing a single reconfigurable engine to process both, thereby minimizing data access and maximizing compute density and energy efficiency. Implemented in a 28-nm process, AULiS occupies 2.24 mm<sup>2</sup> and achieves this unification with only a 3.4% area overhead. The architecture reaches 23.0 TFLOPS/W in inference and 22.3 TFLOPS/W in training, in dense-equivalent FLOPs at 95% zero sparsity. In a fair comparison, this represents a <inline-formula> <tex-math notation="LaTeX">$3.78\times $ </tex-math></inline-formula> training and <inline-formula> <tex-math notation="LaTeX">$1.50\times $ </tex-math></inline-formula> inference improvement in normalized energy efficiency over prior SOTA while delivering up to <inline-formula> <tex-math notation="LaTeX">$10.64\times $ </tex-math></inline-formula> higher normalized compute density. The high and balanced efficiencies prove that learning can be unified with high-performance inference without efficiency compromise for adaptive edge artificial intelligence (AI).
This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.
P. Abrahamsson, O. Salo, Jussi Ronkainen et al.· arXiv.org· 727 citations· ⚡54
The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.
M. Pikkarainen, Jukka Haikara, O. Salo et al.· Empirical Software Engineeri...· 401 citations· ⚡48
The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.
Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al.· Information and Software Tec...· 394 citations· ⚡54
The perception of the impact of agile methods is predominantly positive, and several challenge areas were discovered, but based on this study, agile methods are here to stay.
M. Laanti, O. Salo, P. Abrahamsson· Information and Software Tec...· 260 citations· ⚡20
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.