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.
Paper introduces models to discover complex structures in large hypergraphs.
The paper analyzes learning curves for kernel ridge regression with dot-product kernels.
New method adds interactions to interpretable models for large-scale data.
SpeqNets improve graph neural networks by scaling and adapting to graph sparsity.
We apply information-based complexity analysis to support vector machine (SVM) algorithms, with the goal of a comprehensive continuous algorithmic analysis of such algorithms. This involves complexity measures in which some higher order operations (e.g., certain optimizations) are considered primitive for the purposes …
With higher-order neighborhood information of graph network, the accuracy of graph representation learning classification can be significantly improved. However, the current higher order graph convolutional network has a large number of parameters and high computational complexity. Therefore, we propose a Hybrid Lower …
New method uses higher-order Langevin dynamics for efficient parallel sampling.
We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even). Distance-based methods are popular in machine learning. In large-scale applications, sto…
In recent years, graph neural networks (GNNs) have emerged as a powerful neural architecture to learn vector representations of nodes and graphs in a supervised, end-to-end fashion. Up to now, GNNs have only been evaluated empirically -- showing promising results. The following work investigates GNNs from a theoretical…
Paper introduces a framework for diagnosing Alzheimer's disease using higher-order topological features from fMRI.
A new method captures higher-order interactions in data clusters.
Training deep neural networks with spatio-temporal (i.e., 3D) or multidimensional convolutions of higher-order is computationally challenging due to millions of unknown parameters across dozens of layers. To alleviate this, one approach is to apply low-rank tensor decompositions to convolution kernels in order to compr…
New method adds all interactions in non-linear models without high computational cost.
In this paper, a novel stochastic extra-step quasi-Newton method is developed to solve a class of nonsmooth nonconvex composite optimization problems. We assume that the gradient of the smooth part of the objective function can only be approximated by stochastic oracles. The proposed method combines general stochastic …
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-match…
Predicts node sequences in graphs using multi-order network models.
New method combines hypergraph structure and node attributes for better community detection.
We describe Venture, an interactive virtual machine for probabilistic programming that aims to be sufficiently expressive, extensible, and efficient for general-purpose use. Like Church, probabilistic models and inference problems in Venture are specified via a Turing-complete, higher-order probabilistic language desce…
Sketching is a randomized dimensionality-reduction method that aims to preserve relevant information in large-scale datasets. Count sketch is a simple popular sketch which uses a randomized hash function to achieve compression. In this paper, we propose a novel extension known as Higher-order Count Sketch (HCS). While …
CSD improves goodness-of-fit testing for higher-order dependence.
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…
Geometric AD framework simplifies derivative computation in JAX.
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…
Stability of capillary hypersurfaces with higher order mean curvature.
New method identifies structural parameters without assuming uncorrelated errors.
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…
The paper improves CR Sobolev inequalities and classifies minimizers.
The study of higher-order homology embeddings for manifold topology.
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…
This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the formalization of most mathematical theories and have been shown to pose a significa…
The paper glosses different forms of an introducing of higher order tangent-like functors, especially functors derived from higher order nonholonomic tangent functors. A special attention is devoted to higher order osculating bundles: their identification with higher order tangent bundles is demonstrated as the main re…
A new method predicts higher-order interactions in evolving graphs using simplicial complexes.
Novel higher-order group synchronization for noisy local measurements on hypergraphs.
Higher-order tangent bundles have geometric structures compatible with their iterated bundle structure.
We construct new examples of algebraic curvature tensors so that the Jordan normal form of the higher order Jacobi operator is constant on the Grassmannian of subspaces of type in a vector space of signature . We then use these examples to establish some results concerning higher order Osserman and highe…
We use the Frölicher-Nijenhuis formalism to reformulate the inverse problem of the calculus of variations for a system of differential equations of order 2k in terms of a semi-basic 1-form of order k. Within this general context, we use the homogeneity proposed by Crampin and Saunders in [14] to formulate and discuss t…
We investigate finite-time decoupled convergence in nonlinear two-time-scale stochastic approximation.
A phenomenological investigation of the endogenous and exogenous dynamics in the fluctuations of capital fluxes is investigated on the Chinese stock market using mean-variance analysis, fluctuation analysis and their generalizations to higher orders. Non-universal dynamics have been found not only in exponents diff…
After defining cohomologically higher order BRST and anti-BRST operators for a compact simple algebra {\cal G}, the associated higher order Laplacians are introduced and the corresponding supersymmetry algebra is analysed. These operators act on the states generated by a set of fermionic ghost fields transforming u…
State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization, a polynomial dependence on the approximation guarantee and higher-order smoothn…
Introduce Collapsed Effective Operators for higher-order structures.
Given a closed, oriented, connected 3-manifold, M, we define higher-order linking forms on the higher-order Alexander modules of M. These higher-order linking forms generalize similar linking forms for knots previously studied by the author, which were themselves generalizations of the classical Blanchfield linking for…
In this paper, we introduce the notion of motif closure and describe higher-order ranking and link prediction methods based on the notion of closing higher-order network motifs. The methods are fast and efficient for real-time ranking and link prediction-based applications such as web search, online advertising, and re…
Realized moments of higher order computed from intraday returns are introduced in recent years. The literature indicates that realized skewness is an important factor in explaining future asset returns. However, the literature mainly focuses on the whole market and on the monthly or weekly scale. In this paper, we cond…
The paper connects higher order risk measures and stochastic dominance, showing their equivalence and integrating them with optimization.
New estimator stabilizes higher-order influence functions for stable statistical inference.
This work explores higher-order algebroids via vector bundle comorphisms.
Graph kernels based on the -dimensional Weisfeiler-Leman algorithm and corresponding neural architectures recently emerged as powerful tools for (supervised) learning with graphs. However, due to the purely local nature of the algorithms, they might miss essential patterns in the given data and can only handle binar…