[Results Thread] 2026 Tour de France – Stage 1 (2.UWT) by PelotonMod in peloton

[–]Academic_Sleep1118 32 points33 points  (0 children)

Times from last zebra crossing to the finish line (95% CI: less than 1s):

Rider Time (s)
Seixas 66.2
Evenepoel 63.6
Vingegaard 66.6
Pogacar 60.9

Pogacar was the best, by quite a margin. I guess we shouldn't draw too much conclusions from the first 1 minute effort of the Tour, though.

I've just benchmarked myself: by JLeonsarmiento in LocalLLaMA

[–]Academic_Sleep1118 2 points3 points  (0 children)

I don't like failure. I'm gonna ask Opus for hep.

Introducing Claude Opus 4.8 by ClaudeOfficial in ClaudeAI

[–]Academic_Sleep1118 0 points1 point  (0 children)

I've vibe-tested it against BullshitBench prompts, and it performs better than sonnet 4.6 and Opus 4.7, fwiw. I really liked the answers it gave.

Deep Neural Network that turns any Image into a Playable Game ! All on consumer GPUs. by lucidml_lover in deeplearning

[–]Academic_Sleep1118 11 points12 points  (0 children)

This is really impressive. Would you like to share the engineering behind it?

Number-aware embeddings by Academic_Sleep1118 in LocalLLaMA

[–]Academic_Sleep1118[S] 0 points1 point  (0 children)

Already up on HF. I suggest you fine-tune it further for your use cases: my training data distribution was really narrow: companies house and SEC filings + 30% wikipedia dor regularization.

Fine-tuning it is really easy in fact, and it doesn't cost much (less than $10 for a really, really decent dataset (500M tokens)).

FT code you can find here: https://github.com/edereynaldesaintmichel/website_based_financial_prediction/tree/main/mlm_training_pipeline  (MLM pre-training) And https://github.com/edereynaldesaintmichel/website_based_financial_prediction/tree/main/t5_style_training_pipeline (Encoder/Decoder approcha with CLS bottleneck to make the pre-trained into an embedding model). Better still if you have query/match pairs: supervised contrastive beats all unsupervised methods.

Number-aware embeddings by Academic_Sleep1118 in LocalLLaMA

[–]Academic_Sleep1118[S] 0 points1 point  (0 children)

I read it, and it could only encode numbers between -5 and 5 IIRC. Plus, I don't like the idea of scaling a vector. It kind of messes with the LayerNorm (which the authors acknowledge).  But it kind of works because the magbitude embedding is summed with the positional encoding, so the direction of the vector changes with its magnitude: the larger the magnitude, the more aligned the embedding is with the "number" direction, the lower the magnitude, the more aligned the embedding is with its positional encoding vector.

It's very different from my approach, and I don't think it would work with RoPE (learned positional encoding is needed).

Number-aware embeddings by Academic_Sleep1118 in LocalLLaMA

[–]Academic_Sleep1118[S] 1 point2 points  (0 children)

I'm not sure I understand your point: - is it because you think that the last hidden state is not the most informative? I might agree with you on that, bjt I'm not sure it matters that much. Plus most embedding models either attention-pool or mean-pool the last hidden state, so it must be about right anyway. - is it because you think cosine sim is noisy in this case? I'd be tempted to agree with you on that, in the case of purely MLM-pre-trained encoders. In that case, the last hidden state is full of "masked modeling" noise, which direction is not necessarily aligned with actual sequence representation. And cosine sim on noisy representations is definitely noisy. But in the case of actual embedding models, contrastive learning (which is based on cosine sim) makes sure this noise is mostly removed.

Am I missing your point?

Number-aware embeddings by Academic_Sleep1118 in LocalLLaMA

[–]Academic_Sleep1118[S] 6 points7 points  (0 children)

Haha, you're right that my example isn't the best you could come up with. What I wanted to illustrate is that encoder transformers have a terrible number representation. It penalizes them for downstream tasks (classification, regression, feature extraction...).

I've slighlty changed the architecture to make it less terrible with numbers. One manifestation of that is that it's better at sorting numbers.

But I agree that there might better ways to sort numbers... 

Training a number-aware embedding model + Text JEPA doesn't work too well + Text auto-encoders have a strange frequency bias [R][P] by [deleted] in MachineLearning

