PulseAugur / Brief
EN
LIVE 00:03:06

Brief

last 24h
[2/2] 221 sources

Multi-source AI news clustered, deduplicated, and scored 0–100 across authority, cluster strength, headline signal, and time decay.

  1. TOOL · arXiv stat.ML English(EN) ·

    On the Suboptimality of GP-UCB under Polynomial Effective Optimism

    A new paper published on arXiv investigates the limitations of the Gaussian Process Upper Confidence Bound (GP-UCB) algorithm. Researchers have established upper bounds on its cumulative regret, but this work explores whether GP-UCB is truly minimax optimal. The study introduces a new regret lower bound for GP-UCB with Matérn kernels, indicating that polynomial growth in the effective optimism level hinders optimal regret rates. AI

    IMPACT Identifies a fundamental limitation in a widely used optimization algorithm, potentially guiding future research towards more optimal methods.

  2. RESEARCH · arXiv stat.ML English(EN) · · [2 sources]

    Adaptive RBF-KAN: A Comparative Evaluation of Dynamic Shape Parameters in Kolmogorov-Arnold Networks

    Researchers have developed an enhanced version of Kolmogorov-Arnold Networks (KANs) called adaptive RBF-KAN, which improves computational efficiency and flexibility. This new approach replaces the fixed Gaussian radial basis functions used in FastKAN with a broader family of kernels, including Matérn and Wendland types. The adaptive RBF-KAN utilizes leave-one-out cross-validation for data-driven initialization of kernel shape parameters, which are further refined during network training. Evaluations on benchmark functions demonstrate the effectiveness of adaptive kernel selection and shape parameters for various data patterns. AI

    IMPACT Introduces a more efficient and flexible neural network architecture that could improve performance on various benchmark functions.