Skip to main content
Search

University of Konstanz

2 related articles

Subscribe to updates
  1. arXiv

    Aggregation is itself a spectral valley: SpecValley learns where the valley sits, leading four of six heterophilic graphs

    In node classification on heterophilic graphs, the step before propagation has stayed fixed by degree normalisation, which acts spectrally as a valley whose zero is set by the normalisation rather than by the data, exactly where dense graphs' eigenvalues accumulate. SpecValley learns the valley's centre, sharpness and flank gains per graph, then feeds an ordinary ChebNet spectral filter. Across six heterophilic benchmarks it matches or exceeds the best published result on four, sits within the confidence interval of the best on Tolokers, and trails on Actor; crossing five aggregators with four filters attributes the gain to aggregation rather than to the downstream filter.

  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.

You’re all caught up