arXiv research

SRTC model for background/foreground separation with missing pixels.

We show that every complete metric space is homeomorphic to the precise locus of zeros of an entire analytic map from a Hilbert space to a Banach space. As a corollary, every complete separable metric space is homeomorphic to the precise locus of zeros of an entire analytic map between two separable complex Hilbert spa…

It is shown that the hyperspace of all nonempty closed subsets $\Cld_{AW}(X)$ of a separable metric space $X$ endowed with the Attouch-Wets topology is homeomorphic to a separable Hilbert space if and only if the completion of $X$ is proper, locally connected and contains no bounded connected component, $X$ is topologi…

Turaev-Viro invariants match for certain surface bundles.

We prove that the separating curve graph of a connected, compact, orientable surface with genus at least 3 and a single boundary component is not relatively hyperbolic. This completes the classification of when the separating curve graph is hyperbolic and relatively hyperbolic initiated by previous works of the authors…

We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove that positive, $C'(1/6)$ one-relator groups are conjugacy separable; we provide a…

Study explores robust Orlicz spaces in finance, showing separability implications.

The complement of a non-separating planar graph contains a K_n minor.

We consider the problem of learning causal networks with interventions, when each intervention is limited in size under Pearl's Structural Equation Model with independent errors (SEM-IE). The objective is to minimize the number of experiments to discover the causal directions of all the edges in a causal graph. Previou…

We sharpen the construction of representation space in the paper "Principal Series Representations of Infinite Dimensional Lie Groups II: Construction of Induced Representations". We show that the principal series representation spaces constructed there, are completions of spaces of sections of Hilbert bundles rather t…

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and relevant homomorphisms are also calculable in quadratic time. The algorithm also dec…

A new NMF variant tackles underdetermined problems with sparse and separable assumptions.

Study on diagonal and separating coordinates for symmetric spaces of rank 1.

Separates estimation and control in risk-sensitive investment problems with partial observation.

Paper calculates distances between strata in Teichmüller space, proving a constant separation.

We prove that every acyclic normal one-dimensional real Ambrosio-Kirchheim current in a Polish (i.e. complete separable metric) space can be decomposed in curves, thus generalizing the analogous classical result proven by S. Smirnov in Euclidean space setting. The same assertion is true for every complete metric space …

Tensors play a central role in many modern machine learning and signal processing applications. In such applications, the target tensor is usually of low rank, i.e., can be expressed as a sum of a small number of rank one tensors. This motivates us to consider the problem of low rank tensor recovery from a class of lin…

BELIEF framework interprets GLMs using binary linear models.

We solve a broad class of sequential decision-making problems with partially observed states.

The fundamental tool in the classification of orthogonal coordinate systems in which the Hamilton-Jacobi and other prominent equations can be solved by a separation of variables are second order Killing tensors which satisfy the Nijenhuis integrability conditions. The latter are a system of three non-linear partial dif…

Study proves rigidity results for analytic spacetimes without boundary or timelike boundary.

Study finite curvature solutions on surfaces with nonnegative Gauss curvature.

We solve the equivalence problem for the orthogonally separable webs on the three-sphere under the action of the isometry group. This continues a classical project initiated by Olevsky in which he solved the corresponding canonical forms problem. The solution to the equivalence problem together with the results by Olev…

Single-channel signal separation and deconvolution aims to separate and deconvolve individual sources from a single-channel mixture and is a challenging problem in which no prior knowledge of the mixing filters is available. Both individual sources and mixing filters need to be estimated. In addition, a mixture may con…

We formalize causal separation in portfolio theory, deriving a closed-form projected Markowitz solution.

Recent progress in separating the speech signals from multiple overlapping speakers using a single audio channel has brought us closer to solving the cocktail party problem. However, most studies in this area use a constrained problem setup, comparing performance when speakers overlap almost completely, at artificially…

