Working Set Selection - a faster approach

1. Working Set Selection- a faster approach R92922006 鄭先廷 R92922054 李明翰 R93922071 李德軒 D90942011 陳冠廷

2. Outline • The faster approach • Algorithm • Experimental Result vs. libsvm

3. Faster approach • There exists a decomposition algorithm that, given the current feasible solution x and ∆f(x) in the beginning of the next iteration, computes an (1/m^2)-rate pair for x in O(m) steps

4. Algorithm € μ+ / μ- index μ > max({max∆f(x)+ - min∆f(x)-}μ)? 10.0 + 31 > max∆f(x)+ ? _ 7 < min∆f(x)- ? 12 ….. ….. ….. 2m > max({max∆f(x)+ - min∆f(x)-}μ)? 3 > max∆f(x)+ ? + 1 > max({max∆f(x)+ - min∆f(x)-}μ)? _ 1 < min∆f(x)- ? 13

5. Experimental Result