Research
On-device research index

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.

168,982 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Jun 199319922001200920172026
48 results for norm completions

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…

2017-05-15abs ↗pdf ↗

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 …

2013-03-02abs ↗pdf ↗

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 …

2005-05-31abs ↗pdf ↗

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…

2013-09-24abs ↗pdf ↗

The study provides bounds for geodesic diameter in Euclidean space.

problem Finding bounds for geodesic diameter in Euclidean space.
method Develops a geometric approach using locally rectifiable chains and complete normed commutative group bundles.
result Provides a new method for calculating geodesic diameter bounds.

In this paper we investigate complete critical metrics of the L2L^{2}-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.

2012-04-12abs ↗pdf ↗

We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-rr, order-dd, N×N××NN \times N \times \cdots \times N tensor where r=O(1)r=O(1), the best sampling complexity that was achieved is O(Nd2)O(N^{\frac{d}{2}}), which is obtained by solving a tensor nuclear-norm minimizatio…

2017-11-14abs ↗pdf ↗

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…

2016-03-29abs ↗pdf ↗

Let (M,g)(M,g) be a noncompact complete nn-manifold with harmonic curvature and positive Sobolev constant. Assume that L2L_2 norms of Weyl curvature and traceless Ricci curvature are finite. We prove that (M,g)(M,g) is Einstein if n5n \ge 5 and Ln/2L_{n/2} norms of Weyl curvature and traceless Ricci curvature are small enough…

2009-11-13abs ↗pdf ↗

New method estimates missingness probabilities for MNAR matrix completion.

problem Bias in matrix completion due to missing not at random data.
method Estimate missingness probabilities using nuclear norm structure.
result Improved matrix completion accuracy without auxiliary information.

New algorithms solve tensor problems with random components using SDP.

problem Exact tensor nuclear norm, decomposition, and completion for random tensors.
method Degree-4 Sum of Squares (SOS) semidefinite programs.
result Exact solutions for tensor nuclear norm, decomposition, and completion with random asymmetric components.

New method stabilizes FQE by reweighting Bellman targets.

problem Stability guarantees for FQE often rely on Bellman completeness, which can fail with function approximation.
method Proposes stationary-weighted FQE, reweighting Bellman targets by stationary target-to-behavior density ratio.
result Proves finite-sample linear convergence to stationary projected Bellman fixed point without Bellman completeness.

New nonconvex regularizers improve low-rank matrix recovery efficiency and accuracy.

problem Efficiently recover low-rank matrices from incomplete data.
method Factor group-sparse regularization, related to Schatten-p norms.
result Improved generalization error bounds for Schatten-p norms as p decreases.

This paper tackles robustness of ensemble stumps and trees under general ℓ_p norm perturbations.

problem The vulnerability of ensemble stumps and trees to small input perturbations under the ℓ_∞ norm.
method Developed dynamic programming algorithms for robustness verification and certified defense under general ℓ_p norm perturbations.
result First certified defense method for ensemble stumps and trees under ℓ_p norm perturbations.

Matrix completion works well for smooth non-linear structures, even without low-rank assumptions.

problem Matrix completion for smooth non-linear structures.
method Nuclear-norm penalization for matrices lying in a low-dimensional non-linear manifold.
result Nuclear-norm penalization is minimax rate optimal for recovering smooth non-linear matrices with missing data.

The study classifies complete self-shrinkers in Euclidean space.

problem Classifying complete self-shrinkers in Euclidean space.
method Proving the isometry of complete self-shrinkers under specific conditions.
result Complete self-shrinkers are isometric to Rn\mathbb{R}^{n}, Sn(n)S^{n}(\sqrt{n}), or Sk(k)imesRnkS^k (\sqrt{k}) imes\mathbb{R}^{n-k}, 1kn11\leq k\leq n-1.

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…

2017-03-22abs ↗pdf ↗

It is our purpose to study complete self-shrinkers in Euclidean space. By introducing a generalized maximum principle for L\mathcal{L}-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…

