ExplorerData ScienceMachine Learning
Research PaperResearchia:202608.27004

Agentic Autoresearch for Cell-Edge Power Control: Radically Redefining the Researcher's Role

Ahmad Khan

Abstract

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...

Submitted: August 27, 2026Subjects: Machine Learning; Data Science

Description / Details

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%99.5\% of a converged minorization-maximization reference in one fixed-cost inference pass, at roughly 600×600\times lower inference cost, closing 94%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.


Source: arXiv:2608.26093v1 - http://arxiv.org/abs/2608.26093v1 PDF: https://arxiv.org/pdf/2608.26093v1 Original Link: http://arxiv.org/abs/2608.26093v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Aug 27, 2026
Topic:
Data Science
Area:
Machine Learning
Comments:
0
Bookmark