Search results for "Quadrat"
showing 10 items of 344 documents
Weighted bounded mean oscillation applied to backward stochastic differential equations
2015
Abstract We deduce conditional L p -estimates for the variation of a solution of a BSDE. Both quadratic and sub-quadratic types of BSDEs are considered, and using the theory of weighted bounded mean oscillation we deduce new tail estimates for the solution ( Y , Z ) on subintervals of [ 0 , T ] . Some new results for the decoupling technique introduced in Geiss and Ylinen (2019) are obtained as well and some applications of the tail estimates are given.
Block Based Deconvolution Algorithm Using Spline Wavelet Packets
2010
This paper presents robust algorithms to deconvolve discrete noised signals and images. The idea behind the algorithms is to solve the convolution equation separately in different frequency bands. This is achieved by using spline wavelet packets. The solutions are derived as linear combinations of the wavelet packets that minimize some parameterized quadratic functionals. Parameters choice, which is performed automatically, determines the trade-off between the solution regularity and the initial data approximation. This technique, which id called Spline Harmonic Analysis, provides a unified computational scheme for the design of orthonormal spline wavelet packets, fast implementation of the…
Breaking the curse of dimensionality in quadratic discriminant analysis models with a novel variant of a Bayes classifier enhances automated taxa ide…
2013
Macroinvertebrate samples are commonly used in biomonitoring to study changes on aquatic ecosystems. Traditionally, specimens are identified manually to taxa by human experts being time-consuming and cost intensive. Using the image data of 35 taxa and 64 features, we propose a novel variant of the quadratic discriminant analysis for breaking the curse of dimensionality in quadratic discriminant analysis models. Our variant, called a random Bayes array (RBA), uses bagging and random feature selection similar to random forest. We explore several variations of RBA. We consider three classification (i.e taxa identification) decisions: majority vote, averaged posterior probabilities, and a novel…
Sign and rank covariance matrices
2000
The robust estimation of multivariate location and shape is one of the most challenging problems in statistics and crucial in many application areas. The objective is to find highly efficient, robust, computable and affine equivariant location and covariance matrix estimates. In this paper, three different concepts of multivariate sign and rank are considered and their ability to carry information about the geometry of the underlying distribution (or data cloud) are discussed. New techniques for robust covariance matrix estimation based on different sign and rank concepts are proposed and algorithms for computing them outlined. In addition, new tools for evaluating the qualitative and quant…
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.
Reassessing Accuracy Rates of Median Decisions
2007
We show how Bruno de Finetti''s fundamental theorem of prevision has computable applications in statistical problems that involve only partial information. Specifically, we assess accuracy rates for median decision procedures used in the radiological diagnosis of asbestosis. Conditional exchangeability of individual radiologists'' diagnoses is recognized as more appropriate than independence which is commonly presumed. The FTP yields coherent bounds on probabilities of interest when available information is insufficient to determine a complete distribution. Further assertions that are natural to the problem motivate a partial ordering of conditional probabilities, extending the computation …
Exponential and bayesian conjugate families: Review and extensions
1997
The notion of a conjugate family of distributions plays a very important role in the Bayesian approach to parametric inference. One of the main features of such a family is that it is closed under sampling, but a conjugate family often provides prior distributions which are tractable in various other respects. This paper is concerned with the properties of conjugate families for exponential family models. Special attention is given to the class of natural exponential families having a quadratic variance function, for which the theory is particularly fruitful. Several classes of conjugate families have been considered in the literature and here we describe some of their most interesting feat…
Linear Recursive Equations, Covariance Selection, and Path Analysis
1980
Abstract By defining a reducible zero pattern and by using the concept of multiplicative models, we relate linear recursive equations that have been introduced by econometrician Herman Wold (1954) and path analysis as it was proposed by geneticist Sewall Wright (1923) to the statistical theory of covariance selection formulated by Arthur Dempster (1972). We show that a reducible zero pattern is the condition under which parameters as well as least squares estimates in recursive equations are one-to-one transformations of parameters and of maximum likelihood estimates, respectively, in a decomposable covariance selection model. As a consequence, (a) we can give a closed-form expression for t…
Robustifying principal component analysis with spatial sign vectors
2012
Abstract In this paper, we apply orthogonally equivariant spatial sign covariance matrices as well as their affine equivariant counterparts in principal component analysis. The influence functions and asymptotic covariance matrices of eigenvectors based on robust covariance estimators are derived in order to compare the robustness and efficiency properties. We show in particular that the estimators that use pairwise differences of the observed data have very good efficiency properties, providing practical robust alternatives to classical sample covariance matrix based methods.
Complete spectrum and scalar products for the open spin-1/2 XXZ quantum chains with non-diagonal boundary terms
2013
We use the quantum separation of variable (SOV) method to construct the eigenstates of the open XXZ chain with the most general boundary terms. The eigenstates in the inhomogeneous case are constructed in terms of solutions of a system of quadratic equations. This SOV representation permits us to compute scalar products and can be used to calculate form factors and correlation functions.