Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yilong Song

dblp:405/4636 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Optimization for machine learning · 43% Language models and text generation · 29% Efficient and distributed learning · 14%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
communication compression
0.912025
Distributed Retraction-Free and Communication-Efficient Optimization on the Stiefel Manifold · ICML 2025
Machine learning › Optimization for machine learning
distributed optimization
0.912025
Distributed Retraction-Free and Communication-Efficient Optimization on the Stiefel Manifold · ICML 2025
Machine learning › Trustworthy machine learning
language model interpretability
0.912025
Hierarchical Frequency Tagging Probe (HFTP): A Unified Approach to Investigate Syntactic Structure Representations in Large Language Models and the Human Brain · NeurIPS 2025
Machine learning › Optimization for machine learning
riemannian optimization
0.912025
Distributed Retraction-Free and Communication-Efficient Optimization on the Stiefel Manifold · ICML 2025
Machine learning › Optimization for machine learning › riemannian optimization
stiefel manifold
0.912025
Distributed Retraction-Free and Communication-Efficient Optimization on the Stiefel Manifold · ICML 2025
Natural language and speech › Language models and text generation › text representation
syntactic representation
0.912025
Hierarchical Frequency Tagging Probe (HFTP): A Unified Approach to Investigate Syntactic Structure Representations in Large Language Models and the Human Brain · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

stochastic gradient descent · 0.9representational similarity analysis · 0.9momentum · 0.9landing algorithm · 0.9intracranial recordings · 0.9frequency-domain analysis · 0.9error feedback · 0.9
YearPublicationVenuePosition
2025 Distributed Retraction-Free and Communication-Efficient Optimization on the Stiefel Manifold
abstract
Optimization problems on the Stiefel manifold, ranging from principal component analysis to enhancing neural network robustness, are ubiquitous in machine learning. The Landing algorithm avoids computationally expensive retraction operations on manifolds, making it highly competitive for large-scale problems. This paper extends this method to distributed settings, introducing EF-Landing, the first retraction-free and communication-efficient algorithm for distributed stochastic optimization on the Stiefel manifold. By incorporating communication compression and error feedback, EF-Landing ensures convergence and constraint feasibility while significantly reducing communication overhead. We provide sharp convergence guarantees, demonstrating that EF-Landing achieves the same asymptotic linear speedup convergence rate as existing methods without communication compression. Furthermore, our analysis is highly versatile, applying to both deterministic and stochastic settings and encompassing algorithms based on gradient descent or momentum-based gradient descent. We also generalize EF-Landing to operate on block-wise Stiefel manifolds, enabling greater flexibility for structured constraints. Extensive numerical experiments validate our theoretical results.
Yilong Song, Peijin Li
ICML1
2025 Hierarchical Frequency Tagging Probe (HFTP): A Unified Approach to Investigate Syntactic Structure Representations in Large Language Models and the Human Brain
abstract
Large Language Models (LLMs) demonstrate human-level or even superior language abilities, effectively modeling syntactic structures, yet the specific computational units responsible remain unclear. A key question is whether LLM behavioral capabilities stem from mechanisms akin to those in the human brain. To address these questions, we introduce the Hierarchical Frequency Tagging Probe (HFTP), a tool that utilizes frequency-domain analysis to identify neuron-wise components of LLMs (e.g., individual Multilayer Perceptron (MLP) neurons) and cortical regions (via intracranial recordings) encoding syntactic structures. Our results show that models such as GPT-2, Gemma, Gemma 2, Llama 2, Llama 3.1, and GLM-4 process syntax in analogous layers, while the human brain relies on distinct cortical regions for different syntactic levels. Representational similarity analysis reveals a stronger alignment between LLM representations and the left hemisphere of the brain (dominant in language processing). Notably, upgraded models exhibit divergent trends: Gemma 2 shows greater brain similarity than Gemma, while Llama 3.1 shows less alignment with the brain compared to Llama 2. These findings offer new insights into the interpretability of LLM behavioral improvements, raising questions about whether these advancements are driven by human-like or non-human-like mechanisms, and establish HFTP as a valuable tool bridging computational linguistics and cognitive neuroscience. This project is available at https://github.com/LilTiger/HFTP.
Jingmin An, Yilong Song, Ruolin Yang 0006, Nai Ding, Lingxi Lu, Chu Zhuang
NeurIPS2