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

52104156208 · Jun 202019922001200920182026
48 results for higher-order factors

Sum-product networks enhance sequence modeling with higher-order factors.

problem Modeling complex relations in sequence data with first-order models.
method Combining sum-product networks with higher-order linear-chain conditional random fields.
result Improved performance in sequence labeling tasks compared to state-of-the-art methods.

H-GAT improves stock selection by capturing complex higher-order stock relations and integrating both technical and fundamental analysis.

problem Stock selection difficulty and lack of comprehensive analysis.
method Higher-order Graph Attention Network (H-GAT) that incorporates both technical and fundamental analysis.
result H-GAT outperforms existing methods in stock selection metrics.

Unified tensor factorization for efficient 3D convolutions in spatio-temporal emotion analysis.

problem Training deep 3D convolutions is computationally expensive and requires large datasets.
method Tensor factorization framework for separable higher-order convolutions.
result Improved spatio-temporal emotion estimation on large datasets.

FGNN generalizes graph neural networks to capture higher-order dependencies.

problem Capturing higher-order dependencies in graph-structured data.
method Introducing a factor graph neural network (FGNN) that can represent Max-Product Belief Propagation.
result FGNN effectively represents Max-Product Belief Propagation and performs well on both synthetic and real datasets.

AFN learns adaptive-order feature interactions for better predictive models.

problem Learning optimal feature interactions in predictive models.
method AFN uses a logarithmic transformation layer to learn arbitrary-order cross features adaptively.
result AFN outperforms state-of-the-art models on four real datasets.

Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional. Unfortunately, despite increasing interest in FMs, there exists to date no efficient training algorithm for higher-order FMs (HOFMs). In this paper, we present the …

2016-07-25abs ↗pdf ↗

Combines neural networks and probabilistic graphical models for efficient higher-order inference.

problem Lack of efficient higher-order relational information in graph neural networks and probabilistic graphical models.
method Derives efficient approximate sum-product loopy belief propagation for higher-order PGMs, embeds into neural network, proposes methods for constructing higher-order factors.
result Substantially outperforms state-of-the-art k-order graph neural networks in molecular datasets.

Here we propose a novel model family with the objective of learning to disentangle the factors of variation in data. Our approach is based on the spike-and-slab restricted Boltzmann machine which we generalize to include higher-order interactions among multiple latent variables. Seen from a generative perspective, the …

2012-10-19abs ↗pdf ↗

A new probabilistic BTD method for tensor data.

problem Modeling higher-order tensors with robust inference.
method Probabilistic Block-Term Decomposition using variational Bayesian inference and von-Mises Fisher distribution.
result The proposed pBTD can quantify multi-linear structures robustly.

Predicting unobserved entries of a partially observed matrix has found wide applicability in several areas, such as recommender systems, computational biology, and computer vision. Many scalable methods with rigorous theoretical guarantees have been developed for algorithms where the matrix is factored into low-rank co…

2017-05-04abs ↗pdf ↗

Lower bounds for higher-order methods in non-convex optimization.

problem Proving lower bounds for higher-order methods in smooth non-convex finite-sum optimization.
method Analyzing deterministic and randomized algorithms, proposing a new smoothness assumption.
result Proves optimal lower bounds for simulating pth-order regularized methods on the whole function.

Users form information trails as they browse the web, checkin with a geolocation, rate items, or consume media. A common problem is to predict what a user might do next for the purposes of guidance, recommendation, or prefetching. First-order and higher-order Markov chains have been widely used methods to study such se…

2017-04-20abs ↗pdf ↗

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.

The paper proves existence and classification of translating solitons in warped product manifolds.

problem Existence and classification of translating solitons in warped product manifolds.
method Proving existence and classification results for translating solitons defined as initial conditions for higher order mean curvature flows in warped product manifolds.
result Existence and classification of translating solitons in warped product manifolds.

Neural network improves K-factor estimation for OFDM systems.

problem Estimating Ricean K factor for link quality in OFDM systems.
method Classified as a classification problem, neural network estimates K factor at transmitter side.
result High accuracy in K factor estimation with reduced feedback bandwidth.

The reduction theorems for general linear and classical connections are generalized for operators with values in higher order gauge-natural bundles. We prove that natural operators depending on the s1s_1-jets of classical connections, on the s2s_2-jets of general linear connections and on the rr-jets of tensor fields …

2004-05-26abs ↗pdf ↗

New method improves DAG learning by using large coefficients for higher-order terms.

problem Recovering DAG structures from observational data is challenging due to combinatorial optimization.
method Proposes truncated matrix power iteration to approximate DAG constraints efficiently.
result Empirically outperforms previous methods by a factor of 3 or more in structural Hamming distance.

