arXiv research

Paper reviews advances in solving sparsest vector problem in subspaces.

A new method for efficient causal structure learning at scale.

This paper finds sparsest ReLU networks for interpolating data.

BP fails to find sparsest solution for structured matrices.

New method for exact matrix completion with reduced observation complexity.

We consider the task of learning a causal graph in the presence of latent confounders given i.i.d.~samples from the model. While current algorithms for causal structure discovery in the presence of latent confounders are constraint-based, we here propose a score-based approach. We prove that under assumptions weaker th…

The non-negative solution to an underdetermined linear system can be uniquely recovered sometimes, even without imposing any additional sparsity constraints. In this paper, we derive conditions under which a unique non-negative solution for such a system can exist, based on the theory of polytopes. Furthermore, we deve…

SCE improves network embedding using sparsest cut for negative samples only.

Is it possible to find the sparsest vector (direction) in a generic subspace $\mathcal{S} \subseteq \mathbb{R}^p$ with $\mathrm{dim}(\mathcal{S})= n < p$? This problem can be considered a homogeneous variant of the sparse recovery problem, and finds connections to sparse dictionary learning, sparse PCA, and many other …

Two-sample feature selection is the problem of finding features that describe a difference between two probability distributions, which is a ubiquitous problem in both scientific and engineering studies. However, existing methods have limited applicability because of their restrictive assumptions on data distributoins …

We prove a quantitative bi-Lipschitz nonembedding theorem for the Heisenberg group with its Carnot-Carathéodory metric and apply it to give a lower bound on the integrality gap of the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem.

In the context of sparse recovery, it is known that most of existing regularizers such as $\ell_1$ suffer from some bias incurred by some leading entries (in magnitude) of the associated vector. To neutralize this bias, we propose a class of models with partial regularizers for recovering a sparse solution of a linear …

We address the sparse signal recovery problem in the context of multiple measurement vectors (MMV) when elements in each nonzero row of the solution matrix are temporally correlated. Existing algorithms do not consider such temporal correlations and thus their performance degrades significantly with the correlations. I…

New method improves IV estimation with many weak and invalid instruments.

Differentiable structure learning addresses DAGs with multiple global minimizers.

The paper tackles subspace-preserving recovery of sparse signals from overcomplete dictionaries.

The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of linear equations. Then, two approaches are considered to find these group-sparse sol…

Paper quantifies uncertainty in pairwise comparison models.

We consider the change-point detection problem of deciding, based on noisy measurements, whether an unknown signal over a given graph is constant or is instead piecewise constant over two connected induced subgraphs of relatively low cut size. We analyze the corresponding generalized likelihood ratio (GLR) statistics a…

Big Data bring new opportunities to modern society and challenges to data scientists. On one hand, Big Data hold great promises for discovering subtle population patterns and heterogeneities that are not possible with small-scale data. On the other hand, the massive sample size and high dimensionality of Big Data intro…

Learning optimal dictionaries for sparse coding has exposed characteristic sparse features of many natural signals. However, universal guarantees of the stability of such features in the presence of noise are lacking. Here, we provide very general conditions guaranteeing when dictionaries yielding the sparsest encoding…

Paper proposes a method to solve sparse Bayesian learning problems efficiently.

The report studies ranking from pairwise comparisons in graphs, achieving optimal error bounds and proposing efficient algorithms.

Kernel methods are popular in clustering due to their generality and discriminating power. However, we show that many kernel clustering criteria have density biases theoretically explaining some practically significant artifacts empirically observed in the past. For example, we provide conditions and formally prove the…

Given an overcomplete dictionary $A$ and a signal $b$ that is a linear combination of a few linearly independent columns of $A$, classical sparse recovery theory deals with the problem of recovering the unique sparse representation $x$ such that $b = A x$. It is known that under certain conditions on $A$, $x$ can be re…

Efficiently discovers causal DAG permutations without additional assumptions.

ReLU networks learn simple models even with many parameters, overcoming traditional wisdom.

Many modern data-intensive computational problems either require, or benefit from distance or similarity data that adhere to a metric. The algorithms run faster or have better performance guarantees. Unfortunately, in real applications, the data are messy and values are noisy. The distances between the data points are …

Algorithm approximates regularization path for deep neural networks efficiently.

Diffusion MRI (dMRI) provides the ability to reconstruct neuronal fibers in the brain, $\textit{in vivo}$, by measuring water diffusion along angular gradient directions in q-space. High angular resolution diffusion imaging (HARDI) can produce better estimates of fiber orientation than the popularly used diffusion tens…

Choice models, which capture popular preferences over objects of interest, play a key role in making decisions whose eventual outcome is impacted by human choice behavior. In most scenarios, the choice model, which can effectively be viewed as a distribution over permutations, must be learned from observed data. The ob…

Paper develops zeroth and first order stochastic Frank-Wolfe algorithms for constrained optimization.

Speaker verification (SV) systems using deep neural network embeddings, so-called the x-vector systems, are becoming popular due to its good performance superior to the i-vector systems. The fusion of these systems provides improved performance benefiting both from the discriminatively trained x-vectors and generative …

Paper transforms torse-forming vector fields into simpler forms.

Given an d-dimensional manifold with two commuting Killing vectors, together with an d - 1 dimensional submanifold in which one of the Killing vectors lies, then the lapse and shift of the second Killing vector, relative to this slice, remain constant along the orbits of the `surface' Killing vector. Alternatively, the…

New pushforward operation on vector pseudo-bundles creates new examples.

The paper proves that certain modified conformal vector fields are trivial on compact and non-compact manifolds.

The position vector field x is the most elementary and natural geometric object on a Euclidean submanifold $M$. The position vector field plays very important roles in mathematics as well as in physics. Similarly, the tangential component x^T of the position vector field is the most natural vector field tangent to the …

For a submanifold M in a Euclidean space, the tangential component x^T of the position vector field x of M is the most natural vector field tangent to the Euclidean submanifold, called the canonical vector field of M. In this article, first we prove that the canonical vector field of every Euclidean submanifold is alwa…

Characterizes spacetimes using doubly torqued vectors.

Study biharmonic vector fields and unit vector fields on Riemannian manifolds.

Abstract: Generalizes multisymplectic forms to vector-valued versions.

The paper bounds the mean absolute error in DNN vector-to-vector regression.

This short report establishes some basic properties of smooth vector fields on product manifolds. The main results are: (i) On a product manifold there always exists a direct sum decomposition into horizontal and vertical vector fields. (ii) Horizontal and vertical vector fields are naturally isomorphic to smooth famil…

Defines quaternionic k-vector fields on quaternionic Kähler manifolds.

SVM generalizes well even with many support vectors in high dimensions.

Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.

Classifies equivariant vector bundles over toric manifolds.