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

83167250333 · Jun 202019922001200920172026
48 results for High-order systems

RotEqNet preserves rotation symmetry in fluid systems using high-order tensors.

problem Lack of rotational symmetry in machine learning models for fluid systems.
method Introduces RotEqNet, a network that guarantees rotation-equivariance for high-order tensors.
result RotEqNet reduces errors and maintains rotation-equivariance in fluid systems.

Pontryagin's Maximum Principle is an outstanding result for solving optimal control problems by means of optimizing a specific function on some particular variables, the so called controls. However, this is not always enough for solving all these problems. A high order maximum principle (Krener, 1977) must be used in o…

2012-10-25abs ↗pdf ↗

In the last two decades, significant effort has been put in understanding and designing so-called structure-preserving numerical methods for the simulation of mechanical systems. Geometric integrators attempt to preserve the geometry associated to the original system as much as possible, such as the structure of the co…

2018-10-25abs ↗pdf ↗

Enhances CEV model pricing with high-order scheme and adaptive time stepping.

problem Improving accuracy in pricing American CEV models with irregularities.
method High-order time adapted scheme, local mesh refinement, adaptive time stepping, fifth-order 5(4) Dormand-Prince method.
result Highly accurate solution with reduced computational runtime.

The paper analyzes cryptocurrency trading networks using pairwise and high-order dependencies.

problem Understanding information flows and dependencies in cryptocurrency markets.
method Defined a cryptocurrency trading network using weekly log returns, analyzed using Granger causality and O-information.
result High-order dependencies reveal that stable coins play a major role in high-order effects.

Factorization machine (FM) is an effective model for feature-based recommendation which utilizes inner product to capture second-order feature interactions. However, one of the major drawbacks of FM is that it couldn't capture complex high-order interaction signals. A common solution is to change the interaction functi…

2020-02-16abs ↗pdf ↗

Modeling interactions between features improves the performance of machine learning solutions in many domains (e.g. recommender systems or sentiment analysis). In this paper, we introduce Exponential Machines (ExM), a predictor that models all interactions of every order. The key idea is to represent an exponentially l…

2016-05-12abs ↗pdf ↗

Paper tackles high-order inference in structured prediction tasks.

problem Maximizing a score function on the space of labels in high-order Markov random fields.
method Generative model approach with two-stage convex optimization algorithm.
result Success in general high-order inference problems driven by hyperedge expansion properties.

Exact partitioning of high-order planted models achieved through convex optimization.

problem Efficiently partitioning hypergraphs generated by high-order planted models.
method Solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint.
result Exact recovery of true underlying cluster structures with high probability.

Paper proposes a new MIMO detection algorithm using Gaussian Mixture Expectation Propagation.

problem Challenges in MIMO detection due to interference and noise in high-order high-dimensional systems.
method The approach uses a Gaussian Mixture Model (GMM) approximation for Belief Propagation (BP) and Expectation Propagation (EP) messages to improve detection accuracy.
result The proposed algorithm outperforms state-of-the-art detection algorithms while maintaining low computational complexity.

In this paper, we propose new conditions guaranteeing that the trajectories of a mechanical control system can track any curve on the configuration manifold. We focus on systems that can be represented as forced affine connection control systems and we generalize the sufficient conditions for tracking known in the lite…

2015-01-16abs ↗pdf ↗

We are able to derive the equations of motion for forced mechanical systems in a purely variational setting, both in the context of Lagrangian or Hamiltonian mechanics, by duplicating the variables of the system as introduced by Galley [2013], Galley, Tsang, and Stein [2014]. We show that this construction is useful to…

2017-12-26abs ↗pdf ↗

Paper develops a high-order recombination algorithm for financial modeling.

problem Creating accurate approximations of stochastic differential equations in finance.
method High-order recombination method applied to practical financial problems.
result Algorithm effectively avoids explosive growth in support cardinality for high-order approximations.

Paper proposes efficient methods for high-order clustering in tensor block models.

problem High-order clustering of multiway datasets in neuroimaging, genomics, etc.
method Tensor block model and computationally efficient algorithms (HLloyd, HSC)
result Achieves high-order exact clustering with statistical optimality and computational efficiency.

