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 Experiment Videos

A Sparse Representation for Function Approximation

Poggio1, Girosi

  • 1Massachusetts Institute of Technology, Artificial Intelligence Lab, Cambridge MA, US, 545 Technology Square, 02139. tp@ai.mit.edu

Neural Computation
|August 11, 1998
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

An Equivalence Between Sparse Approximation and Support Vector Machines.

Neural computation·1998
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

This study introduces a novel function representation using sparse, local correlation kernels. This method connects to principal component analysis, regularization, and support vector machines for advanced data analysis.

Area of Science:

  • Machine Learning
  • Data Science
  • Applied Mathematics

Background:

  • Function approximation is a fundamental problem in data analysis.
  • Existing methods often struggle with high-dimensional or complex datasets.
  • The need for efficient and interpretable representations is critical.

Purpose of the Study:

  • To develop a new, general representation for functions.
  • To explore the relationship between this representation and established machine learning techniques.
  • To leverage sparsity and locality for improved function approximation.

Main Methods:

  • Derivation of a general function representation.
  • Utilizing local correlation kernels.
  • Identifying optimal sparse locations and scales for kernels.

Related Experiment Videos

Main Results:

  • A novel sparse representation for functions is established.
  • Connections are characterized between this representation and principal component analysis (PCA), regularization, sparsity principles, and support vector machines (SVMs).
  • The representation offers a unified view of these concepts.

Conclusions:

  • The proposed representation provides a powerful framework for function approximation.
  • It offers insights into the theoretical underpinnings of various machine learning algorithms.
  • This approach has potential applications in diverse data analysis tasks.