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

Trend · papers per month

8.3%16.7%25.0%33.3% · Jul 199219922001200920172026
48 results for monomial order

Gradient boosts monomial-order-free basis construction algorithms.

problem Lack of theoretical properties in monomial-order-free basis construction algorithms.
method Exploits gradient to sidestep spurious vanishing, achieve consistent output, and remove redundant bases.
result Proposes methods that equip monomial-order-free algorithms with theoretical properties.

Power-law spectrum of random feature model is preserved in neural networks.

problem Preserving power-law spectrum in neural networks through random feature model.
method Characterized eigenvalues of population random-feature covariance using dyadic head-tail decomposition and Wick chaos expansions.
result Power-law exponent αα is inherited from input covariance, modified by a logarithmic correction.

We present here a result of Monomialization of real analytic two-symmetric tensor fields over regular real analytic surfaces. We apply it to the (extension of the pull-back of the) inner metric of a resolved surface of a real analytic surface singularity. Doing so we recover Hsiang & Pati property at each point of the …

2015-05-19abs ↗pdf ↗

The algebra of differential invariants under SA3(R)SA_3(\mathbb{R}) of generic parabolic surfaces S2R3S^2 \subset \mathbb{R}^3 with nonvanishing Pocchiola 4th4^{\text{th}} invariant WW is shown to be generated, through invariant differentiations, by only one other invariant, MM, of order 55, having 5757 differential monomi…

2019-08-21abs ↗pdf ↗

The paper connects knot volume to AA-polynomial structure.

problem Understanding the relationship between knot volume and AA-polynomial structure.
method Examining satellite knots and their AA-polynomials to conjecture a connection with hyperbolic volume.
result The conjecture that knots with zero hyperbolic volume have AA-polynomials with specific factor structure.

We prove a version of Jonsson-Mustaţǎ's Conjecture, which says for any graded sequence of ideals, there exists a quasi-monomial valuation computing its log canonical threshold. As a corollary, we confirm Chi Li's conjecture that a minimizer of the normalized volume function is always quasi-monomial. Applying our techni…

2019-07-02abs ↗pdf ↗

Efficiently optimizes boolean functions using multilinear polynomials and exponential weight updates.

problem Optimizing boolean functions over the boolean hypercube with high computational cost.
method Proposes a computationally efficient algorithm using multilinear polynomials and exponential weight updates.
result Improves computational time up to several orders of magnitude compared to state-of-the-art algorithms.

POUnets combine partitions of unity and monomials for efficient deep learning.

problem Efficiently approximating functions with deep neural networks in high dimensions.
method Integrates partitions of unity and monomials into neural network architecture.
result POUnets achieve hp-convergence for smooth functions and outperform MLPs for discontinuous functions.

We prove that the Kontsevich tetrahedral flow P˙=Qa:b(P)\dot{\mathcal{P}} = \mathcal{Q}_{a:b} (\mathcal{P}), the right-hand side of which is a linear combination of two differential monomials of degree four in a bi-vector P\mathcal{P} on an affine real Poisson manifold NnN^n, does infinitesimally preserve the space of Poisson…

2016-08-04abs ↗pdf ↗

The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have exactly three vertices) the spanning trees are generated by the Pfaffian of a suitably…

2001-09-17abs ↗pdf ↗

We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e. each data point is a solution to a system of polynomial equations. In this case the original matrix is possibly high-rank, but it becomes low-rank after mapping each column to a higher dimensional…

2017-03-28abs ↗pdf ↗

Given a klt singularity x(X,D)x\in (X, D), we show that a quasi-monomial valuation vv with a finitely generated associated graded ring is the minimizer of the normalized volume function vol^(X,D),x\widehat{\rm vol}_{(X,D),x}, if and only if vv induces a degeneration to a K-semistable log Fano cone singularity. Moreover, such a mi…

2017-07-18abs ↗pdf ↗

Study shows shallow ReLU networks struggle with high-dimensional Lipschitz functions.

problem Expressing high-dimensional Lipschitz functions with shallow ReLU networks.
method Established lower bounds on shallow network complexity for polynomial approximation.
result Shallow ReLU networks suffer from the curse of dimensionality for Lipschitz functions.

The study determines fiber homotopy trivial bundles and their impact on curvature.

problem Understanding fiber homotopy trivial bundles and their effect on curvature.
method Classical approach via block bundles and surgery theory.
result Existence of elements of infinite order in homotopy groups of spaces of positive curvature.

We present a novel method for exact hierarchical sparse polynomial regression. Our regressor is that degree rr polynomial which depends on at most kk inputs, counting at most \ell monomial terms, which minimizes the sum of the squares of its prediction errors. The previous hierarchical sparse specification aligns w…

2017-09-28abs ↗pdf ↗

