Publication

Learning with Compressible Priors

Volkan Cevher
2009
Conference paper

Abstract

We describe a set of probability distributions, dubbed compressible priors, whose independent and identically distributed (iid) realizations result in p-compressible signals. A signal x in R^N is called p-compressible with magnitude R if its sorted coefficients exhibit a power-law decay as |x|_(i)

Official source

https://infoscience.epfl.ch/record/151476?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Learning with Compressible Priors

Graph Chatbot

Chat with Graph Search

Generalization of Scaled Deep ResNets in the Mean-Field Regime

Valence can control the nonexponential viscoelastic relaxation of multivalent reversible gels

Regressive Tomography and Direct Regressive Reconstruction: A Research Note

Valence can control the nonexponential viscoelastic relaxation of multivalent reversible gels

Regressive Tomography and Direct Regressive Reconstruction: A Research Note

Generalization of Scaled Deep ResNets in the Mean-Field Regime