Live data from Hacker News

Viewing profile — tuned

tuned

HN member
Joined
Sat, Dec 28, 2013, 1:08 PM UTC
HN karma
65
Public activity
65 items

About tuned

www.tuned.org.uk

Recent public activity

  1. story
  2. story
  3. comment
    Comment #48804247

    trying to generate images and sounds from eigenvectors as harmonic basis

  4. story
  5. story
  6. comment
    Comment #47516290

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

  7. story
  8. story
  9. comment
    Comment #46716976

    ok, thanks. I am taking it slow then

  10. comment
    Comment #46675848

    no, from my point of view is being more domain-focused instead of going full-orthogonal.

  11. comment
    Comment #46675839

    right. this is a proposal that needs to be tested. I started testing it on 30M parameters then I will move to a 100M and evaluate the generation on domain-specific assisting tasks

  12. comment
    Comment #46675822

    > 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 ene…

  13. comment
    Comment #46675806

    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 …

  14. comment
    Comment #46675769

    if you have a corpus of code snippets to train the manifold (Laplacian) on (and a good embedding model), it is definitely possible to try something like this.

  15. comment
    Comment #46675701

    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 pr…

  16. comment
    Comment #46675678

    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…

  17. comment
    Comment #46675640

    Thanks to all that have read. I would be glad to answer further scoped questions on the content of the post and the paper. I answered some comments that may clarify the ideas from …

  18. comment
    Comment #46675624

    the idea is to have a lot of "narrow" models to work with RAG instead of one model for all the knowledge domains or also distil the metadata that is currently in enterprise Knowled…

  19. comment
    Comment #46675619

    exactly, that is the current objective. To proove that generation for a specific domain is on-par with causal attention models

  20. comment
    Comment #46675599

    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 pap…

  21. comment
    Comment #46675574

    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" bu…

  22. comment
    Comment #46675557

    thanks for linking. Yes the paper compares the new architecture (that is also a fork of my implementation of nanoGPT) with Karpathy's nanoGPT. There are also links to the code and …

  23. comment
    Comment #46675547

    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, …

  24. story
  25. story