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.
A fast method learns plasma collision kernels from simulations, improving kinetic models.
We accelerate the power method for strong low-rank approximation using fast sketching.
A robust method for decomposing spectral peaks robust to distortion and interference.
A fast, robust AMP algorithm for quadratic optimization problems.
PRISMA uses PDE residuals for fast, robust, and accurate inference.
Essential principal components simplify spectral analysis with minimal training data.
A new method speeds up spectral normalization for neural nets.
Using spectral decomposition techniques and singular perturbation theory, we develop a systematic method to approximate the prices of a variety of options in a fast mean-reverting stochastic volatility setting. Four examples are provided in order to demonstrate the versatility of our method. These include: European opt…
A fast spectral algorithm detects community structure in evolving graphs.
Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to reuse information of past cluster assignments to expedite computation. Our approach builds on a recent idea of sidestepping the main bottleneck of spectral clusterin…
This paper speeds up SVC clustering by compressing data while preserving key properties.
A fast graph embedding method for large graphs.
Improved graph-based multiclass classification for multilayer data.
Fast simulates Volterra processes using RFF, focusing on S-fBM.
Efficiently approximates statistical leverage scores for faster KRR.
A large class of machine learning techniques requires the solution of optimization problems involving spectral functions of parametric matrices, e.g. log-determinant and nuclear norm. Unfortunately, computing the gradient of a spectral function is generally of cubic complexity, as such gradient descent methods are rath…
Spectral methods predict long-term signals from linear and nonlinear systems.
New method shows stochastic momentum can converge quickly on optimization problems.
We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy. Our algorithms can decompose a 4-tensor with -dimensional orthonormal components in the…
Hidden Markov Models (HMMs) can be accurately approximated using co-occurrence frequencies of pairs and triples of observations by using a fast spectral method in contrast to the usual slow methods like EM or Gibbs sampling. We provide a new spectral method which significantly reduces the number of model parameters tha…
SpGAT learns graph representations using spectral attention for efficiency.
Kernel methods have great promise for learning rich statistical representations of large modern datasets. However, compared to neural networks, kernel methods have been perceived as lacking in scalability and flexibility. We introduce a family of fast, flexible, lightly parametrized and general purpose kernel learning …
Kernel methods obtain superb performance in terms of accuracy for various machine learning tasks since they can effectively extract nonlinear relations. However, their time complexity can be rather large especially for clustering tasks. In this paper we define a general class of kernels that can be easily approximated …
We study the problem of approximating orthogonal matrices so that their application is numerically fast and yet accurate. We find an approximation by solving an optimization problem over a set of structured matrices, that we call extended orthogonal Givens transformations, including Givens rotations as a special case. …
Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary instance of SNMF provides superior clustering quality compared to many classic cluste…
MSTs provide a fast and meaningful clustering method in low-dimensional data.
Community detection is a fundamental problem in network analysis with many methods available to estimate communities. Most of these methods assume that the number of communities is known, which is often not the case in practice. We study a simple and very fast method for estimating the number of communities based on th…
Spectral method speeds fitting of binary time series models.
We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained …
FAST selects coresets more efficiently by matching distributions in the frequency domain.
Stochastic neighbor embedding (SNE) and related nonlinear manifold learning algorithms achieve high-quality low-dimensional representations of similarity data, but are notoriously slow to train. We propose a generic formulation of embedding algorithms that includes SNE and other existing algorithms, and study their rel…
In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or words' embedding, represented by graphs. We present a formulation o…
We show how spectral filters can improve the convergence of numerical schemes which use discrete Hilbert transforms based on a sinc function expansion, and thus ultimately on the fast Fourier transform. This is relevant, for example, for the computation of fluctuation identities, which give the distribution of the maxi…
We consider the problem of clustering with the longest-leg path distance (LLPD) metric, which is informative for elongated and irregularly shaped clusters. We prove finite-sample guarantees on the performance of clustering with respect to this metric when random samples are drawn from multiple intrinsically low-dimensi…
We propose a new method to model multi-way similarities into hypergraphs for clustering.
We propose a novel spectral convolutional neural network (CNN) model on graph structured data, namely Distributed Feedback-Looped Networks (DFNets). This model is incorporated with a robust class of spectral graph filters, called feedback-looped filters, to provide better localization on vertices, while still attaining…
New method predicts neural network performance using free probability theory.
A new topology improves decentralized learning efficiency and accuracy.
This paper proposes a spectral clustering algorithm for hyperbolic spaces, improving efficiency over Euclidean methods.
The paper explores efficient graph algorithms on geometric graphs and their computational limits.
DOODL learns shared spectral dynamics across related dynamical systems.
This paper describes a versatile method that accelerates multichannel source separation methods based on full-rank spatial modeling. A popular approach to multichannel source separation is to integrate a spatial model with a source model for estimating the spatial covariance matrices (SCMs) and power spectral densities…
New optimizer SF-NorMuon matches tuned AdamW across various horizons.
Spectral clustering is a fast and popular algorithm for finding clusters in networks. Recently, Chaudhuri et al. (2012) and Amini et al.(2012) proposed inspired variations on the algorithm that artificially inflate the node degrees for improved statistical performance. The current paper extends the previous statistical…
A new method uses matrix sketches for efficient graph clustering in dynamic environments.
FastGAT reduces GNN computation time by 10x using graph sparsification.
Many algorithms have been proposed for fitting network models with communities, but most of them do not scale well to large networks, and often fail on sparse networks. Here we propose a new fast pseudo-likelihood method for fitting the stochastic block model for networks, as well as a variant that allows for an arbitr…
We present a simple and fast geometric method for modeling data by a union of affine subspaces. The method begins by forming a collection of local best-fit affine subspaces, i.e., subspaces approximating the data in local neighborhoods. The correct sizes of the local neighborhoods are determined automatically by the Jo…