HN user

tuned

65 karma

www.tuned.org.uk

Posts27
Comments31
View on HN
www.amazon.com 17d ago

Syntethic Intelligence: from IT to AI, a semantic revolution

tuned
2pts0
www.tuned.org.uk 5mo ago

Graph Wiring: speed, accuracy, RAG-focused

tuned
2pts0
www.tuned.org.uk 6mo ago

Starting from scratch: Training a 30M Topological Transformer

tuned
144pts58
github.com 6mo ago

Show HN: A concept implementation for a faster Transformer [pdf]

tuned
2pts0
economyoftime.net 8mo ago

Metamaterials-Inspired Software Engineering

tuned
1pts0
github.com 8mo ago

A Rust+Burn Implementation for Nanochat

tuned
2pts1
www.tuned.org.uk 8mo ago

Show HN: Spectral Indexing, from concept to paper to alpha in 45 days

tuned
2pts0
www.tuned.org.uk 9mo ago

DeepSeek-OCR Compression Meets Energy Search

tuned
3pts1
crates.io 9mo ago

DeepSeek-OCR compression in readable Rust

tuned
3pts1
www.tuned.org.uk 9mo ago

Show HN: Beyond geometric similarity in vector databases

tuned
1pts0
www.tuned.org.uk 9mo ago

Better vector search with graphs and spectral indexing

tuned
7pts0
www.tuned.org.uk 10mo ago

Show HN: Spectral Indexing for Vector Search

tuned
3pts0
www.tuned.org.uk 10mo ago

ArrowSpace: A primer for spectral indexing in vector search

tuned
1pts0
medium.com 5y ago

Grow Mycelium, a Metabolic Wonder

tuned
1pts1
news.ycombinator.com 7y ago

Ask HN: Are olive trees plantations viable as Mars colony's food primer?

tuned
1pts0
medium.com 8y ago

Going down into Quantum Computing

tuned
1pts0
www.youtube.com 8y ago

Video File: Solar System's First Interstellar Visitor Dazzles Scientists

tuned
1pts0
www.linkedin.com 8y ago

Python+HYDRA: RDF for Automated REST APIs

tuned
1pts0
www.businessinsider.com.au 9y ago

Oldest Evidence of Life Found in Australian Pond

tuned
3pts0
medium.com 10y ago

“Personal History of Computing – Part 1”

tuned
2pts0
medium.com 10y ago

Microservice on-top of distributed filesystem for NASA data

tuned
3pts1
news.ycombinator.com 10y ago

A Riddle About Love and Coding

tuned
2pts0
github.com 10y ago

High Performance Microservice for Orbital GIS Data

tuned
2pts0
thndr.it 11y ago

Young Hackers in Orbit with Low-Cost Launchers and Cubesats? It Can Be Done

tuned
1pts0
news.ycombinator.com 12y ago

SpaceXplore.It

tuned
2pts0
news.ycombinator.com 12y ago

XplorationApp – Project Chronos -Demo Out

tuned
1pts0
www.spacexplore.it 12y ago

XplorationApp – REST for Apps about Space Missions (SpaceApps Intl Challenge)

tuned
1pts0
[dead] 17 days ago

trying to generate images and sounds from eigenvectors as harmonic basis

[dead] 4 months ago

Measuring structural information. Check out the paper, notebooks and Python library

This is obviously not powerful enough to express non-linear relationships - like graph relationships.

the distance metrics used is based on energy-informed graphs that encode energy relations in a distribution called taumode, see my previous paper on spectral indexing for vector databases for a complete roll-out

also: precomputing a sparse Laplacian for N vectors at dimension D (NxD) is infinitely cheaper (if using `arrowspace`, my previous paper) than computing distances on the same full dense vectors billions of times. There are published tests that compute a Laplacian on 300Kx384 space in 500 secs on a laptop on CPU. So it is a trade-off: potentially few minutes of pretaining or hours of dot-product on dense matrices

it made sense to me as it is a very simple idea I guess: causal self-attention compute QKV distances computing on the full vectors for Q,K and V; the topological transformer can provide the same computation using Q, scalar K and V. Instead of [N², N², N²] -> [N², N, N²] is used. If generation is confirmed to be on par in terms of quality, the gains are evident.

it most-likely will in terms of performance as it uses 50% less memory (for sure it will at inference time that is the most used operation on web services), because it can leverage longer T and D if the design is confirmed and the quality of generation is comparable to other models. If this very basic assumption is correct, it means a lot of savings in electricity as the same GPUs can resolve more requests.

comparisons will be run when the quality of generation will be on pair with other available models. It is useless to have preformance if the quality is not at lease on par.

The paper runs a bench (code and bench in the paper) to compare the performance with a causal attention GPT-2 model (nanoGPT) at inference (20% faster) and at training (equivalent for T and D larger than a threshold).

This is a novel re-interpretation of the Transformer, based on my previous research made with a library called `arrowspace`.

It is somehow what is called a "Grassmann-like flow" but without the Plucker embedding, or also similar to what is done in DavisTensor but relying on spectral Laplacian instead of purely geometric distances.

The problem with a lot of stuff done before is that it focuses on dense representations. This architecture is focuses on sparse representation and provides a new approximation computation based on energy-informed graphs.

thanks for reading. I cannot retrain an existing model as the self-attention mechanism has been completely redesigned. The Keys and Values in self-attention are stored as scalars, so a latent space with traditional weights does not make sense if used in the context of a topological transformer. The two latent spaces would be somehow equivalent eventually but they would store totally different values.

Model Architecture (gpt.rs)

Multi-layer Transformer: N stacked decoder blocks with pre-norm residual connections Rotary Position Embeddings (RoPE): Replaces learned positional encodings with rotary embeddings for better length generalization Multi-Query Attention (MQA): Reduces KV cache size by sharing key/value heads across query heads RMSNorm: Parameter-free normalization for stability (instead of LayerNorm) QK-norm: Normalizes queries and keys before attention to prevent numerical instability ReLU² MLP: Uses ReLU(x)² activation for better gradient flow on GPUs Softcap Logits: Bounds output logits using tanh(x/15)*15 to prevent extreme values

In this post, I demonstrate how DeepSeek's optical compression approach—treating rendered text as a visual medium—has been replicated in Rust using `burn.dev`, and how this compression primitive unlocks a new search paradigm in arrowspace v0.18.0: energy-informed retrieval that moves decisively beyond cosine similarity.

Location: Edinburgh, UK

Remote: No or partially

Willing to relocate: Yes, to London or Cambridge

Technologies: Python, HTTP, SQL (especially PostgreSQL), No-SQL (MongoDB, Redis, ...), REST, Semantic Web & Linked Data, Unit Testing, Web APIs, GIS, Functional Programming, Anything-even-Pizza-as-a-service. Very interested in testing professionally my Rust or GoLang knowledge.

Résumé/CV: https://medium.com/@lorenzogotuned https://www.linkedin.com/in/lorenzomoriondo/ https://github.com/Mec-iS

Email: tunedconsulting add_a_snail gmail add_a_domain

Interested in: Satellite data, BioTech, FinTech, Research spin-offs

Looking for: Permanent job with benefits in a well-established start-up or mid-sized mature company

In Italy we have http://www.bancaetica.it/ it's a 'popular' bank, it means that collects money on the local district to borrow to local/italian entrepreneurs. And it's ehical, it borrows only to projects with high levels of sustainability: green economy, innovation, alternative energies etc. Now it's quite up also the concept of 'social banking' http://www.social-banking.org/the-institute/what-is-social-b...