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

Trend · papers per month

316292123 · Jun 202019922001200920172026
48 results for higher-order correlations

Proposes a method to enhance multi-view learning by maximizing higher order correlations.

problem Losing intrinsic interconnections among multiple views in pairwise correlation maximization.
method Formulates multi-view data as a low rank approximation problem using higher order correlation tensor and solves it with the generating polynomial method.
result Consistently outperforms prior methods on real multi-view data.

Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.

problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.

Many nonlinear extensions of the Kalman filter, e.g., the extended and the unscented Kalman filter, reduce the state densities to Gaussian densities. This approximation gives sufficient results in many cases. However, this filters only estimate states that are correlated with the observation. Therefore, sequential esti…

2012-07-18abs ↗pdf ↗

Diffusion models learn simple statistics before complex ones, revealing a sample complexity exponent.

problem Understanding the learning dynamics of diffusion models.
method Empirical observations and theoretical analysis of diffusion models and denoisers.
result Diffusion models learn simple statistics (pair-wise correlations) at linear sample complexity, while higher-order statistics (e.g., fourth cumulant) require cubic sample complexity.

Neural networks learn faster with correlated latent variables.

problem Efficiently learning from higher-order correlations in neural networks.
method Analytical derivation and simulations of two-layer neural networks.
result Correlations between latent variables speed up learning from higher-order correlations.

Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.

problem Understanding how LLMs internalize statistical structure during next-token prediction.
method Cumulant-expansion framework treating softmax entropy as perturbation around center distribution.
result Cumulants reveal distinct signatures for mathematical vs. general text prompts, quantifying feature-learning dynamics.

To date, the instability of prognostic predictors in a sparse high dimensional model, which hinders their clinical adoption, has received little attention. Stable prediction is often overlooked in favour of performance. Yet, stability prevails as key when adopting models in critical areas as healthcare. Our study propo…

2016-09-28abs ↗pdf ↗

This work generalizes transformer attention to capture higher-order correlations efficiently.

problem Detecting triple-wise connections that were impossible for transformers.
method Developed a generalized attention scheme using Kronecker computation, showing near-linear time algorithms for bounded entries.
result A near-linear time algorithm for generalized attention computation in the bounded-entry setting.

Study higher-order spin glass models for social network behavior with peer-group effects.

problem Modeling correlation phenomena on social networks with peer-group effects.
method Inference in higher-order Ising models to recover coefficients and peer-group effects.
result Strong concavity of log pseudo-likelihood implies statistical error rate of sqrt(d/n) for MPLE.

For joint inference over multiple variables, a variety of structured prediction techniques have been developed to model correlations among variables and thereby improve predictions. However, many classical approaches suffer from one of two primary drawbacks: they either lack the ability to model high-order correlations…

2019-10-31abs ↗pdf ↗

New tensor framework connects Fisher information, hypergraphs, and multi-observable correlations.

problem Missing structure in pairwise Fisher graphs for multi-observable radiation patterns.
method Higher-order Fisher tensors and natural exponential-family coordinates.
result Exact triality of Fisher tensors, cumulants, and hypergraphs.

First passage models, where corporate assets undergo correlated random walks and a company defaults if its assets fall below a threshold provide an attractive framework for modeling the default process. Typical one year default correlations are small, i.e., of order a few percent, but nonetheless including correlations…

2008-12-10abs ↗pdf ↗

Study neural networks by mapping correlations, revealing essential statistics.

problem Understanding information processing in trained neural networks.
method Characterize neural network as distribution transformations, focusing on correlation functions.
result Higher-order correlations are crucial for internal layers, while input layer captures more.

Neural networks can learn from higher-order cumulants efficiently, requiring quadratic samples.

problem Learning from higher-order cumulants in high-dimensional data.
method Spiked cumulant model, polynomial time algorithms, neural networks, random features.
result Neural networks require quadratic samples to learn from higher-order cumulants efficiently, while random features require more samples.

Memory capacity of DAM scales exponentially with feature separation, unaffected by correlations.

problem Understanding how feature correlations impact DAM's capacity.
method Developed an empirical framework to analyze DAM's capacity under varying feature correlations and pattern separations.
result Memory capacity scales exponentially with feature separation, unaffected by correlations.

New method combines hypergraph structure and node attributes for better community detection.

problem Improving community detection in hypergraphs with node attributes.
method Developed a principled model that learns from data to combine higher-order interactions and node attributes.
result Strong performance in hyperedge prediction and community detection, especially when attributes are informative.

Weak correlations explain linear dynamics in deep learning models.

problem Understanding the linear structure in gradient-based learning algorithms.
method Characterization of weak correlations between derivatives and parameters.
result Weak correlations are the underlying principle for linearization in deep learning models.

This paper improves multi-label classification by leveraging high-order label correlations.

problem Improving accuracy in multi-label classification tasks using label correlations.
method Exploiting high-order label correlations through a supervised learning classifier system (UCS) and label powerset (LP) strategy.
result The proposed method outperforms other LP-based methods on multiple benchmark datasets.

