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,742 papers · 148 categories

Trend · papers per month

229457686914 · Jun 202019922001200920172026
48 results for set Fourier convolutions

New methods improve translation-equivariant neural processes for modeling unknown functions.

problem Modeling unknown latent functions from irregularly sampled measurements.
method Volterra series and set Fourier convolutions to address translation-equivariance and efficiency.
result Improved translation-equivariant neural processes with analytical transparency and linear scalability.

Initialization of parameters in deep neural networks has been shown to have a big impact on the performance of the networks (Mishkin & Matas, 2015). The initialization scheme devised by He et al, allowed convolution activations to carry a constrained mean which allowed deep networks to be trained effectively (He et al.…

2017-02-21abs ↗pdf ↗

Improved numerical solution for BSDEs with reduced boundary errors.

problem Boundary errors in numerical solution of BSDEs.
method Modified damping and shifting schemes to transform target function into a bounded periodic function, applying Fourier transforms.
result Significant reduction in boundary errors with improved accuracy and convergence.

Enhances DGPs with adaptive RKHS Fourier features for better non-stationary pattern modeling.

problem Capturing complex non-stationary patterns in non-linear dynamical systems.
method Integrates ODE-based RKHS Fourier features into DGPs using convolution operations for adaptive amplitude and phase modulation. Uses a doubly stochastic variational inference framework.
result Improved predictive performance across various regression tasks.

Study dynamics of LpL^p-multipliers on harmonic manifolds with exponential volume growth.

problem Characterize the behavior of LpL^p-multipliers on harmonic manifolds of purely exponential volume growth.
method Analyzing the dynamics of LpL^p-multipliers on non-compact harmonic manifolds, using Fourier transformation and properties of radial functions.
result Show that LpL^p-multipliers acting nicely on smooth functions with compact support for p2p\leq 2 cannot be chaotic.

A new CNN-based algorithm improves Fourier ptychography for faster, more robust image reconstruction.

problem Slow and inefficient Fourier ptychography reconstruction under system aberrations.
method A CNN-based iterative phase retrieval algorithm trained on GPUs.
result Significantly faster and more robust image reconstruction under system aberrations.

Previous research has shown that computation of convolution in the frequency domain provides a significant speedup versus traditional convolution network implementations. However, this performance increase comes at the expense of repeatedly computing the transform and its inverse in order to apply other network operati…

2016-11-16abs ↗pdf ↗

New method for optimizing risk in financial models using Fourier transforms.

problem Optimizing risk in financial models with multi-period mean-CVaR.
method Strictly monotone 2D integration scheme via Fourier-trained transition kernels.
result Established robust and accurate optimization method for financial models.

We review the properties of transversality of distributions with respect to submersions. This allows us to construct a convolution product for a large class of distributions on Lie groupoids. We get a unital involutive algebra $\cE\_{r,s}'(G,Ω^{1/2})$ enlarging the convolution algebra C_c(G,Ω1/2)C^\infty\_c(G,Ω^{1/2}) associate…

2015-02-06abs ↗pdf ↗

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 ↗

Study spherical Fourier transform on hypergeometric type harmonic manifolds.

problem Spherical Fourier transform on harmonic Hadamard manifolds.
method Representation of spherical functions by Gauss hypergeometric functions.
result Inversion formula, convolution rule, and Plancherel theorem are derived.

IGT learns graph representations without supervision.

problem Building deep unsupervised graph representations.
method Generic complex-valued spectral graph architecture from Fourier transform generalization, greedy concave objective for discriminative and invariant features.
result IGT learns both discriminative and invariant features from graph topology.

Local convolutions bias neural networks towards high-frequency adversarial examples.

problem High-frequency adversarial examples in neural networks.
method Analysis of different linear and nonlinear architectures, focusing on the impact of local convolution operations.
result Local convolutions induce an implicit bias towards high frequency features, leading to high-frequency adversarial examples.

LOT improves adversarial robustness by training 1-Lipschitz convolution layers.

problem Improving adversarial robustness of deep neural networks.
method LOT: Layer-wise Orthogonal Training for 1-Lipschitz convolution layers.
result LOT significantly enhances certified robustness of Lipschitz-bounded models.

State-of-the-art methods for Convolutional Sparse Coding usually employ Fourier-domain solvers in order to speed up the convolution operators. However, this approach is not without shortcomings. For example, Fourier-domain representations implicitly assume circular boundary conditions and make it hard to fully exploit …

2019-08-31abs ↗pdf ↗

New algorithms learn sparse set functions in non-orthogonal Fourier bases.

problem Learning sparse set functions in non-orthogonal Fourier bases.
method Novel algorithms using non-orthogonal Fourier transforms.
result At most nkklog2k+knk - k \log_2 k + k queries for kk non-zero Fourier coefficients.

Convolutional Neural Networks (CNNs) have become the method of choice for learning problems involving 2D planar images. However, a number of problems of recent interest have created a demand for models that can analyze spherical images. Examples include omnidirectional vision for drones, robots, and autonomous cars, mo…

2018-01-30abs ↗pdf ↗

Performance of neural networks can be significantly improved by encoding known invariance for particular tasks. Many image classification tasks, such as those related to cellular imaging, exhibit invariance to rotation. We present a novel scheme using the magnitude response of the 2D-discrete-Fourier transform (2D-DFT)…

2018-05-31abs ↗pdf ↗

We introduce the convolutional spectral kernel (CSK), a novel family of non-stationary, nonparametric covariance kernels for Gaussian process (GP) models, derived from the convolution between two imaginary radial basis functions. We present a principled framework to interpret CSK, as well as other deep probabilistic mo…

2019-05-23abs ↗pdf ↗

Filters in a Convolutional Neural Network (CNN) contain model parameters learned from enormous amounts of data. In this paper, we suggest to decompose convolutional filters in CNN as a truncated expansion with pre-fixed bases, namely the Decomposed Convolutional Filters network (DCFNet), where the expansion coefficient…

2018-02-12abs ↗pdf ↗

New method enforces orthogonality in convolutional layers for improved robustness.

problem Improving adversarial robustness in deep learning models.
method Applying the Cayley transform to skew-symmetric convolutions in the Fourier domain.
result The proposed method preserves orthogonality and enhances adversarial robustness compared to existing techniques.

Study examines boundedness of oscillating singular integrals on specific Lie groups.

problem Investigating boundedness of oscillating singular integrals on Lie groups of polynomial growth.
method Presented kernel criteria in terms of sub-Riemannian structure and Fourier analysis.
result Extended classical oscillating conditions for boundedness of oscillating convolution operators.

A new convolutional spectral kernel network learns hierarchical and local features.

problem Lack of deep learning in non-stationary spectral kernels.
method Introduces convolutional filters and deep architectures into non-stationary spectral kernels, derives generalization error bounds, and introduces regularizers.
result Validated the effectiveness of the convolutional spectral kernel network on real-world datasets.

Tensor methods have emerged as a powerful paradigm for consistent learning of many latent variable models such as topic models, independent component analysis and dictionary learning. Model parameters are estimated via CP decomposition of the observed higher order input moments. However, in many domains, additional inv…

2015-06-10abs ↗pdf ↗

We prove new kinematic formulas for tensor valuations and simplify previously known Crofton formulas by using the recently developed algebraic theory of translation invariant valuations. The heart of the paper is the computation of the Alesker-Fourier transform on the large class of spherical valuations, which is achie…

2014-02-12abs ↗pdf ↗

The paper derives and proves the Helgason Fourier transform for vector bundle-valued differential forms on homogeneous spaces.

problem Deriving the Helgason Fourier transform for vector bundle-valued differential forms on homogeneous spaces.
method Employing the perspective of the functional equation satisfied by the classical Fourier transform, the paper derives the Helgason Fourier transform map and proves its properties.
result The Fourier transform is explicitly given and proven to be a map from vector bundle-valued differential forms to another vector bundle-valued differential form on the product space.

New MCMC method speeds up quantum physics simulations by a factor of 100.

problem Simulating quantum many-body systems with high computational complexity.
method FFT-accelerated MCMC with coupled particle and auxiliary variables.
result Achieves O(NlogN)O(N \log N) scaling, significantly faster than traditional O(N3)O(N^3) methods.

HFNO enhances interpretability of turbulent flows through parallel wavenumber bin processing.

problem Opaque inner workings of Fourier Neural Operators (FNOs) hinder physical interpretability.
method Introduces HFNO, a novel FNO-based architecture that processes wavenumber bins in parallel, enhancing interpretability.
result HFNO decomposes turbulent flows across various scales, enabling increased interpretability and multiscale modeling.

Neural networks learn simpler features first, then more complex ones; Fourier analysis reveals this pattern.

problem Understanding the learning dynamics of neural networks, especially with natural image data.
method Fourier analysis of translation-invariant and power-law spectra to study feature learning.
result Simple neural networks first rely on amplitude information, then phase information, and power-law spectra can accelerate learning phase information.

In this paper we introduce a new family of operator-valued distributions on Euclidian space acting by convolution on differential forms. It provides a natural generalization of the important Riesz distributions acting on functions, where the corresponding operators are (Δ)α/2(-Δ)^{-α/2}, and we develop basic analogous prop…

2017-02-03abs ↗pdf ↗

Proves conditions for Fourier transforms in rank 1 symmetric spaces.

problem Understanding Fourier transform bounds in symmetric spaces.
method Proves sufficient and necessary conditions using Lipschitz and Fourier type integral conditions.
result Establishes bounds for Fourier transforms in rank 1 symmetric spaces with specific moduli of continuity.

Analyzes how diffusion models learn, revealing a spectral bias in structure mastery.

problem Understanding the learning dynamics and bias in diffusion models.
method Developed an analytical framework using a Gaussian-equivalence principle to solve gradient-flow dynamics and integrate probability-flow ODEs.
result Exposes a universal inverse-variance spectral law: high-variance structure is mastered faster than low-variance detail.

This study shows how optimizer choice affects adversarial robustness in neural networks.

problem Understanding and improving adversarial robustness in neural networks.
method Revisiting known results linking robust classifiers and minimum norm solutions, combining them with recent optimizer bias findings.
result Achieving both perfect standard accuracy and robustness with certain optimizers under specific conditions.

Unified method for deriving ridgelet transforms for various neural network architectures.

problem Deriving closed-form expressions for ridgelet transforms in modern neural network architectures.
method Unified Fourier slice method to derive ridgelet transforms for diverse neural network types.
result Systematic method to derive ridgelet transforms for various neural network architectures.