@javaeeeee1

Machine Learning Engineer. I learn by teaching. Opinions are my own. Building https://nitter.cf/t.co/LDTxX1BwWC

Toronto, Ontario
Joined October 2014
Dmitry Noranovich retweeted
Opus 5.5 is 20% cheaper per input and output token than Opus 5, and 60% cheaper on cache reads. So what does that actually do to the cost of a task in Claude Code? We ran the numbers, and built a calculator so you can run yours from /usage: claude.dev/blog/what-a-task-…
247
263
69
6,180
671,126
Dmitry Noranovich retweeted
It’s now easier to build plugins for Claude. We built a new portal to submit your plugin, track review, and see usage. Plugins package MCP and skills, and are becoming the way to build for Claude. MCP usage across Claude products is up 110x this year! claude.com/blog/build-plugin…
182
311
99
4,492
702,768
Dmitry Noranovich retweeted
Reasoning from scratch, round number 5! This time, talking about log-probability scoring (also a great fundamental concept for loss functions like cross-entropy in pre-training and distillation) and self-refinement. 00:00 Introduction and inference-time scaling recap 05:02 Loading the pretrained LLM 08:00 Comparing and scoring model answers 10:18 Building a rule-based scorer 17:53 Token probabilities and sequence likelihood 26:47 Computing token probabilities in PyTorch 30:12 Token indexing and shifted targets 37:27 Log probabilities and numerical stability 45:57 Scoring answers with average log probabilities 56:24 How self-refinement works 59:07 Generating critiques and revised answers 1:01:00 Implementing the self-refinement loop 1:05:57 MATH-500 evaluation results 1:07:35 Takeaways and next steps
46
127
5
1,021
55,128
Dmitry Noranovich retweeted
Grok 4.7 is here. It's a notable improvement over Grok 4.6 at the same price and speed.
1,529
3,129
1,916
28,719
21,698,865