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

81162242323 · Jun 202019922001200920172026
48 results for wavelet random matrices

Algorithm identifies fractal system's scaling exponents in high dimensions.

problem Statistical identification of Hurst distribution in high-dimensional fractal systems.
method Wavelet random matrices, modified spectral clustering, model selection.
result Algorithm consistently estimates Hurst distribution in moderately high dimensions.

A new algorithm for optimizing huge-scale black-box problems with reduced memory usage.

problem Optimizing huge-scale black-box problems with limited vector operations.
method ZO-BCD algorithm for zeroth-order optimization with reduced memory footprint.
result ZO-BCD achieves state-of-the-art adversarial attack success rate of 97.9%.

In this paper we propose and study a family of continuous wavelets on general domains, and a corresponding stochastic discretization that we call Monte Carlo wavelets. First, using tools from the theory of reproducing kernel Hilbert spaces and associated integral operators, we define a family of continuous wavelets by …

2019-03-15abs ↗pdf ↗

Multiresolution Matrix Factorization (MMF) was recently introduced as a method for finding multiscale structure and defining wavelets on graphs/matrices. In this paper we derive pMMF, a parallel algorithm for computing the MMF factorization. Empirically, the running time of pMMF scales linearly in the dimension for spa…

2015-07-15abs ↗pdf ↗

New wavelet frames constructed from reproducing kernels for continuous and discrete domains.

problem Generating wavelet frames on non-Euclidean structures.
method Spectral filtering of integral operators associated with reproducing kernels.
result Discrete frames as Monte Carlo estimates of continuous frames, with finite-sample rates derived.

In recent years, a rapidly growing literature has focussed on the construction of wavelet systems to analyze functions defined on the sphere. Our purpose in this paper is to generalize these constructions to situations where sections of line bundles, rather than ordinary scalar-valued functions, are considered. In part…

2008-11-18abs ↗pdf ↗

We describe new results and algorithms for two different, but related, problems which deal with circulant matrices: learning shift-invariant components from training data and calculating the shift (or alignment) between two given signals. In the first instance, we deal with the shift-invariant dictionary learning probl…

2018-12-03abs ↗pdf ↗

Multiresolution Matrix Factorization (MMF) was recently introduced as an alternative to the dominant low-rank paradigm in order to capture structure in matrices at multiple different scales. Using ideas from multiresolution analysis (MRA), MMF teased out hierarchical structure in symmetric matrices by constructing a se…

2019-10-10abs ↗pdf ↗

Study on random matrices in deep neural networks with IID entries.

problem Distribution of singular values in product of random matrices for deep neural networks.
method Random matrix theory with a streamlined approach for non-Gaussian data.
result Generalization of macroscopic universality property to non-Gaussian data.

The paper deals with distribution of singular values of product of random matrices arising in the analysis of deep neural networks. The matrices resemble the product analogs of the sample covariance matrices, however, an important difference is that the population covariance matrices, which are assumed to be non-random…

2020-01-17abs ↗pdf ↗

We apply a recently developed wavelet based approach to characterize the correlation and scaling properties of non-stationary financial time series. This approach is local in nature and it makes use of wavelets from the Daubechies family for detrending purpose. The built-in variable windows in wavelet transform makes t…

2006-01-31abs ↗pdf ↗

Glioma grading before surgery is very critical for the prognosis prediction and treatment plan making. We present a novel wavelet scattering-based radiomic method to predict noninvasively and accurately the glioma grades. The method consists of wavelet scattering feature extraction, dimensionality reduction, and glioma…

2019-05-23abs ↗pdf ↗

New method denoises graph signals using wavelets, scalable for large graphs.

problem Denoising graph signals with overcomplete tight frames and correlated noise.
method Data-driven wavelet tight frame, Stein's unbiased risk estimate, Chebyshev-Jackson polynomial approximations, Monte-Carlo strategy.
result Method scales to large graphs and finds applications in differential privacy.

