arXiv Machine Learning August 7, 2026 By Sriram Loganathan, Gokul Anand, Aung Bo Bo, Yourui Shao, William B. Andreopoulos

Sparse Mutual Information Graph Averaging for Improving Random Indexing Embeddings

Read the original on arXiv Machine Learning →

arXiv:2608. 05724v1 Announce Type: cross Abstract: Sparse word embedding pipelines can avoid dense co-occurrence matrix materialization, dense factorization, and gradient training while still relying on sparse global corpus statistics.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers

Aug 6

Sparse Mutual Information Graph Averaging for Improving Random Indexing Embeddings

Sparse word embedding pipelines can avoid dense co-occurrence matrix materialization, dense factorization, and gradient training while still relying on sparse global corpus statistics. This paper studies Random Indexing (RI) vectors refined by weighted averaging on a sparse Positive Pointwise Mutual Information (PPMI) graph.

rag nlp efficiency

arXiv Computation and Language

Aug 25

Sparse PPMI Graph Averaging for Random Indexing Embeddings

arXiv:2608.05724v2 Announce Type: replace Abstract: We study a specific sparse post-processing pipeline for Random Indexing (RI) on kinship analogies in a small fairytales corpus. The published artif...

By Sriram Loganathan, Gokul Anand, Aung Bo Bo, Yourui Shao, William B. Andreopoulos

rag benchmarks

arXiv AI

Jun 2

Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs

arXiv:2606. 01400v1 Announce Type: cross Abstract: Evaluating large language models (LLMs) across comprehensive benchmarks is expensive and time-consuming.

By Denica Kjorvezir, Marko Djukanovi\'c, Ana Gjorgjevikj, Gjorgjina Cenikj, Tome Eftimov

llms rag benchmarks

arXiv Machine Learning

Aug 18

Domain-Agnostic Neural Topic Modeling with Contextual Token-Level Semantic Graph Representation

arXiv:2608. 16269v1 Announce Type: cross Abstract: Recent advances in neural topic models with pre-trained language models (PLMs) have achieved strong performance by leveraging general-domain pre-training, yet their topic interpretability often degrades on specialized corpora.

By Seung-Won Seo, Won Ik Cho, Yongmin Yoo

llms rag fine-tuning benchmarks safety

arXiv AI

Jun 19

IHUBERT: Vector-Based Semantic Deduplication and Domain-Balanced Pretraining for Persian Resources

arXiv:2606. 20089v1 Announce Type: cross Abstract: Persian pretrained language models (PLMs) are still limited by the scarcity of large-scale, high-quality pretraining corpora and by insufficient evaluation beyond standard classification and NER tasks.

By Arash Ghafouri, Mahdi Firouzmandi, Hossein Saberi, Mohammad Reza Hasani Ahangar

llms nlp benchmarks

arXiv AI

Jun 30

Measuring Graph-to-Graph Semantic Similarity in Knowledge Graphs: An Empirical Evaluation of Knowledge Graph Embeddings

arXiv:2606. 29180v1 Announce Type: new Abstract: A Knowledge Graph (KG) represents facts as structured triples and is widely used to organize relational knowledge across diverse domains.

By Seungryeol Baek, Wooseok Sim, Hogun Park

rag

One email a morning, machine-written

Related stories

Sparse Mutual Information Graph Averaging for Improving Random Indexing Embeddings

Sparse PPMI Graph Averaging for Random Indexing Embeddings

Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs

Domain-Agnostic Neural Topic Modeling with Contextual Token-Level Semantic Graph Representation

IHUBERT: Vector-Based Semantic Deduplication and Domain-Balanced Pretraining for Persian Resources

Measuring Graph-to-Graph Semantic Similarity in Knowledge Graphs: An Empirical Evaluation of Knowledge Graph Embeddings