Papers › A Complete Decomposition of KL Error using Refined Information and Mode Interaction Selection

A Complete Decomposition of KL Error using Refined Information and Mode Interaction Selection

15 Oct 2024arXiv:2410.11964archive 2025-07-28

James Enouen, Mahito Sugiyama

The log-linear model has received a significant amount of theoretical attention in previous decades and remains the fundamental tool used for learning probability distributions over discrete variables. Despite its large popularity in statistical mechanics and high-dimensional statistics, the vast majority of such energy-based modeling approaches only focus on the two-variable relationships, such as Boltzmann machines and Markov graphical models. Although these approaches have easier-to-solve structure learning problems and easier-to-optimize parametric distributions, they often ignore the rich structure which exists in the higher-order interactions between different variables. Using more recent tools from the field of information geometry, we revisit the classical formulation of the log-linear model with a focus on higher-order mode interactions, going beyond the 1-body modes of independent distributions and the 2-body modes of Boltzmann distributions. This perspective allows us to define a complete decomposition of the KL error. This then motivates the formulation of a sparse selection problem over the set of possible mode interactions. In the same way as sparse graph selection allows for better generalization, we find that our learned distributions are able to more efficiently use the finite amount of data which is available in practice. On both synthetic and real-world datasets, we demonstrate our algorithm's effectiveness in maximizing the log-likelihood for the generative task and also the ease of adaptability to the discriminative task of classification.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2410.11964")

Code

Syntology Ran 5 of 10 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 5 ran with no contract checked.

By repository: official repository: 10 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 5 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

5ran
5unverified

Licence: 10 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from EnouenJ/mode-attributing-hierarchy. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

KL EnouenJ/mode-attributing-hierarchy/utils/utils.py official repository ran fingerprinted no licence file found · pointer only · 571d357711340c7f · report
get_cumulative_index_sizes EnouenJ/mode-attributing-hierarchy/datasets/dataset_utils.py official repository ran fingerprinted no licence file found · pointer only · a465da79d2f5d42f · report
index_sizes_from_event_dict EnouenJ/mode-attributing-hierarchy/datasets/dataset_utils.py official repository ran no licence file found · pointer only · 20f9fde9cbfdbe18 · report
oneless EnouenJ/mode-attributing-hierarchy/utils/utils.py official repository ran no licence file found · pointer only · 29478703469dab21 · report
powerset EnouenJ/mode-attributing-hierarchy/models.py official repository ran no licence file found · pointer only · fb9020626aee2101 · report
build_nonstrict_frontier EnouenJ/mode-attributing-hierarchy/utils/MIS_utils.py official repository unverified no licence file found · pointer only · 690a1132df324307 · report
build_semistrict_frontier EnouenJ/mode-attributing-hierarchy/utils/MIS_utils.py official repository unverified no licence file found · pointer only · c4eab9ac4a12761f · report
constructWeakHigherInteractions EnouenJ/mode-attributing-hierarchy/utils/MIS_utils.py official repository unverified no licence file found · pointer only · f77b8898c144ec89 · report
powerset EnouenJ/mode-attributing-hierarchy/utils/utils.py official repository unverified no licence file found · pointer only · 70a2f7a8dd235c5f · report
read_categorical_only_from_CSV EnouenJ/mode-attributing-hierarchy/datasets/dataset_utils.py official repository unverified no licence file found · pointer only · b4f39a6a8f5d8ae5 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AttentionFocusSETSoftmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections