The Recursive Hessian Sketch for Adaptive Filtering
This is the companion code that was used to produce the figures of the paper The Recursive Hessian Sketch for Adaptive Filtering by Robin Scheibler and Martin Vetterli, submitted to ICASSP 2016.
Run the code
All the code is pure python and uses only numpy, scipy, matplotlib. The code was run with ipython.
$ ipython --version 3.2.1
We use anaconda to install python, numpy, matplotlib, etc.
All the classical adaptive filters are implemented in
The proposed algorithm is in
$ ipython ./figure_Complexity.py
Start an ipython cluster in the repository.
$ ipcluster start -n x
x is the number of engines you want to use. You can change the number
of loops directly in the script line 42. Then, run the command
$ ipython figure_MSE_sim.py
This will run the long simulation needed. The result will be stored
in the folder
sim_data and the name of the file will contain the date and time.
Copy the date and time in the file
figure_MSE_plot.py line 61-64. Then run
$ ipython figure_MSE_plot.py
Finally, the file
figure_MSE_test.py allows to be quickly edited to test
$ ipython figure_MSE_test.py
Copyright (c) 2016, LCAV
This code is free to reuse for non-commercial purpose such as academic or educational. For any other use, please contact the authors.
Sketch RLS by LCAV, EPFL is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Based on a work at https://github.com/LCAV/sketchrls.