arXiv subjects

Ying Luo

Publications and source records attributed to Ying Luo.

12 recordsLinked to original sources

arXiv2026

LongCat-Next: Lexicalizing Modalities as Discrete Tokens

The prevailing Next-Token Prediction (NTP) paradigm has driven the success of large language models through discrete autoregressive modeling. However, contemporary multimodal systems remain language-centric, often treating non-linguistic modalities as external attachments, leading to fragmented architectures and suboptimal integration. To transcend this limitation, we introduce Discrete Native Autoregressive (DiNA), a unified framework that represents multimodal information within a shared discrete space, enabling a consistent and principled autoregressive modeling across modalities. A key innovation is the Discrete Native Any-resolution Visual Transformer (dNaViT), which performs tokenization and de-tokenization at arbitrary resolutions, transforming continuous visual signals into hierarchical discrete tokens. Building on this foundation, we develop LongCat-Next, a native multimodal model that processes text, vision, and audio under a single autoregressive objective with minimal modality-specific design. As an industrial-strength foundation model, it excels at seeing, painting, and talking within a single framework, achieving strong performance across a wide range of multimodal benchmarks. In particular, LongCat-Next addresses the long-standing performance ceiling of discrete vision modeling on understanding tasks and provides a unified approach to effectively reconcile the conflict between understanding and generation. As an attempt toward native multimodality, we open-source the LongCat-Next and its tokenizers, hoping to foster further research and development in the community. GitHub: https://github.com/meituan-longcat/LongCat-Next

cs.CV↗

arXiv2025

AIA: Rethinking Architecture Decoupling Strategy In Unified Multimodal Model

Unified multimodal models for image generation and understanding represent a significant step toward AGI and have attracted widespread attention from researchers. The main challenge of this task lies in the difficulty in establishing an optimal training paradigm due to inherent conflicting targets in understanding and generation tasks. To alleviate these conflicts and pursue higher performance, many researchers adopt varying degrees of architecture decoupling (e.g., Double image encoders, MOE/MOT architecture, or frozen MLLM). However, excessive model decoupling can lead to the loss of interleave generation ability, undermining the original intent of unified models. In this work, we aim to explore how to mitigate task conflicts without resorting to model decoupling. Firstly, we analyze why decoupling boosts performance by studying the cross-modal attention behavior of models. We observe that architecture decoupling does not solve task conflicts, but essentially drives models toward cross-modal interaction patterns of task-specific models, as seen in Qwen3-VL and HunyuanImage-3.0, and that the more thorough the decoupling, the more consistent the behavior becomes. Motivated by this observation, we propose Attention Interaction Alignment (AIA) loss, which explicitly learns task-specific multimodal interaction patterns during training. To demonstrate the generalizability of our AIA loss, we apply it to Emu3 and Janus-Pro during SFT and post-training stage respectively. Without bells and whistles, AIA not only refines cross-modal attention patterns, but also boosts both generation and understanding performance.

cs.CV↗

arXiv2025

CodePlot-CoT: Mathematical Visual Reasoning by Thinking with Code-Driven Images

Recent advances in Large Language Models (LLMs) and Vision Language Models (VLMs) have shown significant progress in mathematical reasoning, yet they still face a critical bottleneck with problems requiring visual assistance, such as drawing auxiliary lines or plotting functions to solve the problems. Most LLMs and VLMs are constrained to text-only reasoning chains, while multimodal unified models that can generate interleaved text and images lack the necessary precision and controllability for such tasks. To address this, we propose CodePlot-CoT, a code-driven Chain-of-Thought paradigm for "thinking with images" in mathematics. Our approach leverages the VLM to generate text reasoning as well as executable plotting code, which is then rendered into images as "visual thought", to solve mathematical problems. To achieve this, we first construct Math-VR, the first large-scale, bilingual dataset and benchmark for Mathematics problems with Visual Reasoning, comprising 178K samples. Second, to create high-quality training data, we develop a state-of-the-art image-to-code converter specialized for parsing complex mathematical figures into codes. Finally, using these training data, we train the CodePlot-CoT model for solving mathematical problems. Experimental results show that our model achieves up to 21% increase over base model on our new benchmark, fully validating the efficacy of our proposed code-driven reasoning paradigm. Our work opens a new direction for multimodal mathematical reasoning and provides the community with the first large-scale dataset, comprehensive benchmark, and strong approach for such problems. To facilitate future research, we make our datasets, code, and pretrained models publicly available at https://github.com/HKU-MMLab/Math-VR-CodePlot-CoT.

