{"slug": "visibility-graph-representations-of-word-embeddings-for-text-classification", "title": "Visibility Graph Representations of Word Embeddings for Text Classification", "summary": "A paper on arXiv (2611.22685v1) reports that natural visibility graph representations of averaged word embeddings reached 91.24% accuracy on the four-class AG News benchmark at a 1,000-word vocabulary selected by chi-square, the best result among the configurations tested from 700 selected words onward with a fully connected classifier. The degree-based graph input exceeded a BERT-based baseline by 0.29 percentage points at 1,500 words, and in a separate convolutional comparison the adjacency-matrix input reached 86.16% at 1,000 words versus 83.12% for the strongest static embedding. The authors compared graph inputs against continuous bag-of-words, skip-gram, GloVe, FastText and BERT representations across vocabulary budgets of 100 to 1,500 words, and note that controls are needed to establish the reliability of the small differences observed.", "body_md": "arXiv:2611.22685v1 Announce Type: new \nAbstract: Text classifiers depend on representations that expose the distinctions between classes in a form the learning model can use, and a restricted vocabulary changes which representation is most effective. This paper studies natural visibility graphs as an intermediate representation for news topic classification under controlled vocabulary budgets. Word embeddings are averaged into a fixed-length document vector, the vector is read as an ordered numerical series, and its natural visibility graph is passed to a classifier either as an ordered node-degree vector or as an adjacency matrix. On the four-class AG News benchmark, chi-square selection retains 100 to 1,500 words, and the graph inputs are compared with direct embedding-based representations from continuous bag-of-words, skip-gram, GloVe, FastText and BERT. With a fully connected classifier, the degree representation is the most accurate configuration from 700 selected words onward; it reaches its highest accuracy of 91.24% at 1,000 words and exceeds the BERT-based baseline by 0.29 percentage points at 1,500 words. In a separate convolutional comparison, the adjacency input reaches 86.16% at 1,000 words, against 83.12% for the strongest static embedding. The results indicate that visibility-derived features can be competitive once the selected vocabulary provides adequate coverage. We discuss the roles of graph compression, coordinate ordering and classifier choice, and the controls needed to establish the reliability of the small differences observed.", "url": "https://wpnews.pro/news/visibility-graph-representations-of-word-embeddings-for-text-classification", "canonical_source": "https://www.machinebrief.com/news/visibility-graph-representations-of-word-embeddings-for-text-1fsx", "published_at": "2026-11-19 05:00:00+00:00", "updated_at": "2026-11-19 07:43:29.222862+00:00", "lang": "en", "topics": ["natural-language-processing", "machine-learning", "ai-research"], "entities": ["arXiv", "AG News", "BERT", "GloVe", "FastText"], "also_reported_by": [], "takeaway": "Reading an averaged document embedding as an ordered series and classifying its natural visibility graph's node-degree vector beat a BERT-based baseline by 0.29 points at 1,500 selected words and hit 91.24% at 1,000 words on AG News.", "recommendation": null, "alternates": {"html": "https://wpnews.pro/news/visibility-graph-representations-of-word-embeddings-for-text-classification", "markdown": "https://wpnews.pro/news/visibility-graph-representations-of-word-embeddings-for-text-classification.md", "text": "https://wpnews.pro/news/visibility-graph-representations-of-word-embeddings-for-text-classification.txt", "jsonld": "https://wpnews.pro/news/visibility-graph-representations-of-word-embeddings-for-text-classification.jsonld"}}