The Alexander biquandle of a virtual knot or link is a module over a 2-variable Laurent polynomial ring which is an invariant of virtual knots and links. The elementary ideals of this module are then invariants of virtual isotopy which determine both the generalized Alexander polynomial (also known as the Sawollek poly…

2011-10-06abs ↗pdf ↗

A new bootstrapping method reduces key sizes and runtime in FHE.

problem Large plaintext evaluation in FHE increases bootstrapping complexity.
method New polynomial vector representation and monic monomial permutation matrices.
result Polynomial factor improvement in key size and constant factor in runtime.

We express the coefficients of the Hirzebruch L-polynomials in terms of certain alternating multiple zeta values. In particular, we show that every monomial in the Pontryagin classes appears with a non-zero coefficient, with the expected sign. Similar results hold for the polynomials associated to the A-hat genus.

2017-08-18abs ↗pdf ↗

We investigate aspects of Kauffman bracket skein algebras of surfaces and modules of 3-manifolds using quantum torus methods. These methods come in two flavors: embedding the skein algebra into a quantum torus related to quantum Teichmuller space, or filtering the algebra and obtaining an associated graded algebra that…

2019-10-03abs ↗pdf ↗

A toric cube is a subset of the standard cube defined by binomial inequalities. These basic semialgebraic sets are precisely the images of standard cubes under monomial maps. We study toric cubes from the perspective of topological combinatorics. Explicit decompositions as CW-complexes are constructed. Their open cells…

2012-02-20abs ↗pdf ↗

The paper proves a cohomological injection for a specific group.

problem Investigating nontriviality of certain cohomology classes.
method Uses an idea from Nariman to prove nontriviality of monomials in the Euler and Pontrjagin classes.
result Proves that H(extBSO(4);Q)H^*( ext{BSO}(4);\mathbb{Q}) injects into the group cohomology of extDiff+(S3) ext{Diff}^+(S^{3}).

In this paper we present two new bases, BH2B^{\prime}_{H_2} and BH2\mathcal{B}_{H_2}, for the Kauffman bracket skein module of the handlebody of genus 2 H2H_2, KBSM(H2H_2). We start from the well-known Przytycki-basis of KBSM(H2H_2), BH2B_{H_2}, and using the technique of parting we present elements in BH2B_{H_2} in open b…

2019-08-22abs ↗pdf ↗

Paper connects MoE and self-attention, proposing active-attention.

problem Improving efficiency and performance of self-attention mechanisms.
method Established connection between MoE and self-attention, analyzed quadratic gating functions, proposed active-attention mechanism.
result Active-attention outperforms standard self-attention in various tasks.

Approximate vanishing ideal is a concept from computer algebra that studies the algebraic varieties behind perturbed data points. To capture the nonlinear structure of perturbed points, the introduction of approximation to exact vanishing ideals plays a critical role. However, such an approximation also gives rise to a…

2019-01-25abs ↗pdf ↗

Inspired by the Bruhat-Tits building of SLn_n(Qp\mathbb Q_p), we construct a complete metric space X with an action of the tame automorphism group of the affine space Tame(KnK^n). The points in X are certain monomial valuations, and X admits a natural structure of Euclidean CW-complex of dimension n-1. When n = 3, and…

2018-02-01abs ↗pdf ↗

The paper establishes inequalities for Chern classes and Riemann-Roch type inequalities for projective manifolds.

problem Establishing inequalities for Chern classes and Riemann-Roch type inequalities for projective manifolds.
method Applying effective very ampleness of adjoint bundles, log-concavity, and Khovanskii-Teissier inequalities.
result For any projective manifold X and ample line bundle L, there exists a universal bivariate polynomial Q_λ(x, y) with deg Q ≤ d, such that the inequality holds.

The Links-Gould polynomial of alternating knots is shown to be log-concave and positive.

problem Verifying the positivity and log-concavity of the Links-Gould polynomial for alternating knots.
method Formulated a conjecture and verified it computationally for all 51.3 million knots with up to 19 crossings.
result All but 544 knots satisfy a stronger log-concavity condition.

The paper connects knot theory and cluster algebras via dimer face polynomials.

problem Understanding the relationship between knot theory and cluster algebras.
method Analyzing dimer face polynomials and their connections to Alexander polynomials and cluster algebras.
result Dimer face polynomials are multivariate generalizations of Alexander polynomials and FF-polynomials in cluster algebras.

We unify slice sampling and Hamiltonian Monte Carlo (HMC) sampling, demonstrating their connection via the Hamiltonian-Jacobi equation from Hamiltonian mechanics. This insight enables extension of HMC and slice sampling to a broader family of samplers, called Monomial Gamma Samplers (MGS). We provide a theoretical anal…

2016-02-25abs ↗pdf ↗

Recent advances in stochastic gradient techniques have made it possible to estimate posterior distributions from large datasets via Markov Chain Monte Carlo (MCMC). However, when the target posterior is multimodal, mixing performance is often poor. This results in inadequate exploration of the posterior distribution. A…

2017-06-05abs ↗pdf ↗

Study the expressivity and training complexity of polynomial neural networks.

problem Understanding the expressivity and training complexity of polynomial neural networks.
method Use algebraic geometry to describe neuromanifolds and neurovarieties, analyzing their dimension and learning degree.
result Characterized the dimension and learning degree of neuromanifolds, providing geometric and complexity measures.