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

Trend · papers per month

4285127169 · May 202619922001200920172026
48 results for rank inequalities

Proves homological inequality for cycles in Hadamard spaces of asymptotic rank 2.

problem Establishing isoperimetric inequalities in Hadamard spaces of asymptotic rank two.
method Homological inequality for cycles in dimensions at least 2, assuming finite linearly controlled asymptotic dimension.
result Homological inequality for general cycles in Hadamard 3-manifolds and finite-dimensional CAT(0) cube complexes.

Sharp isoperimetric inequalities for Neumann eigenvalues in symmetric spaces.

problem Finding bounds for eigenvalues of Neumann Laplacian on domains in symmetric spaces.
method Proving sharp inequalities for eigenvalues in compact and noncompact rank-1 symmetric spaces.
result Generalization of previous results for hyperbolic space and symmetric spaces.

Maps from rational homology solid tori yield rank inequalities in Heegaard Floer homology.

problem Rank inequalities in Heegaard Floer homology.
method Using Hanselman-Rasmussen-Watson's bordered Floer homology, we extend their proof to rational homology solid tori.
result We provide rank inequalities for Heegaard Floer homology.

The paper proves concentration inequalities for two-sample rank processes and applies them to ranking performance criteria.

problem Measuring the performance of ranking statistics between two populations.
method Proves concentration inequalities for two-sample rank processes indexed by VC classes of scoring functions.
result Generalization capacity of empirical maximizers of ranking performance criteria is investigated.

The free factor complex of rank 4+ fails a combinatorial isoperimetric inequality.

problem Failure of combinatorial isoperimetric inequality in the free factor complex.
method Construction of a coarsely Lipschitz function from the upward link of a free factor to integers.
result A loop in the free factor complex requires linearly growing number of 2-simplices to fill.

The paper analyzes tensor recovery from symmetric rank-one measurements using information theory.

problem Recovering tensors with low symmetric rank from symmetric rank-one measurements.
method Covering numbers argument, Carbery-Wright inequality, orthogonal polynomials, Fano's inequality.
result Near-optimal sample complexity bounds for log-concave distributions.

Let K~\widetilde{K} be a 2-periodic knot in S3S^3 with quotient KK. We prove a rank inequality between the knot Floer homology of K~\widetilde{K} and the knot Floer homology of KK using a spectral sequence of Hendricks, Lipshitz and Sarkar. We also conjecture a filtered refinement of this inequality, for which we giv…

2018-10-02abs ↗pdf ↗

For a 2-periodic link L~\tilde L in the thickened annulus and its quotient link LL, we exhibit a spectral sequence with E1AKh(L~)F2F2[θ,θ1]EAKh(L)F2F2[θ,θ1].E^1 \cong AKh(\tilde L) \otimes_{\mathbb{F}_2} \mathbb{F}_2[θ, θ^{-1}] \rightrightarrows E^\infty \cong AKh(L) \otimes_{\mathbb{F}_2} \mathbb{F}_2[θ, θ^{-1}]. This spectral sequence splits along qu…

2017-07-11abs ↗pdf ↗

We investigate properties of estimators obtained by minimization of U-processes with the Lasso penalty in high-dimensional settings. Our attention is focused on the ranking problem that is popular in machine learning. It is related to guessing the ordering between objects on the basis of their observed predictors. We p…

2015-12-17abs ↗pdf ↗

Paper tackles underranking in group-fair ranking systems, proving a trade-off and presenting an algorithm.

problem Underranking in group-fair ranking systems can worsen social and economic inequalities.
method Formulated underranking as a new problem, proved a lower bound, and presented a fair ranking algorithm.
result Algorithm achieves best of underranking and group fairness, confirming theoretical trade-off.

Paper proves geodesic ball maximizes second Robin eigenvalue in non-compact symmetric spaces.

problem Maximizing the second Robin eigenvalue in non-compact rank-1 symmetric spaces.
method Quantitative spectral inequality for the second Robin eigenvalue.
result Geodesic ball maximizes the second Robin eigenvalue among domains of the same volume.

Paper proves eigenvalue inequality for Hopf-symmetric domains.

problem Eigenvalue inequality for Hopf-symmetric domains in non-compact symmetric spaces.
method Used geometric and spectral analysis on non-compact rank one symmetric spaces.
result Eigenvalue inequality for bounded Hopf-symmetric domains in non-compact symmetric spaces.

The study establishes uncertainty principles on harmonic manifolds of rank one.

problem Developing uncertainty principles for harmonic manifolds of rank one.
method Derivation of various uncertainty principles including Heisenberg, Morgen, Schrödinger, and Hömanders principles.
result Generalization of Hausdorff-Young inequality to harmonic manifolds of rank one.

Study shows inequality in Floer homologies for 3-manifold covers.

problem Establishing an inequality between Heegaard Floer homologies of branched covers.
method Using Heegaard Floer homology, the study establishes an inequality for dimensions of homologies of 3-manifold covers.
result An inequality is established between the dimensions of Heegaard Floer homologies of branched covers.

