arXiv research

Proposes RNSE for clustering with adaptive similarity matrix learning.

The Prescriptive Canvas improves business outcomes by directly prescribing actions based on predictions.

This paper tackles unpaired data in multi-view learning, proposing a new framework and models.

Recently the field of inverse problems has seen a growing usage of mathematically only partially understood learned and non-learned priors. Based on first principles, we develop a projectional approach to inverse problems that addresses the incorporation of these priors, while still guaranteeing data consistency. We im…

Study of alternating links on nonorientable surfaces, extending results to nonorientable projections.

We show that one can interweave an unknot into any non-alternating connected projection of a link so that the resulting augmented projection is alternating.

The successive projection algorithm (SPA) can quickly solve a nonnegative matrix factorization problem under a separability assumption. Even if noise is added to the problem, SPA is robust as long as the perturbations caused by the noise are small. In particular, robustness against noise should be high when handling th…

Study bounds on cusp volumes of alternating knots on surfaces.

In this paper, we propose a new fast and robust recursive algorithm for near-separable nonnegative matrix factorization, a particular nonnegative blind source separation problem. This algorithm, which we refer to as the successive nonnegative projection algorithm (SNPA), is closely related to the popular successive pro…

Principal Component Analysis (PCA) is a very successful dimensionality reduction technique, widely used in predictive modeling. A key factor in its widespread use in this domain is the fact that the projection of a dataset onto its first $K$ principal components minimizes the sum of squared errors between the original …

This paper is devoted to prove the existence of $q$-periodic alternating projections of prime alternating $q$-periodic knots. The main tool is the Menasco-Thistlethwaite's Flyping theorem. Let $K$ be an oriented prime alternating knot that is $q$-periodic with $q\geq 3$, i.e. $K$ admits a symmetry that is a rotation of…

This paper proposes a method to select project schedules with the lowest risk.

Study shows bounds on volumes of weakly generalised alternating knots.

New number bounds knot complexity, including unknotting and crosscap numbers.

We study the set of Crowell states for alternating knot projections and show that for prime alternating knots the space of states for a reduced projection is connected, a result similar to that for Kauffman states. As an application we give a new proof of a result of Ozsvath and Szabo characterizing (2,2n+1) torus knot…

This paper studies periodic and free periodic knots in alternating projections.

New method reduces computational cost for nonnegative low rank matrix approximation.

This paper deals with unsupervised clustering with feature selection. The problem is to estimate both labels and a sparse projection matrix of weights. To address this combinatorial non-convex problem maintaining a strict control on the sparsity of the matrix of weights, we propose an alternating minimization of the Fr…

It is widely believed that the success of deep convolutional networks is based on progressively discarding uninformative variability about the input with respect to the problem at hand. This is supported empirically by the difficulty of recovering images from their hidden representations, in most commonly used network …

A new method for generating time-dependent densities efficiently.

Unified framework for multi-view learning with orthogonal projections.

This article is devoted to the study of prime alternating +achiral knots. In the case of arborescent knots, we prove in +AAA Visibility Theorem 5.1, that the symmetry is visible on a certain projection (not necessarily minimal) and that it is realised by a homeomorphism of order 4. In the general case (arborescent or n…

Paper solves robust multi-dimensional scaling with accelerated projections.

This paper tabulates prime knot projections up to eight double points.

In this paper, we study the recovery of a signal from a set of noisy linear projections (measurements), when such projections are unlabeled, that is, the correspondence between the measurements and the set of projection vectors (i.e., the rows of the measurement matrix) is not known a priori. We consider a special case…

Menasco showed that a non-split, prime, alternating link that is not a 2-braid is hyperbolic in $S^3$. We prove a similar result for links in closed thickened surfaces $S \times I$. We define a link to be fully alternating if it has an alternating projection from $S\times I$ to $S$ where the interior of every complemen…

New method improves MMD estimation without convexity assumptions.

The paper addresses the $k$-tangle enumeration problem. We introduce a notion of cascade diagram for $k$-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections with up to 12 crossings are tabulated. We provide also pictures of alternating …

Nonparametric tests via kernel embedding of distributions have witnessed a great deal of practical successes in recent years. However, statistical properties of these tests are largely unknown beyond consistency against a fixed alternative. To fill in this void, we study here the asymptotic properties of goodness-of-fi…

We give an alternative definition of relative hyperbolicity based on properties of closest-point projections on peripheral subgroups. We also derive a distance formula for relatively hyperbolic groups, similar to the one for mapping class groups.

Introduces a framework using information theory for understanding machine learning.

Paper defines conditions for projective links in projective 3-space.

Paper tackles efficient SGD methods for constrained bilevel optimization.

We solved a conjecture about braid group quotients being alternating groups.

Augmented alternating links are links obtained by adding trivial components that bound twice-punctured disks to non-split reduced non-2-braid prime alternating projections. These links are known to be hyperbolic. Here, we extend to show that generalized augmented alternating links, which allow for new trivial component…

Large sectors of the recent optimization literature focused in the last decade on the development of optimal stochastic first order schemes for constrained convex models under progressively relaxed assumptions. Stochastic proximal point is an iterative scheme born from the adaptation of proximal point algorithm to nois…

The paper studies right-angled links on higher genus surfaces.

Proves certain alternating links have specific geometric properties.

The Jones polynomial of an alternating link is a certain specialization of the Tutte polynomial of the (planar) checkerboard graph associated to an alternating projection of the link. The Bollobas-Riordan-Tutte polynomial generalizes the Tutte polynomial of planar graphs to graphs that are embedded in closed oriented s…

Bayesian deep learning avoids underfitting by projecting onto null space of generalized Gauss-Newton matrix.

We present an objective function for learning with unlabeled data that utilizes auxiliary expectation constraints. We optimize this objective function using a procedure that alternates between information and moment projections. Our method provides an alternate interpretation of the posterior regularization framework (…

In this paper, we study the sum rate maximization for successive zero-forcing dirty-paper coding (SZFDPC) with per-antenna power constraint (PAPC). Although SZFDPC is a low-complexity alternative to the optimal dirty paper coding (DPC), efficient algorithms to compute its sum rate are still open problems especially und…

Paper improves SPA and its variants' robustness to noise.

Rapid simulations of advection-dominated problems are vital for multiple engineering and geophysical applications. In this paper, we present a long short-term memory neural network to approximate the nonlinear component of the reduced-order model (ROM) of an advection-dominated partial differential equation. This is mo…

Optimal projections enhance Naive Bayes classification.

An ideal triangulation $\mathcal{T}$ of a hyperbolic 3-manifold $M$ with one cusp is non-peripheral if no edge of $\mathcal{T}$ is homotopic to a curve in the boundary torus of $M$. For such a triangulation, the gluing and completeness equations can be solved to recover the hyperbolic structure of $M$. A planar project…

Novel methods improve machine learning efficiency and accuracy.

The study finds lower bounds for the warping degree of a knot projection.