Related Experiment Video
Updated: Dec 22, 2025

Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
Deep Compressed Sensing for Learning Submodular Functions
Yu-Chung Tsai1, Kuo-Shih Tseng1
1Department of Mathematics, National Central University, Taoyuan City 32001, Taiwan.
Abstract:
The AI community has been paying attention to submodular functions due to their various applications (e.g., target search and 3D mapping). Learning submodular functions is a challenge since the number of a function's outcomes of N sets is 2 N . The state-of-the-art approach is based on compressed sensing techniques, which are to learn submodular functions in the Fourier domain and then recover the submodular functions in the spatial domain. However, the number of Fourier bases is relevant to the number of sets' sensing overlapping. To overcome this issue, this research proposed a submodular deep compressed sensing (SDCS) approach to learning submodular functions. The algorithm consists of learning autoencoder networks and Fourier coefficients. The learned networks can be applied to predict 2 N values of submodular functions. Experiments conducted with this approach demonstrate that the algorithm is more efficient than the benchmark approach.
Related Concept Videos
Synthetic Disvision of Polynomials
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Piecewise-Defined Functions
Singularity Functions for Shear
Evaluating Limits by Direct Substitution
Graphical Representation of Inequalities

