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

20406080 · Nov 201919922001200920172026
48 results for filtered spectrum

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.

Proposes a Gaussian process for graph signals using adaptive spectral kernels.

problem Predicting signals on graph nodes with various structures.
method Spectral kernel learning approach that incorporates a polynomial function in the graph spectral domain.
result The model accurately recovers ground truth spectral filters and outperforms in real-world graph data.

New method filters large networks from financial data to reveal key subnetworks.

problem Filtering large dimensional networks to isolate key constituents.
method Exploits spectral properties of high-dimensional data networks, tuning for sparsity and consistency.
result Shows method can interpolate between zero and maximal filtering, preserving spectral properties.

The proliferation of fake news and filter bubbles makes it increasingly difficult to form an unbiased, balanced opinion towards a topic. To ameliorate this, we propose 360° Stance Detection, a tool that aggregates news with multiple perspectives on a topic. It presents them on a spectrum ranging from support to opposit…

2018-04-03abs ↗pdf ↗

Kalman Filters are one of the most influential models of time-varying phenomena. They admit an intuitive probabilistic interpretation, have a simple functional form, and enjoy widespread adoption in a variety of disciplines. Motivated by recent variational methods for learning deep generative models, we introduce a uni…

2015-11-16abs ↗pdf ↗

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…

2019-11-21abs ↗pdf ↗

Graph classification improved using spectral features and wavelet filters.

problem Categorizing graphs based on their structure and node attributes.
method Derived spectral features from graph signal processing, designed two Gaussian process models: one simple and one sophisticated.
result Simple and sophisticated Gaussian process models yield competitive performance, including well-calibrated uncertainty estimates.

In this work we study the non-parametric reconstruction of spatio-temporal dynamical Gaussian processes (GPs) via GP regression from sparse and noisy data. GPs have been mainly applied to spatial regression where they represent one of the most powerful estimation approaches also thanks to their universal representing p…

2017-05-03abs ↗pdf ↗

Mel-frequency filter bank (MFB) based approaches have the advantage of learning speech compared to raw spectrum since MFB has less feature size. However, speech generator with MFB approaches require additional vocoder that needs a huge amount of computation expense for training process. The additional pre/post processi…

2020-02-05abs ↗pdf ↗

End-to-end audio recognition system improves accuracy.

problem Improving accuracy in auditory object recognition.
method Proposes an end-to-end deep neural network with an 'inception nucleus' to learn features from raw waveforms.
result Bests current state-of-the-art approaches by 10.4 percentage points on Urbansound8k dataset.

A new EnKF method for elliptic PDEs reduces dimensionality for accurate state estimation.

problem Elliptic PDEs in fluid flows make traditional EnKF regularization ineffective.
method Low-rank factorization of the Kalman gain based on the Jacobian spectrum.
result Inference can be performed in a low-dimensional subspace of the state space.

We define a new spectrum for compact length spaces and Riemannian manifolds called the "covering spectrum" which roughly measures the size of the one dimensional holes in the space. More specifically, the covering spectrum is a set of real numbers δ>0δ>0 which identify the distinct δδ covers of the space. We investigat…

2003-11-22abs ↗pdf ↗

Study the energy spectrum of metrics on surfaces and its relation to simple length spectrum.

problem Relate the energy spectrum to the simple length spectrum of metrics on surfaces.
method Analyze the energy spectrum of metrics on surfaces and their Teichmüller spaces, considering homotopy conditions.
result The energy spectrum determines the simple length spectrum under certain conditions.

Singular values of a data in a matrix form provide insights on the structure of the data, the effective dimensionality, and the choice of hyper-parameters on higher-level data analysis tools. However, in many practical applications such as collaborative filtering and network analysis, we only get a partial observation.…

2017-03-18abs ↗pdf ↗

Efficiently sparsifies simplicial complexes using local densities of states.

problem Prohibitive computational requirements for dense simplicial complexes.
method Probabilistic sparsification using local densities of states and kernel-ignoring decomposition.
result Approximates the spectrum of the original SC with a sparser surrogate SC.

Simpler models outperform deep architectures with proper preprocessing and tuning.

problem Signal extraction from noisy cryptocurrency LOB data.
method Benchmarked a range of models including deep architectures and interpretable baselines.
result Simpler models can match and exceed deep architectures' performance with proper preprocessing and tuning.

Develops a new spectrum for annular links, recovering a transverse invariant at extreme gradings.

problem Understanding transverse link invariants in the annular setting.
method Constructs a stable homotopy type for annular links and defines a map to the Khovanov skein spectrum.
result At extreme gradings, the map from the Khovanov spectrum to the Khovanov skein spectrum recovers the cohomotopy transverse invariant.

The spectrum of certain manifolds matches that of hyperbolic space if the bottom spectrum is maximal.

problem Investigating spectral rigidity of manifolds with Ricci bounded below and maximal bottom spectrum.
method Analyzing the spectrum of the Laplacian on manifolds with specific Ricci curvature bounds.
result The spectrum of the manifold coincides with that of hyperbolic space if the bottom spectrum is maximal.

Paper analyzes ensemble Kalman updates for effective dimension and localization.

problem Why small ensemble sizes work well in inverse problems and data assimilation.
method Non-asymptotic analysis of ensemble Kalman updates, focusing on effective dimension and localization.
result Rigorously explains why a small ensemble size is sufficient when prior covariance has moderate effective dimension.

Recently, deep learning becomes the main focus of machine learning research and has greatly impacted many important fields. However, deep learning is criticized for lack of interpretability. As a successful unsupervised model in deep learning, the autoencoder embraces a wide spectrum of applications, yet it suffers fro…

2018-12-31abs ↗pdf ↗

In 2004, Sormani and Wei introduced the covering spectrum: a geometric invariant that isolates part of the length spectrum of a Riemannian manifold. In their paper they observed that certain Sunada isospectral manifolds share the same covering spectrum, thus raising the question of whether the covering spectrum is a sp…

2009-05-01abs ↗pdf ↗

This paper focuses on spectral filters on graphs, namely filters defined as elementwise multiplication in the frequency domain of a graph. In many graph signal processing settings, it is important to transfer a filter from one graph to another. One example is in graph convolutional neural networks (ConvNets), where the…

2019-01-29abs ↗pdf ↗

The rigidity of marked length spectrum for closed hyperbolic surfaces due to Fricke-Klein [7] has been the motivation of many different rigidity results, specially for manifolds of negative curvature. From the works of Vigneras [18], Sunada [17] and many other authors this result is far from being true for the unmarked…

2017-01-30abs ↗pdf ↗

Study essential spectrum of differential operators on geometrically finite orbifolds.

problem Analyzing the essential spectrum of differential operators over specific geometric structures.
method Investigates first order and Laplace type elliptic differential operators on Riemannian vector bundles over geometrically finite orbifolds.
result Discovers properties of essential spectra for these operators.

ManifoldFlow relaxes fixed-spectrum Stiefel layers to learn a positive spectrum.

problem Fixed-spectrum Stiefel layers impose rigid spectral constraints.
method Introduces ManifoldFlow, a relaxation that learns a positive spectrum while keeping the basis on the Stiefel manifold.
result Learnable SPD spectrum improves performance in various settings.

Paper proves flat metrics from holomorphic quadratic differentials can be identified by length spectrum.

problem Identifying flat metrics from holomorphic quadratic differentials.
method Proved using length spectrum on closed oriented surfaces.
result Flat metrics from holomorphic quadratic differentials can be distinguished by their length spectrum.