Skip to main content
Search

# Multi-Armed Bandit

4 related articles

Subscribe to updates
  1. Modular XL-MIMO beam training stops sweeping the full codebook: parallax lays out candidates, statistics prune the noise-only sectors

    Beam training for modular extremely large antenna arrays in hybrid near- and far-field environments no longer keeps a fixed candidate codebook. Prior subarray schemes relied on predefined codebooks or activation patterns and adapted poorly to spatially non-stationary channels; this scheme builds a parallax-aware initial codebook covering each subarray's angular shift, then learns online with a multi-armed bandit, and once a statistical steady state is detected it projects beams across subarrays and prunes noise-only sectors with a likelihood ratio test, compressing the action space. In simulation the scheme's effective spectral efficiency exceeds three comparison schemes across the evaluated SNR range, with markedly reduced training overhead.

  2. A honeybee swarm's hive mind behaves like one reinforcement learning agent, with each scout a parallel bandit sample

    When honeybees choose a nest site, individuals blindly switch to the option advertised most strongly by neighbors, and this local imitation is shown to be equivalent, at the group level, to a single online reinforcement-learning agent solving a multi-armed bandit. That macro-agent updates nest-site probabilities by a rule named Maynard-Cross Learning, with each scout acting as one parallel action-reward sample. The derivation covers the weighted voter model, a simplified description, and simulations indicate roughly 500 scouts suffice to track the macro-dynamics and converge on the best site.

  3. arXiv

    Boundary tests for conversational agents stop guessing: conditions pulled from replies lift explicitly valid tests to 62.7%–83.3%

    Boundary testing of conversational agents gets a new route: instead of inferring expected behavior from workflow-graph nodes and edges, statements describing one policy condition and the behavior expected when it holds are extracted from the agent's replies in exploratory conversations, then paired with test transformation instructions. Across four domains, 62.7% to 83.3% of tests are valid boundary tests whose expected behavior is explicitly defined by the prompt, tool code, or knowledge base, above the 47.7% to 68.1% of prior AgentEval suites; transformed tests add 13 to 46 explicit boundaries.

  4. OptimAI turns natural-language optimization problems into solver code with a multi-agent LLM pipeline, reaching 88.1% on NLP4LP and 82.3% on Optibench and cutting error rates by 58% and 52% over the prior best

    The work introduces OptimAI, an LLM-powered multi-agent framework that takes a natural-language optimization problem through four stages—formulation, planning, solver code generation, and reflective debugging—and adds UCB-based debug scheduling to switch dynamically among candidate plans; under zero-shot prompting it reaches 88.1% accuracy on NLP4LP with GPT-4o+o1-mini and 82.3% on Optibench with DeepSeek-R1, reducing error rates by 58% and 52% over the prior best, while ablations show that removing the planner or code critic drops productivity by 5.8× and 3.1× and that enabling UCB debug scheduling adds a further 3.3× productivity gain.

You’re all caught up