arXiv:2608.29362v1 Announce Type: cross Abstract: Sparse computations are fundamental to scientific computing, graph analytics, and machine learning, yet their performance is highly sensitive to the...
The paper introduces a geometry‑aware graph construction method that adaptively selects Gaussian kernel bandwidths per node to align the kernel’s spectral complexity with the intrinsic dimensionality of the underlying manifold. By matching the kernel’s effective rank to a local intrinsic dimension estimate derived from a minimum spanning tree, the method operates within a manifold‑consistent log‑log scaling regime. Experiments on CIFAR‑100 demonstrate that this adaptive bandwidth approach consistently improves leave‑one‑out classification and label propagation accuracy compared to fixed‑bandwidth and other adaptive techniques.
arXiv:2608. 08704v1 Announce Type: cross Abstract: Kernel spectral clustering with a single bandwidth can be inadequate for data exhibiting multiple characteristic pairwise-distance scales, a problem particularly prevalent in the high-dimensional regime.
arXiv:2609.14105v1 Announce Type: new Abstract: Heat Kernel Textures (HKTex) represent surface appearance with intrinsic anisotropic kernels, but evaluate them using 50 global Laplace-Beltrami eige...
arXiv:2512. 06143v2 Announce Type: replace Abstract: Despite a large corpus of recent work on scaling up Gaussian processes, a stubborn trade-off between computational speed, prediction and uncertainty quantification accuracy, and customizability persists.
arXiv:2608.29892v1 Announce Type: new Abstract: Learning solution operators for partial differential equations (PDEs) on irregular and geometry-dependent domains remains a central challenge in scient...
The paper introduces Spectrally Optimised Neural Discretisations (SpeND), a mesh‑free framework that learns discretisation weights from local stencil geometry on unstructured point clouds. By embedding discrete moment conditions into the network architecture, SpeND guarantees polynomial consistency and allows the weights to be optimised for spectral accuracy over a chosen wavenumber band, using an unsupervised Fourier‑mode loss. The resulting operators are PDE‑agnostic, perform well on Poisson, Burgers, and Navier–Stokes equations, and can reduce wall‑clock time by 3–20× compared to existing mesh‑free methods at the same accuracy.
arXiv:2601. 17090v2 Announce Type: replace-cross Abstract: Partial differential equations (PDEs) govern complex systems, yet neural operators often struggle to efficiently capture the long-range, nonlocal interactions inherent in their solution maps.
arXiv:2607. 13566v1 Announce Type: cross Abstract: For low-dimensional problems ($d\leq3$), spectral methods can achieve exceptionally high accuracy.
arXiv:2607. 19387v1 Announce Type: cross Abstract: Surrogate modeling for high-dimensional nonlinear dynamical systems that exhibit chaos requires mechanisms that preserve not only pointwise accuracy but also the scale-dependent structure of physical fields.
arXiv:2607. 06644v1 Announce Type: cross Abstract: Determinantal point processes have recently emerged as a kernel-based alternative to standard independent sampling for constructing efficient minibatches, coresets, and other compact representations of large-scale datasets.
arXiv:2606. 16990v1 Announce Type: new Abstract: While persistent Laplacians (PL) offer a richer geometric representation of data than persistent homology, utilizing their full eigenspectrum for learning tasks is often hampered by high dimensionality and the ``varying length'' problem across different filtration scales.