相关论文: Multivariate Regression Depth

Depth notions in regression have been systematically proposed and examined in Zuo (2018). One of the prominent advantages of notion of depth is that it can be directly utilized to introduce median-type deepest estimating functionals (or…

Based on the tree architecture, the objective of this paper is to design deep neural networks with two or more hidden layers (called deep nets) for realization of radial functions so as to enable rotational invariance for near-optimal…

We consider semi-supervised regression when the predictor variables are drawn from an unknown manifold. A simple two step approach to this problem is to: (i) estimate the manifold geodesic distance between any pair of points using both the…

Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth…

Many man-made objects are characterised by a shape that is symmetric along one or more planar directions. Estimating the location and orientation of such symmetry planes can aid many tasks such as estimating the overall orientation of an…

Consider a non-negative number $t$ and a hyperplane $H$ of $\mathbb{R}^d$ whose distance to the center of the hypercube $[0,1]^d$ is $t$. If $t$ is equal to $0$ and $H$ is orthogonal to a diagonal of $[0,1]^d$, it is known that the…

We will show that for any $n\ge N$ points on the $N$-dimensional sphere $S^N$ there is a closed hemisphere which contains at least $\lfloor\frac{n+N+1}{2}\rfloor$ of these points. This bound is sharp and we will calculate the amount of sets…

Despite their empirical success, pushing Transformer architectures to extreme depth often leads to a paradoxical failure: representations become increasingly redundant, lose rank, and ultimately collapse. Existing explanations largely…

For strongly convex objectives that are smooth, the classical theory of gradient descent ensures linear convergence relative to the number of gradient evaluations. An analogous nonsmooth theory is challenging. Even when the objective is…

Depth is a concept that measures the `centrality' of a point in a given data cloud or in a given probability distribution. Every depth defines a family of so-called trimmed regions. For statistical applications it is desirable that with…

Consider a regression problem where the learner is given a large collection of $d$-dimensional data points, but can only query a small subset of the real-valued labels. How many queries are needed to obtain a $1+\epsilon$ relative error…

This paper studies how to generalize Tukey's depth to problems defined in a restricted space that may be curved or have boundaries, and to problems with a nondifferentiable objective. First, using a manifold approach, we propose a broad…

We revisit the HED Method for the Mullins-Sekerka evolution in the plane. We identify a natural notion of distance, intrinsic to the interface itself. Using this distance, the energy, and the dissipation, we develop natural assumptions on…

We study exact Lagrangian immersions with one double point of a closed orientable manifold K into n-complex-dimensional Euclidean space. Our main result is that if the Maslov grading of the double point does not equal 1 then K is homotopy…

Data depth is a statistical function that generalizes order and quantiles to the multivariate setting and beyond, with applications spanning over descriptive and visual statistics, anomaly detection, testing, etc. The celebrated halfspace…

Multiple near frontal-parallel planes based depth representation demonstrated impressive results in self-supervised monocular depth estimation (MDE). Whereas, such a representation would cause the discontinuity of the ground as it is…

Exploiting the variational interpretation of kernel interpolation we exhibit a direct connection between interpolation and regression, where interpolation appears as a limiting case of regression. By applying this framework to point clouds…

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

The well-known Reifenberg theorem states that if a subset of $\mathbb{R}^n$ can be well approximated by $k$-planes at every point and every scale, then it is biH\"older homeomorphic to a $k$-disk. This article concerns a subset $S$ of…

We consider the regression problem of estimating functions on $\mathbb{R}^D$ but supported on a $d$-dimensional manifold $ \mathcal{M} \subset \mathbb{R}^D $ with $ d \ll D $. Drawing ideas from multi-resolution analysis and nonlinear…