We prove that each non-separable completely metrizable convex subset of a Frechet space is homeomorphic to a Hilbert space. This resolves an old (more than 30 years) problem of infinite-dimensional topology. Combined with the topological classification of separable convex sets due to Klee, Dobrowoslki and Torunczyk, th…

In this paper, we give a complete characterization on which finitely generated subgroups of finitely generated $3$-manifold groups are separable. Our characterization generalizes Liu's spirality character on $π_1$-injective immersed surface subgroups of closed $3$-manifold groups. A consequence of our characterization …

We consider perturbed quadharmonic operators, $Δ^4 + V$, acting on sections of a Hermitian vector bundle over a complete Riemannian manifold, with the potential $V$ satisfying a bound from below by a non-positive function depending on the distance from a point. Under a bounded geometry assumption on the Hermitian vecto…

We study the space of complete Riemannian metrics of nonnegative curvature on the plane equipped with the C^k topology. If k is infinite, we show that the space is homeomorphic to the separable Hilbert space. For any k we prove that the space cannot be made disconnected by removing a finite dimensional subset. A simila…

Develops a new framework for causal models on cyclic graphs, solving unique solvability issues.

New algorithm for nonnegative tensor completion with linear convergence rate.

In this paper, we give an algorithm to build all compact orientable atoroidal Haken 3-manifolds with tori boundary or closed orientable Haken 3-manifolds, so that in both cases, there are embedded closed orientable separating incompressible surfaces which are not tori. Next, such incompressible surfaces are related to …

We associate cube complexes called completions to each subgroup of a right-angled Coxeter group (RACG). A completion characterizes many properties of the subgroup such as whether it is quasiconvex, normal, finite-index or torsion-free. We use completions to show that reflection subgroups are quasiconvex, as are one-end…

We extend a recently proposed 1-nearest-neighbor based multiclass learning algorithm and prove that our modification is universally strongly Bayes-consistent in all metric spaces admitting any such learner, making it an "optimistically universal" Bayes-consistent learner. This is the first learning algorithm known to e…

Matrix completion is a problem that arises in many data-analysis settings where the input consists of a partially-observed matrix (e.g., recommender systems, traffic matrix analysis etc.). Classical approaches to matrix completion assume that the input partially-observed matrix is low rank. The success of these methods…

It is shown that bootstrap approximations of an estimator which is based on a continuous operator from the set of Borel probability measures defined on a compact metric space into a complete separable metric space is stable in the sense of qualitative robustness. Support vector machines based on shifted loss functions …

Classifies polynomial growth solutions to drift-harmonic equations on asymptotically paraboloidal manifolds.

Completes preliminary structures in 3D flows to foliations.

New framework for cyclic quantum causal models with graph separation property.

New bounds improve linkage methods for clustering, distinguishing complete-link from single-link.

Starting from a bundle E over R, the dual of the first jet bundle, which is a co-dimension 1 sub-bundle of the cotangent bundle of E, is the appropriate manifold for the geometric description of time-dependent Hamiltonian systems. Based on previous work, we recall properties of the complete lifts of a type (1,1) tensor…

We present a complete classification of Einstein metrics on the space M = I \times S^3, where I is the interval (0,l) or (0,\infty) or their closures, and we consider separate metric functions f and h (functions of I) for the base and fiber of the Hopf fibration S^1 -> S^3 -> S^2. All such metrics yielding smooth and c…

This paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracking Algorithm), an efficient and robust online algorithm for tracking subspaces from highly incomplete information. The algorithm uses a robust $l^1$-norm cost function in order to estimate and track non-stationary subspaces when the streaming data …

Novel unsupervised audio source separation using generative priors.

Paper proposes a new method to separate low rank and sparse matrices without bias.

We determine the homeomorphism type of the space of smooth complete nonnegatively curved metrics on surfaces of positive Euler characteristic equipped with the topology of $C^γ$ uniform convergence on compact sets, when $γ$ is infinite or is not an integer. If $γ=\infty$, the space of metrics is homeomorphic to the sep…

Open problem: Establishing bounds for Cayley-table completion to discover discrete algorithmic axioms.