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

35810 · May 202619922001200920172026
48 results for Arnold strangeness

Recently V. Arnold introduced Strangeness and J±J^{\pm} invariants of generic immersions of an oriented circle to R2\R^2. Here these invariants are generalized to the case of generic immersions of an oriented circle to an arbitrary surface FF. We explicitly describe all the invariants satisfying axioms, which naturall…

1999-06-18abs ↗pdf ↗

In this paper we study the Lorenz equations using the perspective of the Conley index theory. More specifically, we examine the evolution of the strange set that these equations posses throughout the different values of the parameter. We also analyze some natural Morse decompositions of the global attractor of the syst…

2018-12-12abs ↗pdf ↗

In this article, we give proofs on the Arnold Lagrangian intersection conjecture on the cotangent bundles, Arnold-Givental Lagrangian intersection conjecture and the Arnold fixed point conjecture.

2008-08-05abs ↗pdf ↗

Kolmogorov-Arnold Networks promise scalable performance in high dimensions.

problem Curse of dimensionality in multilayer perceptrons.
method Kolmogorov-Arnold representation theorem and interpolation methods.
result Kolmogorov-Arnold Networks achieve true freedom from the curse of dimensionality.

Revisits the connection between neural networks and the Kolmogorov-Arnold theorem.

problem Explains the limitations of using the Kolmogorov-Arnold theorem to explain neural networks with multiple hidden layers.
method Derives modifications of the Kolmogorov-Arnold representation that transfer smoothness properties to the outer function and can be well approximated by ReLU networks.
result Shows that a deep neural network with most layers approximating the interior function is a more natural interpretation of the Kolmogorov-Arnold representation.

Arnold-Liouville systems cannot be bi-Hamiltonian generically.

problem The bi-Hamiltonian structure of Arnold-Liouville systems.
method Proving that a specific class of smooth functions is a meagre subset for the Fréchet topology, which implies Arnold-Liouville systems cannot be bi-Hamiltonian.
result Generically, Arnold-Liouville systems cannot be bi-Hamiltonian.

The paper proves that most metrics satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.

problem Understanding metrics that satisfy a strong version of Arnold's conjecture for Laplace eigenvalues.
method Using geometric characterizations and perturbation theory, the paper proves the conjecture for most metrics.
result The Strong Arnold Hypothesis is satisfied for all metrics except for a set of infinite codimension.

A new Kolmogorov-Arnold network improves function approximation and optimization.

problem Approximating potentially irregular functions in high dimensions.
method Proposes a new Kolmogorov-Arnold network (KAN) and provides error bounds and universal approximation theorems.
result Outperforms multilayer perceptrons in accuracy and convergence speed for irregular functions.

SVGP KAN integrates uncertainty quantification into Kolmogorov-Arnold networks.

problem Uncertainty quantification in scientific machine learning models.
method Sparse variational Gaussian process inference with Kolmogorov-Arnold topology.
result Demonstrated ability to distinguish aleatoric and epistemic uncertainty in various scientific applications.

Combines geometric hydrodynamics with magnetic systems to derive new equations and prove well-posedness.

problem Deriving new equations for magnetic systems and proving their well-posedness.
method Introducing the magnetic Euler-Arnold equation and proving well-posedness for specific equations.
result Local and global well-posedness results for the magnetic Euler-Arnold equation associated with the global quasi-geostrophic equations.

Proves Arnold conjecture for singular symplectic manifolds using novel techniques.

problem Hamiltonian dynamics on singular symplectic manifolds.
method Introducing smooth symplectic forms to singular symplectic structures under mild conditions, using Floer homology.
result Proves a lower bound on the number of 1-periodic Hamiltonian orbits for b2mb^{2m}-symplectic manifolds.

Unified framework for Arnold-type invariants via dual complexes and finite-difference structures.

problem Study of Arnold-type invariants of immersed curves and surfaces.
method Framework on dual complexes, locally normalized maps, finite-difference structures, and Shumakovitch-type identities.
result Unified evaluation of Arnold-type invariants St(1)St_{(1)} and St(2)St_{(2)} on dual skeleta.

The paper confirms Arnold's conjecture about hyperbolic polynomials.

problem The number of connected components of hyperbolic polynomials increases linearly with degree.
method Constructive proof using homotopy invariance of the index of a curve and properties of homogeneous polynomials.
result Exact number of connected components of Hyp(D)Hyp(D) is determined and representatives for each component are provided.

Proves Weinstein's and Arnold's conjectures using contact instantons.

