Double machine learning provides √ n-consistent estimates of parameters of interest even when highdimensional or nonparametric nuisance parameters are estimated at an n−1/4 rate. The key is to employ Neyman-orthogonal moment equations which are first-order insensitive to perturbations in the nuisance parameters. We show that the n−1/4 requirement can be improved to n−1/(2k+2) by employing a kth...

The most commonly used techniques for credit scoring is logistic regression, and more recent research has proposed that the support vector machine is a more effective method. However, both logistic regression and support vector machine suffers from curse of dimension. In this paper, we introduce a new way to address this problem which is defined as orthogonal dimension reduction. We discuss the...

In this paper, we show that the projection of a regular orthogonal array of strength t onto more than t factors consists of replicates of either a fractional factorial or a full factorial design of strength t, depending on the number of factors retained in the projection.

In this paper we show additional properties of the limit of the sequence produced by the subspace correction algorithm proposed by Fornasier and Schönlieb [24] for L2/TV -minimization problems. Inspired by the work of Vonesch and Unser [34], we adapt and specify this algorithm to the case of an orthogonal wavelet space decomposition and for deblurring problems.

It is shown that regularity of orthogonal wavelet matrices, i.e. vanishing of discrete moments of some of their rows, corresponds to maximizing the discrete moments of one of the rows. This leads to an algorithm for calculation of such wavelets by nding a vector which simultaneosly vanishes certain indeenite quadratic forms.

An orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of n spanning subgraphs of Kn, all isomorphic toG, such that any two members ofG share exactly one edge and every edge ofKn is contained in exactly two members of G. In the 1980s Hering posed the problem to decide the existence of an ODC for the case that G is an almost-Hamiltonian cycle, i.e. a cycle of le...

in this study, flow characteristics through symmetric stenosis artery are investigated. the shape of eccentricity for stenotic flows is limited by circular-cross sections and plaques are usually assumed as to be oriented concentrically. thegoverningequationsaretheusualnavier-stokesequationsandare numericallysolved by using finite volumemethod in arbitrary orthogonal curvilinear coordinates. in ad...

We propose an approach to constructing a new type of design, a sliced space-filling design, intended for computer experiments with qualitative and quantitative factors. The approach starts with constructing a Latin hypercube design based on a special orthogonal array for the quantitative factors and then partitions the design into groups corresponding to different level combinations of the qual...

A simple orthogonal array OA(q2n−1, q2n−2, q, 2) is constructed by using the action of a large subgroup of PGL(n + 1, q2) on a set of non degenerate Hermitian varieties in PG(n, q2).