- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies how to use a small LLM to make constrained resource allocation decisions. The concrete setting is channel allocation for Wi-Fi 7 MLO, i.e., deciding which channel each station connects to on each frequency band, which maximizes the total network throughput while satisfying the constraints. The paper proposes CoWA, which splits the task into two parts. A controller calls a set of domain tools (pairwise distances, channel-specific conflict graphs, conflict intensity, channel loads, initial groups, and zero-link STAs) and writes their results into the prompt together with the network state, and then the LLM decides the final allocation. The training includes three stages, (i) organizing the network state, constraints, tools, and output format into a unified text interface, (ii) SFT cold start on tool-augmented trajectories, and (iii) GRPO optimization with a reward composed of the simulator's throughput, format correctness, and allocation validity. The paper runs experiments with Llama-3.1-8B in a simulated environment. Its throughput is close to that of a prompt-engineered GPT-5.2 and of the search-based method BAI-MCTS.
Critical strengths
None. I cannot identify any strength of this paper. In my opinion, the contribution is merely a fairly straightforward adaptation of conventional LLM fine-tuning to a Wi-Fi scenario. The motivation, the challenges, and the intuition of the solution are all unclear, and I do not see any value brought by using an LLM for decision-making.
Critical weaknesses
-
The motivation for using an LLM is unclear. (i) The LLM's input consists only of numbers such as coordinates, channels, and carrier-sensing radius, plus the distances and conflict results already computed by the tools. All physical knowledge about the channels is handled by the tools and the simulator, and (in my opinion) the LLM itself does not understand this physical knowledge. If so, why use an LLM instead of a GNN, an MLP, or a conventional optimization method? The paper also does not analyze what the LLM actually learns or what it adds on top of the tools' heuristic results. (ii) The paper is motivated by the fact that search methods need thousands of evaluations per instance, but there is no systematic comparison with the cost of search methods. The runtime of BAI-MCTS is not reported at all. Only the runtimes of CoWA and GPT-5.2 are compared, and I think the comparison is unfair, since they run on different hardware (i.e., authors' own device vs. OpenAI server).
-
The paper keeps emphasizing agents and tool calling, but there is no real agent or tool calling. The 6 tools are called by the controller in a predefined order before LLM inference, all their results are fed to the LLM, and the LLM never chooses a tool. This is closer to prompt-engineered context than to real agentic tool calling. Yet the paper calls it an LLM agent in the abstract, the introduction, and Figure 3, and discusses it alongside ReAct, Toolformer, AgentTuning, and similar works in the related work. The framing does not match what is actually done. Without this framing, the method is essentially SFT and GRPO on a prompt augmented with domain features, and the novelty is limited.
-
The experiments are insufficient to support the paper's conclusions. (i) I feel there are a lot of naive baselines that should be compared. The tools already compute an initial allocation, and the LLM mainly completes it and adds links on top of it. However, the paper does not compare with simply using the tool results plus a simple completion rule, nor does it give the same tool results to GPT-5.2 or to an untrained Llama-8B. If these alternatives perform similarly, the LLM step contributes almost nothing. (ii) The improvement is too small. As shown in Figure 4, the average throughputs of CoWA, GPT-5.2, and BAI-MCTS differ by only ~1%, and I also notice that the BAI-MCTS baseline achieves higher throughput with 6 and 12 STAs. (iii) The experiments consider only one simulated case with a fixed setting of 3 BSSs and 3 channels. The paper needs to consider more diverse settings to demonstrate the generalization of the proposed method, especially when the LLM faces more BSSs and more channels, where the large amount of numerical input may cause the LLM to overlook part of the information during reasoning and make wrong decisions.
Questions for authors
- I am not sure about the rationale and intuition for using an LLM for this kind of problem, i.e., Wi-Fi resource allocation. Specifically, without the fine-tuning proposed in the paper, does the LLM already understand this physical information? Do more capable LLMs understand this information better? This would be one motivation for the proposed method. If they already understand it, does the paper's fine-tuning teach them how to allocate resources? If they do not, does the fine-tuning teach them to understand this information, or does it merely make them memorize these numbers and make decisions?
- I suggest that the authors compare the end-to-end cost of conventional methods and the LLM. In particular, can the thousands of searches in conventional methods be parallelized? Please make a fair comparison, for example on the same hardware as well as on several typical deployment platforms (e.g., edge devices).
- In the real world, can any system tolerate such a long LLM inference time (36.50 seconds per allocation on average)?