problem Proving Weinstein's and Arnold's conjectures in contact geometry.
method Existence of fundamental class in Legendrian contact instanton cohomology, evaluation transversality, and geometric construction of contactomorphisms.
result Proves Weinstein's and Arnold's conjectures in full generality.

Kolmogorov-Arnold Networks achieve optimal convergence rates in nonparametric regression.

problem Nonparametric function approximation in multivariate settings.
method Structured additive and multiplicative KANs using B-splines.
result Achieve minimax-optimal convergence rate O(n2r/(2r+1))O(n^{-2r/(2r+1)}) for Sobolev space functions.

Kolmogorov-Arnold Networks improve deep learning adaptivity and can approximate Besov functions optimally.

problem Improving deep learning adaptivity and understanding approximation rates.
method Analyzing Besov norms and using Res-KANs for approximation.
result KANs can optimally approximate Besov functions at the optimal rate.

Proposes a new neural network architecture combining MLP and basis functions.

problem Function approximation and operator learning in scientific machine learning.
method Combines robust MLP inner functions with flexible basis functions outer functions.
result KKAN outperforms MLPs and KANs in function approximation and operator learning tasks.

S2KAN integrates symbolic primitives into neural network activations for improved interpretability.

problem Training activations in KANs often lack symbolic fidelity, leading to unintelligible models.
method Softly Symbolified Kolmogorov-Arnold Networks (S2KAN) integrates symbolic primitives into training with learnable gates and a Minimum Description Length objective.
result S2KAN discovers interpretable forms when symbolic terms suffice, gracefully degrading to dense splines when necessary.

A 3D metric conformally related to Arnold cat fast dynamo metric: dsA2=eλzdp2+eλzdq2+dz2{ds_{A}}^{2}=e^{-λz}dp^{2}+e^{λz}dq^{2}+dz^{2} is shown to present a behaviour of non-dynamos where the magnetic field exponentially decay in time. The Riemann-Christoffel connection and Riemann curvature tensor for the Arnold and its conformal counter…

2007-03-14abs ↗pdf ↗

KANEL combines models for early hit enrichment in virtual screening.

problem Assessing model accuracy in chemical bioactivity predictions.
method Ensemble workflow using Kolmogorov-Arnold Networks (KANs) and other models.
result Improves early hit enrichment metrics like PPV@N.

Kolmogorov-Arnold Networks offer interpretable models for energy applications.

problem Lack of interpretability in modern machine learning methods for sensitive industries.
method Symbolic regression with Kolmogorov-Arnold Networks compared to traditional feedforward neural networks.
result Kolmogorov-Arnold Networks yield perfectly interpretable models and learn real, physical relations.

KANs replace fixed MLP weights with learnable edge functions, improving accuracy and interpretability.

problem Lack of interpretability and scalability in MLPs.
method KANs use learnable activation functions on edges instead of fixed weights, replacing weights with spline functions.
result KANs outperform MLPs in accuracy and interpretability with smaller models.

A new KAN variant uses sinusoidal activations to approximate functions.

problem Approximating multivariable functions using neural networks.
method Replacing inner and outer functions in Kolmogorov-Arnold representation with weighted sinusoidal functions.
result The new KAN variant outperforms fixed-frequency Fourier transform and achieves comparable performance to MLPs.

Kolmogorov-Arnold Networks enable ultrafast online learning with fixed-point quantization.

problem Efficient online learning for high-frequency systems with strict memory constraints.
method Fixed-point online training on FPGAs exploiting B-spline locality in KANs.
result Kolmogorov-Arnold Networks are more efficient and expressive than MLPs for low-latency tasks.

We prove conjectures of Rene Thom and Vladimir Arnold for C^2 solutions to the degenerate elliptic equation that is the level set equation for motion by mean curvature. We believe these results are the first instances of a general principle: Solutions of many degenerate equations behave as if they are analytic, even wh…

2017-12-14abs ↗pdf ↗

Presented are two neural network architectures for convex functions, demonstrating competitive performance.

problem Approximating convex functions efficiently and accurately.
method Developed two neural network architectures: one based on linear-by-part representation and the other on cubic splines.
result Cubic ICKAN networks produce results similar to classical ICNNs in solving convex approximation problems.

Recently Arnold's $\St$ and J±J^{\pm} invariants of generic planar curves have been generalized to the case of generic planar wave fronts. We generalize these invariants to the case of wave fronts on an arbitrary surface FF. All invariants satisfying the axioms which naturally generalize the axioms used by Arnold are …

1999-01-28abs ↗pdf ↗