Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

316
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....
316
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

299
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,...
299
Convergence of Fourier Series01:21

Convergence of Fourier Series

346
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...
346
Fast Fourier Transform01:10

Fast Fourier Transform

819
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
819
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

973
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
973
Discrete Fourier Transform01:15

Discrete Fourier Transform

781
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
781

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Genome modelling and design across all domains of life with Evo 2.

Nature·2026
Same author

Sequence modeling and design from molecular to genome scale with Evo.

Science (New York, N.Y.)·2024
Same author

Prospector Heads: Generalized Feature Attribution for Large Models & Data.

ArXiv·2024
Same author

Towards trustworthy seizure onset detection using workflow notes.

NPJ digital medicine·2024
Same author

Development and Validation of a Machine Learning System to Identify Reflux Events in Esophageal 24-Hour pH/Impedance Studies.

Clinical and translational gastroenterology·2023
Same author

Noise2Recon: Enabling SNR-robust MRI reconstruction with semi-supervised and self-supervised learning.

Magnetic resonance in medicine·2023
Same journal

Towards the Efficient Inference by Incorporating Automated Computational Phenotypes under Covariate Shift.

Proceedings of machine learning research·2026
Same journal

Endo-SemiS: Towards Robust Semi-Supervised Image Segmentation for Endoscopic Video.

Proceedings of machine learning research·2026
Same journal

Perspective: Machine Learning for Health Should Consider Social Drivers of Health.

Proceedings of machine learning research·2026
Same journal

Classifying Phonotrauma Severity from Vocal Fold Images with Soft Ordinal Regression.

Proceedings of machine learning research·2026
Same journal

Does Domain-Specific Retrieval Augmented Generation Help LLMs Answer Consumer Health Questions?

Proceedings of machine learning research·2026
Same journal

Quantitative Convergence Analysis of Projected Stochastic Gradient Descent for Non-Convex Losses via the Goldstein Subdifferential.

Proceedings of machine learning research·2026
See all related articles

Related Experiment Video

Updated: Jan 3, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:46

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

4

Low-Precision Random Fourier Features for Memory-Constrained Kernel Approximation.

Jian Zhang1, Avner May1, Tri Dao1

  • 1Stanford University.

Proceedings of Machine Learning Research
|November 29, 2019
PubMed
Summary
This summary is machine-generated.

We developed low-precision quantization of random Fourier features (LP-RFFs) for memory-efficient kernel approximation. LP-RFFs achieve high-rank approximations with significantly reduced memory, matching performance of full-precision methods.

More Related Videos

Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

18.1K

Related Experiment Videos

Last Updated: Jan 3, 2026

A Multimodal Wide-Field Fourier-Transform Raman Microscope
06:46

A Multimodal Wide-Field Fourier-Transform Raman Microscope

Published on: December 30, 2025

4
Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

18.1K

Area of Science:

  • Machine Learning
  • Computational Science

Background:

  • Kernel approximation methods are crucial for large-scale machine learning.
  • Existing methods face memory constraints when approximating high-rank kernels.

Purpose of the Study:

  • To develop a memory-efficient kernel approximation technique.
  • To improve generalization performance under strict memory budgets.

Main Methods:

  • Defined a novel kernel approximation error metric.
  • Proposed low-precision quantization of random Fourier features (LP-RFFs).
  • Theoretically analyzed the impact of quantization on generalization.

Main Results:

  • The new error metric better predicts empirical generalization.
  • LP-RFFs enable high-rank approximations within memory limits.
  • Empirical results show LP-RFFs match full-precision RFFs and Nyström method performance.
  • LP-RFFs achieve 3x-10x (vs. RFFs) and 50x-460x (vs. Nyström) memory reduction.

Conclusions:

  • Low-precision quantization is effective for memory-efficient kernel approximation.
  • LP-RFFs offer a practical solution for large-scale kernel methods.
  • The proposed approach balances performance and memory usage.