Higher Order Approximations For Maxima Of Random Fields

Author(s):  
K. Breitung
Keyword(s):  
2004 ◽  
Vol 41 (A) ◽  
pp. 35-53 ◽  
Author(s):  
V. V. Anh ◽  
N. N. Leonenko ◽  
L. M. Sakhno

This paper provides a quasi-likelihood or minimum-contrast-type method for the parameter estimation of random fields in the frequency domain based on higher-order information. The estimation technique uses the spectral density of the general kth order and allows for possible long-range dependence in the random fields. To avoid bias due to edge effects, data tapering is incorporated into the method. The suggested minimum contrast functional is linear with respect to the periodogram of kth order, hence kernel estimation for the spectral densities is not needed. Furthermore, discretization is not required in the estimation of continuously observed random fields. The consistency and asymptotic normality of the resulting estimators are established. Illustrative applications of the method to some problems in mathematical finance and signal detection are given.


2014 ◽  
Vol 2 ◽  
pp. 339-350
Author(s):  
Xian Qian ◽  
Yang Liu

We show that the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic programming; the other is a supermodular quadratic pseudo-Boolean maximization problem, which can be solved in cubic time using a minimum cut algorithm. We use dual decomposition to force their agreement. Experimental results on Twitter named entity recognition and sentence dependency tagging tasks show that our method outperforms spanning tree based dual decomposition.


Sign in / Sign up

Export Citation Format

Share Document