相关论文: Multivariate Regression Depth

The $k$-deck of a graph is its multiset of induced subgraphs on $k$ vertices. We prove that $n$-vertex graphs with maximum degree $2$ have the same $k$-decks if each cycle has at least $k+1$ vertices, each path component has at least $k-1$…

The $k$-flex locus of a projective hypersurface $V\subset \mathbb P^n$ is the locus of points $p\in V$ such that there is a line with order of contact at least $k$ with $V$ at $p$. Unexpected contact orders occur when $k\ge n+1$. The case…

Regression analysis is a standard supervised machine learning method used to model an outcome variable in terms of a set of predictor variables. In most real-world applications we do not know the true value of the outcome variable being…

Based on the numerical manifold method principle, we developed a mathematical framework of a neural network manifold: Deep Manifold and discovered that neural networks: 1) is numerical computation combining forward and inverse; 2) have near…

The colourful simplicial depth of a point x in the plane relative to a configuration of n points in k colour classes is exactly the number of closed simplices (triangles) with vertices from 3 different colour classes that contain x in their…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the…

Given a set of $n$ weighted points on the $x$-$y$ plane, we want to find a step function consisting of $k$ horizontal steps such that the maximum vertical weighted distance from any point to a step is minimized. We solve this problem in…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

We study the following basic machine learning task: Given a fixed set of $d$-dimensional input points for a linear regression problem, we wish to predict a hidden response value for each of the points. We can only afford to attain the…

We study a general class of bilevel problems, consisting in the minimization of an upper-level objective which depends on the solution to a parametric fixed-point equation. Important instances arising in machine learning include…

We use a new method to give conditions for the existence of a local isometric immersion of a Riemannian $n$-manifold $M$ in $\mathbb{R}^{n+k}$, for a given $n$ and $k$. These equate to the (local) existence of a $k$-tuple of scalar fields…

Deep learning revolutionized data science, and recently its popularity has grown exponentially, as did the amount of papers employing deep networks. Vision tasks, such as human pose estimation, did not escape from this trend. There is a…

Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x, y in K is nearly…

In this work, we demonstrate that a major limitation of regression using a mean-squared error loss is its sensitivity to the scale of its targets. This makes learning settings consisting of target's whose values take on varying scales…

Non-parametric estimation of functions as well as their derivatives by means of local-polynomial regression is a subject that was studied in the literature since the late 1970's. Given a set of noisy samples of a $\mathcal{C}^k$ smooth…

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

A common belief in high-dimensional data analysis is that data are concentrated on a low-dimensional manifold. This motivates simultaneous dimension reduction and regression on manifolds. We provide an algorithm for learning gradients on…

Deep, overparameterized regression models are notorious for their tendency to overfit. This problem is exacerbated in heteroskedastic models, which predict both mean and residual noise for each data point. At one extreme, these models fit…

Suppose an $n \times d$ design matrix in a linear regression problem is given, but the response for each point is hidden unless explicitly requested. The goal is to sample only a small number $k \ll n$ of the responses, and then produce a…