SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1212.4777 · 2012

A Practical Algorithm for Topic Modeling with Provable Guarantees

arXiv · PDF · Open in the Atlas

Code that ran

We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Topic models provide a useful method for dimensionality reduction and exploratory data analysis in large text corpora. Most approaches to topic model inference have been based on a maximum likelihood objective. Efficient algorithms exist that approximate this objective, but they have no provable guarantees. Recently, algorithms have been introduced that provide provable bounds, but these algorithms are not practical because they are inefficient and not robust to violations of model assumptions. In this paper we present an algorithm for topic model inference that is both provable and practical. The algorithm produces results comparable to the best MCMC implementations while running orders of magnitude faster.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1212.4777")
get_code_for_paper("1212.4777")
have("1212.4777")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1212.4777.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1212.4777.svg)](https://syntology.ai/paper/1212.4777)

Connect an agent — have() is free.