atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Robust and Fast Measure of Information via Low-Rank Representation

AAAI 2023 · Learning theory and algorithms › Matrix and tensor methods · approach: Low-rank approximation theory · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace matrix-based Rényi entropy with low-rank Rényi entropy in the information bottleneck objectiveVGG16 on CIFAR10 · CIFAR10Accuracy (%): 94.13 $\pm$ 0.04 -> 94.16 $\pm$ 0.09Helped
Replace matrix-based Rényi entropy with low-rank Rényi entropy in the information bottleneck objectiveVGG16 on CIFAR10 · CIFAR10IB calculation time (minutes): 46 -> 15Helped
Replace matrix-based Rényi entropy with low-rank Rényi entropy in the information bottleneck objectiveVGG16 on CIFAR10 · CIFAR10Total training time (minutes): 126 -> 95Helped
Use low-rank instead of matrix-based Rényi mutual information for feature selectionLRMI versus MRMI · Feature selection datasets (average)Average rank: 1.74 -> 1.64Helped
Use low-rank instead of matrix-based Rényi mutual information for feature selectionLRMI versus MRMI · BreastAverage rank: 2.6 -> 2.6No clear effect
Use low-rank instead of matrix-based Rényi mutual information for feature selectionLRMI versus MRMI · StatlogAverage rank: 2.0 -> 2.1Hurt
Use low-rank instead of matrix-based Rényi mutual information for feature selectionLRMI versus MRMI · Semeion, Madelon, Krvskp, Spambase, Waveform, OptdigitsAverage rank: Semeion: 1.8 -> 1.4; Madelon: 1.2 -> 1.1; Krvskp: 1.7 -> 1.6; Spambase: 1.5 -> 1.5; Waveform: 1.8 -> 1.5; Optdigits: 1.3Mixed
Use low-rank instead of matrix-based Rényi mutual information for feature selectionLRMI versus MRMI · Feature selection datasetsRunning time: 6 to 27 times speedup; 15 times on averageHelped
Use low-rank Rényi entropy rather than matrix-based Rényi entropy under random data-sample perturbationsInformation potential under random noise · Synthetic noise perturbation simulationVarianceHelped
Use low-rank Rényi entropy in place of the original matrix-based measureLow-rank entropy approximation · 8192 × 8192 kernel matrixSpeedup: more than 25 times speedupHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy