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
Hi, I find the code following the link in your paper. When I read the step 1 of AdaLDA, I am curious about how can you treat step 1 as a linear programme, and now I am checking your code implementation, but I still have some questions.
It seems that you decomposed ,
then
and then you can write the following code
But it seems that we would have additional constraints, i.e., either or should be zero by the definition.
Maybe I have missed some other points, and wish you can help me.
The text was updated successfully, but these errors were encountered:
Hi, I find the code following the link in your paper. When I read the step 1 of AdaLDA, I am curious about how can you treat step 1 as a linear programme, and now I am checking your code implementation, but I still have some questions.
It seems that you decomposed
,
then
and then you can write the following code
ADAM/AdaLDA.m
Lines 30 to 35 in fd0b125
But it seems that we would have additional constraints, i.e., either or should be zero by the definition.
Maybe I have missed some other points, and wish you can help me.
The text was updated successfully, but these errors were encountered: