A new density model using Fourier basis achieves better approximations and compression.
problem Approximating multi-modal 1D densities.
method Constrained Fourier basis model for end-to-end training.
result Lower cross entropy compared to deep factorized models.
A new method integrates Fourier basis expansion and mapping for improved time series forecasting.
problem Inconsistent starting cycles and series length issues in Fourier-based methods.
method Fourier Basis Mapping (FBM) method that integrates time-frequency features through Fourier basis expansion and mapping.
result FBM addresses inconsistencies and preserves temporal characteristics, achieving SOTA performance.
Estimates inner products between nonparametric distributions using Fourier basis.
problem Estimating inner products between two nonparametric distributions.
method Proposes estimators for inner products and induced norms, proves mean squared error bounds and minimax lower bounds.
result Proposed estimators are rate-optimal over Fourier ellipsoids.
Derives representations invariant under crystallographic groups for functions.
problem Representing and learning functions invariant under crystallographic groups.
method Derives linear and nonlinear representations of functions invariant under crystallographic groups.
result Derives orthonormal crystallographically invariant basis functions and embedding maps.
Proposes FRU to stabilize gradients and improve long-term dependencies in RNNs.
problem Challenges in training RNNs for tasks with long-term dependencies.
method Introduces Fourier Recurrent Units (FRU) that stabilize gradients and improve expressivity.
result FRU stabilizes gradients and has stronger expressive power, leading to better performance.
New Fourier analysis method for non-uniform Boolean hypercube.
problem Non-uniform probability measures on the Boolean hypercube.
method ANOVA-based decomposition, explicit basis, least squares problem.
result Generalization of Fourier analysis for arbitrary probability measures.
Enhances Fourier estimator performance for asynchronous event-data.
problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.
New method embeds correlation networks to reveal underlying time series patterns.
problem Analyzing correlation networks derived from time series data.
method Spectral embedding of noisy correlation networks, leveraging Fourier basis elements.
result Spectral embedding recovers true vertex-level latent representations under suitable assumptions.
We develop Fourier methods to expand translation-invariant kernels.
problem Constructing orthonormal expansions for translation-invariant kernels.
method Fourier analytic technique to derive explicit expansions.
result Explicit expansions for various kernels (Matérn, Cauchy, Gaussian).
New method for approximating periodic kernels on high-dimensional data.
problem Inefficient modelling of periodicity in higher-dimensional problems.
method Index Set Fourier Series Features
result Significantly less predictive error compared to alternative methods.
Harmonic analysis on directed graphs for signal modeling and semi-supervised learning.
problem Signal analysis on directed graphs.
method Introduced a Fourier-type basis using eigenvectors of the random walk operator, developed wavelet transforms for multi-scale analysis.
result Efficiency of the proposed framework for semi-supervised learning and signal modeling on directed graphs.
Study shows optimal rates for independence testing via U-statistic permutation tests.
problem Developing a valid test of independence for pairs with additional smoothness constraints.
method Defining a measure of dependence, using a permutation test based on a basis expansion and U-statistic estimator.
result Proves minimax optimality of the test in separation rates for certain cases.
This paper analyzes SHAP values using Fourier expansions for model interpretability.
problem Understanding and interpreting SHAP values in complex models.
method Developed a spectral framework using Fourier expansions for SHAP values in various model regimes.
result SHAP values are Lipschitz continuous in the deterministic regime and converge to Gaussian process values in the probabilistic regime.
New method uses tensor decompositions to overcome the curse of dimensionality for large-scale learning.
problem Large-scale machine learning problems with kernel methods.
method Deterministic Fourier features combined with low-rank tensor decomposition for tensor product structure.
result Demonstrated consistent performance and superior results compared to random Fourier features.
Paper improves Fourier methods for finance control problems, ensuring monotonicity and accuracy.
problem Low accuracy and monotonicity issues in Fourier methods for finance control problems.
method Preprocessing step involving projecting Green's function onto linear basis functions.
result Algorithm is monotone, ℓ∞-stable, and satisfies an ε-discrete comparison principle. New method combines spectral and sparse methods for Gaussian processes.
problem Efficiently fitting Gaussian processes to large datasets.
method Orthogonally decoupled variational Fourier features.
result Competitive performance on synthetic and real-world data.
Paper extends scattering network for fast, scalable feature extraction.
problem Efficiently extracting features from structured inputs.
method Derives a Fourier domain model for scattering network with higher order nonlinearities.
result Achieves linear time complexity for fast computations.
Proposes a framework to predict stock movements by integrating multi-order and internal dynamics.
problem Predicting stock movements with multi-order and internal dynamics.
method Temporal generative filters and hypergraph attentions using wavelet basis.
result Framework outperforms state-of-the-art methods in terms of profit and stability.
RP-GFRFT unifies fractional order and rotation control for graph signals.
problem Lack of rotation-based spectral control in GFRFT and zero-angle degeneracy in AGFT.
method Rotation-parameterized graph fractional Fourier transform (RP-GFRFT) with degeneracy preserving rotation matrix.
result RP-GFRFT improves spectral filtering performance over existing methods.
Localized signal representation on graph bundles using Fourier analysis.
problem Representing signals on graph bundles with twists.
method Partition of unity and product factorization over the base graph.
result Lifted bases for signal spaces of graph bundle components.
Absum improves CNN robustness against Fourier attacks.
problem Structural sensitivity of CNNs to Fourier basis functions.
method Regularizes convolution filter weights to reduce sensitivity.
result Improves robustness against single Fourier attack.
We introduce a multiple curve framework that combines tractable dynamics and semi-analytic pricing formulas with positive interest rates and basis spreads. Negatives rates and positive spreads can also be accommodated in this framework. The dynamics of OIS and LIBOR rates are specified following the methodology of the …
New algorithm trains deep neural networks without global optimization.
problem Training deep neural networks efficiently and without global optimization.
method Uses random complex exponential activation functions and Markov Chain Monte Carlo sampling.
result Consistently attains theoretical approximation rate for residual networks.
Study bounds Rademacher complexity of Fourier neural operators.
problem Bounding Rademacher complexity for Fourier neural operators.
method Investigated using specific group norms and capacity.
result Inferred that group norms determine model information.
FrequentNet uses frequency domain basis vectors for image classification, making models more interpretable and efficient.
problem Image classification models are often complex and hard to interpret.
method FrequentNet selects filter vectors from frequency domain basis vectors instead of training them with back propagation.
result The method improves interpretability and efficiency of image classification models.
Novel CSK kernel improves GP model generalization for non-stationary patterns.
problem Improving generalization of Gaussian process models for non-stationary data.
method Introduced convolutional spectral kernel (CSK) derived from convolution of imaginary radial basis functions, using Fourier transform for interpretation.
result CSK improves GP model generalization on spatiotemporal datasets.
The paper shows how Fourier coefficients of eigenfunctions on curved surfaces decay.
problem Estimating decay rates of Fourier coefficients on curved surfaces.
method Microlocal decomposition of measures into tangential and transversal parts.
result Fourier coefficients of eigenfunctions over curves on Riemannian surfaces with nonpositive curvature decay at a rate of O((logλ)−1/2). Subspace recovery from corrupted and missing data is crucial for various applications in signal processing and information theory. To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w…
Spectral methods predict long-term signals from linear and nonlinear systems.
problem Forecasting temporal signals from linear and nonlinear systems with arbitrary sampling.
method Introduces a spectral algorithm for linear signals and extends it to nonlinear systems using Koopman theory.
result The spectral methods achieve high accuracy in forecasting and uncertainty quantification.
Reconstruction of density functions and their characteristic functions by radial basis functions with scattered data points is a popular topic in the theory of pricing of basket options. Such functions are usually entire or admit an analytic extension into an appropriate tube and "bell-shaped" with rapidly decaying tai…
A machine learning method selects optimal orthonormal bases for functional data analysis.
problem Lack of formal criteria for choosing initial orthonormal bases in functional data methods.
method Proposes a machine learning algorithm to learn and place knots for efficient orthogonal spline bases (splinets).
result Demonstrates efficiency, especially for sparse functional data and complex physical systems.
Method transfers label function spectrum between graphs.
problem Domain adaptation with abrupt label function variations.
method Learning aligned graph bases to transfer label function spectrum.
result Improved classification performance compared to existing methods.
mcanalysis quantifies menstrual cycle effects in health data.
problem Lack of standardised statistical methods for menstrual cycle research.
method Fourier-basis generalised additive model (GAM) pipeline.
result Nine out of 15 health outcomes showed significant association with menstrual cycle.
Paper integrates real data into probabilistic models using Fourier transform.
problem Learning from constrained data sets in high dimensions.
method Functional approach based on weak formulation of Fourier transform of probability measures.
result Estimation of posterior probability measures for QoI and QoI with control parameter.
FMMNN combines sine activations with multi-component, multi-layer structure for high-frequency function approximation.
problem Effective representation and learning of high-frequency features in neural networks.
method Introduces FMMNN with sine-type activations and multi-component, multi-layer structure.
result FMMNN achieves strong accuracy and favorable convergence on oscillatory function-approximation benchmarks.
Proposes AE-1SVM for scalable anomaly detection.
problem Optimization complexity and scalability issues in OC-SVM for large datasets.
method Combines autoencoder with random Fourier features and stochastic gradient descent for end-to-end training.
result End-to-end training achieves better performance than previous methods.
Model forecasts natural gas consumption with Fourier series and feedback.
problem Forecast natural gas consumption for risk minimization.
method Modulated Fourier series with temperature deviations, day-ahead feedback.
result Model outperforms time series methods for long-term projections.
Introduces a neural network-based method for efficient state and parameter estimation in complex systems.
problem Efficiently estimating state paths and parameters from noisy measurements in high-dimensional nonlinear systems.
method Bayesian Information Field Theory with neural network parameterization and optimization algorithms.
result Proposes a method to simplify and enrich state path parameterizations using neural networks, improving inference accuracy.
No-trick kernel adaptive filtering uses deterministic features for scalability and robustness.
problem Scalability issues in kernel methods for large datasets.
method Deterministic feature-map construction using polynomial-exact solutions.
result Deterministic features outperform random Fourier features in performance and scalability.
FEDformer combines Transformer with seasonal-trend decomposition for efficient long-term forecasting.
problem Transformer's inefficiency and inability to capture global time series views.
method Combines seasonal-trend decomposition with Transformer, exploiting Fourier basis for frequency enhancement.
result Reduces prediction error by 14.8% and 22.6% for multivariate and univariate time series, respectively.
Unified diffusion framework enhances generative models flexibility.
problem Improving generative models' design freedom and efficiency.
method Unified framework incorporating choice of representation, prior distribution, and noise scheduling.
result Enhanced flexibility leading to more efficient training and data generation.
A machine-learning approach solves CS data reconstruction for structural health monitoring.
problem Optimal solution for sparse optimization in compressive sensing.
method Formalizing CS data reconstruction as a supervised-learning task, using l1-norm regularization and a multi-neuron layer.
result High reconstruction accuracy achieved by the machine learning-based approach.
We study the geometry of infinitely presented groups satisfying the small cancelation condition C'(1/8), and define a standard decomposition (called the criss-cross decomposition) for the elements of such groups. We use it to prove the Rapid Decay property for groups with the stronger small cancelation property C'(1/10…
Paper proves Fourier transform for valuations, simplifying previous work.
problem Existence of isomorphism for translation-invariant smooth valuations.
method Directly describes Alesker's isomorphism in terms of Fourier transform on functions.
result Simple proofs of Alesker's Fourier transform properties, including a previously conjectured result.
Improved SVM classification with interpretable features from scattered data.
problem Classification of scattered data points in high-dimensional spaces.
method Truncated ANOVA decomposition for sparse feature selection; use of trigonometric or wavelet feature maps.
result Better classification accuracy and interpretability with ℓ1-norm regularization. New Hilbert bundles with ends defined from indexed bases.
problem Defining new structures in Hilbert bundles.
method Indexed bases and unitary operators of finite propagation.
result Characteristic classes of Hilbert bundles with ends.
Improved estimates on Riemannian surfaces with negative curvature.
problem Estimating Fourier coefficients of eigenfunctions on negatively curved surfaces.
method Refined geodesic period integrals and Gauss-Bonnet Theorem to avoid geodesic parallelograms and quantify curvature.
result Fourier coefficients go to zero at a rate of O((logλ)−1/2) for 0<ν<c0λ. 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 nk−klog2k+k queries for k non-zero Fourier coefficients.