Pith. sign in

REVIEW 9 cited by

Artificial Kuramoto Oscillatory Neurons

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.13821 v3 pith:O37O32M3 submitted 2024-10-17 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords neuronsakornkuramotorepresentationsartificialdynamicalgithubhttps
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It has long been known in both neuroscience and AI that ``binding'' between neurons leads to a form of competitive learning where representations are compressed in order to represent more abstract concepts in deeper layers of the network. More recently, it was also hypothesized that dynamic (spatiotemporal) representations play an important role in both neuroscience and AI. Building on these ideas, we introduce Artificial Kuramoto Oscillatory Neurons (AKOrN) as a dynamical alternative to threshold units, which can be combined with arbitrary connectivity designs such as fully connected, convolutional, or attentive mechanisms. Our generalized Kuramoto updates bind neurons together through their synchronization dynamics. We show that this idea provides performance improvements across a wide spectrum of tasks such as unsupervised object discovery, adversarial robustness, calibrated uncertainty quantification, and reasoning. We believe that these empirical results show the importance of rethinking our assumptions at the most basic neuronal level of neural representation, and in particular show the importance of dynamical representations. Code:https://github.com/autonomousvision/akorn Project page:https://takerum.github.io/akorn_project_page/

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 9 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Global synchronization beyond dense graphs: the case of threshold graphs

    math.DS 2025-11 conditional novelty 8.0 of 10

    Connected threshold graphs—built by repeatedly adding isolated or universal vertices—are globally synchronizing for the homogeneous Kuramoto model at any edge density.

  2. Understanding LoRA as Knowledge Memory: An Empirical Analysis

    cs.LG 2026-03 conditional novelty 7.0 of 10

    LoRA modules function as composable knowledge memories for LLMs with measurable storage capacity, internalization efficiency, and advantages in multi-module long-context reasoning.

  3. Traveling Waves Integrate Spatial Information Through Time

    cs.CV 2025-02 conditional novelty 7.0 of 10

    Wave-producing recurrent neural networks with time-series readouts outperform local feed-forward models and rival larger U-Nets on semantic segmentation.

  4. Improving Neural Network Training by Decoupling the Magnitude and Direction of Weight Vectors

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    Splitting weight matrices into a fixed-norm direction and learnable per-row/column magnitudes improves LLM training over AdamW/Muon, removes weight decay and warmup, and transfers the optimal LR across width.

  5. Solving Sudoku using oscillatory neural networks

    cond-mat.dis-nn 2025-08 reject novelty 6.0 of 10

    A Kuramoto oscillator network with one phase per cell can solve easy Sudoku puzzles in simulation and beats a Hopfield baseline, but fails on puzzles with many empty cells.

  6. Sudoku-Bench: Evaluating creative reasoning with Sudoku variants

    cs.AI 2025-05 conditional novelty 6.0 of 10

    A new 100-puzzle Sudoku-variant benchmark is hard for frontier LLMs, which solve under 15 percent unaided.

  7. Graph Coloring Approach to Solving Sudoku with Oscillatory Neural Networks

    cs.LG 2026-07 conditional novelty 5.0 of 10

    A Kuramoto-oscillator network with an added rule-violation repulsion term solves 4x4 Sudoku near-perfectly and 9x9 Sudoku with high accuracy at low-to-moderate unknown-digit ratios, outperforming prior HNN/ONN solvers.

  8. Designing learning in high dimensional oscillator networks with low dimensional read-out

    nlin.CD 2025-08 conditional novelty 5.0 of 10

    A mean-field Kuramoto reservoir with only population-averaged phases as read-out can predict time series, with numerical evidence that chaotic Lorenz dynamics need at least four oscillator populations.

  9. GASPnet: Global Agreement to Synchronize Phases

    cs.LG 2025-07 conditional novelty 5.0 of 10

    A CNN augmented with global attention-driven phase synchronization (GASPnet) outperforms a parameter-matched CNN on noisy multi-object and superimposed-image classification.

Pith tools