Paper combines geometry and time-series analysis for spatiotemporal data.

problem Multivariate time-series data from multiple sensors.
method Combines manifold learning, Riemannian geometry, and spectral analysis.
result Proposes Riemannian multi-resolution analysis (RMRA) for dynamic mode extraction.

Paper introduces rational Gaussian wavelets for efficient signal approximation.

problem Efficiently approximating complex signals with few coefficients.
method Continuous wavelet transform using rational Gaussian wavelets with adjustable parameters.
result Proposed rational Gaussian wavelets provide accurate signal approximations.

Random feature matrices' singular values concentrate near their full expectation in high dimensions.

problem Characterizing the spectra of random feature matrices for regression problems.
method Analyzing two settings of input variables (random or well-separated) with conditions on dimension, complexity ratio, and sampling variance.
result The singular values of random feature matrices concentrate near their full expectation and near one with high probability.

In this work we propose a method for learning wavelet filters directly from data. We accomplish this by framing the discrete wavelet transform as a modified convolutional neural network. We introduce an autoencoder wavelet transform network that is trained using gradient descent. We show that the model is capable of le…

2018-02-08abs ↗pdf ↗

The wavelet transform has seen success when incorporated into neural network architectures, such as in wavelet scattering networks. More recently, it has been shown that the dual-tree complex wavelet transform can provide better representations than the standard transform. With this in mind, we extend our previous meth…

2018-06-04abs ↗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.

Complex systems are typically represented by large ensembles of observations. Correlation matrices provide an efficient formal framework to extract information from such multivariate ensembles and identify in a quantifiable way patterns of activity that are reproducible with statistically significant frequency compared…

2011-06-02abs ↗pdf ↗

This paper proposes the use of wavelet methods to estimate U.S. core inflation. It explains wavelet methods and suggests they are ideally suited to this task. Comparisons are made with traditional CPI-based and regression-based measures for their performance in following trend inflation and predicting future inflation.…

2011-03-29abs ↗pdf ↗

WaveLSFormer learns profitable trading policies from financial time series data.

problem Challenges in learning profitable intraday trading policies from financial time series data.
method WaveLSFormer uses a learnable wavelet-based long-short Transformer to jointly perform multi-scale decomposition and return-oriented decision learning.
result WaveLSFormer consistently outperforms MLP, LSTM, and Transformer backbones in trading performance.

Random projections help in representing sparse graphs efficiently.

problem Efficiently representing sparse graphs of varying sizes and vertex sets.
method Random projection of adjacency matrices to retain graph functionality and properties.
result Random projections can accurately represent graphs of different sizes and vertex sets in the same space.

Paper develops new method for detecting latent structure in large symmetric data matrices.

problem Testing for latent structure in large symmetric data matrices.
method Introduces Wilcoxon--Wigner random matrices based on normalized rank statistics.
result Establishes asymptotic Gaussian fluctuations for leading eigenvalue and eigenvector of Wilcoxon--Wigner matrices.

It is the main goal of this article to address the bipartite ranking issue from the perspective of functional data analysis (FDA). Given a training set of independent realizations of a (possibly sampled) second-order random function with a (locally) smooth autocorrelation structure and to which a binary label is random…

2013-12-18abs ↗pdf ↗

Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.

problem Graph classification with geometric properties encoded in persistence diagrams.
method Optimizes spectral wavelets for graph datasets to capture best-suited features for classification.
result Competitive performance in graph classification problems compared to other persistence-based architectures.

Improved texture synthesis using wavelet-based statistics with rectifier non-linearity.

problem Improving texture synthesis quality using wavelet representations.
method Proposes a family of statistics based on non-linear wavelet representations with a generalized rectifier non-linearity.
result Significantly improves visual quality of texture synthesis compared to classical wavelet-based 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 …

2019-04-12abs ↗pdf ↗