A new method learns dynamic graph representations from time-varying data.

problem Learning dynamic graph representations from time-varying data.
method Higher-order skip-gram with negative sampling (HOSGNS) for tensor factorization.
result HOSGNS outperforms state-of-the-art methods in downstream tasks.

Joint analysis of data from multiple sources has the potential to improve our understanding of the underlying structures in complex data sets. For instance, in restaurant recommendation systems, recommendations can be based on rating histories of customers. In addition to rating histories, customers' social networks (e…

2011-05-17abs ↗pdf ↗

IFM improves recommender systems by learning flexible feature interactions.

problem Dealing with feature interactions in recommender systems can degrade performance.
method Introduces Interaction-Aware Mechanism (IAM) to learn feature and field interactions.
result Improves performance on two well-known datasets compared to state-of-the-art methods.

The Lagrangian formalism on a arbitrary non-fibrating manifold is considered. The kinematical description of this generic situation is based on the concept of (higher-order) Grassmann manifolds which is the factorization of the regular velocity manifold to the action of the differential group. Here we introduce in this…

1997-09-01abs ↗pdf ↗

New method adds interactions to interpretable models for large-scale data.

problem Limited model complexity and lack of interactions in interpretable models.
method Factorization method to derive scalable higher-order tensor product spline models.
result Incorporates all higher-order interactions of non-linear feature effects without computational penalties.

Study privacy vs. utility in estimating network parameters with aggregated data.

problem Privacy-preserving estimation of network parameters from aggregated node degrees.
method β model, local and central differential privacy, minimax lower bounds, simple estimators.
result Achieved minimax-optimal risk bounds for parameter estimation under privacy constraints.

Develops polynomial diffusion models for multi-factor commodity futures dynamics.

problem Modeling futures prices using latent state variables for short and long-term stochastic factors.
method Polynomial diffusion models to incorporate non-linear effects, two filtering methods for estimation.
result Accurate estimation of futures prices despite parameter identification issues in polynomial diffusion models.

Most popular word embedding techniques involve implicit or explicit factorization of a word co-occurrence based matrix into low rank factors. In this paper, we aim to generalize this trend by using numerical methods to factor higher-order word co-occurrence based arrays, or \textit{tensors}. We present four word embedd…

2017-04-10abs ↗pdf ↗

Unified framework for disentangled representations using mechanistic independence.

problem Identifiability of disentangled latent factors under statistical dependencies.
method Introduces mechanistic independence to characterize latent factors by their actions on observed variables, proposing various independence criteria.
result Establishes conditions for identifiability of latent subspaces without statistical assumptions.

In this paper we propose a semi-Markov modulated model of interest rates. We assume that the switching process is a semi-Markov process with finite state space E and the modulated process is a diffusive process. We derive recursive equations for the higher order moments of the discount factor and we describe a Monte Ca…

2012-10-11abs ↗pdf ↗

The study of higher-order homology embeddings for manifold topology.

problem Understanding the structure of higher-order homology embeddings to disclose geometric or topological information.
method Analysis of the null space of the kk-th order Laplacian and proposing an algorithm to factorize the homology embedding.
result The proposed spectral loop detection algorithm is more efficient and effective on various data types.

Graphs improve theorem proving in higher-order logic.

problem Challenges in converting higher-order logic formulas into graph-based representations.
method Used graph neural networks (GNNs) to represent and search higher-order logic.
result GNNs outperform state-of-the-art methods in higher-order theorem proving.

Paper introduces techniques to learn higher-order programs, improving predictive accuracy and reducing learning times.

problem Expressing and learning complex programs in ILP.
method Extending meta-interpretive learning to support higher-order definitions as background knowledge.
result Learning higher-order programs reduces hypothesis space and sample complexity, improving predictive accuracy and reducing learning times.

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 ↗

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 ↗

DPLS improves asset pricing by capturing non-linear risk factor structures.

problem Estimating asset pricing models with non-linear risk factor structures.
method Deep Partial Least Squares (DPLS) for dynamic and flexible factor modeling.
result DPLS models outperform linear models in asset pricing, capturing non-linear risk factor interactions.

OpenGM is a C++ template library for defining discrete graphical models and performing inference on these models, using a wide range of state-of-the-art algorithms. No restrictions are imposed on the factor graph to allow for higher-order factors and arbitrary neighborhood structures. Large models with repetitive struc…

2012-06-01abs ↗pdf ↗

Paper provides Edgeworth expansions for network moments, improving accuracy of sampling distributions.

problem Accurate descriptions of sampling distributions of network moment statistics.
method Edgeworth expansion applied to studentized network moment statistics.
result Higher-order accurate approximation to sampling CDF of network moment statistics.