Finally, we give a simple approach to verify that a particular token is unspeakable rather than just being hard-to-speak.
You’re using an optimization procedure to find an embedding that produces an output, and if you cannot find one you say it is unspeakable. How confident are you that the optimization is strong enough? I.e. what are the odds that a god-mode optimizer in this high-dimensional space could actually find an embedding that produces the unspeakable token, it’s just that linprog wasn’t strong enough?
Just checking here, I can totally imagine that the optimizer is an unlikely point of failure. Nice work again!
You’re using an optimization procedure to find an embedding that produces an output, and if you cannot find one you say it is unspeakable. How confident are you that the optimization is strong enough? I.e. what are the odds that a god-mode optimizer in this high-dimensional space could actually find an embedding that produces the unspeakable token, it’s just that linprog wasn’t strong enough?
Just checking here, I can totally imagine that the optimizer is an unlikely point of failure. Nice work again!