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

2625247851,047 · Jun 202019922001200920172026
48 results for rank two distributions

Analytic torsion defined for rank 2 distributions on 5-manifolds.

problem Defining and analyzing analytic torsion for rank 2 distributions.
method Proposed an analytic torsion for Rumin complex associated with rank 2 distributions on 5-manifolds, established anomaly formulas, and showed coincidence with Ray-Singer torsion.
result The proposed torsion coincides with Ray-Singer torsion for certain nilmanifolds.

The paper designs tests for comparing ranked preference data and finds significant differences.

problem Comparing pairwise comparison and ranking data in various applications.
method Developed two-sample tests for pairwise comparison and ranking data, proving upper and lower bounds.
result Upper and lower bounds show tightness of the proposed tests, and significant differences in preferences were found.

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.

We consider the question whether an orientable 5-manifold can be equipped with a rank two distribution of Cartan type and what 2-plane bundles can be realized. We obtain a complete answer for open manifolds. In the closed case, we settle the topological part of this problem and present partial results concerning its ge…

2016-03-31abs ↗pdf ↗

New gossip algorithms improve robustness of rank-based statistics in decentralized systems.

problem Ensuring robustness in decentralized AI and edge intelligence systems, especially in the presence of corrupted or adversarial data.
method Developed asynchronous gossip algorithms for computing rank-based statistics.
result First convergence rate bound for asynchronous gossip-based rank estimation.

To certain types of generic distributions (subbundles in a tangent bundle) one can associate canonical Cartan connections. Many of these constructions fall into the class of parabolic geometries. The aim of this article is to show how strong restrictions on the possibles sizes of automorphism groups of such distributio…

2008-07-07abs ↗pdf ↗

Representing distributions over permutations can be a daunting task due to the fact that the number of permutations of nn objects scales factorially in nn. One recent way that has been used to reduce storage complexity has been to exploit probabilistic independence, but as we argue, full independence assumptions impo…

2010-06-07abs ↗pdf ↗

Framework for optimizing search engine rankings using observational data.

problem Optimizing ranking policies for search engines using limited observational data.
method Formulated expected reward optimization problem, estimated context value distribution, trained ranking policy via Bayesian inference.
result Demonstrated trade-offs in ranking policies trained on empirical reward estimates.

Novel method for efficient low-rank matrix estimation and bandit algorithms.

problem Low-rank matrix estimation and bandit problems.
method LowPopArt method for low-rank matrix estimation and novel experimental design criterion.
result Improved recovery guarantees and regret bounds for low-rank bandit algorithms.

Study symplectification of rank 2 distributions and their connections.

problem Understanding symplectification and Cartan prolongations of rank 2 distributions.
method Using Tanaka-Morimoto theory and symplectification procedure for rank 2 distributions.
result Demonstrates the existence of normal Cartan connections and iterated prolongations for rank 2 distributions.

We consider the problem of search through comparisons, where a user is presented with two candidate objects and reveals which is closer to her intended target. We study adaptive strategies for finding the target, that require knowledge of rank relationships but not actual distances between objects. We propose a new str…

2012-06-18abs ↗pdf ↗

We propose a new method to estimate Wasserstein distances and optimal transport plans between two probability distributions from samples in high dimension. Unlike plug-in rules that simply replace the true distributions by their empirical counterparts, our method promotes couplings with low transport rank, a new struct…

2018-06-19abs ↗pdf ↗

New method for summarizing ranking distributions using consensus ranking distributions.

problem Summarizing ranking distributions efficiently and accurately.
method Introducing consensus ranking distributions and a top-down tree-structured statistical algorithm.
result Optimal distortion can be expressed as a function of pairwise probabilities, enabling efficient learning methods.

Rank-statistic method approximates ff-divergences without density-ratio estimation.

problem Approximating ff-divergences without explicit density-ratio estimation.
method Mapping distribution rank histograms to discrete ff-divergence and averaging over random projections.
result The rank-statistic estimator is a lower bound of the true ff-divergence and converges under mild conditions.

New method for robust PCA with exponential family distributions.

problem Recovering low-rank structure from data matrices with outliers.
method Alternating Direction Method of Multipliers for eextRPCAe^{ ext{RPCA}}.
result Demonstrated effectiveness in steel sheet defect detection and crime activity monitoring.

Recently, the \textit{Tensor Nuclear Norm~(TNN)} regularization based on t-SVD has been widely used in various low tubal-rank tensor recovery tasks. However, these models usually require smooth change of data along the third dimension to ensure their low rank structures. In this paper, we propose a new definition of da…

2019-10-26abs ↗pdf ↗

This paper investigates the rank distribution, cumulative probability, and probability density of price returns for the stocks traded in the KSE and the KOSDAQ market. This research demonstrates that the rank distribution is consistent approximately with the Zipf's law with exponent α=1.00α= -1.00 (KSE) and -1.31 (KOSDAQ),…

2004-05-18abs ↗pdf ↗

The paper presents two schemes for sampling matrices from specific distributions on a manifold.

problem Sampling matrices from Gibbs distributions on the manifold of positive semi-definite matrices with fixed rank.
method Two explicit schemes based on Euler-Maruyama discretization of the Riemannian Langevin equation with Brownian motion on the manifold.
result Numerical validation of the schemes using specific energy functions and metrics.

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been conside…

2014-09-08abs ↗pdf ↗

We consider a problem of equivalence of generic pairs (X,V)(X,V) on a manifold MM, where VV is a distribution of rank mm and XX is a distribution of rank one. We construct a canonical bundle with a canonical frame. We prove that two pairs are equivalent if and only if the corresponding frames are diffeomorphic. As a p…

2007-12-10abs ↗pdf ↗

Paper studies model stealing for low-rank language models.

problem Model stealing threatens proprietary models' security and data privacy.
method Theoretical study of model stealing for Hidden Markov Models (HMMs) and low-rank language models using the conditional query model.
result Efficient algorithm for learning any low-rank distribution in the conditional query model.

The notion of curvature discussed in this paper is a far going generalization of the Riemannian sectional curvature. It was first introduced by Agrachev, Barilari and Rizzi in arXiv:1306.5318, and it is defined for a wide class of optimal control problems: a unified framework including geometric structures such as Riem…

2016-05-24abs ↗pdf ↗

The paper improves recommendation systems by ensuring their outputs are reliable.

problem Recommendation systems often lack reliability guarantees for their outputs.
method The method uses a pre-trained ranking model to create a set of items with rigorous FDR control.
result The approach provides a way to guarantee the reliability of recommendation outputs.

Proves Sard conjecture for specific distributions, controlling divergence of vector fields.

problem Proving the Sard conjecture for certain types of distributions.
method Constructs a singular distribution capturing essential abnormal lifts, proving the conjecture for rank 3 distributions in dimension 4 and generic corank 1 distributions.
result Proves the Sard conjecture for generic co-rank one distributions.

The paper improves spectral ranking methods for diverse comparison graphs.

problem Estimating preference scores from multiway comparisons with heterogeneous sizes.
method Develops a two-step spectral method for estimating preference scores and their uncertainties.
result The two-step spectral method achieves the same asymptotic efficiency as the Maximum Likelihood Estimator (MLE).