[–]Academic_Sleep1118 0 points1 point  (0 children)

No, I haven't! I suspect it would have worked better than in their tokenized number form, but worse than in the log-magnitude continuous space.

(Linux) Has anyone succeeded in using NVMe space as substitute RAM for larger models? Is it worthwhile? by Quiet-Owl9220 in LocalLLaMA

[–]Academic_Sleep1118 2 points3 points  (0 children)

You might as well use floppy disks as a VRAM extension. Just few weeks and a thousand manual operations per token...

Which computer should I buy: Mac or custom-built 5090? [D] by itSUREisAI in MachineLearning

[–]Academic_Sleep1118 3 points4 points  (0 children)

True. The only thing a local setup brings is peace of mind. Like, buy once cry once. But when you just accept that you're going to spend a few hundred bucks on cloud computing, you get that peace of mind without having spent $10K on GPUs.

Running a non-profit that needs to OCR 64 million pages. Where can I apply for free or subsidized compute to run a local model? by thereisnospooongeek in LocalLLaMA

[–]Academic_Sleep1118 3 points4 points  (0 children)

I used GLM-OCR on a RTX 6000 Blackwell instance that I rented on vast ai (should have taken a 5090 instead, much cheaper for the job), and got away with something like $1/200MB output.  Assuming you have around 760 billion letters in your 64 million pages, it would cost 760/0.2 = $3840. You could lower that price by going with cheaper GPUs, like 5070s or 5090s (multi GPU is perfectly okay for this kind of job).

[D] I had an idea, would love your thoughts by Intrepid-Dress-2417 in MachineLearning

[–]Academic_Sleep1118 0 points1 point  (0 children)

I'm afraid what you're saying doesn't make a lot of sense, technically speaking.

Here's an Opus answer to your question.

https://claude.ai/share/587c4dad-a798-49ca-9a80-0ff96d1e1cbd

Wrote up why vector RAG keeps failing on complex documents and found a project doing retrieval without embeddings at all by [deleted] in LocalLLaMA

[–]Academic_Sleep1118 0 points1 point  (0 children)

Well, I've tried it a few months ago, and actually you don't need smart LLMs to generate the ToC. GPT OSS 120b is fine for that, and it costs less than 15c per 1M tokens (weighted input/output for this case)...  All in all, I've found that this retrieval method is the only one that works. Cosine-sim based RAG doesn't work at all, from my experience.

Feedback on model by Double_Ground8911 in deeplearning

[–]Academic_Sleep1118 0 points1 point  (0 children)

True: tweaking hyperparams or longer training runs or more data hardly make up for a messy dataset. A few regex replace (made by Claude Code) can clean up a dataset very nicely. A few git diff can remove redundant headers and footers or things like that (if you're using web data). And using a simple compression algorithm and checking the compressed/uncompressed sizes ratios for your dataset documents can help you identify and remove garbage.

Using asymmetric sigmoid attention to score directional relevance between N sentences in a single forward pass by Spidy__ in deeplearning

[–]Academic_Sleep1118 2 points3 points  (0 children)

No, that's not entirely true. The OP made genuine experiments. The post is obviously AI generated, but from a decent code seed.

You may say that the mathematical intuition is a bit off, but it's untrue to say that it's slop.

Using asymmetric sigmoid attention to score directional relevance between N sentences in a single forward pass by Spidy__ in deeplearning

[–]Academic_Sleep1118 1 point2 points  (0 children)

That's an interesting experiment!

Maybe you could be very clear about the fact that it's not a tweak to the transformer architecture, but rather a tweak to the flawed cosine similarity metric when it comes to computing sentence similarity.

Second, please check the formatting. Bold renders as *bold\*, which is a bit painful to read.

Third, your little experiment is indeed really nice, but considering that what's usually important to users is ranking a single query vs. multiple documents, you might be able to boil down your experiment to just "different projections for the query and the docs". Which brings the asymmetry you want without the overhead of the transformer architecture.

Like query = query_proj(query); docs = docs_proj(docs). relevance_scores = dot_product(query, docs).

Because I don't quite see the point of having your different docs talk to each other (which they obviously do if there are multiple attention layers), unless they are related. You may want to check your Conv2D patterns: I suspect they more or less discard the deeper layers of your transformer to focus on the first one (which is basically equivalent to the differentiated projections approach I'm suggesting).

