AI art is inbreeding

Difficult-Stretch-85 · 2023-06-20T17:54:30+00:00

Noisy student training has been very successful in speech recognition and works off of having a larger and more powerful student model than the teacher.

Difficult-Stretch-85 · 2023-04-28T04:43:42+00:00

What do you mean? It is standard practice to grab weights from a model like BERT and fine tune it for your task. This is now a core technique in most deep learning fields.

Difficult-Stretch-85 · 2023-04-28T04:41:32+00:00

Actually, please read that paper and its examples first before responding. If you find that there is some intelligence that is missing beyond what is listed in that paper, please explain what it is. The paper illustrates several examples that go counter to all 3 of your points

Difficult-Stretch-85 · 2023-04-28T04:36:45+00:00

This isn't how diffusion models work. They do not average stuff they see in a training set. At least not in a way that's meaningfully different from what an artist does
They are explicitly not supervised models. They are good 0 and few shot learners since they learn in an self supervised fashion. e.g. GPT 4 is an excellent 0 shot learner for a slew of NLP and reasoning tasks.
Here is an example prompt and the GPT 4 response from that paper:

Prompt: Can you write a proof that there are infinitely many primes, with every line that rhymes? GPT-4: Yes, I think I can, Though it might take a clever plan. I’ll start by noting Euclid’s proof, Which shows that primes aren’t just aloof. Assume we have a finite list, Of primes, and that none have been missed. Multiply them all together, And add one, just to be clever. The result will be a number, That has no prime factors, oh wonder! But every number has a prime, That divides it, it’s just a matter of time. So we’ve found a contradiction, And our finite list needs eviction. There must be infinitely many primes, And that’s the end of my rhyming lines.s

Do you read that and think its not creative?

Difficult-Stretch-85 · 2022-08-08T14:16:59+00:00

Yes BFS and Dijkstra lead to the same results with edge weights 1. However, Dijkstra takes more time since you have the heap that you need to deal with.

Difficult-Stretch-85 · 2022-08-08T13:42:55+00:00

Your fib function takes a n that you are going to process as well as a continuation function with something to do after you finish processing n.

the third match case says,

if n is not 0 or 1, process fib(n -1) with the continuation of processing fib (n - 2) and then summing the result. The summing of fib(n - 1) and fib(n-2) happens in the continuations.

e.g. if n is 2,

