You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
What would be the best approach (if it is possible) to provide the system with a matrix M alongside a query vector q, such that the similarity by which search is compared is calculated on (qM, xM) pairs (for the x vectors in the index). This approach is suggested, and seems to work well, in the OpenAI notebook here.
I am intentionally keeping this very vague, as I know standard indexes would not support this, but maybe there is some place where this concept could neatly fit in.
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
-
What would be the best approach (if it is possible) to provide the system with a matrix
M
alongside a query vectorq
, such that the similarity by which search is compared is calculated on (qM
,xM
) pairs (for thex
vectors in the index). This approach is suggested, and seems to work well, in the OpenAI notebook here.I am intentionally keeping this very vague, as I know standard indexes would not support this, but maybe there is some place where this concept could neatly fit in.
Beta Was this translation helpful? Give feedback.
All reactions