News for hackers. Stuff that matters.
Re:Using GPT-3 to pathfind in random graphs by nikkwong on Saturday September 24, 2022 @03:04AM (#32960314)
I know that GPT-3 is not AGI nor modeled properly to ever represent what we would consider to be AGI; but this feels freakishly AGI-ish. This feels like the model is 'reasoning' in a way that I would not expect based on my intuition of how GPT-3 works. As it's been explained to me in lay terms; GPT is great at predicting the next word based on a chunk of previous context. This feels like it's doing much more than that as it's understanding the context and parameters that relate to a question embedded in the text, which seems unrelated to the original instruction of GPT-3 as I understand. Can anyone explain?
Re:Using GPT-3 to pathfind in random graphs by joe-collins on Saturday September 24, 2022 @03:32AM (#32960453)
I think the sentences in this example are, odd vocabulary notwithstanding, fairly typical descriptions of logical implication, which I expect has non-trivial representation in the training set. GPT-3 is probably capable of matching the pattern of the tokens (sentence structure), even if the content of the tokens (spelling/vocabulary) is novel.
Re:Using GPT-3 to pathfind in random graphs by uup on Saturday September 24, 2022 @08:21AM (#32961833)
I doubt it. There are billions of parameters and weights all combining in non trivial ways to produce the output. I don’t think you can describe any of its workings with simple terms like “doing token substitution” even if that’s what it looks like to us when we look at the output.
Re:Using GPT-3 to pathfind in random graphs by joe-collins on Saturday September 24, 2022 @01:23PM (#32964711)
Try it. Reduce the tokens to single characters but keep the structure. Does it work? Maybe single characters looks too much like an abbreviation and that throws it off, because those are found in sufficiently different contexts. Exchange to two characters, three. Throw similar inputs at it and find the point where it reliably "gets it".
Re:Using GPT-3 to pathfind in random graphs by visarga on Saturday September 24, 2022 @06:49AM (#32961349)
The trick was diversity. GPT-3 trained on so many tasks it can understand zero shot ones like pathfinding, even when formulated in completely different terms.
Re:Using GPT-3 to pathfind in random graphs by ALittleLight on Saturday September 24, 2022 @03:46AM (#32960530)
Speaking of things that feel weird, while I had the playground open I tried another prompt that came to to my mind. This prompt is based on the idea that people will usually miss it if you double a word (e.g. I doubled "to" a few words back - did you notice?)

I gave GPT-3 a prompt to test this. Like a human reader would, GPT-3 seems to miss the doubled word in the last sentence. Continuation is at the asterisk.

    Repeat the sentence in quotes.
    
    "The man went to the gas station today."
    The man went to the gas station today.

    "I'm happy to be on holiday."
    I'm happy to be on holiday.
    
    "If you can get to the the store on time, it would be appreciated"
    If you can get to the store on time, it would be appreciated.
---

What's extra-odd about this is that GPT-3 can repeat random character sequences up to 1,000 characters in legnth. For each of these I just gave the sentence in quotes and let GPT-3 autocomplete the repeat. I think that's especially odd because it's showing that GPT-3 does something different when it is asked to repeat random characters (wouldn't miss a duplicate) versus when it is asked to repeat sentences that it could "read".

"I need something stronger than I'm XXXknjd used to."

I need something stronger than I'm XXXknjd used to.

"pmkkrrpjvn"

pmkkrrpjvn

"wxvbssajxczjjewmanvzznxlwzwdvfrghsstmzpvqwsstrxkzunjgxicvrshychbqsulydkiwgyryhkgjtukssacnodtggfahvus"

wxvbssajxczjjewmanvzznxlwzwdvfrghsstmzpvqwsstrxkzunjgxicvrshychbqsulydkiwgyryhkgjtukssacnodtggfahvus

"dcyvufmxwmctighwwhmamgwuyldpkzrwubvcbjirxzhuoqtktcdfjgasurcprctnxmlqfvwkxixrtqqynxfjvtfhmgsfglxhvfhnbqnixulexkqflrdxqpwgavrphkbgspgoyfjfolczssjfrmggtpcdheneaynhdwimcmvkcsauxwnlovefpmqyznynuoxraqixeveiuqotssiymrtmbiodwnhmtexfrttzdlbdwduqzvrkpmqmjcyciqsuwqmlhjrveeozktvccsspsqosutpngigzkqgaltojhvkodzoeqzhlhfqyblvqkoyvjkphmjroidjpbpnkvrchvrnvuoqhgzkypvjycfzrdsyefstckorqwgsbknslqyiwqghdinuwrapkgyvhslbfgqrslsrferhodlvukdsvvzdcwyjwtrqhqkvwbwksefuanzaarvhnmjcgtajsbivaijthercbmqfvndlsfhjtwsiztpwcehuvckmcbjvhnqbvhhqwugrodtyjfrwlkbpatpwgrlzneenyqgcdyzzhrzfsrvfqlnunfpnathcpuealrdwcliriufxdfqaygxtvdriidzzzdbbfwrowhlbasogmzfkwhaaufrcjsdgdobaozazbdfmasrgjiblluvfvfkeuwksyrzdmepmapesadqoozrpaidlgshyhpbypdzdxjdtwnfaxthjwluarbldmxvvfdissthlpdxqxjmgpuefwqvfjupxveztgrrwyobgaljqkgexeulvjucokythfkmcgnlbfkmpgrpaoztrawqciyilbzwjxagwqgwuqcwactwdtobomlkanmdbhpmubdzvolqpusjbtgqoymuovzsqbkzonabhzogabraxmnxnvfdotfisefmfbdbqjzgrhdtgtppobyndfgsrlpxyutebzlrxgahwizvtmieutqnkflkldxeathvrttyffacofuwdkhxdklcisbzbrlddtahut"

dcyvufmxwmctighwwhmamgwuyldpkzrwubvcbjirxzhuoqtktcdfjgasurcprctnxmlqfvwkxixrtqqynxfjvtfhmgsfglxhvfhnbqnixulexkqflrdxqpwgavrphkbgspgoyfjfolczssjfrmggtpcdheneaynhdwimcmvkcsauxwnlovefpmqyznynuoxraqixeveiuqotssiymrtmbiodwnhmtexfrttzdlbdwduqzvrkpmqmjcyciqsuwqmlhjrveeozktvccsspsqosutpngigzkqgaltojhvkodzoeqzhlhfqyblvqkoyvjkphmjroidjpbpnkvrchvrnvuoqhgzkypvjycfzrdsyefstckorqwgsbknslqyiwqghdinuwrapkgyvhslbfgqrslsrferhodlvukdsvvzdcwyjwtrqhqkvwbwksefuanzaarvhnmjcgtajsbivaijthercbmqfvndlsfhjtwsiztpwcehuvckmcbjvhnqbvhhqwugrodtyjfrwlkbpatpwgrlzneenyqgcdyzzhrzfsrvfqlnunfpnathcpuealrdwcliriufxdfqaygxtvdriidzzzdbbfwrowhlbasogmzfkwhaaufrcjsdgdobaozazbdfmasrgjiblluvfvfkeuwksyrzdmepmapesadqoozrpaidlgshyhpbypdzdxjdtwnfaxthjwluarbldmxvvfdissthlpdxqxjmgpuefwqvfjupxveztgrrwyobgaljqkgexeulvjucokythfkmcgnlbfkmpgrpaoztrawqciyilbzwjxagwqgwuqcwactwdtobomlkanmdbhpmubdzvolqpusjbtgqoymuovzsqbkzonabhzogabraxmnxnvfdotfisefmfbdbqjzgrhdtgtppobyndfgsrlpxyutebzlrxgahwizvtmieutqnkflkldxeathvrttyffacofuwdkhxdklcisbzbrlddtahut

Re:Using GPT-3 to pathfind in random graphs by neongreen on Saturday September 24, 2022 @07:12AM (#32961461)
…huh. That’s fascinating.
Re:Using GPT-3 to pathfind in random graphs by bilsbie on Saturday September 24, 2022 @09:35AM (#32962453)
If it walks like a duck …
Re:Using GPT-3 to pathfind in random graphs by mjburgess on Saturday September 24, 2022 @03:41AM (#32960510)
A NN is a means of compressing a training dataset into a mathematical representation (weights) which can be exploited for pattern finding. The representation of the training data is where 95% of the "magic" comes from. We intelligently prepare it, so no intelligence is required in its use.

On any given input, its predictions can "look" how we expect an intelligent response to "look". The job is to disprove this intuition, which is usually trivial. This cannot be done by looking at a single response.

Consider walking into a room and predicting a few people's personality traits correctly based on their star sign. This shows nothing.

Re:Using GPT-3 to pathfind in random graphs by YorkshireSeason on Saturday September 24, 2022 @06:14AM (#32961209)
This sounds like you consider what has been called "feature engineering" in older ML research as being fundamental to modern ML successes. But the trajectory has been the opposite direction, away from feature engineering, and instead towards letting the transformer architecture learn as much as possible, including interesting features.

Most research on deep net architecture, is about how to train it effectively on huge stacks of GPUs and TPUs. That's how/why transformers were invented.

Re:Using GPT-3 to pathfind in random graphs by mjburgess on Saturday September 24, 2022 @06:37AM (#32961302)
weights are just compressions of the training set. The reason hardware improvements have improved ML is just because we're compressing the training set to larger sizes.

Going eg., from 100TB training to 300BB weights. The process of training is more-or-less just "building a search index", and prediction is little more than "looking up examples in the search index and combining".

Re:Using GPT-3 to pathfind in random graphs by YorkshireSeason on Saturday September 24, 2022 @06:55AM (#32961378)
I don't understand those objections.

Yes, one of the key insights of modern DL-based ML is that size matters, neural networks start producing interesting generalisation only once you have large parameter spaces. Indeed, one might wonder if size is all that matters?

I don't see what is wrong with search indices, every computer is a gigantic search index, because main memory is a map from an index (the memory address) to 2^n bit integers, the value stored at the index. So anything that can be computed at all, can be computed by "a search index". The important thing that, prima facie, distinguish NNs from eg SQL databases, is the use real numbers as latent space: because real numbers are a metric space, so you have a notion of distance which allows you do use efficient local search like gradient descent. Moreover, when you ask this 'mere' search index (NNs) about something that it was not trained on, it can (and probably does) return something that is close in this metric space to something it learned.

That did not work at all in the 1990s. Today it works spectacularly well in some domains. So an interesting question now is, to use your language: is human intelligence anything more than "building a search index" and "looking up examples in the search index and combining"? So this is a variation of Searle's Chinese room, but unlike him in 1980, we have working Chinese rooms!

Re:Using GPT-3 to pathfind in random graphs by mjburgess on Saturday September 24, 2022 @09:12AM (#32962269)
It is important to note that the search space is just the training data. That space does not span enough dimensions to actually solve the problems in question.

For example, we act in the world so as to set the state of possible causal variables -- and thereby can distinguis causes.

Above, graph algorithms operate on a discrete graph space and hence on the graph. GPT here isn't doing that.

Seeing NNs as distance-based searches in a compressed 'training space' demystifies what solutions can be found.

Here the text space defined by the training set does not permit a graph traversal, so eg., the NN 'uses' edges that don't exist

We are not searches across such spaces, which are radically impoverished and not parametrised by time or action

Re:Using GPT-3 to pathfind in random graphs by YorkshireSeason on Saturday September 24, 2022 @12:58PM (#32964469)
It is not the case that "the search space is just the training data", the search space in NNs are some variants of real multivariate functions. The training data can be all manner of things, in LLMs, they are text in natural language. Graphs or natural language text are mapped from a discrete space to a continuous metric space.

It is true that LLMs cannot currently solve complex mathematics problems reliably. Whether that's an intrinsic shortcoming of transformers, or not is an interesting open question, that is being investigated as we speak. A lot of well-known DL research teams bet on transformers beating humans in mathematics in the next few years, see e.g.

   https://imo-grand-challenge.github.io/
Re:Using GPT-3 to pathfind in random graphs by jmfldn on Saturday September 24, 2022 @09:16AM (#32962303)
"is human intelligence anything more than "building a search index" and "looking up examples in the search index and combining"?"

Yes, it is more than this. Even if we can simulate things that appear like thinking using these methods, what we do bears no comparison. That's not a criticism of the computer here but the brain doesn't work like this.

Ultimately, maybe the question "can computers think" is meaningless as Turing himself said. If the output appears like it is the product of thought, then what difference does it make?

Re:Using GPT-3 to pathfind in random graphs by nl on Saturday September 24, 2022 @08:37AM (#32961950)
> The process of training is more-or-less just "building a search index", and prediction is little more than "looking up examples in the search index and combining".

It's really not.

You are compressing the information in that dataset. That means the model has to learn characteristics of the information in the data that represent it. This is one of the reasons why some argue that compression is a form of intelligence[1]

It's a very different mechanism to a search index or database even if in some case it appears to work similarly.

[1] http://www.hutter1.net/ai/

Re:Using GPT-3 to pathfind in random graphs by visarga on Saturday September 24, 2022 @06:53AM (#32961367)
Reminds me of Pedro Domingos's paper - Every Model Learned by Gradient Descent Is Approximately a Kernel Machine

https://arxiv.org/abs/2012.00152

Re:Using GPT-3 to pathfind in random graphs by YorkshireSeason on Saturday September 24, 2022 @07:08AM (#32961437)
Modern DL uses stochastic gradient descent, which Domingos's paper doesn't deal with, in fact he leaves the generalisation as an open problem.

Be that as it may, universality in computing models is a well known issue. I could also say "Every Model Learned by Gradient Descent Is an x86 processor + a lot of RAM", or ""Every Model Learned by Gradient Descent Is a 2 Layer Neural Net" (as 2 layer nets are universal approximators), but this is not terribly illuminating.

Re:Using GPT-3 to pathfind in random graphs by pyinstallwoes on Saturday September 24, 2022 @06:15AM (#32961214)
Your example implies that they are not affected by star signs. This is arguably false given people believe in star signs and thus certainly influenced by the traits of said star signs.
Re:Using GPT-3 to pathfind in random graphs by mjburgess on Saturday September 24, 2022 @06:39AM (#32961308)
My point is a few instances of reality confirming our prejudices is not the basis for explanation. This is something we've already discovered, it's called "the scientific method", and its wholey absent from ML.
Re:Using GPT-3 to pathfind in random graphs by YorkshireSeason on Saturday September 24, 2022 @07:00AM (#32961408)
How do you explain the tangible progress in ML?