Skip to content
Back to skills

Topic Modelling Black Box Optimization

ASecurity

**arXiv ID:** 2512.16445 **Authors:** Roman Akramov, Artem Khamatullin, Svetlana Glazyrina, Maksim Kryzhanovskiy, Roman Ischenko **Published:** 2025-12-18T12:00:24Z **Abstract:** Choosing the number of topics $T$ in Latent Dirichlet Allocation (LDA) is a key design decision that strongly affects both the statistical fit and interpretability of topic models. In this work, we formulate the selection of $T$ as a discrete black-box optimization problem, where each function evaluation corresponds ...

  • 3 stars
  • 0 votes
  • 0 copies
  • 0 views
  • Added September 11, 2026
toolsgo

Security analysis

A100/100

Scanned September 11, 2026

npx -y skills add hiyenwong/ai_collection --skill topic-modelling-black-box-optimization --agent claude-code

Installs into .claude/skills of the current project.

Are you the author of Topic Modelling Black Box Optimization?

Add the live security badge to your README. It updates with every re-scan.

Security grade badge for Topic Modelling Black Box Optimization
[![Security: A — Skills Directory](https://www.skillsdirectory.com/api/skills/hiyenwong-topic-modelling-black-box-optimization/badge)](https://www.skillsdirectory.com/skills/hiyenwong-topic-modelling-black-box-optimization)

More formats (shields.io, HTML) on the badges page. Keep it an A: scan every change in CI with Pro.

Download with Pro
SKILL.md
# Topic Modelling Black Box Optimization

**arXiv ID:** 2512.16445
**Authors:** Roman Akramov, Artem Khamatullin, Svetlana Glazyrina, Maksim Kryzhanovskiy, Roman Ischenko
**Published:** 2025-12-18T12:00:24Z
**Abstract:**
Choosing the number of topics $T$ in Latent Dirichlet Allocation (LDA) is a key design decision that strongly affects both the statistical fit and interpretability of topic models. In this work, we formulate the selection of $T$ as a discrete black-box optimization problem, where each function evaluation corresponds to training an LDA model and measuring its validation perplexity. Under a fixed evaluation budget, we compare four families of optimizers: two hand-designed evolutionary methods - Genetic Algorithm (GA) and Evolution Strategy (ES) - and two learned, amortized approaches, Preferential Amortized Black-Box Optimization (PABBO) and Sharpness-Aware Black-Box Optimization (SABBO). Our experiments show that, while GA, ES, PABBO, and SABBO eventually reach a similar band of final perplexity, the amortized optimizers are substantially more sample- and time-efficient. SABBO typically identifies a near-optimal topic number after essentially a single evaluation, and PABBO finds competitive configurations within a few evaluations, whereas GA and ES require almost the full budget to approach the same region.

## Skill Description

This skill is generated from the arXiv paper: Topic Modelling Black Box Optimization (2512.16445).

## How to Use

[To be filled in by the user or by future automation]

## References

- [arXiv:2512.16445](http://arxiv.org/abs/2512.16445v1)

Attribution

Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.

Comments

Loading comments…