We propose a set of convex low rank inducing norms for a coupled matrices and tensors (hereafter coupled tensors), which shares information between matrices and tensors through common modes. More specifically, we propose a mixture of the overlapped trace norm and the latent norms with the matrix trace norm, and then, w…
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Study classifies 3D self-shrinkers with constant second form norm.
Generalizes inequality for complete manifolds involving homology classes.
Matrix completion has been well studied under the uniform sampling model and the trace-norm regularized methods perform well both theoretically and numerically in such a setting. However, the uniform sampling model is unrealistic for a range of applications and the standard trace-norm relaxation can behave very poorly …
Social trust prediction addresses the significant problem of exploring interactions among users in social networks. Naturally, this problem can be formulated in the matrix completion framework, with each entry indicating the trustness or distrustness. However, there are two challenges for the social trust problem: 1) t…
A new tensor p-shrinkage nuclear norm improves low-rank tensor completion.
We introduce twisted Alexander norms of a compact connected orientable 3-manifold with first Betti number bigger than one generalizing norms of McMullen and Turaev. We show that twisted Alexander norms give lower bounds on the Thurston norm of a 3-manifold. Using these we completely determine the Thurston norm of many …
In this paper, we investigate the sample size requirement for a general class of nuclear norm minimization methods for higher order tensor completion. We introduce a class of tensor norms by allowing for different levels of coherence, which allows us to leverage the incoherence of a tensor. In particular, we show that …
RTC-GTNLN model recovers traffic data from missing values and noise.
We consider in this paper the problem of noisy 1-bit matrix completion under a general non-uniform sampling distribution using the max-norm as a convex relaxation for the rank. A max-norm constrained maximum likelihood estimate is introduced and studied. The rate of convergence for the estimate is obtained. Information…
The study provides bounds for geodesic diameter in Euclidean space.
In this paper we investigate complete critical metrics of the -norm of the scalar curvature. We prove that any complete critical metric with positive scalar curvature has constant scalar curvature and we characterize critical metrics with nonnegative scalar curvature in dimension three and four.
We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-, order-, tensor where , the best sampling complexity that was achieved is , which is obtained by solving a tensor nuclear-norm minimizatio…
In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix completion, and provide unified upper bounds on the sample complexity and the estimatio…
Robust tensor ring completion improves tensor recovery accuracy and efficiency.
Let be a noncompact complete -manifold with harmonic curvature and positive Sobolev constant. Assume that norms of Weyl curvature and traceless Ricci curvature are finite. We prove that is Einstein if and norms of Weyl curvature and traceless Ricci curvature are small enough…
New method estimates missingness probabilities for MNAR matrix completion.
New algorithms solve tensor problems with random components using SDP.
New method stabilizes FQE by reweighting Bellman targets.
New nonconvex regularizers improve low-rank matrix recovery efficiency and accuracy.
This paper tackles robustness of ensemble stumps and trees under general ℓ_p norm perturbations.
Matrix completion works well for smooth non-linear structures, even without low-rank assumptions.
The study classifies complete self-shrinkers in Euclidean space.
We obtain a Chern-Osserman type equality of a complete properly immersed surface in Euclidean space, provided the L^2-norm of the second fundamental form is finite. Also, by using a monotonicity formula, we prove that if the L^2-norm of mean curvature of a noncompact surface is finite, then it has at least quadratic ar…
Given a sequence of complete Riemannian manifolds of the same dimension, we construct a complete Riemannian manifold such that for all the -norm of the Riesz transform on dominates the -norm of the Riesz transform on for all . Thus we establish the following dichoto…
It is our purpose to study complete self-shrinkers in Euclidean space. By introducing a generalized maximum principle for -operator, we give estimates on supremum and infimum of the squared norm of the second fundamental form of self-shrinkers without assumption on \emph{polynomial volume growth}, which is…
Selective sampling improves matrix completion with known structure.
Researchers classify 3D self-shrinkers in 4D space.
Efficiently learns matching rewards in two-sided markets with matrix completion.
The purpose of this paper is to study complete -surfaces in Euclidean space . A complete classification for 2-dimensional complete -surfaces in Euclidean space with constant squared norm of the second fundamental form is given.
The paper improves tensor completion bounds using spectral gap.
New nonconvex regularizer speeds up low-rank matrix completion.
The paper tackles matrix estimation from noisy data, focusing on low-rank matrices.
We define a norm on homology of punctured tori equipped with a complete hyperbolic metric of finite volume and use it to find asymptotics on the growth of the number of simple geodesics of bounded length.
Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To overcome these difficulties, existing approaches often proceed by unfolding tensors i…
This paper presents a deterministic method for matrix completion using Ramanujan graphs.
The purpose of this paper is to study complete self-shrinkers of mean curvature flow in Euclidean spaces. In the paper, we give a complete classification for 2-dimensional complete Lagrangian self-shrinkers in Euclidean space with constant squared norm of the second fundamental form.
Unique inhomogeneous ruled hypersurface found in complex hyperbolic space.
In this paper, we develop a relative error bound for nuclear norm regularized matrix completion, with the focus on the completion of full-rank matrices. Under the assumption that the top eigenspaces of the target matrix are incoherent, we derive a relative upper bound for recovering the best low-rank approximation of t…
The paper proposes a new method for dictionary learning using -norm maximization.
We show that a regular isomorphism of profinite completion of the fundamental groups of two 3-manifolds and induces an isometry of the Thurston norms and a bijection between the fibered classes. We study to what extent does the profinite completion of knot groups distinguish knots and show that it distingui…
The -support norm is a regularizer which has been successfully applied to sparse vector prediction problems. We show that it belongs to a general class of norms which can be formulated as a parameterized infimum over quadratics. We further extend the -support norm to matrices, and we observe that it is a special …
Unified framework for coupled tensor completion improves recovery accuracy.
The spectral -support norm enjoys good estimation properties in low rank matrix learning problems, empirically outperforming the trace norm. Its unit ball is the convex hull of rank matrices with unit Frobenius norm. In this paper we generalize the norm to the spectral -support norm, whose additional para…
For the problems of low-rank matrix completion, the efficiency of the widely-used nuclear norm technique may be challenged under many circumstances, especially when certain basis coefficients are fixed, for example, the low-rank correlation matrix completion in various fields such as the financial market and the low-ra…
The study proves properties of self-shrinkers with bounded curvature.
We study a regularizer which is defined as a parameterized infimum of quadratics, and which we call the box-norm. We show that the k-support norm, a regularizer proposed by [Argyriou et al, 2012] for sparse vector prediction problems, belongs to this family, and the box-norm can be generated as a perturbation of the fo…
Study of 3D vacuum static spaces with specific curvature properties.