cs.CV↗

arXiv2025

Instance-level Randomization: Toward More Stable LLM Evaluations

Evaluations of large language models (LLMs) suffer from instability, where small changes of random factors such as few-shot examples can lead to drastic fluctuations of scores and even model rankings. Moreover, different LLMs can have different preferences for a certain setting of random factors. As a result, using a fixed setting of random factors, which is often adopted as the paradigm of current evaluations, can lead to potential unfair comparisons between LLMs. To mitigate the volatility of evaluations, we first theoretically analyze the sources of variance induced by changes in random factors. Targeting these specific sources, we then propose the instance-level randomization (ILR) method to reduce variance and enhance fairness in model comparisons. Instead of using a fixed setting across the whole benchmark in a single experiment, we randomize all factors that affect evaluation scores for every single instance, run multiple experiments and report the averaged score. Theoretical analyses and empirical results demonstrate that ILR can reduce the variance and unfair comparisons caused by random factors, as well as achieve similar robustness level with less than half computational cost compared with previous methods.

cs.LG↗

arXiv2025

Theoretical Investigation of High-Tc Superconductivity in Sr-Doped La$_3$Ni$_2$O$_7$ at Ambient Pressure

The recent discovery of pressure-induced superconductivity in La$_3$Ni$_2$O$_7$ has established a novel platform for studying unconventional superconductors. However, achieving superconductivity in this system currently requires relatively high pressures. In this study, we propose a chemical pressure strategy via Sr substitution to stabilize high-Tc superconductivity in La$_3$Ni$_2$O$_7$ under ambient conditions.Using density functional theory (DFT) calculations, we systematically investigate the structural and electronic properties of Sr-doped La$_{3-x}$Sr$_x$Ni$_2$O$_7$ (x = 0.25, 0.5, 1) at ambient pressure and identify two dynamically stable phases:La$_{2.5}$Sr$_{0.5}$Ni$_2$O$_7$ and La$_2$SrNi$_2$O$_7$.Our calculations reveal that both phases exhibit metallization of the $\sigma$-bonding bands dominated by Ni-d$_{z^{2}}$ orbitals-a key feature associated with high-Tc superconductivity, as reported in the high-pressure phase of La$_3$Ni$_2$O$_7$. Further analysis using tight-binding models shows that the key hopping parameters in La$_{2.5}$Sr$_{0.5}$Ni$_2$O$_7$ and La$_2$SrNi$_2$O$_7$ closely resemble those of La$_3$Ni$_2$O$_7$ under high pressure, indicating that strong super-exchange interactions between interlayer Ni-d$_{z^{2}}$ orbitals are preserved. These findings suggest that Sr-doped La$_3$Ni$_2$O$_7$ is a promising candidate for realizing high-Tcsuperconductivity at ambient pressure.

cond-mat.supr-con↗

arXiv2024

Identifying clusters in Czekanowski's diagram

Visualizing data through Czekanowski's diagram has as its aim the illustration of the relationships between objects. Often, obvious clusters of observations are directly visible. However, it is not straightforward to precisely delineate these clusters. This paper presents the development of the package RMaCzek, which now includes features for cluster identification in Czekanowski diagrams.

stat.AP↗

arXiv2021

Sparse Reconstruction for Radar Imaging based on Quantum Algorithms

The sparse-driven radar imaging can obtain the high-resolution images about target scene with the down-sampled data. However, the huge computational complexity of the classical sparse recovery method for the particular situation seriously affects the practicality of the sparse imaging technology. In this paper, this is the first time the quantum algorithms are applied to the image recovery for the radar sparse imaging. Firstly, the radar sparse imaging problem is analyzed and the calculation problem to be solved by quantum algorithms is determined. Then, the corresponding quantum circuit and its parameters are designed to ensure extremely low computational complexity, and the quantum-enhanced reconstruction algorithm for sparse imaging is proposed. Finally, the computational complexity of the proposed method is analyzed, and the simulation experiments with the raw radar data are illustrated to verify the validity of the proposed method.

quant-ph↗

arXiv2020

Bipartite Flat-Graph Network for Nested Named Entity Recognition

