See what’s next in edge AI at @computex_taipei 2025!
Join Axelera AI + Aetina in Taipei, 20–23 May, for: 4x4K Real-Time Analytics Fast & Accurate IC Sorting Powered by our Metis AI Platform.
Taipei Nangang Exhibition Center
#EdgeAI #AIInference
COMPUTING
-

Edge AI Analytics at Computex Taipei 2025
By
–
-
Handling Dynamic Document Updates in AI Retrieval Systems
By
–
For (2), documents that change and where you want the updates to be reflected quickly in the retrieval system can be challenging. You usually end up building a "fresh" layer of your system that has very different data structures that can handle updates/insertions, but that is
-
Knowledge Graphs Infrastructure Impact Web Corpus Scale
By
–
For (1), knowledge graphs help with lots of higher level kind of things, search presentation aspects, etc., but from an infrastructure perspective, they don't have a huge effect because they just aren't very large relative to the web corpus.
-
Groq’s LPU Chip: Shaping AI Inference Future Today
By
–
Groq saw inference coming almost a decade ago – it's why the LPU, our purpose-built chip, is shaping what's possible for AI inference today. Learn more in this @PracticalAIFM episode where @djays shares his insights for tech leaders. Listen here:
-
60% Compute Savings Achievement for Large Model Training
By
–
The result: up to 60% compute savings (!)
That’s a massive impact for training large models efficiently. -

SF Compute: Commoditizing the Compute Market
By
–
SF Compute: Commoditizing Compute https://
latent.space/p/sfcompute We're excited for our latest deep dive into the compute market with @evanjconrad of @sfcompute! It should not be normal for the prices of one of the world’s most important resources right now to swing from $8 to $1 -

Text embeddings rediscover BM25 core principles during training
By
–
-> Researchers show that text embeddings methods re-discover BM25 from scratch during training! Far from abandoning standard search techniques like BM25, it appears that neural search methods naturally re-implement their core principles. Let's you have a search query like
-
In-Memory Index Redundancy and Distributed Cluster Architecture
By
–
The problem was that an in memory index, because of its size, did not have the same level of redundancy on a per-cluster basis as a disk-based index (e.g. usually every page was present in the memory of just a single machine).
-
Unpublished Search Systems Work from 2009 Conference Talk
By
–
We never really published any papers about lots of interesting systems work that underlies our search systems, so this relatively little known talk I gave at the Web Search and Data Mining conference in 2009 is the best public source of info.
-
Google Search Evolution: From Disk to In-Memory Systems
By
–
Someone just reminded me of this lecture I gave in 2009 that described the evolution of Google Search from 1999 to 2009. People who are interested in how our search systems work might find this interesting. It touches on disk-based serving systems, in-memory indices,