Asset Details
Do you wish to reserve the book?
Fast Approximation of Rotations and Hessians matrices
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Fast Approximation of Rotations and Hessians matrices
Do you wish to request the book?
Fast Approximation of Rotations and Hessians matrices
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
Fast Approximation of Rotations and Hessians matrices
2014
Overview
A new method to represent and approximate rotation matrices is introduced. The method represents approximations of a rotation matrix \\(Q\\) with linearithmic complexity, i.e. with \\(\\frac{1}{2}n\\lg(n)\\) rotations over pairs of coordinates, arranged in an FFT-like fashion. The approximation is \"learned\" using gradient descent. It allows to represent symmetric matrices \\(H\\) as \\(QDQ^T\\) where \\(D\\) is a diagonal matrix. It can be used to approximate covariance matrix of Gaussian models in order to speed up inference, or to estimate and track the inverse Hessian of an objective function by relating changes in parameters to changes in gradient along the trajectory followed by the optimization procedure. Experiments were conducted to approximate synthetic matrices, covariance matrices of real data, and Hessian matrices of objective functions involved in machine learning problems.
Publisher
Cornell University Library, arXiv.org