Paper presents a low-cost algorithm for bipartite ranking with improved sample size requirements.

problem Bipartite ranking's quadratic dependence on sample size makes it computationally expensive.
method Uses a novel uniform risk bound based on matrix and vector concentration inequalities to achieve low cost and competitive performance.
result Shows that the sample size required for competitive performance is not quadratic, improving efficiency.

New conditions ensure Dantzig-Wolfe relaxation matches rank-constrained optimization problems.

problem Rank-constrained optimization problems with linear matrix inequalities.
method Investigates Dantzig-Wolfe relaxation and develops conditions for exactness.
result Conditions for extreme point, convex hull, and objective exactness.

This paper establishes inequalities on quaternionic hyperbolic spaces and the Cayley hyperbolic plane.

problem Establishing higher order Poincaré-Sobolev and Hardy-Sobolev-Maz'ya inequalities on quaternionic hyperbolic spaces and the Cayley hyperbolic plane.
method Developing factorization theorems and introducing Geller's operators, combining with Helgason-Fourier analysis and kernel estimates.
result Established higher order Poincaré-Sobolev and Hardy-Sobolev-Maz'ya inequalities on quaternionic hyperbolic spaces and the Cayley hyperbolic plane.

Let MM be a compact connected orientable Seifert manifold with hyperbolic orbifold BMB_M, and fπ:π1(M)π1(M)f_π: π_1(M)\rightarrowπ_1(M) be an automorphism induced by an orientation-reversing homeomorphism ff of MM. We give a bound on the rank of the fixed subgroup of fπf_π, namely, $\rank\fix(f_π)<2\rank π_1(M)$, which is simi…

2015-01-30abs ↗pdf ↗

We study the problem of prediction for evolving graph data. We formulate the problem as the minimization of a convex objective encouraging sparsity and low-rank of the solution, that reflect natural graph properties. The convex formulation allows to obtain oracle inequalities and efficient solvers. We provide empirical…

2012-05-07abs ↗pdf ↗

Given a knot K in S^3, let Σ(K) be the double branched cover of S^3 over K. We show there is a spectral sequence whose E^1 page is (\hat{HFK}(Σ(K), K) \otimes V^{n-1}) \otimes \mathbb Z_2((q)), for V a \mathbb Z_2-vector space of dimension two, and whose E^{\infty} page is isomorphic to (\hat{HFK}(S^3, K) \otimes V^{n-…

2011-07-11abs ↗pdf ↗

Establishes a rank inequality between knot Floer homologies of freely 2-periodic knots and their quotients.

problem Knot Floer homology of freely 2-periodic knots and their quotients
method Large's generalization of Seidel-Smith's localization spectral sequence
result Rank inequality between knot Floer homologies

A well-known conjecture of Rasmussen states that for any knot KK in S3S^{3}, the rank of the reduced Khovanov homology of KK is greater than or equal to the rank of the reduced knot Floer homology of KK. This rank inequality is supposed to arise as the result of a spectral sequence from Khovanov homology to knot Flo…

2018-11-19abs ↗pdf ↗

We introduce the notions of categorical systoles and categorical volumes of Bridgeland stability conditions on triangulated categories. We prove that for any projective K3 surface, there exists a constant C depending only on the rank and discriminant of its Picard group, such that $$\mathrm{sys}(σ)^2\leq C\cdot\mathrm{…

2018-03-26abs ↗pdf ↗

New method learns low-dimensional representations of nonlinear time series without supervision.

problem Learning low-dimensional representations of nonlinear time series without supervision.
method Based on monotone variational inequality, the method learns representations by assuming sequences arise from a common domain.
result The method can learn the geometry for the entire domain and faithful representations for the dynamics of each individual sequence.

We solve robust regression and matrix completion problems with sparse and low-rank models.

problem Adversarial contamination and noisy matrix completion in high-dimensional settings.
method Subgaussian statistical learning framework, trace-regression with matrix decomposition, novel Huber-type loss.
result Near-optimal estimation rates for robust regression and matrix completion.

This note quantifies, via a sharp inequality, an interplay between (a) the characteristic rank of a vector bundle over a topological space X, (b) the Z/2Z-Betti numbers of X, and (c) sums of the numbers of certain partitions of integers. In a particular context, (c) is transformed into a sum of the readily calculable B…

2013-07-11abs ↗pdf ↗

This paper improves entropy bounds for ranking time-series complexity.

problem Ranking the complexity of time series processes.
method Building on information theoretic bounds, the paper improves the upper bound of conditional differential entropy using Hadamard's inequality and covariance matrix properties.
result The improved bounds can be used to rank the complexity of time series processes.

This work establishes always-valid risk bounds for online matrix completion.

problem Challenges in establishing always-valid concentration inequalities for online matrix completion.
method Combines non-asymptotic martingale concentration and regularized low-rank matrix regression.
result Establishes always-valid risk bound process for online matrix completion.