- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper introduces INFLENS, which uses a location game in a fixed prompt-trait space to determine both LoRA expert training weights and inference routing. It derives a kernel-general local instability criterion for positional separation. Experiments on a mixture of seven safety-related datasets demonstrate correspondence between allocation shares and expert quality, together with NLL improvements over pooling and several routing baselines.
Critical strengths
The method provides an explicit connection between training-data allocation and inference routing without fitting the router to expert losses. The local stability analysis offers a useful account of when competitive positions separate.
The extensive controls examine allocation sharpness, initialization, fixed positions, routing rules, and model families. The paper also clearly distinguishes single-expert selection from probability mixing and acknowledges negative behavioral results.
Critical weaknesses
Limited generalization evidence. The trait space is constructed using the full dataset, including test examples and benchmark annotations. Performance without access to the test population remains unverified.
Unclear benefit of the game objective. The clustering baseline does not match INFLENS’s dense, share-weighted training, making it difficult to separate the benefits of competitive positioning from those of soft data weighting.
Questions for authors
Which annotations from validation and test examples enter trait-axis estimation? How do routing accuracy and NLL gains change when the axes, normalization, and game positions are fitted exclusively on training data?
Does INFLENS outperform a soft-clustering allocation using the same trait space, information access, dense training weights, expert count, and training budget? This comparison would help establish the contribution of the game objective.
2 comments
Thank you for the response. Most of my concerns about the experiments have been addressed. However, considering the manuscript’s overall quality, I am inclined to maintain my current score.
Thank you for recognizing the connection between training-data allocation and inference routing, the local stability analysis, and the breadth of the controls. We ran both experiments you requested on three data splits. The allocation remains predictive when the trait space is fitted on training data alone, and the matched comparison shows that the game's Dirichlet allocation performs well with either equilibrium or k-means positions.
"Gain" is the reduction in held-out NLL relative to the pooled adapter trained on the same data, in nats per token (higher is better; mean ± sample SD over the three splits).
W1 and Q1: Information used to construct the trait space
In the submitted experiments, trait-axis estimation used each source benchmark's annotations for all records, including validation and test records: the unsafe-response flag (BeaverTails), faithful versus hallucinated response (HaluEval), harmful versus benign goal (JBB-Behaviors), fraction of characters covered by PII spans (AI4Privacy), seemingly toxic benign prompt versus toxic control (OR-Bench), the binary injection label, and refusal-worthy versus benign instruction (Do-Not-Answer). Quantile normalization and resource-density estimation also used all prompts.
The annotations describe the dataset's prompts and reference responses, not our models' outputs, and test records did not enter adapter optimization, gate fitting, or expert-loss feedback. They did contribute to the resource map, so your concern about access to the test population is valid.
We refitted the axes, normalization, resource density, and equilibrium initialization on the training partition only, then retrained the experts.
The training-only version has slightly higher routed NLL on all three splits. The paired reduction in gain is 0.0091 ± 0.0027 nats, about 8% of the original improvement, and top-1 agreement falls by 1.6 percentage points. The hindsight-best gain is unchanged (paired difference 0.0000 ± 0.0009 nats).
The third row also removes benchmark annotations: we clustered the training prompt embeddings with k-means and built one cluster-versus-rest direction per cluster. The allocation still identifies the best expert for 81% of prompts, against 15% for the shuffled baseline.
W2 and Q2: Matched comparison with soft clustering
The comparison matches the trait space, resource information, dense share-weighted training, seven expert pairs, and training budget, with positions frozen in every arm.
Comparison with soft clustering. Relative to soft k-means with its fitted Gaussian bandwidth, InflEns improves NLL by 0.010 ± 0.001 nats when one expert is sampled, about 0.006 under argmax routing, and 0.002 under probability mixing.
Positions and allocation. Replacing the game's equilibrium positions with k-means centroids while keeping the Dirichlet allocation gives nearly identical performance (paired difference 0.0006 ± 0.0007 nats). The game reaches positions of comparable quality through its competitive objective, without a separate clustering step. We do not claim better positions on this distribution.
With k-means centroids, the Dirichlet kernel's gains exceed those of sharpness-matched Gaussian soft k-means by about 0.006 to 0.009 nats. Together with the position control, this supports an important role for the allocation rule in expert learning and routing. Reach has a smaller effect: matching the game's sharpness improves sampling gain by 0.0034 nats but reduces argmax and mixture gains by 0.0025 and 0.0027, so no single reach is best for every routing rule.
Contribution of the game formulation. Before any adapter is trained, the game provides a criterion for when a co-located configuration becomes locally unstable to positional separation. The criterion depends explicitly on the number of players and applies to general influence kernels, including the Dirichlet kernel used here. The framework links these analytically characterized allocations to both expert training and inference.