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,657 papers · 148 categories

Trend · papers per month

51102153204 · Jun 202019922001200920172026
48 results for arbitrary rank

Paper tackles matrix estimation under arbitrary noise, achieving minimax optimality.

problem Noisy low-rank-plus-sparse matrix recovery under arbitrary dependence.
method Incoherent-constrained least-square estimator, novel energy spreading result.
result Achieves minimax optimality in estimating structured Markov transition kernels.

Unified approach for robust low rank matrix estimation with adversaries.

problem Robust low rank matrix estimation in the presence of adversaries.
method Unified approach combining Huber loss and nuclear norm penalization.
result Sharp estimation error bounds for matrix compressed sensing and completion.

We classify invariant Lagrangians of the form L(gij,gij,k,gij,kl,DI,DI,j)L(g_{ij},g_{ij,k},g_{ij,kl},D_I,D_{I,j}) depending at most quadratically on the variables gij,k,gij,klg_{ij,k},g_{ij,kl} and DI,DI,jD_I,D_{I,j}, where gg is a Lorentz metric and DD is a tensor field of arbitrary rank on a smooth manifold. As a corollary, we prove a conjecture of Bray'…

2014-08-18abs ↗pdf ↗

The article constructs Fuchsian Schottky groups with conformal boundaries.

problem Creating generalized Schottky groups with specific properties.
method Developed Fuchsian Schottky groups by including orientation-reversing isometries.
result Decomposed compact core of conformally compact Riemann surfaces into pairs of pants.

In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a biased random way, only O(n1.5/ε2)O(n^{1.5}/ε^2) of the possible n3n^3 elements while s…

2015-02-17abs ↗pdf ↗

Motivated by control-affine systems in optimal control theory, we introduce the notion of a point-affine distribution on a manifold X - i.e., an affine distribution F together with a distinguished vector field contained in F. We compute local invariants for point-affine distributions of constant type when dim(X)=n, ran…

2009-03-30abs ↗pdf ↗

Classifies totally geodesic submanifolds in symmetric spaces.

problem Classifying submanifolds in symmetric spaces.
method Classification of totally geodesic submanifolds in products of rank one symmetric spaces.
result Infinitely many examples of irreducible totally geodesic submanifolds in Hermitian symmetric spaces.

Consider a Riemannian manifold in dimension n3n\geq 3 with strictly convex boundary. We prove the local invertibility, up to potential fields, of the geodesic ray transform on tensor fields of rank four near a boundary point. This problem is closely related with elastic \textit{qP}-wave tomography. Under the condition …

2018-10-25abs ↗pdf ↗

For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary Clifford algebras, followed by quaternionic vectors as a special case. All results a…

2002-09-28abs ↗pdf ↗

Identifies interpretable generative model for multivariate data.

problem Black-box architectures of deep generative models are often unidentified and difficult to interpret.
method Introduces Deep Discrete Encoder (DDE) Copula, a hierarchical binary latent variable model inside a copula framework.
result Establishes conditions for identification of DDE copula parameters and proves posterior consistency.

Let X=G/KX=G/K be a higher rank symmetric space of non-compact type, where GG is the connected component of the isometry group of XX. We define the splitting rank of XX, denoted by srk(X)\text{srk}(X), to be the maximal dimension of a totally geodesic submanifold YXY\subset X which splits off an isometric R\mathbb R-facto…

2016-02-03abs ↗pdf ↗

Let \A be a complex hyperplane arrangement, and let XX be a modular element of arbitrary rank in the intersection lattice of \A. We show that projection along XX restricts to a fiber bundle projection of the complement of \A to the complement of the localization $\A_X$ of \A at XX. The fiber is the decone of a reali…

2000-02-12abs ↗pdf ↗

We prove that, for n=3 and 4, the minimal nonabelian finite factor group of the outer automorphism group Out F_n of a free group of rank n is the linear group PSL_n(Z_2) (conjecturally, this may remain true for arbitrary rank n > 2). We also discuss some computational results on low index subgroups of Aut F_n and Out F…

2009-12-18abs ↗pdf ↗

The existence problem for holomorphic structures on vector bundles over non-algebraic surfaces is in general still open. We solve this problem in the case of rank 2 vector bundles over K3 surfaces and in the case of vector bundles of arbitrary rank over all known surfaces of class VII. Our methods, which are based on D…

2002-01-24abs ↗pdf ↗

We study the problem of nonnegative rank-one approximation of a nonnegative tensor, and show that the globally optimal solution that minimizes the generalized Kullback-Leibler divergence can be efficiently obtained, i.e., it is not NP-hard. This result works for arbitrary nonnegative tensors with an arbitrary number of…

2017-11-21abs ↗pdf ↗

Recently, fundamental conditions on the sampling patterns have been obtained for finite completability of low-rank matrices or tensors given the corresponding ranks. In this paper, we consider the scenario where the rank is not given and we aim to approximate the unknown rank based on the location of sampled entries an…

2017-07-03abs ↗pdf ↗

Algorithm estimates mixtures of arbitrary Gaussians robustly in presence of corruptions.

problem Estimating mixtures of arbitrary Gaussians in the presence of a constant fraction of arbitrary corruptions.
method Polynomial-time algorithm using partial clustering and tensor decomposition.
result Resolves the main open problem in several previous works on algorithmic robust statistics.

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in da…

2014-10-01abs ↗pdf ↗

A vector field on a Riemannian manifold is called conformal Killing if it generates one-parameter group of conformal transformations. The class of conformal Killing symmetric tensor fields of an arbitrary rank is a natural generalization of the class of conformal Killing vector fields, and appears in different geometri…

2011-03-18abs ↗pdf ↗

We study paracontact metric (κ,μ)(κ,μ)-spaces with κ=1κ=-1, equivalent to h2=0h^2=0 but not h=0h=0. In particular, we will give an alternative proof of Theorem 3.2 of [11] and present examples of paracontact metric (1,2)(-1,2)-spaces and (1,0)(-1,0)-spaces of arbitrary dimension with tensor hh of every possible constant rank. We w…

2014-08-28abs ↗pdf ↗

A rank-n tensor on a Lorentzian manifold V whose contraction with n arbitrary causal future directed vectors is non-negative is said to have the dominant property. These tensors, up to sign, are called causal tensors, and we determine their general properties in dimension N. We prove that rank-2 tensors which map the n…

2001-04-26abs ↗pdf ↗

Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.

problem Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.
method Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.
result Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.

We describe a generalization of GKM theory for actions of arbitrary compact connected Lie groups. To an action satisfying the non-abelian GKM conditions we attach a graph encoding the structure of the non-abelian 1-skeleton, i.e., the subspace of points with isotopy rank at most one less than the rank of the acting gro…

2012-08-28abs ↗pdf ↗

Efficiently representing real world data in a succinct and parsimonious manner is of central importance in many fields. We present a generalized greedy pursuit framework, allowing us to efficiently solve structured matrix factorization problems, where the factors are allowed to be from arbitrary sets of structured vect…

2016-02-12abs ↗pdf ↗