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

Trend · papers per month

174347521694 · Jun 202019922001200920172026
48 results for higher order terms

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 ↗

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.

Paper proves Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.

problem Proving relations between Reshetikhin-Turaev and re-normalized link invariants for links.
method Analyzing higher order terms of re-normalized link invariants for plumbed links.
result Reshetikhin-Turaev link invariants appear in higher order terms of re-normalized link invariants for plumbed links.

This work improves online SGD's sample complexity for multi-index models by considering higher-order terms.

problem Suboptimal sample complexity for learning multi-index models using online SGD.
method Focus on both second- and higher-order terms to improve sample complexity.
result Online SGD achieves ildeO(dPL1) ilde{O}(d P^{L-1}) samples for multi-index models.

Superposition rules form a class of functions that describe general solutions of systems of first-order ordinary differential equations in terms of generic families of particular solutions and certain constants. In this work we extend this notion and other related ones to systems of higher-order differential equations …

2011-11-17abs ↗pdf ↗

A new method predicts higher-order interactions in evolving graphs using simplicial complexes.

problem Predicting higher-order interactions in dynamic graphs with theoretical guarantees.
method Capturing higher-order interactions as simplices, modeling neighborhoods with face-vectors, and developing a nonparametric kernel estimator.
result Our method outperforms existing higher-order prediction methods and is theoretically consistent.

In this paper, using the method of moving frames, we generalise some of Terracini's results on varieties with tangent defect. In particular, we characterise varieties with higher order osculating defect in terms of Jacobians of higher fundamental forms and moreover we characterise varieties with "small" higher fundamen…

2012-04-19abs ↗pdf ↗

Unified field theory from higher-order Riemannian geometry.

problem Field-theoretical unification of fundamental forces.
method Exploiting higher-order Riemannian geometry and Einstein-Hilbert action, deriving gauge theories and predicting physical constants.
result Theoretical predictions for Weinberg angle and Coulomb's constant match experimental values.

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function of the Fisher information volume of the model as the sample size nn goes to in…

2015-10-01abs ↗pdf ↗

This work explores higher-order algebroids via vector bundle comorphisms.

problem Generalizing concepts of higher-order tangent bundles and Lie algebroids.
method Introduces a vector bundle comorphism approach to describe higher-order algebroids.
result Establishes a one-to-one correspondence between higher-order Lie algebroids and specific algebraic structures.

Study on uniqueness of hypersurfaces in hyperbolic space with constant mean curvature.

problem Uniqueness of hypersurfaces with constant higher order mean curvature in hyperbolic space.
method Generalization of Bernstein theorem and proof of Bernstein type results for immersed hypersurfaces.
result Rigidity of horospheres and equidistant spheres in terms of their higher order mean curvatures.

GUIDE detects anomalies in attributed networks by reconstructing node attributes and higher-order structures.

problem Lack of effective mechanisms for detecting anomalies in complex network interactions.
method GUIDE uses attribute and structure autoencoders, graph attention, and reconstruction errors to identify anomalies.
result GUIDE significantly outperforms state-of-the-art methods on multiple real-world datasets.

We prove a lower bound for the kk-th Steklov eigenvalues in terms of an isoperimetric constant called the kk-th Cheeger-Steklov constant in three different situations: finite spaces, measurable spaces, and Riemannian manifolds. These lower bounds can be considered as higher order Cheeger type inequalities for the Ste…

2017-05-24abs ↗pdf ↗

We consider the higher order buckling eigenvalues of the following Dirichlet poly-Laplacian in the unit sphere (Δ)pu=Λ(Δ)u(-Δ)^p u=Λ(-Δ) u with order p(2)p(\geq2). We obtain universal bounds on the (k+1)(k+1)th eigenvalue in terms of the first kkth eigenvalues independent of the domains. In particular, for p=2p=2, our result is shar…

2009-08-31abs ↗pdf ↗

We develop the intersection theory at relative chain-cochain level, and apply it along with the use of Seifert disks for an oriented link to give a combinatorial algorithm to compute Massey's higher order linking numbers. It is subtle to compute higher-order linking numbers, and it has been a folklore to use the inters…

2014-07-18abs ↗pdf ↗

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.

Expands differential geometry to higher-order infinitesimals.

problem No specific problem stated; general expansion of differential geometry.
method Introduces higher tangent vectors and jet connections, generalizes Riemannian metric tensor, develops higher-order integration theory.
result Natural analogues of Riemannian curvature tensor with novel phenomena.

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 ↗

The growing use of neuroimaging technologies generates a massive amount of biomedical data that exhibit high dimensionality. Tensor-based analysis of brain imaging data has been proved quite effective in exploiting their multiway nature. The advantages of tensorial methods over matrix-based approaches have also been de…

2016-07-15abs ↗pdf ↗

The paper proposes a method to compute higher infinitesimals in numerical and symbolic analysis.

problem Computing higher-order derivatives with higher infinitesimals.
method Automatic differentiation in terms of C-infinity rings and Weil algebras.
result A unifying theoretical framework for multivariate higher-order derivatives.

