drittich

7 ms·

1. 31.▲
   Data stolen in PowerSchool data breach not deleted despite paid ransom(ctvnews.ca)

   4 points by drittich 1y ago|0 comments
2. 32.▲
   by drittich 1y ago

   I played with gemma-3-4b-it-qat recently using a mid-tier graphics card and a few things stood out to me: 1. It was very fast, between 35 and 70 tokens per second, with initial response in under 200ms. That kind of speed is a feature. 2.
3. 33.▲
   by drittich 1y ago

   False dichotomy. An alternate position is to do it in a measured, planned way, not under duress as the economy tanks and international relations are soured.
4. 34.▲
   by drittich 1y ago

   I think the main point stands, though, which is that you can't undo to the previous state. E.g., rolling back all tariffs/deportations/firings/budget cuts would not undo the damage done.
5. 35.▲
   by drittich 2y ago

   It's like when you are in a traffic jam. It's the other drivers fault, not you!
6. 36.▲
   by drittich 2y ago

   I am going to hazard a guess that it's because the closer the services are to your data, the easier they are to implement, and you often get great speed too. FTS in Postgres has been fantastic for me, and combining it with vector searc
7. 37.▲
   by drittich 2y ago

   See also: * An Introduction to the Delia Derbyshire Archive [video]( https://www.youtube.com/watch?v=pPIqq7_RjnA )
8. 38.▲
   by drittich 2y ago

   A GREAT documentary.
9. 39.▲
   by drittich 2y ago

   Thanks, sounds amazing! I've checked it out from local library.
10. 40.▲
    by drittich 2y ago

    I'm wondering if any glass plates were recovered? I'm not sure they were all salvaged at the time, but I don't know how they would fare in the saltwater.
11. 41.▲
    by drittich 2y ago

    +1, there are definitely some sad parts to this story.
12. 42.▲
    by drittich 2y ago

    Ah, but where were the survivors buried?
13. 43.▲
    by drittich 2y ago

    Thanks, much appreciated!
14. 44.▲
    by drittich 2y ago

    How do you weight results between vector search and bm25? Do you fall back to bm25 when vector similarity is below a threshold, or maybe you tweak the weights by hand for each data set?
15. 45.▲
    by drittich 2y ago

    I must have missed that feature. I don't see it under Data Source or Integrations. Can you point me to it? Use case is mostly call an API and show one or more property values from the JSON object that comes back, or use it as a tabula
16. 46.▲
    by drittich 2y ago

    Will there be the ability to call an API and parse the JSON (e.g., to flatten) to use as a data source?
17. 47.▲
    by drittich 2y ago

    While your original comment might be taken as funny, this one quickly devolved into a strawman argument ending in a personal attack. Was that your intention?
18. 48.▲
    by drittich 2y ago

    I like the idea! A few things I noted: 1) despite the paged UI, the API call /rest/v1/arxiv_papers?select=*&order=published.desc is downloading all 708 articles. You will find the UI more snappy if you do server-side pagi
19. 49.▲
    by drittich 2y ago

    I tend to agree. I'm interested in the concept, but the opening line seems to justify its need as a reaction to s-expression syntax in Lisp. Knowing nothing about that, I fear I'm going to miss the context of the whole article, an
20. 50.▲
    by drittich 2y ago

    Someone else mentioned babylon.js in this thread. Did you evaluate that and choose three.js over it?
21. 51.▲
    by drittich 3y ago

    Please explain what ANY expands to...
22. 52.▲
    by drittich 3y ago

    I just got interested in Mega Man recently - do you recommend a playthrough in order, or is there a best version to play for a good initial experience?
23. 53.▲
    by drittich 3y ago

    I completely get your take on this and don't disagree. IMO it reads as a flippant response to a potentially serious question, and I am going to assume this is unintentional, which does not mean it is unfair to call it out. Stepping bac
24. 54.▲
    by drittich 3y ago

    I wrote a C# library to do this, which is similar to other chunking approaches that are common, like the way langchain does it: https://github.com/drittich/SemanticSlicer Given a list of separators (regexes), it goes t
25. 55.▲
    by drittich 3y ago

    Isn't "give it a big chunk" just the same problem at a higher level? How do you handle, say, a book?
26. 56.▲
    by drittich 3y ago

    How does this work when there is a limited context window. You do some pre-chunking?
27. 57.▲
    by drittich 3y ago

    I really wanted to like it, and the visuals were fantastic. But, I had no emotional reaction to the characters and feel like the plot was just flowing along without a reason for me to care. I gave it 30 minutes.
28. 58.▲
    by drittich 3y ago

    Vector similarity searches can be done with simple SQL statements, and while the performance will not match a vector db, it's often good enough. For a db like SQLite that can run in-memory, I suspect they would be reasonably fast.
29. 59.▲
    by drittich 3y ago

    And it's not just the models. E.g., the Assistants API is not available yet in Azure, and there is no expected ship date for it. But I'm confident it's coming.
30. 60.▲
    by drittich 3y ago

    And let's be honest, most of those 6 years was figuring out what to name the variables.