Sciweavers

746 search results - page 2 / 150
» Fast (Structured) Newton Computations
Sort
View
AAAI
2011
12 years 7 months ago
Fast Newton-CG Method for Batch Learning of Conditional Random Fields
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
Yuta Tsuboi, Yuya Unno, Hisashi Kashima, Naoaki Ok...
ICA
2004
Springer
14 years 1 months ago
Blind Deconvolution Using the Relative Newton Method
We propose a relative optimization framework for quasi maximum likelihood blind deconvolution and the relative Newton method as its particular instance. Special Hessian structure a...
Alexander M. Bronstein, Michael M. Bronstein, Mich...
JMLR
2012
11 years 10 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
JCC
2010
105views more  JCC 2010»
13 years 6 months ago
Fast determination of the optimal rotational matrix for macromolecular superpositions
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...
Pu Liu, Dimitris K. Agrafiotis, Douglas L. Theobal...
SIAMSC
2010
155views more  SIAMSC 2010»
13 years 2 months ago
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
Berkant Savas, Lek-Heng Lim