Higher-order geometry modifies Newtonian dynamics and predicts anomalies in spacecraft motion.

problem Observing and understanding higher-order effects in general relativity.
method Generalizing the Einstein-Hilbert action to include higher-order infinitesimals and studying field equations and cosmologies.
result Higher-order corrections predict anomalies like the Pioneer and flyby effects.

We give a construction of homotopy algebras based on ``higher derived brackets''. More precisely, the data include a Lie superalgebra with a projector on an Abelian subalgebra satisfying a certain axiom, and an odd element ΔΔ. Given this, we introduce an infinite sequence of higher brackets on the image of the project…

2003-04-03abs ↗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.

MACE uses higher-order messages to create fast, accurate force fields.

problem Creating fast and accurate force fields in computational chemistry and materials science.
method Introducing MACE, an equivariant MPNN model that uses four-body messages.
result MACE reduces the required number of message passing iterations to just two, achieving state-of-the-art accuracy.

New approach approximates c-space geometry of multi-loop linkages.

problem Higher-order mobility analysis of multi-loop linkages.
method Higher-order Taylor series expansion of geometric constraint mapping using joint screws.
result Local approximation of c-space and configurations with certain rank.

Study optimizes zero-order strongly convex function minimization with higher order smoothness.

problem Optimizing a strongly convex function with noisy evaluations.
method Randomized approximation of projected gradient descent with smoothing kernel.
result Upper bounds and minimax lower bounds for the algorithm, showing near-optimality.

Paper proves higher-order flow matching preserves optimality in generative modeling.

problem Theoretical guarantees for higher-order flow matching in generative modeling.
method Neural network approximations with controlled depth, width, and sparsity.
result Proves worst case optimality for second-order flow matching.

We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue of the pp-Laplacian. In the case of the closed eigenvalue problem and the Neuma…

2019-07-08abs ↗pdf ↗

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…

2018-10-04abs ↗pdf ↗

HAMD optimizes cubic portfolios without quadratization, achieving better results.

problem Optimizing higher-order portfolio models with reduced distortion.
method Hybrid pipeline combining continuous Hamiltonian search, cardinality-preserving projection, and iterated local search.
result HAMD achieves significantly lower native cubic objective values than classical heuristics.

We study higher-order analogues of Dirac structures, extending the multisymplectic structures that arise in field theory. We define higher Dirac structures as involutive subbundles of TM+kTMTM+\wedge^k TM^* satisfying a weak version of the usual lagrangian condition (which agrees with it only when k=1k=1). Higher Dirac stru…

2016-11-07abs ↗pdf ↗

The paper solves a general case of the cohomological relative index problem for foliations.

problem Solving the cohomological relative index problem for foliations of non-compact manifolds.
method Generalizing Gromov and Lawson's results to Dirac operators on non-compact complete Riemannian manifolds, involving all terms of the Connes-Chern character.
result Establishing a relative topological index and Connes-Chern character equality for two leafwise Dirac operators on non-compact manifolds.

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.

A new HOM model improves forecasting of Indian base metal prices.

problem Improving accuracy in predicting base metal prices in the Indian market.
method A Higher Order Markovian (HOM) model with varying order based on market delay.
result The HOM model consistently outperforms the standard Markovian model in forecasting.

The paper introduces new boundary operators and proves higher order CR Sobolev trace inequalities for Siegel domain and complex ball.

problem Establishing higher order CR Sobolev trace inequalities for Siegel domain and complex ball.
method Introducing conformally covariant boundary operators, proving extension theorems, and establishing trace inequalities.
result Generalized CR Sobolev trace inequalities for all γ ∈ (0, n+1) \mathbb{N}.

In this article, we study the deformations of Filippov algebroids. We define a differential graded Lie algebra (in short DGLA) for a Filippov algebroid by introducing the notion of Filippov multiderivations for a vector bundle. Later on, we discuss deformations of a Filippov algebroid in terms of low-dimensional cohomo…

2019-12-31abs ↗pdf ↗

Improved estimation of higher order integrals using shrinkage techniques.

problem Estimating higher order Bochner integrals in non-parametric settings.
method Shrinkage of U-statistic towards a target element, considering kernel degeneracy.
result Consistent shrinkage estimators with fast rates of convergence, even for non-degenerate kernels.

Efficiently approximates higher-order derivatives for generative models.

problem Expensive computation of higher-order derivatives in generative models.
method Rewrite SM objective in terms of directional derivatives and use finite difference for efficient approximation.
result Comparable results to gradient-based methods but significantly more computationally efficient.

SpeqNets improve graph neural networks by scaling and adapting to graph sparsity.

problem Graph neural networks struggle with permutation-equivariant functions and scalability to large graphs.
method Introducing sparsity-aware, permutation-equivariant graph networks with heuristics for graph isomorphism.
result Significantly improved predictive performance and reduced computation times compared to existing methods.