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

6121824 · May 202619922001200920172026
48 results for Circulant Permutations

C-OPH improves One Permutation Hashing by using a shorter circulant permutation.

problem Improving the accuracy of One Permutation Hashing (OPH) for Jaccard similarity estimation.
method Develops a new densification method using a shorter circulant permutation.
result Achieves the smallest estimation variance for Jaccard similarity.

C-MinHash reduces the number of permutations needed for MinHash from thousands to just two.

problem Approximating Jaccard similarity in large binary datasets using many permutations.
method Initial permutation followed by circulant shifting of a second permutation to generate hashes.
result C-MinHash achieves unbiased Jaccard similarity estimation with uniformly smaller variance.

The paper uncovers symmetries in large language models through layer-peeled optimization.

problem Understanding geometric structure in large language model weights and context embeddings.
method Constrained layer-peeled optimization program to analyze symmetries in next-token distributions.
result Symmetries in target next-token distributions are transferred to optimal model weights and context embeddings.

In this paper, we study deep diagonal circulant neural networks, that is deep neural networks in which weight matrices are the product of diagonal and circulant ones. Besides making a theoretical analysis of their expressivity, we introduced principled techniques for training these models: we devise an initialization s…

2019-01-29abs ↗pdf ↗

A 4-dimensional Riemannian manifold equipped with a circulant structure, which is an isometry with respect to the metric and its fourth power is the identity, is considered. The almost product manifold associated with the considered manifold is studied. The relation between the covariant derivatives of the almost produ…

2017-03-23abs ↗pdf ↗

Study curvature properties of specific Riemannian manifolds with skew-circulant structures.

problem Investigate curvature of Riemannian manifolds with a particular tensor structure.
method Analyze 4D Riemannian manifolds with right skew-circulant tensor S, invariant under S and g, focusing on Ricci tensor and sectional curvatures.
result Obtained properties of curvature tensors and sectional curvatures for specific manifolds.

We have studied the statistical mechanics of money circulation in a closed economic system. An explicit statistical formulation of the circulation velocity of money is presented for the first time by introducing the concept of holding time of money. The result indicates that the velocity is governed by behavior pattern…

2005-07-20abs ↗pdf ↗

Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To address this problem, we propose Circulant Binary Embedding (CBE) which generates bina…

2014-05-13abs ↗pdf ↗

Paper offers robust recovery for 1-bit sensing with partial Gaussian circulant matrices.

problem Accurately recovering vectors from 1-bit measurements using structured matrices.
method Correlation-based optimization with randomly signed partial Gaussian circulant matrices and generative models.
result Recovery guarantees match those for i.i.d. Gaussian matrices but with faster computation.

A 4-dimensional Riemannian manifold equipped with an additional tensor structure, whose fourth power is the identity, is considered. This structure has a circulant matrix with respect to some basis, i.e. the structure is circulant, and it acts as an isometry with respect to the metric. The Riemannian product manifold a…

2019-04-20abs ↗pdf ↗

We prove that Pareto theory of circulation of elites results from our wealth evolution model, Kelly criterion for optimal betting and Keynes' observation of "animal spirits" that drive the economy and cause that human financial decisions are prone to excess risk-taking.

2014-12-15abs ↗pdf ↗

Study of spheres and circles on a manifold with a specific metric structure.

problem Understanding geometric objects on a manifold with a skew-circulant structure.
method Analyzing hyper-spheres, spheres, and circles in a tangent space of a 4D manifold with a skew-circulant tensor structure.
result Characterization of geometric objects under an indefinite metric.

A new Riemannian manifold with skew-circulant structures and its associated locally conformal Kähler manifold are studied.

problem Exploring new Riemannian manifolds with specific tensor structures.
method Defined a tensor on a 4D Riemannian manifold with skew-circulant properties, constructed a Lie group, and studied associated Hermitian manifolds.
result The associated Hermitian manifold is a locally conformal Kähler manifold.

We consider a 3-dimensional Riemannian manifold V with a metric g and an affinor structure q. The local coordinates of these tensors are circulant matrices. In V we define an almost conformal transformation. Using that definition we construct an infinite series of circulant metrics which are successively almost conform…

2010-10-24abs ↗pdf ↗

We consider a 3-dimensional Riemannian manifold M with two circulant structures -- a metric g and an endomorphism q whose third power is identity. The structure q is compatible with g such that an isometry is induced in any tangent space of M. We obtain some curvature properties of this manifold (M, g, q) and give an e…

2013-08-22abs ↗pdf ↗

We consider a three-dimensional Riemannian manifold equipped with two circulant structures - a metric g and a structure q, which is an isometry with respect to g and the third power of q is minus identity. We discuss some curvature properties of this manifold, we give an example of such a manifold and find a condition …

2013-08-22abs ↗pdf ↗

Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good kernel has to be chosen. Picking a good kernel is a very challenging problem in its…

2015-03-12abs ↗pdf ↗

Recursive Feature Machines show grokking in modular arithmetic without neural networks.

problem Grokking in modular arithmetic tasks.
method Recursive Feature Machines (RFM) with Average Gradient Outer Product (AGOP).
result RFM and neural networks learn block-circulant features to solve modular arithmetic.

We describe new results and algorithms for two different, but related, problems which deal with circulant matrices: learning shift-invariant components from training data and calculating the shift (or alignment) between two given signals. In the first instance, we deal with the shift-invariant dictionary learning probl…

2018-12-03abs ↗pdf ↗

We consider a class (M, g, q) of four-dimensional Riemannian manifolds M, where besides the metric g there is an additional structure q, whose fourth power is the unit matrix. We use the existence of a local coordinate system such that there the coordinates of g and q are circulant matrices. In this system q has consta…

2014-09-26abs ↗pdf ↗

New algorithms for efficient learning with long-term rewards in contextual bandits.

problem Efficient learning with long-term rewards in contextual bandits.
method Proposes new algorithms leveraging sparsity to discover dependence patterns and arm parameters.
result Regret upper bounds for data-poor and data-rich regimes, showing improved sample complexity.

We study a game-theoretic variant of the maximum circulation problem. In a flow allocation game, we are given a directed flow network. Each node is a rational agent and can strategically allocate any incoming flow to the outgoing edges. Given the strategy choices of all agents, a maximal circulation that adheres to the…

2019-08-05abs ↗pdf ↗

Random permutations can offer faster convergence than with-replacement sampling for some functions.

problem Understanding when and how random permutations outperform with-replacement sampling in SGD convergence.
method Analyzing convergence rates for different function classes (1D strongly convex, general strongly convex, quadratic strongly convex).
result The optimal convergence gap between random and permutation-based SGD varies from exponential to nonexistent, depending on the function class.

Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be further processed to learn a permutation-invariant representation of that set, avoid…

2018-12-10abs ↗pdf ↗

Parastatistic distribution of a total debt owed to a large number of creditors considered in relation to the duration of these debts. The process of debt calculation depends on the fractal dimension of economic system in which this process takes place. Two actual variants of these dimensions are investigated. Critical …

2016-01-28abs ↗pdf ↗

We tackle permutation in linear regression with a new inference framework.

problem Statistical investigation of permutation in linear regression models.
method Localization step followed by conditional Monte Carlo test and coefficient inference.
result Valid statistical inference procedures for permutation and regression coefficients.

Recently, the method of b-bit minwise hashing has been applied to large-scale linear learning and sublinear time near-neighbor search. The major drawback of minwise hashing is the expensive preprocessing cost, as the method requires applying (e.g.,) k=200 to 500 permutations on the data. The testing time can also be ex…

2012-08-06abs ↗pdf ↗