6 articles tagged with #tensor-networks. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers propose EinSort, an adaptive tensorization method that uses index ordering to identify and compress low-rank structures in large language models, demonstrating improved results for weight and KV-cache compression compared to existing approaches.
Researchers introduce Deep Tree Tensor Networks (DTTN), a novel neural architecture originating from quantum physics that captures exponential-order feature interactions for image recognition. The model demonstrates superior performance across multiple benchmarks while maintaining parameter efficiency through tree-like topology, potentially advancing interpretable AI research.
Researchers demonstrate a case study using large language models (LLMs) with OpenEvolve to optimize contraction orders in tensor networks, highlighting both the potential of verifier-guided evolutionary coding agents for algorithm development and the critical importance of human validation, evaluation metrics, and rigorous testing in AI-assisted research.
Researchers introduce Automatically Differentiable Nonlinear Tensor Networks (ADNTNs), a novel technique for compressing deep neural networks by building large weight tensors from hierarchical small cores with nonlinear activations. The method achieves compression ratios from 2,000× to 77,000× on standard architectures like AlexNet and VGG-16 while maintaining or improving accuracy, representing a mathematically structured approach to reducing model size.
Researchers introduce TN-SHAP-G, a machine learning framework that efficiently computes Shapley values—a key method for explaining AI model decisions—by leveraging graph structure in data. The approach uses tensor networks to create compact surrogates that scale to larger datasets where traditional methods become computationally infeasible.
Researchers have developed new parameterization methods for squared tensor networks and circuits that eliminate computational overhead in marginalization and partition function calculations. By leveraging unitary matrix parameterizations inspired by orthogonality and determinism principles, the approach maintains expressiveness while enabling more efficient machine learning applications without the traditional squaring operation complexity.
