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

Junlong Jia

dblp:371/2687 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—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 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 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
Deep learning architectures and training · 38% Learning theory · 38% Language models and text generation · 25%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › normalization
layer normalization
0.812024
On the Nonlinearity of Layer Normalization · ICML 2024
Machine learning › Deep learning architectures and training
normalization
0.812024
On the Nonlinearity of Layer Normalization · ICML 2024
Machine learning › Learning theory › neural network theory
representational capacity
0.812024
On the Nonlinearity of Layer Normalization · ICML 2024
Machine learning › Learning theory › computational learning theory › VC theory
VC dimension
0.812024
On the Nonlinearity of Layer Normalization · ICML 2024

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

topic organization · 2.0multi-agent debate · 2.0BM25 retrieval · 2.0theoretical analysis · 0.8group partition · 0.8
YearPublicationVenuePosition
2026 LiteLong: Resource-Efficient Long-Context Data Synthesis for LLMs
abstract
High-quality long-context data is essential for training large language models (LLMs) capable of processing extensive documents, yet existing synthesis approaches using relevance-based aggregation face challenges of computational efficiency. We present LiteLong, a resource-efficient method for synthesizing long-context data through structured topic organization and multi-agent debate. Our approach leverages the BISAC book classification system to provide a comprehensive hierarchical topic organization, and then employs a debate mechanism with multiple LLMs to generate diverse, high-quality topics within this structure. For each topic, we use lightweight BM25 retrieval to obtain relevant documents and concatenate them into 128K-token training samples. Experiments on HELMET and Ruler benchmarks demonstrate that LiteLong achieves competitive long-context performance and can seamlessly integrate with other long-dependency enhancement methods. LiteLong makes high-quality long-context data synthesis more accessible by reducing both computational and data engineering costs, facilitating further research in long-context language training.
Junlong Jia, Xing Wu 0002, Chaochen Gao, Zijia Lin, Zhongzhi Li, Weinong Wang, Donghui Jin, Debing Zhang
AAAI1
2024 On the Nonlinearity of Layer Normalization
abstract
Layer normalization (LN) is a ubiquitous technique in deep learning but our theoretical understanding to it remains elusive. This paper investigates a new theoretical direction for LN, regarding to its nonlinearity and representation capacity. We investigate the representation capacity of a network with layerwise composition of linear and LN transformations, referred to as LN-Net. We theoretically show that, given $m$ samples with any label assignment, an LN-Net with only 3 neurons in each layer and $O(m)$ LN layers can correctly classify them. We further show the lower bound of the VC dimension of an LN-Net. The nonlinearity of LN can be amplified by group partition, which is also theoretically demonstrated with mild assumption and empirically supported by our experiments. Based on our analyses, we consider to design neural architecture by exploiting and amplifying the nonlinearity of LN, and the effectiveness is supported by our experiments.
Yunhao Ni, Junlong Jia, Lei Huang 0015
ICML3