If you are familiar with the concept of an NP-complete problem, the weights are just one possible solution.
The Traveling Salesman Problem is probably the easiest analogy to make. It’s as though we’re all trying to find the shortest path through a bunch of points (ex. towns), and when someone says “here is a path that I think is pretty good”, that is analogous to sharing network weighs for an AI. We can then all openly test that solution against other solutions and determine which is “best”.
What they aren’t telling you is whether people traveling that path somehow benefits them (maybe they own all the gas stations on that path. Or maybe they’ve hired highway men to rob people on that path). And figuring out if that’s the case in a hyper-dimensional space is non-trivial.
chicken@lemmy.dbzer0.com 1 week ago
tbf the widely used nomenclature for them is “open weights”, specifically to draw that distinction. There are genuinely open source models, in that the training data and everything is also documented, just not as many.
thejevans@lemmy.ml 1 week ago
The OSI doesn’t require open access to training data for AI models to be considered “open source”, unfortunately. opensource.org/ai/open-source-ai-definition
I agree that “open weights” is a more apt description, though