- HTP
- CoSaMP
- Iterative Hard Thresholding
- Subspace Pursuit : noisy
- HTP
- CoSaMP
- Subspace Pursuit
- Iterative Hard Thresholding
- Refine readMe inside logs folder.
- Re-run regret experiment with corrected IHT.
- Be insightful about the variances of all random things.
- If doesn't converge, try with tau = 100 fixed.
- plots : reward vs time
- plots : regret vs time
- plots : average regret vs time
- plots : accumulated reward vs time
- make notebook.
- Other algorithms.
- Fix
x_best
and continue programming.
- Converges with the log range of tau.
- Should I take
np.abs()
in the algorithms?
- In regret calculation step, is
x_best
a constant through time? y_t
should be varying, not fixed. Try both.- Is
gamma
fixed?
- No. It changes with time. Obviously.
y_t
will vary asx_best
varies. I was wrong about the understanding. Now the setting asks me to try withw_random
as fixed and varying.- Sir said, fixing it is valid for agnostic adversary scenario.