HackerTrans
TopNewTrendsCommentsPastAskShowJobs

trivexwe

no profile record

comments

trivexwe
·2 lata temu·discuss
> Sounds like woo.

O, definitely woo. I tried to make that explicitly clear by using “hypothesis” and “appearance”.

My hypothesis is less “optimization solutions == consciousness” and more positing that our brains, “action potentials” was meant as cheeky shorthand for the human brain, use an “optimization solution” that we identify as “consciousness”, or as you put it “sentience”.

But to quote South Park, “and I base that on absolutely nothing”. ;P
trivexwe
·2 lata temu·discuss
Yeah, the messaging got a little muddled, but the relation was purely analogical.

I was trying to point to a situation where you have a clear problem: a generating function for the prime number sequence; and a solution that identifies a small subset of the intended sequence without addressing, or even informing in any substantial way, the full breadth of the original problem.

> At the time of writing the longest known arithmetic progression of primes is of length 23, and was found in 2004 by Markus Frind, Paul Underwood, and Paul Jobling: 56211383760397 + 44546738095860 · k; k = 0, 1, . . ., 22.'.

The triviality was overloaded to both imply that calculating this subset is trivial, it is a simple arithmetic progression, and that subset of the full prime number sequence is now trivial to produce.

In the same way that the Green-Tao theorem has yet to lead to a complete solution to the prime number sequence, I feel, the machine learning techniques will fail to lead to a complete solution to protein folding.
trivexwe
·2 lata temu·discuss
> Why are you dubious? Where do your objections come from?

That the results the machine learning techniques provide are still nondeterministic.

Meaning that they are, in terms of identifying other local minima that satisfy the constraints, as good as a guess.

If the provided solution also came with a method of systemic modification to derive all other solutions that satisfy the constraints, then I would be satisfied.

Without that you are unable to say with certainty that your local minima is correct even if nature fails to adhere to the lowest energy assumption.

> However, nature isn't magic and can't magically solve global optimisation problems.

I wonder sometimes. Let’s remember, this is an open question after all.

I have a long standing hypothesis that an algorithmic solution to the global optimization problem is what lends action potentials the appearance, or essence?, of what we mean when we speak of “consciousness”.

But I am a more inclined toward the abstract aspects of the mathematics behind the problem, and leave advocacy for the current techniques to researchers developing practical solutions with them.

I applaud the people who toiled with X-ray crystallography to build the field to the point that a machine learning technique could be developed.
trivexwe
·2 lata temu·discuss
Weird article.

It mentions multiple times that ~”the protein folding problem is solved” as well as multiple instances of ~”but there are limitations to this technique and it is often missing crucial details”.

It really is difficult to conceptualize these highly nonlinear problem spaces, like protein folding, until you attempt to work with them.

Many in software development have an intuitive understanding of the difficulty evidenced in the community’s ~“the last 10% took 100% of the time” meme.

Even in a nonlinear problem spaces you have “trivial” solutions.

Terry Tao famously coauthored a paper finding arithmetic progressions for generating sequences of primes.[1] The sequences found are “trivial” in terms of “solving the prime sequence problem” in that they are sparse, the sequences are finite, and progressions lack a method of find more.

These machine learning tools are by design approximation engines. I’m unsure of any results that prove one way or the other that it is possible to pass a bound of approximation that provides exact solutions. (think, an approximate solution that only fails to provide exact solutions for solutions that are trivial using a different method, I think a lot of work I p-adics is motivated similarly)

I feel these machine learning techniques are expanding the definition of “trivial solutions” to include those capable of being solved by their convoluted methods (back prop, etc). Since this new subset of the space that can be labeled “solved” appear more complex than known trivial solutions people assume the whole space must be known, and this is where the difficult conceptualization rears its influence.

Protein folding is still an unsolved problem, and I’m dubious of the notion machine learning will ever solve it, but hopefully we get some helpful science out of it.

[1] https://en.m.wikipedia.org/w/index.php?title=Green%E2%80%93T...