We analyze the frequency spectrum of quantum neural networks using algebraic methods and prove maximality results.
problem Understanding the frequency spectrum and maximality properties of quantum neural networks.
method Using Minkowski sums and algebraic descriptions, we prove maximality results for QNN architectures.
result We establish spectral invariance under area-preserving transformations, showing the frequency spectrum depends only on the area A=RL. FreSh shifts model's initial frequency spectrum to match target signal, improving neural representation performance.
problem MLPs' low-frequency bias limits capturing high-frequency details accurately.
method FreSh selects embedding hyperparameters to align model's initial output spectrum with target signal's spectrum.
result FreSh improves performance across various neural representation methods and tasks with minimal computational overhead.
Recently, sparsity-based algorithms are proposed for super-resolution spectrum estimation. However, to achieve adequately high resolution in real-world signal analysis, the dictionary atoms have to be close to each other in frequency, thereby resulting in a coherent design. The popular convex compressed sensing methods…
Muon outperforms GD in associative memory learning by balancing frequency components.
problem Training dynamics and scaling behavior of Muon in associative memory learning.
method Study of Muon in a linear associative memory model with softmax retrieval and hierarchical frequency spectrum over query-answer pairs.
result Muon achieves exponential speedup over GD in noiseless case and superior scaling efficiency in noisy case.
Study cryptocurrency price dynamics using adaptive EMD and spectral analysis.
problem Analyze the time-varying volatility of cryptocurrency prices.
method Adaptive complementary ensemble empirical mode decomposition (ACE-EMD) and Hilbert spectral analysis.
result Reveal the properties of various timescales in cryptocurrency price dynamics.
Ultra-wideband (UWB) radar systems nowadays typical operate in the low frequency spectrum to achieve penetration capability. However, this spectrum is also shared by many others communication systems, which causes missing information in the frequency bands. To recover this missing spectral information, we propose a gen…
Convolutional GANs favor low spatial frequencies, affecting fine detail generation.
problem Understanding GANs' limitations in high spatial frequency learning.
method Proposed method to manipulate GANs' bias against high spatial frequencies.
result Convolutional GANs have a bias against learning high spatial frequencies.
A robust method for decomposing spectral peaks robust to distortion and interference.
problem Decomposing spectral peaks in the presence of distortion and interference.
method Optimizing a nonparametric approach using pseudo-symmetric functions with nonincreasing behavior.
result Decomposed spectral peaks show pseudo-orthogonal behavior and power preserving equality.
This article develops a statistical test for the null hypothesis of strict stationarity of a discrete time stochastic process in the frequency domain. When the null hypothesis is true, the second order cumulant spectrum is zero at all the discrete Fourier frequency pairs in the principal domain. The test uses a window …
We develop the scattering theory of general conformally compact metrics. For low frequencies, the domain of the scattering matrix is shown to be frequency dependent. In particular, generalized eigenfunctions exhibit L^2 decay in directions where the asymptotic curvature is sufficiently negative. The scattering matrix i…
Advancements in deep generative models such as generative adversarial networks and variational autoencoders have resulted in the ability to generate realistic images that are visually indistinguishable from real images, which raises concerns about their potential malicious usage. In this paper, we present an analysis o…
A new spectrum attention mechanism improves time series classification.
problem Improving robustness and classification accuracy in time series classification.
method Proposes a spectrum attention mechanism (SAM) to filter and highlight important frequency components, using L1 regularization and a tumbling window for segmentation.
result Experimental results show that the proposed SSAM method produces better feature representations and improves classification accuracy.
Quantum models can approximate any function if data encoding allows for a rich enough frequency spectrum.
problem Theoretical properties of quantum machine learning models, particularly their expressive power.
method Investigated how data encoding affects the expressive power of parametrized quantum circuits.
result Quantum models can access increasingly rich frequency spectra by repeating data encoding gates, potentially making them universal function approximators.
Empirical study compares finite- and infinite-width BNNs, revealing performance differences under model mismatch.
problem Comparing BNNs with different widths due to conflicting model properties and inference intractability.
method Empirical comparison of finite- and infinite-width BNNs, analyzing performance under model mismatch.
result Increasing width can hurt BNN performance when the model is mis-specified, and finite-width BNNs generalize better under model mismatch.
Proposes a novel graph signal model using narrowband kernels.
problem Graph signals with multiple concentrated frequency regions.
method Jointly learns graph signal model parameters and coefficients.
result Joint learning improves signal interpolation accuracy.
The log-periodic power law (LPPL) is a model of asset prices during endogenous bubbles. A major open issue is to verify the presence of LPPL in price sequences and to estimate the LPPL parameters. Estimation is complicated by the fact that daily LPPL returns are typically orders of magnitude smaller than measured price…
Random SNNs are stable and simple, with low-frequency Fourier spectra.
problem Stability and robustness of spiking neural networks.
method Boolean function analysis and Fourier spectrum concentration.
result Random LIF-SNNs are stable and biased towards simple functions.
The convolutional layers are core building blocks of neural network architectures. In general, a convolutional filter applies to the entire frequency spectrum of the input data. We explore artificially constraining the frequency spectra of these filters and data, called band-limiting, during training. The frequency dom…
A common assumption in semi-supervised learning with graph models is that the class label function varies smoothly on the data graph, resulting in the rather strict prior that the label function has low-frequency content. Meanwhile, in many classification problems, the label function may vary abruptly in certain graph …
We consider stochastic point processes generating time series exhibiting power laws of spectrum and distribution density (Phys. Rev. E 71, 051105 (2005)) and apply them for modeling the trading activity in the financial markets and for the frequencies of word occurrences in the language.
Standard sparse pseudo-input approximations to the Gaussian process (GP) cannot handle complex functions well. Sparse spectrum alternatives attempt to answer this but are known to over-fit. We suggest the use of variational inference for the sparse spectrum approximation to avoid both issues. We model the covariance fu…
Spectrum sensing is of critical importance in any cognitive radio system. When the primary user's signal has uncertain parameters, the likelihood ratio test, which is the theoretically optimal detector, generally has no closed-form expression. As a result, spectrum sensing under parameter uncertainty remains an open qu…
While much research effort has been dedicated to scaling up sparse Gaussian process (GP) models based on inducing variables for big data, little attention is afforded to the other less explored class of low-rank GP approximations that exploit the sparse spectral representation of a GP kernel. This paper presents such a…
FreDN separates trends and periodicities in non-stationary time series forecasts.
problem Spectral entanglement and computational burden in frequency-domain methods for non-stationary time series.
method FreDN introduces a learnable Frequency Disentangler module to separate trend and periodic components directly in the frequency domain, and uses a ReIm Block to reduce complexity.
result FreDN outperforms state-of-the-art methods by up to 10% on long-term forecasting benchmarks.
A simple analytically solvable model exhibiting a 1/f spectrum in an arbitrarily wide frequency range was recently proposed by Kaulakys and Meskauskas (KM). Signals consisting of a sequence of pulses show that inherent origin of the 1/f noise is Brownian fluctuations of the average intervent time between subsequent pul…
We study the spectral properties of curl, a linear differential operator of first order acting on differential forms of appropriate degree on an odd-dimensional closed oriented Riemannian manifold. In three dimensions its eigenvalues are the electromagnetic oscillation frequencies in vacuum without external sources. In…
For a bounded domain Ω⊂Rn with smooth boundary, we explicitly calculate the first two coefficients of the asymptotic expansion of the trace of the strongly continuous semigroup associated with the Navier-Lamé operator on Ω as t→0+. These coefficients (i.e., spectral invariants) provide precise …
We uniquely and explicitly reconstruct the instantaneous intrinsic metric of the Kerr-Newman Event Horizon from the spectrum of its Laplacian. In the process we find that the angular momentum parameter, radius, area; and in the uncharged case, mass, can be written in terms of these eigenvalues. In the uncharged case th…
We analyze the structure of the \emph{frequency space} Q(F) of a nonabelian free group F=F(a1,...,ak) consisting of all shift-invariant Borel probability measures on ∂F and construct a natural action of Out(F) on Q(F). In particular we prove that for any outer automorphism φ of F the \emph{conju…
FreST Loss decorrelates spatio-temporal dependencies in graph signals.
problem Complex spatio-temporal dependencies in graph-structured signals are not well captured by standard forecasting models.
method FreST Loss extends supervision to the joint spatio-temporal spectrum using Joint Fourier Transform (JFT).
result FreST Loss reduces estimation bias and improves forecasting accuracy on real-world datasets.
Improved speech enhancement with MNTFA using time-frequency attention.
problem Speech enhancement with limited model size and memory.
method Designing MNTFA with self-attention modules for long sequences and joint training.
result MNTFA achieves better performance with fewer parameters than DPCRN.
Financial frequency combs emerge from macroeconomic long-range memory.
problem Financial economy's long-run cyclic structure
method Incommensurate fractional-order financial model
result Frequency comb structure in steady-state spectrum
We present techniques for effective Gaussian process (GP) modelling of multiple short time series. These problems are common when applying GP models independently to each gene in a gene expression time series data set. Such sets typically contain very few time points. Naive application of common GP modelling techniques…
In high frequency financial data not only returns but also waiting times between trades are random variables. In this work, we analyze the spectra of the waiting-time processes for tick-by-tick trades. The numerical problem, strictly related with the real inversion of Laplace transforms, is analyzed by using Tikhonov's…
This study investigates that a characteristic time scale on an exchange rate market (USD/JPY) is examined for the period of 1998 to 2000. Calculating power spectrum densities for the number of tick quotes per minute and averaging them over the year yield that the mean power spectrum density has a peak at high frequenci…
Study uses machine learning to predict high-frequency trading liquidity.
problem Predicting minute-level price movements in high-frequency trading markets.
method Advanced machine learning techniques (Logistic Regression, SVM, Random Forest) applied to liquidity metrics.
result Random Forest algorithm shows superior accuracy in predicting price movements.
We study the properties of memory of a financial time series adopting two different methods of analysis, the detrended fluctuation analysis (DFA) and the analysis of the power spectrum (PSA). The methods are applied on three time series: one of high-frequency returns, one of shuffled returns and one of absolute values …
This study proposes a fully convolutional network (FCN) model for raw waveform-based speech enhancement. The proposed system performs speech enhancement in an end-to-end (i.e., waveform-in and waveform-out) manner, which dif-fers from most existing denoising methods that process the magnitude spectrum (e.g., log power …
Deep neural networks can generalize by reducing high-frequency noise over time, not always following a monotonic learning bias.
problem Understanding the learning dynamics and generalization of over-parameterized DNNs.
method Experimental analysis of deep double descent, focusing on the spectral bias of DNNs.
result The high-frequency components of DNNs diminish over training, leading to a second descent in test error.
We propose a novel sparse spectrum approximation of Gaussian process (GP) tailored for Bayesian optimization. Whilst the current sparse spectrum methods provide desired approximations for regression problems, it is observed that this particular form of sparse approximations generates an overconfident GP, i.e. it produc…
In this paper we will try to assess the multifractality displayed by the high-frequency returns of Madrid's Stock Exchange IBEX35 index. A Multifractal Detrended Fluctuation Analysis shows that this index has a wide singularity spectrum which is most likely caused by its long memory. Our findings also show that this lo…
Improves Bayesian optimization efficiency for mixed variable spaces.
problem Boosting sample efficiency in Bayesian optimization for mixed variable spaces.
method Proposes frequency modulated (FM) kernels to model complex dependencies across different types of variables.
result BO-FM outperforms competitors in various optimization problems.
Study improves Hayashi-Yoshida estimator for high-dimensional stock covolatility.
problem Inconsistent performance of Hayashi-Yoshida estimator in high dimensions.
method Analyzed the limiting spectral distribution of the Hayashi-Yoshida estimator.
result Established the connection between the estimator's spectrum and the true covariance matrix in high dimensions.
In this paper, we study the adversarial attack and defence problem in deep learning from the perspective of Fourier analysis. We first explicitly compute the Fourier transform of deep ReLU neural networks and show that there exist decaying but non-zero high frequency components in the Fourier spectrum of neural network…
Multifractal analysis is one of the important approaches that enables us to measure the complexity of various data via the scaling properties. We compare the most common techniques used for multifractal exponents estimation from both theoretical and practical point of view. Particularly, we discuss the methods based on…
The cross correlation matrix between equities comprises multiple interactions between traders with varying strategies and time horizons. In this paper, we use the Maximum Overlap Discrete Wavelet Transform to calculate correlation matrices over different timescales and then explore the eigenvalue spectrum over sliding …
I propose a frequency domain adaptation of the Expectation Maximization (EM) algorithm to group a family of time series in classes of similar dynamic structure. It does this by viewing the magnitude of the discrete Fourier transform (DFT) of each signal (or power spectrum) as a probability density/mass function (pdf/pm…
A new method for unfolding histograms without matrix inversion.
problem Matrix inversion in experimental physics, especially in high-energy particle physics.
method Sampling many distributions, folding them through the response matrix, and choosing the closest one to the data.
result Performs as well as traditional methods in well-defined inverse problems and outperforms them in ill-defined ones.