In this paper, we propose a novel bipartite flat-graph network (BiFlaG) for nested named entity recognition (NER), which contains two subgraph modules: a flat NER module for outermost entities and a graph module for all the entities located in inner layers. Bidirectional LSTM (BiLSTM) and graph convolutional network (GCN) are adopted to jointly learn flat entities and their inner dependencies. Different from previous models, which only consider the unidirectional delivery of information from innermost layers to outer ones (or outside-to-inside), our model effectively captures the bidirectional interaction between them. We first use the entities recognized by the flat NER module to construct an entity graph, which is fed to the next graph module. The richer representation learned from graph module carries the dependencies of inner entities and can be exploited to improve outermost entity predictions. Experimental results on three standard nested NER datasets demonstrate that our BiFlaG outperforms previous state-of-the-art models.

cs.IR↗

arXiv2019

Hierarchical Contextualized Representation for Named Entity Recognition

Named entity recognition (NER) models are typically based on the architecture of Bi-directional LSTM (BiLSTM). The constraints of sequential nature and the modeling of single input prevent the full utilization of global information from larger scope, not only in the entire sentence, but also in the entire document (dataset). In this paper, we address these two deficiencies and propose a model augmented with hierarchical contextualized representation: sentence-level representation and document-level representation. In sentence-level, we take different contributions of words in a single sentence into consideration to enhance the sentence representation learned from an independent BiLSTM via label embedding attention mechanism. In document-level, the key-value memory network is adopted to record the document-aware information for each unique word which is sensitive to similarity of context information. Our two-level hierarchical contextualized representations are fused with each input token embedding and corresponding hidden state of BiLSTM, respectively. The experimental results on three benchmark NER datasets (CoNLL-2003 and Ontonotes 5.0 English datasets, CoNLL-2002 Spanish dataset) show that we establish new state-of-the-art results.

cs.CL↗

arXiv2019

Named Entity Recognition Only from Word Embeddings

Deep neural network models have helped named entity (NE) recognition achieve amazing performance without handcrafting features. However, existing systems require large amounts of human annotated training data. Efforts have been made to replace human annotations with external knowledge (e.g., NE dictionary, part-of-speech tags), while it is another challenge to obtain such effective resources. In this work, we propose a fully unsupervised NE recognition model which only needs to take informative clues from pre-trained word embeddings. We first apply Gaussian Hidden Markov Model and Deep Autoencoding Gaussian Mixture Model on word embeddings for entity span detection and type prediction, and then further design an instance selector based on reinforcement learning to distinguish positive sentences from noisy sentences and refine these coarse-grained annotations through neural networks. Extensive experiments on CoNLL benchmark datasets demonstrate that our proposed light NE recognition model achieves remarkable performance without using any annotated lexicon or corpus.

cs.IR↗

arXiv2019

Open Named Entity Modeling from Embedding Distribution

In this paper, we report our discovery on named entity distribution in a general word embedding space, which helps an open definition on multilingual named entity definition rather than previous closed and constraint definition on named entities through a named entity dictionary, which is usually derived from human labor and replies on schedule update. Our initial visualization of monolingual word embeddings indicates named entities tend to gather together despite of named entity types and language difference, which enable us to model all named entities using a specific geometric structure inside embedding space, namely, the named entity hypersphere. For monolingual cases, the proposed named entity model gives an open description of diverse named entity types and different languages. For cross-lingual cases, mapping the proposed named entity model provides a novel way to build a named entity dataset for resource-poor languages. At last, the proposed named entity model may be shown as a handy clue to enhance state-of-the-art named entity recognition systems generally.

cs.CL↗

arXiv2008

Learning of Content Knowledge and Development of Scientific Reasoning Ability: A Cross Culture Comparison

Student content knowledge and general reasoning abilities are two important areas in education practice and research. However, there hasn't been much work in physics education that clearly documents the possible interactions between content learning and the development of general reasoning abilities. In this paper, we report one study of a systematic research to investigate the possible interactions between students' learning of physics content knowledge and the development of general scientific reasoning abilities. Specifically, this study seeks to answer the research question of whether and to what extent content learning may affect the development of general reasoning abilities. College entrance testing data of freshman college students in both USA and China were collected using three standardized tests, FCI, BEMA, and Lawson's Classroom Test of Scientific Reasoning (Lawson Test). The results suggest that years of rigorous training of physics knowledge in middle and high schools have made significant impact on Chinese students' ability in solving physics problems, while such training doesn't seem to have direct effects on their general ability in scientific reasoning, which was measured to be at the same level as that of the students in USA. Details of the curriculum structures in the education systems of USA and China are also compared to provide a basis for interpreting the assessment data.

physics.ed-ph↗