It sounds very much like complexity theory, where you definitely have problems that are easier to verify than solve (see NP hard).
(Otherwise I could do stuff like use a hash function to train a NN to compute input for hashes , for example, no?)
1) computationally intractable to forge. (e.g. requires simulating trillions of photons)
2) computationally tractable to verify
Sadly, my immediate gut intuition is that there is not such a problem, for a variety of reasons; but hopefully I'm wrong!
In theory, yes - you can. The training function could return a score - say the number of matching digits in the hash - and the NN will in theory learn what inputs produce the better output. If somehow, there is a weakness in the hash algorithm, it could stumble onto it - allowing it to get better at producing the right input to get the required output.
The simpler it is to deterministically manipulate, the easier it should be for a NN to learn to manipulate - even of the function is just returning a boolean or a "rating between 1 and 10". So yea, good hash functions are unlikely to be learned and solved, but photos and videos aren't designed to be hash functions.
(All that said, I'm willing to be bet the time and computing power you'd need to pour into this NN to break a good hash function is likely more than has ever existed in the sum of all past time + computing resources ;))
I think you mean NP. NP hard includes problems that are not in NP, such as the halting problem.
I'm not aware of any proof that photorealistic 3D rendering is in NP. If it is not, then verifying 3D cannot be said to be easy.
[1] https://en.wikipedia.org/wiki/P_versus_NP_problem#Reasons_to...
The main argument from your link is nobody has found an efficient algorithm for any of the 3,000+ studied problems after all this time.
And yet it’s also true that in the same span of time, nobody has been able to prove the that it’s not, either. No matter how hard they have tried.
“probably not” is just an opinion. I’ll wait for the formal proof. Till then it simply is not known whether or not.
if there was some score that would look at lighting etc, you probably could just tack it on to one of the loss functions somewhere and expect to see improvement.
maybe not enough to beat the system; or perhaps it would increase the lighting score but make the image obviously unrealistic in other ways we haven’t thought of.
basically at this point you would have a lot of if-else statements, like a "Expert System" AI in the 80s.
so much so that it would be better to use a NN to replace the loss/error/verification function instead of coding it by hand?