A two-layer neural network model that systematically includes correlations among input variables to arbitrary order and is designed to implement Bayes inference has been adapted to classify breast cancer tumors as malignant or benign, assigning a probability for either outcome. The inputs to the network represent measu…

2019-12-15abs ↗pdf ↗

We analyze daily prices of 29 commodities and 2449 stocks, each over a period of 15\approx 15 years. We find that the price fluctuations for commodities have a significantly broader multifractal spectrum than for stocks. We also propose that multifractal properties of both stocks and commodities can be attributed mainl…

2003-08-01abs ↗pdf ↗

Paper proposes a new LSTM model for spatio-temporal learning.

problem Challenging video tasks require learning long-term spatio-temporal correlations.
method Introduces a higher-order convolutional LSTM model with tensor train decomposition.
result Model achieves state-of-the-art performance with significantly fewer parameters.

RFMs transition from linear to nonlinear under specific input-label correlation.

problem Understanding the transition from linear to nonlinear behavior in RFMs.
method Analyzing RFMs under spiked covariance designs, characterizing the interaction between anisotropy and input-label correlation.
result The RFM generalization error is governed by the strength of input-label correlation, leading to a clear nonlinear advantage above a specific boundary.

New method shows fully-connected networks can learn convolutional structures from data.

problem How to learn convolutional structures from translation-invariant data.
method Data-driven emergence of convolutional structure in neural networks.
result Initially fully-connected networks can learn convolutional structures from their inputs.

The paper tackles statistical and computational challenges in learning correlated reward models.

problem The Independence of Irrelevant Alternatives (IIA) assumption collapses human preferences into a universal utility function, leading to coarse approximations.
method The paper investigates the statistical and computational challenges of learning a correlated probit model using best-of-three preference data.
result Best-of-three preference data overcomes the limitations of pairwise preference data, allowing for more fine-grained modeling of human preferences.

Dynamic Vine Copulas detect and quantify time-varying higher-order interactions in multivariate systems.

problem Time-varying dependence in multivariate systems, including tail behavior, asymmetry, and conditional structure.
method Dynamic Vine Copulas (DVC) framework for estimating and diagnosing non-Gaussian dependence, using fixed-root-order C-vines and smooth parameter trajectories.
result DVC detects and quantifies time-varying higher-order interactions, distinguishing between pairwise and conditional dependence.

We consider support recovery in the quadratic logistic regression setting - where the target depends on both p linear terms xix_i and up to p2p^2 quadratic terms xixjx_i x_j. Quadratic terms enable prediction/modeling of higher-order effects between features and the target, but when incorporated naively may involve solvi…

2017-03-08abs ↗pdf ↗

In many real-world applications, data are often unlabeled and comprised of different representations/views which often provide information complementary to each other. Although several multi-view clustering methods have been proposed, most of them routinely assume one weight for one view of features, and thus inter-vie…

2018-10-18abs ↗pdf ↗

New VAE models reveal hierarchical visual cortex computations.

problem Capturing hierarchical visual cortex computations in generative models.
method Sparse coding hierarchical VAEs trained on natural images with varied generative and recognition components.
result Representations similar to those in visual cortex emerge under inductive biases.

We investigate the relative information content of six measures of dependence between two random variables XX and YY for large or extreme events for several models of interest for financial time series. The six measures of dependence are respectively the linear correlation ρv+ρ^+_v and Spearman's rho ρs(v)ρ_s(v) conditio…

2002-03-07abs ↗pdf ↗

The correlated stochastic volatility models constitute a natural extension of the Black and Scholes-Merton framework: here the volatility is not a constant, but a stochastic process correlated with the price log-return one. At present, several stochastic volatility models are discussed in the literature, differing in t…

2007-09-06abs ↗pdf ↗

Study reveals structural differences in financial networks near and far from crises using balance theory.

problem Understanding the complex behavior of stocks and their collective behavior in financial crises.
method Investigates financial networks by triplet interaction in the framework of balance theory, focusing on higher-order interactions.
result Formation of an ordered structure in crisis networks makes them resistant to disorder, with a critical temperature measuring crisis strength.

For certain classes of knots we define geometric invariants called higher-order genera. Each of these invariants is a refinement of the slice genus of a knot. We find lower bounds for the higher-order genera in terms of certain von Neumann ρρ-invariants, which we call higher-order signatures. The higher-order genera o…

2008-07-02abs ↗pdf ↗

In topic modeling, many algorithms that guarantee identifiability of the topics have been developed under the premise that there exist anchor words -- i.e., words that only appear (with positive probability) in one topic. Follow-up work has resorted to three or higher-order statistics of the data corpus to relax the an…

2016-11-15abs ↗pdf ↗

A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucia…

2017-04-12abs ↗pdf ↗

A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher…

2019-07-25abs ↗pdf ↗

In this paper we develop a geometric approach to higher order mechanics on graded bundles in both, the Lagrangian and Hamiltonian formalism, via the recently discovered weighted algebroids. We present the corresponding Tulczyjew triple for this higher order situation and derive in this framework the phase equations fro…

2014-12-08abs ↗pdf ↗