Quantum systems with scrambling improve temporal information processing, but scaling requires exponential overhead.

problem Scalability and memory retention of quantum reservoirs in temporal information processing.
method Examined a quantum reservoir processing framework with scrambling reservoirs modeled by high-order unitary designs, analyzed in noiseless and noisy settings.
result Memory retention improves exponentially with reservoir size but worsens with reservoir iterations, requiring exponential shot overhead for scaling.

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.

New method finds significant high-order interactions efficiently.

problem Finding statistically significant high-order interactions in high-dimensional data.
method Extends selective inference to high-order interaction models with pruning strategy.
result Demonstrated efficient and powerful method for high-order interactions.

New integrators for Lagrangian systems on homogeneous spaces derived from nonholonomic mechanics.

problem Numerical integration of Lagrangian systems on homogeneous spaces.
method Nonholonomic partitioned Runge-Kutta Munthe-Kaas (RKMK) methods on Lie groups.
result Preservation of properties in high-order numerical integrators.

Taking into account high-order interactions among covariates is valuable in many practical regression problems. This is, however, computationally challenging task because the number of high-order interaction features to be considered would be extremely large unless the number of covariates is sufficiently small. In thi…

2015-06-26abs ↗pdf ↗

RGCF improves collaborative filtering by refining graph convolution embeddings.

problem GCN-based recommendation models introduce noise and redundancy, limiting high-order connectivity capture.
method Developed RGCF, a new GCN-based Collaborative Filtering model with redesigned embeddings.
result RGCF significantly outperforms state-of-the-art models on public datasets.

Finding statistically significant high-order interaction features in predictive modeling is important but challenging task. The difficulty lies in the fact that, for a recent applications with high-dimensional covariates, the number of possible high-order interaction features would be extremely large. Identifying stati…

2015-06-26abs ↗pdf ↗

EPINE enhances network embedding by improving adjacency matrix-based high-order proximity.

problem Inaccurate and poorly designed calculation of high-order proximity in network embedding.
method EPINE redefines high-order proximity intuitively and proposes a scalable algorithm for accurate calculation.
result EPINE outperforms existing methods in network reconstruction, link prediction, and node classification.

To alleviate sparsity and cold start problem of collaborative filtering based recommender systems, researchers and engineers usually collect attributes of users and items, and design delicate algorithms to exploit these additional information. In general, the attributes are not isolated but connected with each other, w…

2019-03-18abs ↗pdf ↗

Novel CG-EGNNs learn equivariant functions from Clifford algebras.

problem Lack of equivariance in high-order graph neural networks.
method Integrates high-order local structures with Clifford algebras for equivariant learning.
result CG-EGNNs outperform previous methods on various benchmarks.

In this article we propose a novel measure of systemic risk in the context of financial networks. To this aim, we provide a definition of systemic risk which is based on the structure, developed at different levels, of clustered neighbours around the nodes of the network. The proposed measure incorporates the generaliz…

2018-10-31abs ↗pdf ↗

Enhances clustering performance with a novel high-order Laplacian matrix.

problem Limited representation capability and insufficient information exploitation in multi-view spectral clustering.
method Proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix.
result Improves clustering performance through enhanced representation capacity of the learned optimal Laplacian matrix.

Paper analyzes LSA algorithm bias and error bounds with RR extrapolation.

problem Analyzing bias and high-order error bounds of LSA with Markovian noise.
method Polyak-Ruppert averaging, linearization, Richardson-Romberg extrapolation.
result RR extrapolation effectively cancels the leading bias term.

Paper proposes an efficient algorithm to handle high-order portfolio moments.

problem Designing portfolios with high-order moments (skewness and kurtosis) is computationally challenging.
method Proposes a SCA algorithm framework for solving high-order portfolios efficiently.
result Demonstrates the efficiency of the proposed algorithm through numerical experiments.

New method disentangles high-order effects in feature importance.

problem Quantifying cooperative effects in feature importance.
method Adaptive Leave One Covariate Out (LOCO) method to decompose LOCO into two-body and higher-order components.
result Decomposes LOCO into two-body and higher-order components, highlighting synergistic and redundant effects.