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.

169,051 papers · 148 categories

Trend · papers per month

4998146195 · Jun 202019922001200920172026
48 results for block circulant embedding

Adaptive activity monitoring framework for wearable sensors.

problem Efficiently monitor human activities with low power consumption.
method Switching Gaussian process model with block circulant embedding and FFT for inference.
result Optimized trade-off between sensor power consumption and prediction performance.

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 ↗

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 introduce a framework and early results for massively scalable Gaussian processes (MSGP), significantly extending the KISS-GP approach of Wilson and Nickisch (2015). The MSGP framework enables the use of Gaussian processes (GPs) on billions of datapoints, without requiring distributed inference, or severe assumption…

2015-11-05abs ↗pdf ↗

Improved singular value approximation for convolutional layers.

problem Improving accuracy of singular value approximation for linear convolutional layers.
method Developed a new spectral density matrix method for singular value approximation with improved accuracy and reduced computational complexity.
result Obtained moderate improvement in singular value distribution compared to circular approximation.

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.

Paper studies deep diagonal circulant neural networks and introduces training techniques.

problem Understanding and training deep neural networks with structured weight matrices.
method Theoretical analysis and practical training techniques including initialization and non-linearity use.
result Deep diagonal circulant networks outperform other structured models in accuracy and weight efficiency.

A new algorithm for optimizing huge-scale black-box problems with reduced memory usage.

problem Optimizing huge-scale black-box problems with limited vector operations.
method ZO-BCD algorithm for zeroth-order optimization with reduced memory footprint.
result ZO-BCD achieves state-of-the-art adversarial attack success rate of 97.9%.

Study on 4D manifolds with circulant structures and their products.

problem Characterizing 4D Riemannian manifolds with specific tensor structures.
method Investigation of Riemannian product manifolds with circulant structures and analysis of conditions for metric properties.
result Conditions for Riemannian product manifolds to belong to specific classes.

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 ↗

Recurrent Neural Networks (RNNs) are becoming increasingly important for time series-related applications which require efficient and real-time implementations. The recent pruning based work ESE suffers from degradation of performance/energy efficiency due to the irregular network structure after pruning. We propose bl…

2018-03-20abs ↗pdf ↗

Regularization improves spectral embedding by focusing on the largest blocks.

problem Improving the quality of spectral embedding for graph data.
method Explained the impact of complete graph regularization on spectral embedding of a block model.
result Regularization forces spectral embedding to focus on the largest blocks, making it less sensitive to noise or outliers.

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.

Novel Bayesian framework for spatio-temporal neuroimaging data.

problem Inference on multi-task sparse hierarchical regression models with complex spatio-temporal dynamics.
method Flexible hierarchical Bayesian framework with Kronecker product covariance structure, majorization-minimization optimization, and Riemannian geometry.
result Improved performance on synthetic and real M/EEG data.

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 ↗

This paper tracks coin circulation in Bitcoin to identify miners and analyze mining pool structures.

problem Identifying and understanding Bitcoin miners and their profit distribution schemes.
method Constructs fresh coin circulation networks and uses a heuristic algorithm to compare networks from different mining pools.
result Infers common profit distribution schemes of Bitcoin mining pools and observes an increasing trend in miner numbers.

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.

Proposes a block-based model for attributed network embedding.

problem Handles both assortative and disassortative networks.
method Assigns nodes to blocks based on similar linkage patterns, using neural networks to preserve attribute information.
result Consistently outperforms state-of-the-art methods on disassortative networks.

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 ↗

Investigates neural codes and their embeddings, proving conjectures and introducing new code types.

problem Analyzing neural codes and their embedding dimensions.
method Combinatorial, topological, and algebraic analysis; proving conjectures; introducing new neural code types.
result Proves conjectures about neural codes and their embeddings, introduces new code types.

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.

DEN learns diverse tasks to generalize to unseen tasks.

problem Generalization from a diverse set of classification tasks with limited data.
method Three-block architecture: covariate transformation, distribution embedding, and classification.
result DEN outperforms existing methods in various synthetic and real tasks.

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 ↗

This paper studies clustering and embedding in high-dimensional Gaussian mixture block models.

problem Clustering and embedding in high-dimensional Gaussian mixture block models.
method Spectral clustering and embedding algorithms for graphs sampled from Gaussian mixture block models.
result Performance analysis of spectral clustering and embedding algorithms for 2-component spherical Gaussian mixtures.

Improved graph embedding through refined linear transformation and community recovery.

problem Identifying meaningful latent communities in graph data.
method Refined graph encoder embedding via linear transformation, self-training, and latent community recovery.
result Improved vertex embedding and better decision boundaries for vertex classification.

The paper classifies vertices in weighted networks using spectral embedding and edge weight distributions.

problem Classifying vertices in weighted networks where edge weights and adjacencies encode class membership.
method Introduced a edge weight distribution matrix to the K-Block Stochastic Block Model for weighted networks. Developed classification procedures based on spectral embedding of the unweighted adjacency matrix under two assumptions on edge weight distributions.
result Proposed classifiers outperform quadratic discriminant analysis on transformed weighted networks.

This paper studies node embeddings of networks, revealing their geometric properties.

problem Understanding the geometric properties of node embeddings in random networks.
method Characterization of ergodic limits, generalization, and convex relaxations of random walk node embedding objectives.
result The optimal node embedding Grammians have rank 1 for a nuclear norm relaxation of the non-randomized objective.