News for hackers. Stuff that matters.
Re:Chunking 2M files a day for code search using syntax trees by eldenring on Monday July 31, 2023 @06:34PM (#36949782)
I'd guess these model's understand works more closely to people so encoding in text is more token efficient and things like comments help.

Also syntax seems a lot easier to understand for them than semantics/logic. If you've used GPT-4 it almost never makes syntax errors. Logical errors on the other hand...

Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Monday July 31, 2023 @06:40PM (#36949835)
From my experience, GPT-4 never makes syntax errors directly but when making edits to existing code it's harder to prevent these syntax errors from appearing. We used to add a second pass to check for these syntax errors.

It also frequently makes undefined variables and the like, however.

Re:Chunking 2M files a day for code search using syntax trees by reitzensteinm on Monday July 31, 2023 @06:51PM (#36949939)
Did you get rid of the second pass? I'm working on something quite similar and find a pass that inspects and rejects erroneous code to be a big boost to correctness.
Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Monday July 31, 2023 @06:59PM (#36950013)
We got rid of it. Our new edit framework works around search-and-replace pairs with an example at https://github.com/sweepai/sweep/blob/d37dda3a626f09dea3b322...
Re:Chunking 2M files a day for code search using syntax trees by reitzensteinm on Monday July 31, 2023 @07:34PM (#36950359)
Ah, interesting. I completely abandoned diff style updates in favour of AST substitution, but that was only possible because my tradeoffs are different to yours.

I'm building a bot that's building itself, so it doesn't have to support large legacy code bases with different languages.

Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Monday July 31, 2023 @08:53PM (#36950983)
This is interesting, I'm wondering what you mean by AST substitution. Is this like an agent that traverses the tree and picks what to edit? Is this language model based? Also, thankfully we don't support too many uncommon languages. The most recent ones we added support for are embedded templates (ERB/EJS for flask and Ruby) and mustache. Fortunately many uncommon languages are subsets of other languages.
Re:Chunking 2M files a day for code search using syntax trees by reitzensteinm on Monday July 31, 2023 @08:59PM (#36951017)
The agent specifies what function, class, method etc to replace, along with its full source. It's more costly, but I believe it leads to fewer hallucinations as it is generating a coherent piece of code.

But it requires parsing AST and language specific instructions. And things like metaprogramming or macros could cause some hairy confusion.

All of these factors don't hurt my use case.

Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Monday July 31, 2023 @09:18PM (#36951139)
We have a similar method under the hood, except it's purely text-based search-and-replace. The model decides what to replace. It seems to be consistent and is easy to implement.
Re:Chunking 2M files a day for code search using syntax trees by reitzensteinm on Monday July 31, 2023 @09:28PM (#36951205)
My gut feeling based on my experience over the last couple of months is that substitution of an entire function is more reliable than some lines of a function. The surrounding context reduces the chance of hallucinations.

Gut feeling doesn't account for much though - I'm working on an evals system to be able to quantify system performance. It won't be cheap to run.

It could easily be that your method is superior.

Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Monday July 31, 2023 @10:06PM (#36951480)
From our experience, single or few line replacements generally fine, since many of the changes are many few-line changes in multiple spots accross multiple files. We also provide surrounding context for the search-and-replace pairs, which helps with the model. Beyond 10 lines and the model also usually add the function headers in there which helps with the code generation.

I'm also curious, how are you guys evaluating the performance of your models?

Re:Chunking 2M files a day for code search using syntax trees by reitzensteinm on Monday July 31, 2023 @11:30PM (#36951964)
There's no systematic evaluation yet which is the next step. It's successfully bootstrapping itself which is a fairly high bar, but quantitative performance measurements are getting more and more important as the project progresses.
Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Tuesday August 01, 2023 @12:18AM (#36952241)
I feel the same, benchmarking in general is a pain but a good benchmark for us could go a long way.
Re:Chunking 2M files a day for code search using syntax trees by _boffin_ on Monday July 31, 2023 @07:23PM (#36950248)
I’ve built out an end to end automated fix pipeline, it’s getting the bug fixes right, but been having trouble with line number errors.

Looking forward to reading through your docs and repo later tonight to see how you’re addressing issues like this.

Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Monday July 31, 2023 @08:47PM (#36950937)
We used to use line numbers but it became problematic so we switched over to search-and-replace pairs, which works significantly better. The only potential problems are with setting up a fuzzy search system since sometimes the search doesn't match exactly with the code (missing comments, etc.). We're going to write about our core algo and diff managing system soon.
Re:Chunking 2M files a day for code search using syntax trees by anotherpaulg on Tuesday August 01, 2023 @05:20AM (#36954044)
Re:Chunking 2M files a day for code search using syntax trees by kevinlu1248 on Tuesday August 01, 2023 @05:57AM (#36954223)
Yup it's based on the aider blogs. They're perfect for our use case and are very reliable compared to our old attempts.