aspireai.
PUBLIC EDITION

An open-source Postgres extension brings filtered vector search into the database you already run

AspireAI community · Pinecone
Most teams that want vector search and already run Postgres end up adding a second system, and the usual in-database option - a graph index like HNSW - gets expensive to scale, takes a long time to build, and degrades accuracy when a query is filtered, because the filter is applied after the graph narrows the candidates. pg_pinecone is an Apache 2.0 Postgres extension that indexes the vector columns you already have in pgvector, with an index that stores a compact summary of each vector instead of a graph, so search stays fast on a small memory footprint and indexes build quickly. The filter is applied during search rather than after it, so a query scoped to one tenant still returns a full set of results, and the data never leaves Postgres - your tables and the full vectors stay where they are and Postgres remains the system of record. The honest caveat is that it is a first-party release from the vendor whose engine runs at scale behind it, and the benchmarks are the vendor's own.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.