Atomic auto-encoders for learning sparse representations
At the Gretsi 2025, one session was about inverse problems. An example inverse problem involves find a high-dimensional signal \(x\) from low dimensional observations \(y\) under a linear model \(y = A x +z\) where \(z\) is a measurement noise, \(A\) the sensing matrix.
One approach involves compressed sensing where you try to decompose your signal as the combination of the smallest number of dictionnary elements. In this family of approachs, (missing reference) proposed latent auto-encoders.
References
Enjoy Reading This Article?
Here are some more articles you might like to read next:
- Google Gemini updates: Flash 1.5, Gemma 2 and Project Astra
- Displaying External Posts on Your al-folio Blog
- Liste des techniques pour l'UV2
- End of support for Volta GPUs with pytorch
- Customizing neovim
- Adb commands over wifi
- Rethinking deep vision interpretability
- Job token permissions to access registries
- Regularized gradient descent
- Test