svd

Tag

Cards List
#svd

Deriving SVD without even aiming at it

Hacker News Top · 5d ago Cached

This blog post explains how to derive the Singular Value Decomposition (SVD) from scratch by focusing on the underlying intuition and the motivation behind the concept, arguing that traditional math books often present formalized conclusions without showing the exploratory path.

0 favorites 0 likes
#svd

Low-Cost High-Order Singular Value Decomposition for Tensor-Based Reconstruction from Sparse Sensor Measurements: Urban Flow and Air-Quality Applications

arXiv cs.LG · 2026-06-25 Cached

This paper introduces low-cost High-Order Singular Value Decomposition (lcHOSVD), a tensor-based method for reconstructing high-dimensional environmental fields from sparse sensor measurements. Applied to urban flow and air-quality datasets, it achieves lower reconstruction errors and greater robustness to uneven sensor distributions compared to matrix-based approaches.

0 favorites 0 likes
#svd

@vintcessun: Turns out LLM text embeddings are hijacked by high-frequency tokens (periods, articles)! The unembedding matrix implicitly defines a low-rank subspace dominated by these uninformative expressions. This is the root cause of LLMs' poor performance as universal embeddings, and the contamination is subtle. EmbedFilter…

X AI KOLs Timeline · 2026-06-12 Cached

This study reveals that LLM text embeddings are hijacked by high-frequency tokens (e.g., periods, articles) and proposes EmbedFilter, which performs SVD on the unembedding matrix and subtracts the projection component to release true semantics, achieving zero-training-cost dimensionality reduction and retrieval efficiency gains.

0 favorites 0 likes
#svd

@rasbt: Always back to the basics: LatentMoE was probably inspired by MLA, which was inspired by LoRA, which was inspired by SV…

X AI KOLs Timeline · 2026-06-09 Cached

Sebastian Raschka points out the chain of inspiration from LatentMoE back to eigendecomposition through MLA, LoRA, and SVD.

0 favorites 0 likes
#svd

Shortcuts in the Tail: Debiasing via Post-Hoc Spectral Compression of Fine-Tuning Updates

arXiv cs.LG · 2026-06-09 Cached

A post-hoc method reduces spurious correlations in fine-tuned LLMs by truncating the tail of the SVD of the weight update matrix. It reduces the spurious-group gap by up to 5x with less than 2pp accuracy loss, without retraining or group labels.

0 favorites 0 likes
#svd

SigmaScale: LLM Compression with SVD-based Low-Rank Decomposition and Learned Scaling Matrices

arXiv cs.CL · 2026-06-08 Cached

Introduces SigmaScale, a method that learns auxiliary scaling matrices for SVD-based LLM compression, showing competitive performance on Llama 3.1 8B and Qwen3-8B benchmarks.

0 favorites 0 likes
#svd

Spectral Unforgetting: Post-Hoc Recovery of Damaged Capabilities Without Retraining

arXiv cs.LG · 2026-05-21 Cached

This paper proposes DG-Hard, a post-hoc spectral repair method that recovers capabilities damaged by fine-tuning without retraining, using only the pretrained and fine-tuned checkpoints. It applies Donoho-Gavish hard singular-value thresholding to weight updates to remove noise and restore degraded performance.

0 favorites 0 likes
#svd

CERSA: Cumulative Energy-Retaining Subspace Adaptation for Memory-Efficient Fine-Tuning

arXiv cs.LG · 2026-05-12 Cached

The paper introduces CERSA, a novel parameter-efficient fine-tuning method that uses singular value decomposition to retain principal components, significantly reducing memory usage while outperforming existing methods like LoRA.

0 favorites 0 likes
← Back to home

Submit Feedback