Research map / Learning theory and algorithms / Matrix and tensor methods
Tensor Biclustering
Soheil Feizi, Hamid Javadi, David Tse
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 changed | Where | Measured | Effect |
|---|---|---|---|
| use tensor folding+spectral instead of tensor unfolding+spectral | Tensor biclustering · Synthetic, n=200, m=50, k=40, noise models I and II | bicluster recovery rate | Improved |
| switch from noise model I to noise model II when comparing folding+spectral against others | Tensor folding+spectral · Synthetic, n=200, m=50, k=40 | bicluster recovery rate | Improved |
| use tensor folding+spectral instead of thresholding individual trajectory lengths when k is small | Tensor folding+spectral · Asymptotic analysis, small k | achievability bound | Hurt |
| use tensor folding+spectral instead of other polynomial-time methods when k is large | Tensor folding+spectral · Asymptotic analysis, large k | achievability bound | Improved |
| fold the tensor instead of unfolding it, keeping block structure of trajectories (ablation) | Spectral tensor biclustering · Table 1, m=Θ(n), Δ=1/√k | required signal strength | Improved |
| use tensor folding+spectral instead of random bicluster selection | Tensor folding+spectral · Roadmap epigenomics | inferred bicluster quality | Improved |
| use tensor folding+spectral instead of other tensor biclustering methods on real data | Tensor folding+spectral · Roadmap epigenomics | inferred bicluster quality | Improved |
Closest papers by meaning
- Learning from Binary Multiway Data: Probabilistic Tensor Decomposition and its Statistical Optimality (JMLR 2020 · similarity 0.87)
- Performance Gaps in Multi-view Clustering under the Nested Matrix-Tensor Model (ICLR 2024 · similarity 0.86)
- General Tensor Spectral Co-clustering for Higher-Order Data (NeurIPS 2016 · similarity 0.86)
- Tensor-Based Sketching Method for the Low-Rank Approximation of Data Streams. (ICLR 2023 · similarity 0.85)
- Learning from Multiway Data: Simple and Efficient Tensor Regression (ICML 2016 · similarity 0.85)
- Union of Low-Rank Tensor Spaces: Clustering and Completion (JMLR 2020 · similarity 0.85)
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.
