AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 7 of 68 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Foundation models supply reinforcement learning (RL) with priors that mitigate its longstanding weaknesses in sample efficiency and transfer, but their token-by-token generation makes queries sequential and costly. Jev, a recently released decision model, generates nothing and returns calibrated, typed answers in a sin...
Despite the wide deployment of memory in large-model agents, there is no unified formal account of what a memory is or when it is optimal. This paper takes a first step toward this account. The central idea is that memory is a basis, knowledge is its span, and answerability is a coverage problem: an agent stores events...
PACE (Pre-execution Admission via Code Embeddings), an online-adaptive admission control framework that improves budgeted sample efficiency by estimating candidate utility prior to execution from within-run execution history, without training a separate offline predictor.
This paper proposes Generalized Agent Iteration (GAI), a formal framework that describes iterative policy improvement and RSI as two cases of a single learning paradigm that rests on the classical account, makes existing systems comparable, and provides a principled basis for analyzing and designing new ones.
FANS is presented, a generalization-oriented structured network framework that promotes flatter and robust policy learning by guiding the optimization trajectory through modular architectural design and validate the effectiveness of FANS in mitigating overestimation and promoting generalization.
Large Language Model (LLM)-driven AutoML agents have shown strong capabilities in constructing end-to-end machine learning pipelines. However, their effectiveness is limited by costly execution-based feedback, which can make the search for high-quality solutions inefficient under restricted computational budgets. We pr...
This work proposes LaRes, a novel hybrid framework that achieves efficient policy learning through reward function search by leveraging large language models to generate the reward function population, guiding RL in policy learning.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.