2012-02-06abs ↗pdf ↗

Researchers classify 3D self-shrinkers in 4D space.

problem Classifying complete 3D self-shrinkers with specific properties in Euclidean space.
method Completely classified 3-dimensional complete self-shrinkers with constant norm of the second fundamental form and constant f3f_{3} in R4\mathbb R^{4}.
result A complete classification of 3D self-shrinkers in Euclidean space R4\mathbb R^{4}.

Efficiently learns matching rewards in two-sided markets with matrix completion.

problem Learning high-dimensional matching rewards in matching markets with limited data.
method Utilizes matrix completion with a novel approach to handle matching interference.
result Near-optimal guarantees for reward learning under matching interference.

The purpose of this paper is to study complete λλ-surfaces in Euclidean space R3\mathbb R^3. A complete classification for 2-dimensional complete λλ-surfaces in Euclidean space R3\mathbb R^3 with constant squared norm of the second fundamental form is given.

2018-07-18abs ↗pdf ↗

New nonconvex regularizer speeds up low-rank matrix completion.

problem Low-rank matrix completion with good theoretical and empirical performance.
method Proposes a new nonconvex regularizer with adaptive shrinkage, scalable, and fast optimization.
result Proposed method achieves state-of-the-art recovery performance and is the fastest.

The paper tackles matrix estimation from noisy data, focusing on low-rank matrices.

problem Estimating a low-rank matrix from noisy observations.
method The paper analyzes several estimators, including constrained nuclear-norm minimization, nuclear-norm regularized least squares, and a nonconvex constrained low-rank optimization problem.
result The estimators provide upper error bounds that depend on matrix rank, observed fraction, and matrix sums, and are minimax optimal.

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…

2014-05-07abs ↗pdf ↗

This paper presents a deterministic method for matrix completion using Ramanujan graphs.

problem Exact and stable recovery of unknown matrices from a small number of measurements.
method Deterministic sampling using asymmetric Ramanujan graphs and constrained nuclear norm minimization.
result The method achieves exact recovery with noise-free measurements and stable approximation with noisy measurements.

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 R4\mathbb R^4 with constant squared norm of the second fundamental form.

2018-02-07abs ↗pdf ↗

Unique inhomogeneous ruled hypersurface found in complex hyperbolic space.

problem Classifying ruled real hypersurfaces with constant norm.
method Analyzing nonflat complex space forms, proving existence and uniqueness.
result Existence of a unique inhomogeneous example in complex hyperbolic space.

The paper proposes a new method for dictionary learning using p\ell_p-norm maximization.

problem Complete dictionary learning problem in signal processing and data analytics.
method The paper investigates p\ell_p-norm maximization approaches for complete dictionary learning, proving global maximizers are close to the true dictionary and developing an efficient algorithm based on the generalized power method.
result The p\ell_p-based approaches are more efficient and robust than conventional methods, with p=3p=3 performing best.

The kk-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 kk-support norm to matrices, and we observe that it is a special …

2014-03-06abs ↗pdf ↗

Unified framework for coupled tensor completion improves recovery accuracy.

problem Improving recovery accuracy in coupled tensor completion.
method Unified framework using tensor ring (TR) decomposition with shared latent factors and novel optimization model.
result The proposed method achieves superior recovery accuracy on real-world data compared to state-of-the-art methods.

The spectral kk-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 kk matrices with unit Frobenius norm. In this paper we generalize the norm to the spectral (k,p)(k,p)-support norm, whose additional para…

2016-01-04abs ↗pdf ↗

The study proves properties of self-shrinkers with bounded curvature.

problem Characterizing self-shrinkers with bounded curvature.
method Analyzing properties of self-shrinkers in Rn+1\mathbb{R}^{n+1} with bounded second fundamental form.
result Proves that if the squared norm of the second fundamental form is bounded, it must be constant.

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…

2015-12-27abs ↗pdf ↗