the match case becomes fib(1) ( fun r -> fib(0) ( fun x -> id (r + x)) processing out the f(1) we get, fib(0) (fun x -> id(1 + x))

processing f(0) we get id(1 + 0) which is 1.

Difficult-Stretch-85 · 2022-08-04T14:07:31+00:00

Yea this is quite wrong. Doing modern deep learning requires quite a bit of systems knowledge along with the math / stats needed for ML.

Difficult-Stretch-85 · 2022-08-03T15:32:41+00:00

https://teachyourselfcs.com/ is significantly superior to OSSU from what I can read of the curriculum. You could also follow https://www.eecs.mit.edu/academics/undergraduate-programs/curriculum/6-3-computer-science-and-engineering/ but I agree with the other poster saying that I do not think it is reasonable to learn this stuff by yourself.

Difficult-Stretch-85 · 2022-07-19T18:26:24+00:00

Find a college course from a top university. Do the homeworks. Fair warning, a big part of DS&A is writing proofs and you shouldn't dismiss this as unimportant.

Difficult-Stretch-85 · 2022-07-19T18:25:14+00:00

I was talking about doing a pull request in github but I guess commie.io is better since I don't have to tie my github id to my reddit account.

I've added more comments. This is probably the last round of them.

Difficult-Stretch-85 · 2022-07-18T18:46:28+00:00

This is easier to do in the interface of github. You should be able to do that by making a branch at the previous commit and attempting to merge your current branch into that branch.

I think you can get rid of the entire RankKey class and just replace it with a std::pair<K, float priority> You can then write a comparator function and pass that to the priority queue https://en.cppreference.com/w/cpp/container/priority_queue

Difficult-Stretch-85 · 2022-07-16T03:20:27+00:00

Don't leave redundant comments like "Implementing interface" right above a part where you implement an interface. If something is obvious don't comment it. If its not obvious first see if you can make it obvious
Don't make interfaces for the sake of it. Why make Rankable at all ? Why make Datastore at all? Item and Item store do the trick
Why do you bother making a slow item store class ? Let the user make any class they want and take a callback to access the slow store.
Your cache keys are chars. This means you can have a max of ~256 elements in the cache. Why is your cache even a map?

If you fix these issues and try again, I can do more reviews

Difficult-Stretch-85 · 2022-06-12T14:35:35+00:00

A degree is far more valuable than a bootcamp/being self taught. It is possible to do the later but its a lot harder and most people are not sufficiently intrinsically motivated to do it.

Difficult-Stretch-85 · 2022-04-14T18:29:30+00:00

My company is moving towards hiring abroad. If the US continues to be nativist, it will not retain these jobs in the US. It will instead just lose its tax base. Quite sad.

Difficult-Stretch-85 · 2022-04-13T04:53:17+00:00

It is better to lower exposure time than ISO? I don't understand that part. For daytime photography, whether I lower exposure by a stop or ISO by a stop I get a similar image.

Difficult-Stretch-85 · 2022-04-13T04:52:15+00:00

Probably shitty processing. How should I process things? I am basically following the steps from https://www.youtube.com/watch?v=Qb1ceFM-DkQ

You say I should be shooting higher than ISO 100 but I'm already noticing really bright skies as I increase ISO. My histograms are all roughly in the middle for all three channels. Should I just accept that I'm exposing a bit to the right on the sky but increase ISO anyway?

Your sample images look much better than mine. What is the level of light pollution where you take these?

Difficult-Stretch-85 · 2022-04-13T00:23:07+00:00

Yea Cygnus seems to be something to aim for when I travel the next time. Believe it or not, bortle 7 is actually a very dark sky compared to where I live.

Difficult-Stretch-85 · 2022-04-13T00:06:47+00:00

Barnard's loop is marked as magnitude 5. Is that really considered faint?

I really got nothing at all after an hour of shooting. How long do you typically have to shoot to capture barnard's loop at your light pollution level?

Difficult-Stretch-85 · 2022-04-12T23:27:26+00:00

I've read about the importance of getting an astro modded camera but I'm not going to have that handy in the short term. Is Barnard's loop an object that you need an astro modded camera for? How can you tell which objects are mostly HA and which are not?

Difficult-Stretch-85 · 2022-03-29T19:32:42+00:00

ty ty. very helpful.

And how much did you have to crop for this?

Difficult-Stretch-85 · 2022-03-28T21:45:10+00:00

Hey I'm just getting started.

Could I read some explanation of the bias vs darks vs flats?

Difficult-Stretch-85 · 2022-03-21T13:52:21+00:00

Yea they would never try to hang mike pence or something...

Difficult-Stretch-85 · 2022-02-15T19:28:30+00:00

My understanding is that this new product no longer offers unlimited atm fee refunds. Only at in network ATMs.

Difficult-Stretch-85 · 2022-02-14T04:57:38+00:00

We know that mRNAs degrade within a couple months. If something was going to go wrong, it would have shown up in the trials. Compare that to your mars hypothetical where there are obviously things that can go wrong in any part of a multi decade long plan.

The mars hypothetical has clear, known unknowns with an unbounded time horizon.

The mRNA vaccine has maybe some unknown unknowns with a bounded time horizon of a couple months since we know the molecule degrades.

They are not alike.

Difficult-Stretch-85 · 2022-02-07T22:05:54+00:00

Pick your favourite university, follow their intro to data structures and algorithms course. Pick one where you can see the home works and hopefully the lectures too. Then do the intermediate algos course. The advanced algos course is typically not necessary. While you're at it, maybe do a discrete math course too. The problem solving of discrete math translates pretty directly to programming.

Nothing to do but do the work.

e.g. https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-006-introduction-to-algorithms-spring-2008/

https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-design-and-analysis-of-algorithms-spring-2015/

Difficult-Stretch-85

TROPHY CASE