AI自主设计无线资源管理算法,效率比人工高600倍。
Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role

- AI自动修改模型架构、损失函数等,基于单一指标迭代优化。
- 26小时内完成81次实验,性能达基准99.5%,推理成本降低600倍。
- 发现可证明的最优结构,适用于不同网络规模和性能目标。
为无线资源管理设计机器学习算法耗时费力,需人工指定模型架构、损失函数和训练策略。本文展示可将这一设计环节完全交由自主代理完成。采用自研究(autoresearch)协议:AI编码代理修改训练脚本,运行固定预算实验,并根据单一不变指标决定是否保留变更。代理被赋予对模型族、输入表示、输出参数化、损失函数及任务采样方式的全权,目标设定为多小区网络中对细胞边缘吞吐量的最小百分位速率优化。该问题非凸、非光滑且在远离最大最小顶点时强NP难。通过哈希锁定评估器、强制推理契约及每实验预注册的可证伪者保障结果可信。在26小时内的81次无人值守实验中,代理以单次固定成本推理达到收敛的最小化-最大化参考方案的99.5%,推理成本约为其1/600,从首个有效架构起即缩小了94%的差距,且仅用一组参数适配所有网络规模与百分位目标。所发现的输出参数化能精确复现任意权重下的最大最小最优分配,于最小百分位处成立。
原文摘要 · Abstract (English)
Designing machine learning algorithms for wireless resource management is labour-intensive: the architecture, the loss function and the training recipe are all specified by hand. We demonstrate that this design layer can be surrendered to an autonomous agent in its entirety. We adopt the autoresearch protocol, in which an AI coding agent edits a training script, runs a fixed-budget experiment, and retains or discards the change according to a single immutable metric. We grant the agent authority over the architecture family, the input representation, the output parameterization, the loss function and the task-sampling law, and set it a target chosen for its difficulty: sum-least-percentile-rate power control across a multicell network. The formulation targets cell-edge throughput and is non-convex, non-smooth and strongly NP-hard away from its max-min vertex. Safeguards render the results trustworthy: a hash-pinned evaluator, an enforced inference contract and a pre-registered falsifier per experiment. In eighty-one unattended experiments over twenty-six hours, the agent reached $99.5\%$ of a converged minorization-maximization reference in one fixed-cost inference pass, at roughly $600\times$ lower inference cost, closing $94\%$ of the gap from its first working architecture, with one parameter set serving every network size and percentile target. It recovered provable structure rather than tuned constants: the output parameterization it discovered reproduces the exact max-min-optimal allocation at the minimum percentile, for every value of the trained weights.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。