Pith. sign in

REVIEW 2 cited by

Confidence Threshold Neural Diving

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 2202.07506 v2 pith:4RGNEPCM submitted 2022-02-15 math.OC cs.AIcs.DMcs.LGcs.NE

classification math.OCcs.AIcs.DMcs.LGcs.NE
keywords confidencemethodbettercompetitiondivingneuralprimalsolution
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Finding a better feasible solution in a shorter time is an integral part of solving Mixed Integer Programs. We present a post-hoc method based on Neural Diving to build heuristics more flexibly. We hypothesize that variables with higher confidence scores are more definite to be included in the optimal solution. For our hypothesis, we provide empirical evidence that confidence threshold technique produces partial solutions leading to final solutions with better primal objective values. Our method won 2nd place in the primal task on the NeurIPS 2021 ML4CO competition. Also, our method shows the best score among other learning-based methods in the competition.

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. SPL-LNS: Sampling-Enhanced Large Neighborhood Search for Solving Integer Linear Programs

    cs.LG 2025-08 unverdicted novelty 6.0 of 10

    SPL-LNS replaces the greedy proposal step in neural Large Neighborhood Search with sampling over locally-informed proposals, trained by hindsight relabeling on self-generated data, and reports large gains over prior n...

  2. SORREL: Suboptimal-Demonstration-Guided Reinforcement Learning for Learning to Branch

    cs.LG 2024-12 conditional novelty 5.0 of 10

    SORREL combines offline reinforcement learning on suboptimal demonstrations with self-imitation finetuning to learn branching policies that match expert-trained solvers.

Pith tools