Pith. sign in

REVIEW 2 cited by

LLM-Forest: Ensemble Learning of LLMs with Graph-Augmented Prompts for Data Imputation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.21520 v4 pith:VX4YFMXB submitted 2024-10-28 cs.LG cs.CL

classification cs.LGcs.CL
keywords dataimputationlearningllm-forestensembleforestframeworkllms
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Missing data imputation is a critical challenge in various domains, such as healthcare and finance, where data completeness is vital for accurate analysis. Large language models (LLMs), trained on vast corpora, have shown strong potential in data generation, making them a promising tool for data imputation. However, challenges persist in designing effective prompts for a finetuning-free process and in mitigating biases and uncertainty in LLM outputs. To address these issues, we propose a novel framework, LLM-Forest, which introduces a "forest" of few-shot prompt learning LLM "trees" with their outputs aggregated via confidence-based weighted voting based on LLM self-assessment, inspired by the ensemble learning (Random Forest). This framework is established on a new concept of bipartite information graphs to identify high-quality relevant neighboring entries with both feature and value granularity. Extensive experiments on 9 real-world datasets demonstrate the effectiveness and efficiency of LLM-Forest.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. APEX$^2$: Adaptive and Extreme Summarization for Personalized Knowledge Graphs

    cs.LG 2024-12 conditional novelty 5.0 of 10

    APEX2 maintains an extremely small personalized knowledge graph by decaying old interest scores, diffusing new query heat, and incrementally re-sorting triples, outperforming static summarizers in simulated evolving-q...

  2. Local Clustering on Complex Graphs and Complex Hypergraphs

    cs.SI 2024-12 conditional novelty 5.0 of 10

    GeneralACL and HyperACL find local clusters with conductance O(sqrt(optimal)) on weighted directed self-looped graphs and EDVW hypergraphs with probability at least 1/2 under two conditions.

Pith tools