vatsachak

10 ms·

91.
by vatsachak 1mo ago
Astra is a new step in LLMs I think. I'm so used to having to comb through LLM word vomit and then combatting the sycophancy by giving it all possible opinions on the same prompt. Astra seems to be "confident" and also is abl
92.
by vatsachak 1mo ago
Damn I am so hyped
93.
by vatsachak 1mo ago
I mean at this point there's no doubt that LLM cans be RL maxxed and give you _some working output_ but the next frontier is whether they can create good abstractions, a.k.a use the correct level of expressivity so as to not inline eve
94.
by vatsachak 1mo ago
This is quite useless actually. The whole point of formalizing FLT was to clean up modern number theory into reusable abstractions that prove it. If its 13 million LoC, it might involve so much spaghetti that its unusable other than the res
95.
by vatsachak 1mo ago
Why don't they just buy extra land surrounding the data center to reduce noise pollution concerns? Regardless hopefully this restarts nuclear power generation
96.
by vatsachak 1mo ago
What was the problem?
97.
by vatsachak 2mo ago
Those damn compilers are going to take our jobs!!!
98.
by vatsachak 2mo ago
Yeah ONNX runtime or Burn-rs are great because they compile to wasm
99.
by vatsachak 2mo ago
I agree. Foraging out in the beautiful woods connecting to nature by eating what you picked is irrational.
100.
by vatsachak 2mo ago
I feel like there is still low hanging fruit on the auto regressive LLMs; the encoder
101.
by vatsachak 2mo ago
My Ticket example is not the standard type state pattern. Usually the State is shimmied in as a generic into the type being mutated
102.
by vatsachak 2mo ago
That's fair, but you would have to make sure that write_buffer is the only function that can create a WrittenBuffer<'a>. And then the second function could take a WrittenBuffer<'a> as an unused arg I mean there&#x
103.
by vatsachak 2mo ago
The I/O is done using the mutable reference to the UntypedStateMachine in the functions. For example UntypedStateMachine could just be a vec that you append to or read from. If you want to model cases with failure your return type will
104.
by vatsachak 2mo ago
It's because I use Ticket<T> in situations where I need to remember (force other users to use) a sequence of functions that take arguments not necessarily constructed by others. async fn write_buffer(buf: &mut [u8]) -> Ti
105.
by vatsachak 2mo ago
You don't need the enum? You just require Ticket<T_0> as a function argument. It's really not that cumbersome, it's like two extra lines of code...
106.
by vatsachak 2mo ago
In the type state pattern you would have something like this pub trait ValidState {} struct StateMachine<'a, T> where T: ValidState { untyped: &'a mut UntypedStateMachine, _marker: PhantomData<T> } fn reser
107.
by vatsachak 2mo ago
Why is it cumbersome?
108.
by vatsachak 2mo ago
Types are puzzles in a good way. If you were to design Ikea furniture, you'd make pieces that only fit in to the total configuration the correct way. Types provide that same phenomenon in programming imo. At the end of the day we are s
109.
by vatsachak 2mo ago
Nah reducing token length means that we're just reducing English down towards a programming language like a nice demi-glace
110.
by vatsachak 2mo ago
Okay let's say you had three functions func1(foo_0) -> bar0 func2(foo_1, foo_2) -> bar1 func3(foo_3, foo_3) -> bar2 And you wanted to make sure that func2 and func3 can only be called after func1 has been called. A wrapper on
111.
by vatsachak 2mo ago
This is not really ST. This is analogous to eating at an old school restaurant. You can't just walk in to the food service counter and say "give me a burger"; you need to first get a ticket from the cashier proving that you&#
112.
by vatsachak 2mo ago
That's fair but then you have to make your args a struct for this bespoke purpose; an anti pattern. Also, many other functions can depend on the ticket from func_1. So making the ticket separate and generic on the process is the right
113.
by vatsachak 2mo ago
Types are puzzles. A good Rustacean will make sure that the pieces fit to make the picture. That's why in crates where I need to make sure certain functions are called in order, I use a Ticket<T>, where one function returns a Tic
114.
by vatsachak 2mo ago
I'm liking where LLMs are headed: They can do the difficult small level optimization, the boring but tedious code but cannot be tasteful. That means I'm more valuable and more productive. Good stuff
115.
by vatsachak 2mo ago
Yeah. We shouldn't have standardized languages either. Everyone was fine with their own regional dialect for hundreds of thousands of years.
116.
by vatsachak 2mo ago
Yeah experimentation is probably the best use case of LLMs
117.
by vatsachak 2mo ago
Eventually lambda prolog will rise again
118.
by vatsachak 2mo ago
These Intel chips are getting out of hand
119.
by vatsachak 2mo ago
Because sometimes parsers can have weird inputs, like structured Excel files
120.
by vatsachak 2mo ago
Damn. These things aren't AGI... but I don't care. Luna is good enough for me to give a parser spec and have it write one.

More ›