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

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for Kan simplicial manifolds

Geometric models for representations up to homotopy using simplicial vector bundles.

problem Geometric models for representations up to homotopy of Lie groupoids.
method Application of higher analogs of cleavages in simplicial fibrations to geometric models.
result An equivalence between representations up to homotopy and simplicial vector bundles endowed with a cleavage.

In this thesis, we employ simplicial methods to study actions, principal bundles, and bibundles of higher groupoids. Roughly, we use Kan fibrations to model actions of higher groupoids, we use pairs of a Kan fibration and a special acyclic fibration to model principal bundles of higher groupoids, we use inner Kan fibra…

2015-12-14abs ↗pdf ↗

Let YY be a CW-complex with a single 0-cell, let KK be its Kan group, a free simplicial group whose realization is a model for the space ΩYΩY of based loops on YY, and let GG be a Lie group, not necessarily connected. By means of simplicial techniques involving fundamental results of {\smc Kan's} and the standard $…

1995-05-23abs ↗pdf ↗

A semisimplicial set has face maps but not degeneracies. A basic fact, due to Rourke and Sanderson, is that a semisimplicial set satisfying the Kan condition can be given a simplicial structure. The present paper gives a combinatorial proof of this fact and a generalization to multisemisimplicial sets.

2012-10-20abs ↗pdf ↗

Given an n-term L-infinity algebra L, we construct a Kan simplicial manifold which we think of as the 'Lie n-group' integrating L. This extends work of Getzler math.AT/0404003 . In the case of an ordinary Lie algebra, our construction gives the simplicial classifying space of the corresponding simply connect Lie group.…

2006-03-23abs ↗pdf ↗

Geometrically solves differentiating simplicial manifolds.

problem Differentiating simplicial manifolds.
method Establishes a normal form theorem, identifies a differentiating ideal, proves quotient semi-freeness, interprets as Chevalley-Eilenberg algebra of higher Lie algebroid.
result Introduces higher van Est map and proves van Est isomorphism theorem.

We consider the problem of integration of L_\infty-algebroids (differential graded manifolds) to L_\infty-groupoids. We first construct a "big" Kan simplicial manifold (Fréchet or Banach) whose points are solutions of a (generalized) Maurer-Cartan equation. The main analytic trick in our work is an integral transformat…

2015-06-16abs ↗pdf ↗

We describe an AA_\infty-quasi-equivalence of dg-categories between the first authors' PA\mathcal{P}_{\mathcal{A}} ---the category of category of prefect A0A^0-modules with flat Z\Z-connection, corresponding to the de Rham dga A\mathcal{A} of a compact manifold MM--- and the dg-category of \emph{infinity-local syst…

2009-08-20abs ↗pdf ↗

The Deligne groupoid is a functor from nilpotent differential graded Lie algebras concentrated in positive degrees to groupoids; in the special case of Lie algebras over a field of characteristic zero, it gives the associated simply connected Lie group. We generalize the Deligne groupoid to a functor gamma from L-infin…

2004-04-01abs ↗pdf ↗

Unified framework for observables in n-plectic geometry.

problem Quantization of extended objects in higher geometric contexts.
method Develops a semi-simplicial set model for observables, using a Grassmann variable to encode submanifold codimensions.
result Establishes a categorified pre-n-Hilbert space and a quantization scheme matching multisymplectic geometry.

Constructs a universal Chern-Weil map for infinite dimensional Lie groups.

problem Universal Chern-Weil map for infinite dimensional Lie groups.
method Introduces smooth simplicial sets and constructs a new classifying space as a smooth Kan complex.
result Verifies a conjecture of Reznikov for compactly generated Hamiltonian symplectomorphisms.

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.

SVGP KAN integrates sparse variational GP with KANs for scalable probabilistic inference.

problem Lack of probabilistic outputs in standard KANs and cubic scaling of Gaussian Process methods.
method Sparse Variational GP-KAN combines KAN topology with sparse variational inference and permutation-based importance analysis.
result Enables probabilistic KANs to handle larger datasets with linear computational complexity.

Wav-KAN improves neural network interpretability and performance.

problem Challenges in interpretability, training speed, robustness, and performance of traditional neural networks.
method Integrates wavelet functions into the Kolmogorov-Arnold network structure for efficient data representation.
result Enhanced accuracy, faster training speeds, and increased robustness compared to existing methods.

Smooth KANs improve model reliability in computational biomedicine.

problem Limited convergence of KANs in representing generic smooth functions.
method Introducing smooth, structurally informed KANs that can approximate MLPs in specific function classes.
result Smooth KANs can achieve equivalence to MLPs in specific function classes, enhancing model reliability and performance.

Adaptive RBF-KAN improves KANs by dynamically adjusting kernel parameters.

problem Efficiently approximating multivariate functions using learnable univariate edge functions.
method Integrates LOOCV-based kernel scale estimation with adaptive kernel learning.
result Adaptive RBF-KAN outperforms fixed kernel KANs on various benchmark functions.

Temporal Functional Circuits explain KAN forecasts with interpretable edge functions.

problem Lack of mechanistic explanations in KAN forecasting.
method Transform KAN edge functions into faithful, temporally grounded explanations using a gated residual KAN.
result Gated KAN achieves lower MSE than linear-only models on regime-switching signals.

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.

DKL-KAN combines deep learning and kernel methods for scalable, expressive models.

problem Combining deep learning's depth with kernel methods' flexibility for scalable models.
method DKL-KAN uses Kolmogorov-Arnold Networks (KAN) to optimize kernel attributes within a Gaussian process framework.
result DKL-KAN outperforms DKL-MLP on datasets with a low number of observations and DKL-MLP on large datasets.

Curvature penalties improve interpretability of KANs without sacrificing accuracy.

problem Pathologically high-curvature oscillations in KANs activations make them hard to interpret.
method Derived a curvature penalty and proved an upper bound on model curvature.
result KANs with curvature penalties achieve substantially smoother activations while maintaining accuracy.

Bayesian KANs achieve near-minimax posterior contraction rates in anisotropic Besov spaces.

problem Statistical foundation for Bayesian Kolmogorov-Arnold networks in anisotropic Besov spaces.
method Sparse Bayesian KANs with spike-and-slab priors, hyperprior on model size, and approximation complexity bounds.
result Posterior contraction rates depend on intrinsic anisotropic smoothness and effective dimension of the compositional structure.

HaKAN uses Hahn-KAN blocks to forecast multivariate time series.

problem Long-term time series forecasting challenges with high complexity and spectral bias.
method HaKAN integrates channel independence, patching, and a stack of Hahn-KAN blocks with residual connections. It uses Hahn polynomial-based learnable activation functions.
result HaKAN consistently outperforms state-of-the-art methods on various forecasting benchmarks.

KAN-PCA improves asset return analysis by capturing more variance than classical PCA during market crises.

problem Inefficient classical PCA during market crises when correlations between assets change dramatically.
method KAN-PCA uses KAN (Kolmogorov-Arnold Networks) with B-spline functions to learn nonlinear projections.
result KAN-PCA achieves a higher reconstruction R^2 (66.57%) compared to classical PCA (62.99%) on 20 S&P 500 stocks.

This study compares MLPs and KANs in low-data regimes, finding MLPs with personalized activation functions outperform KANs.

problem Comparing MLPs and KANs in low-data regimes.
method Introduced an effective technique for designing MLPs with unique, parameterized activation functions for each neuron.
result MLPs with personalized activation functions achieve significantly higher predictive accuracy with only a modest increase in parameters, especially in low-data regimes.

GP-KAN uses Gaussian Processes in KANs for robust, parameter-efficient non-linear modeling.

problem Non-linear modeling with limited parameters and uncertainty estimates.
method Integrates Gaussian Processes into Kolmogorov Arnold Networks (KANs) for robust non-linear modeling.
result GP-KAN achieves 98.5% accuracy on MNIST with 80k parameters compared to 1.5M for state-of-the-art models.

Integral foliated simplicial volume is a version of simplicial volume combining the rigidity of integral coefficients with the flexibility of measure spaces. In this article, using the language of measure equivalence of groups we prove a proportionality principle for integral foliated simplicial volume for aspherical m…

2014-03-18abs ↗pdf ↗

We define the ideal simplicial volume for compact manifolds with boundary. Roughly speaking, the ideal simplicial volume of a manifold MM measures the minimal size of possibly ideal triangulations of MM "with real coefficients", thus providing a variation of the ordinary simplicial volume defined by Gromov in 1982, t…

2018-02-14abs ↗pdf ↗

Wavelet Kolmogorov-Arnold Networks improve federated learning performance.

problem Improving performance in federated learning with heterogeneous data.
method Implemented Wav-KAN with CWT and DWT for multiresolution capability, integrating wavelet-based activation functions.
result Significant improvements in computational efficiency, robustness, and accuracy in federated learning.

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.

We consider the relation between simplicial volume and two of its variants: the stable integral simplicial volume and the integral foliated simplicial volume. The definition of the latter depends on a choice of a measure preserving action of the fundamental group on a probability space. We show that integral foliated s…

2015-06-18abs ↗pdf ↗

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.

Enhances KANs for accuracy and interpretability with multi-exit architecture.

problem Unclear optimal depth for KANs and difficulty in optimization and interpretation.
method Introduces multi-exit KANs with each layer having its own prediction branch.
result Multi-exit KANs outperform single-exit versions on various datasets.