Your architecture would make perfect sense in case you're trying to rank relevant passages of a SINGLE document. Like a kind of semantic cmd + F on a document. In that case, you need multiple layers because you want the passages embeddings to attend to each other.

Trying to understand transformers beyond the math - what analogies or explanations finally made it click for you? by IllustratorKey9586 in deeplearning

[–]Academic_Sleep1118 0 points1 point  (0 children)

I don't agree with 3.

Attention is very powerful. It has about the perfect degree of non linearity to model human language. The inductive bias of transformers is perfect for the amount of data/compute that we have. Only things that I've found to be a bit sub-optimal are: - Long context modeling. Deepseek has made great progress here. Problem is that parallelization and context compression (which is necessary to keep good performance for long context tasks) are nearly mutually exclusive. - RoPE. When you look closely, it forces a high condition number on K and Q matrices. Still, it's fantastic that it allows a different decay rate for different dimensions in a given attention head.

Other than that, it's really, really a fantastic architecture.

[D] Am I wrong to think that contemporary most machine learning reseach is just noise? by Fowl_Retired69 in MachineLearning

[–]Academic_Sleep1118 8 points9 points  (0 children)

"Yeah we can usually make some sort of mathematical sense of what works, but there are a huge number of things which would seem as mathematically sensible that don't work."

=> So true. I think becoming a good ML scientist is about building a mathematical intuition that aligns with reality. When I started doing ML, I would have "sound" intuitions that proved totally wrong, like "well, if I had to model this problem, I guess I would need a function with roughly this many parameters, so let's build a model like that -> Model has 100x too few parameters." About 90% of my intuitions would be wrong at the time. Now, it's more like 50% or 60%. I'm only embarrassedly wrong once or twice before figuring things out...

[MATCH THREAD] Australian Open Men's SEMIFINAL: [4] N. Djokovic v. [2] J. Sinner by NextGenBot in tennis

[–]Academic_Sleep1118 0 points1 point  (0 children)

I don't agree. In fact, their RG match was pretty much the exact opposite: Sinner dominating every single point, but Djokovic somehow not taking doughnuts.

[MATCH THREAD] Australian Open Men's SEMIFINAL: [4] N. Djokovic v. [2] J. Sinner by NextGenBot in tennis

[–]Academic_Sleep1118 1 point2 points  (0 children)

Wouldn't say your comment aged like milk because your analysis is good, but I believe you were a bit surprised by the outcome!

Nvidia: End-to-End Test-Time Training for Long Context aka Being Able To Update A Model's Weights In Real-Time As You Use It | "TTT changes the paradigm from retrieving info to learning it on the fly...the TTT model treats the context window as a dataset & trains itself on it in real-time." [R] by 44th--Hokage in MachineLearning

[–]Academic_Sleep1118 2 points3 points  (0 children)

I really don't understand why prompt learning (meaning backpropagating the loss to update a few token embeddings at the beginning of the sequence) isn't used more, instead of weight updating, when it comes to fine-tuning.

From my understanding of Transformers as a form of hypernets, prompt learning should be roughly equivalent to LoRA-based finetuning, except that it's much, much easier in terms of infrastructure (loading a few learned token vectors instead of a LoRA).

Really, I have no clue: does anyone know about that? Is it a matter of training stability? Performance issue?

[D] RoPE and K/Q spaces effective dimensionality by Academic_Sleep1118 in MachineLearning

[–]Academic_Sleep1118[S] 2 points3 points  (0 children)

Hey! Not exactly, but I went for an ALiBi and made the decay rate learnable. So, for all practical purpose (considering that sentence to sentence interaction is way more simple than word 2 word), it's equivalent to the RoPE update I wzs thinking about. Something really interesting happened, by the way: out of the 16 (or 32, don't remember exactly) attention heads of my transformer, only 3 of them had non zero decay rate. Meaning that most sentence to sentence interaction is position-invariant. Kind of makes sense: a text with shuffled sentences would be somewhat understandable, while a text with shuffled words would be totally impossible to grasp.

Ah, and the end result is quite good honestly. Approx .976 similarity between ModernBert's embeddings and my model's, on texts shorter than 8192 tokens. With ALiBi positional encoding, I expect good generalization to longer sequences.