在科罗博夫空间上的函数与富里埃函数网络的函数的近似.
Peilin Liu1, Yuqing Liu2, Xiang Zhou3
1School of Mathematics and Statistics, University of Sydney, Sydney, New South Wales 2006, Australia.
概括
本研究探讨了从功能数据中学习的福里埃函数网络,以实现维度独立的融合率. 这些深度学习模型克服了高维问题的维度诅咒.
科学领域:
- 机器学习 机器学习
- 深度学习 (Deep Learning) 是一种深度学习.
- 功能数据分析 功能数据分析
背景情况:
- 深度神经网络越来越多地用于功能数据分析.
- 对功能数据的神经网络的理论理解是有限的.
- 高维的功能数据带来了重大挑战.
研究的目的:
- 调查福里埃函数网络的近似能力.
- 分析功能数据深度学习的理论基础.
- 开发一个神经网络架构,减少功能数据的参数.
主要方法:
- 利用弗里埃神经运算符和深度卷积神经网络.
- 对于非线性连续函数的确定的近似率.
- 专注于在周期函数的科罗博夫空间上定义的函数.
主要成果:
- 对于富里埃函数网络来说,已经证明了维度独立的收率.
- 与其他架构相比,显示了参数的显著减少.
- 提供了从功能数据学习的理论保证.
结论:
- 里叶函数网络为高维函数数据分析提供了一个有前途的方法.
- 该研究通过理论见解克服了维度的诅咒.
- 这些发现为更高效,更有效的深度学习模型铺平了道路.
相关概念视频
Linear Approximation in Frequency Domain
85
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
85
Parseval's Theorem for Fourier transform
877
Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
877
Convergence of Fourier Series
128
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
128
Linear Approximation in Time Domain
64
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
64
Trigonometric Fourier series
243
Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
243
Properties of Fourier series II
136
Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...
A function f(t) is...
136


