We present a new sparse compression technique based on the information bottleneck (IB) principle, which takes into account side information. This is achieved by introducing a sparse variant of IB which preserves the information in only a few selected dimensions of the original data through compression. By assuming a Gaussian copula we can capture arbitrary non-Gaussian margins, continuous or discrete. We apply our model to select a sparse number of biomarkers relevant to the evolution of malignant melanoma and show that our sparse selection provides reliable predictors
The information bottleneck function gives a measure of optimal preservation of correlation between s...
Submitted to the 2018 International Zurich Seminar on Information and Communication (IZS)Internation...
Abstract—We propose computationally efficient encoders and decoders for lossy compression using a Sp...
We present a reformulation of the information bottleneck (IB) problem in terms of copula, using the ...
The information bottleneck (IB) method is a technique for extracting information that is relevant fo...
Both authors contributed equally The problem of extracting the relevant aspects of data was ad-dress...
In many applications, it is desirable to extract only the relevant aspects of data. A principled way...
The information bottleneck (IB) problem tackles the issue of obtaining relevant compressedrepresenta...
We study a new class of codes for lossy compression with the squared-error distortion crite-rion, de...
We define the relevant information in a signal x 2 X as being the information that this signal provi...
We study a new class of codes for lossy compression with the squared-error distortion criterion, des...
Abstract—The achievable and converse regions for sparse representation of white Gaussian noise based...
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a ...
150 pagesData compression is a widely used technique to reduce the transmission rate of a source sig...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
The information bottleneck function gives a measure of optimal preservation of correlation between s...
Submitted to the 2018 International Zurich Seminar on Information and Communication (IZS)Internation...
Abstract—We propose computationally efficient encoders and decoders for lossy compression using a Sp...
We present a reformulation of the information bottleneck (IB) problem in terms of copula, using the ...
The information bottleneck (IB) method is a technique for extracting information that is relevant fo...
Both authors contributed equally The problem of extracting the relevant aspects of data was ad-dress...
In many applications, it is desirable to extract only the relevant aspects of data. A principled way...
The information bottleneck (IB) problem tackles the issue of obtaining relevant compressedrepresenta...
We study a new class of codes for lossy compression with the squared-error distortion crite-rion, de...
We define the relevant information in a signal x 2 X as being the information that this signal provi...
We study a new class of codes for lossy compression with the squared-error distortion criterion, des...
Abstract—The achievable and converse regions for sparse representation of white Gaussian noise based...
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a ...
150 pagesData compression is a widely used technique to reduce the transmission rate of a source sig...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
The information bottleneck function gives a measure of optimal preservation of correlation between s...
Submitted to the 2018 International Zurich Seminar on Information and Communication (IZS)Internation...
Abstract—We propose computationally efficient encoders and decoders for lossy compression using a Sp...