Searcharxiv⌕ Search

arXiv subjects

Jihao Liu

Publications and source records attributed to Jihao Liu.

At least 55 records · Page 3Linked to original sources

LM-Searcher: Cross-domain Neural Architecture Search with LLMs via Unified Numerical Encoding

Recent progress in Large Language Models (LLMs) has opened new avenues for solving complex optimization problems, including Neural Architecture Search (NAS). However, existing LLM-driven NAS approaches rely heavily on prompt engineering and domain-specific tuning, limiting their practicality and scalability across diverse tasks. In this work, we propose LM-Searcher, a novel framework that leverages LLMs for cross-domain neural architecture optimization without the need for extensive domain-specific adaptation. Central to our approach is NCode, a universal numerical string representation for neural architectures, which enables cross-domain architecture encoding and search. We also reformulate the NAS problem as a ranking task, training LLMs to select high-performing architectures from candidate pools using instruction-tuning samples derived from a novel pruning-based subspace sampling strategy. Our curated dataset, encompassing a wide range of architecture-performance pairs, encourages robust and transferable learning. Comprehensive experiments demonstrate that LM-Searcher achieves competitive performance in both in-domain (e.g., CNNs for image classification) and out-of-domain (e.g., LoRA configurations for segmentation and generation) tasks, establishing a new paradigm for flexible and generalizable LLM-based architecture search. The datasets and models will be released at https://github.com/Ashone3/LM-Searcher.

cs.CL↗

RSMA-Enabled Covert Communications Against Multiple Spatially Random Wardens

This work investigates covert communication in a rate-splitting multiple access (RSMA)-based multi-user multiple-input single-output system, where the random locations of the wardens follow a homogeneous Poisson point process. To demonstrate practical deployment scenarios, imperfect channel state information at the transmitter is considered. Closed-form expressions for the statistics of the received signal-to-interference-plus-noise ratio, along with the analytical formulations for the covertness constraint, outage probability, and effective covert throughput (ECT), are derived. Subsequently, an ECT maximization problem is formulated under covertness and power allocation constraints. This optimization problem is addressed using an alternating optimization-assisted genetic algorithm (AO-GA). Simulation results corroborate the theoretical analysis and demonstrate the superiority of RSMA over conventional multiple access schemes, as well as the effectiveness of the proposed AO-GA.

eess.SY↗

Minimal model program for algebraically integrable foliations on klt varieties

For lc algebraically integrable foliations on klt varieties, we prove the base-point-freeness theorem, the contraction theorem, and the existence of flips. The first result resolves a conjecture of Cascini and Spicer, while the latter two results strengthen a result of Cascini and Spicer by removing their assumption on the termination of flips. Moreover, we prove the existence of the minimal model program for lc algebraically integrable foliations on klt varieties and the existence of good minimal models or Mori fiber spaces for lc algebraically integrable foliations polarized by ample divisors on klt varieties. As a consequence, we show that $\mathbb{Q}$-factorial klt varieties with lc algebraically integrable Fano foliation structures are Mori dream spaces. We also show the existence of a Shokurov-type polytope for lc algebraically integrable foliations.

math.AG↗

Sarkisov program for algebraically integrable and threefold foliations

By applying the theory of the minimal model program for adjoint foliated structures, we establish the Sarkisov program for algebraically integrable foliations on klt varieties: any two Mori fiber spaces of such structure are connected by a sequence of Sarkisov links. Combining with a result of R. Mascharak, we establish the Sarkisov program for foliations in dimension at most $3$ with mild singularities. Log version and adjoint foliated version of the aformentioned Sarkisov programs are also established.

math.AG↗

Seed1.5-VL Technical Report

We present Seed1.5-VL, a vision-language foundation model designed to advance general-purpose multimodal understanding and reasoning. Seed1.5-VL is composed with a 532M-parameter vision encoder and a Mixture-of-Experts (MoE) LLM of 20B active parameters. Despite its relatively compact architecture, it delivers strong performance across a wide spectrum of public VLM benchmarks and internal evaluation suites, achieving the state-of-the-art performance on 38 out of 60 public benchmarks. Moreover, in agent-centric tasks such as GUI control and gameplay, Seed1.5-VL outperforms leading multimodal systems, including OpenAI CUA and Claude 3.7. Beyond visual and video understanding, it also demonstrates strong reasoning abilities, making it particularly effective for multimodal reasoning challenges such as visual puzzles. We believe these capabilities will empower broader applications across diverse tasks. In this report, we mainly provide a comprehensive review of our experiences in building Seed1.5-VL across model design, data construction, and training at various stages, hoping that this report can inspire further research. Seed1.5-VL is now accessible at https://www.volcengine.com/ (Volcano Engine Model ID: doubao-1-5-thinking-vision-pro-250428)

cs.CV↗

On finite generation and boundedness of adjoint foliated structures

We prove the existence of good minimal models for any klt algebraically integrable adjoint foliated structure of general type, and that Fano algebraically integrable adjoint foliated structures with total minimal log discrepancies and parameters bounded away from zero form a bounded family. These results serve as the algebraically integrable foliation analogues of the finite generation of the canonical rings proved by Birkar-Cascini-Hacon-M\textsuperscript{c}Kernan, and the Borisov-Alexeev-Borisov conjecture on the boundedness of Fano varieties proved by Birkar, respectively. As an application, we prove that the ambient variety of any lc Fano algebraically integrable foliation is of Fano type, provided the ambient variety is potentially klt.

math.AG↗

StreamChat: Chatting with Streaming Video

This paper presents StreamChat, a novel approach that enhances the interaction capabilities of Large Multimodal Models (LMMs) with streaming video content. In streaming interaction scenarios, existing methods rely solely on visual information available at the moment a question is posed, resulting in significant delays as the model remains unaware of subsequent changes in the streaming video. StreamChat addresses this limitation by innovatively updating the visual context at each decoding step, ensuring that the model utilizes up-to-date video content throughout the decoding process. Additionally, we introduce a flexible and efficient crossattention-based architecture to process dynamic streaming inputs while maintaining inference efficiency for streaming interactions. Furthermore, we construct a new dense instruction dataset to facilitate the training of streaming interaction models, complemented by a parallel 3D-RoPE mechanism that encodes the relative temporal information of visual and text tokens. Experimental results demonstrate that StreamChat achieves competitive performance on established image and video benchmarks and exhibits superior capabilities in streaming interaction scenarios compared to state-of-the-art video LMM.

cs.CV↗

On termination of flips and exceptionally non-canonical singularities

We systematically introduce and study a new type of singularities, namely, exceptionally non-canonical (enc) singularities. This class of singularities plays an important role in the study of many questions in birational geometry, and has tight connections with local K-stability theory, Calabi-Yau varieties, and mirror symmetry. We reduce the termination of flips to the termination of terminal flips and the ACC conjecture for minimal log discrepancies (mlds) of enc pairs. As a consequence, the ACC conjecture for mlds of enc pairs implies the termination of flips in dimension $4$. We show that, in any fixed dimension, the termination of flips follows from the lower-semicontinuity for mlds of terminal pairs, and the ACC for mlds of terminal and enc pairs. Moreover, in dimension $3$, we give a rough classification of enc singularities, and prove the ACC for mlds of enc pairs. These two results provide a second proof of the termination of flips in dimension $3$ which does not rely on any difficulty function. Finally, we propose and prove the special cases of several conjectures on enc singularities and local K-stability theory. We also discuss the relationship between enc singularities, exceptional Fano varieties, and Calabi-Yau varieties with small mlds or large indices via mirror symmetry.

math.AG↗

A generalized non-vanishing theorem on surfaces

We show that the anti-canonical bundle of any $\mathbb Q$-factorial surface is numerically effective if and only if it is pseudo-effective. To prove this, we establish a numerical non-vanishing theorem for surfaces polarized with pseudo-effective divisors. The latter answers a question of C. Fontanari.

math.AG↗

Instruction-Guided Visual Masking

Instruction following is crucial in contemporary LLM. However, when extended to multimodal setting, it often suffers from misalignment between specific textual instruction and targeted local region of an image. To achieve more accurate and nuanced multimodal instruction following, we introduce Instruction-guided Visual Masking (IVM), a new versatile visual grounding model that is compatible with diverse multimodal models, such as LMM and robot model. By constructing visual masks for instruction-irrelevant regions, IVM-enhanced multimodal models can effectively focus on task-relevant image regions to better align with complex instructions. Specifically, we design a visual masking data generation pipeline and create an IVM-Mix-1M dataset with 1 million image-instruction pairs. We further introduce a new learning technique, Discriminator Weighted Supervised Learning (DWSL) for preferential IVM training that prioritizes high-quality data samples. Experimental results on generic multimodal tasks such as VQA and embodied robotic control demonstrate the versatility of IVM, which as a plug-and-play tool, significantly boosts the performance of diverse multimodal models, yielding new state-of-the-art results across challenging multimodal benchmarks. Code, model and data are available at https://github.com/2toinf/IVM.

cs.CV↗

Flop between algebraically integrable foliations on potentially klt varieties

We prove that for any two minimal models of an lc algebraically integrable foliated triple on potentially klt varieties, there exist small birational models that are connected by a sequence of flops. In particular, any two minimal models of lc algebraically integrable foliated triples on $\mathbb Q$-factorial klt varieties are connected by a sequence of flops. We also discuss the connection between minimal models for possibly non-algebraically integrable foliations on threefolds, assuming the minimal model program for generalized foliated quadruples.

math.AG↗

ACC for local volumes

We prove the ACC conjecture for local volumes. Moreover, when the local volume is bounded away from zero, we prove Shokurov's ACC conjecture for minimal log discrepancies.

math.AG↗

Minimal model program for algebraically integrable adjoint foliated structures

For $\mathbb Q$-factorial klt algebraically integrable adjoint foliated structures, we prove the cone theorem, the contraction theorem, and the existence of flips. Therefore, we deduce the existence of the minimal model program for such structures. We also prove the base-point-freeness theorem for such structures of general type and establish an adjunction formula and the existence of $\mathbb Q$-factorial quasi-dlt modifications for algebraically integrable adjoint foliated structures.

math.AG↗

MM-Instruct: Generated Visual Instructions for Large Multimodal Model Alignment

This paper introduces MM-Instruct, a large-scale dataset of diverse and high-quality visual instruction data designed to enhance the instruction-following capabilities of large multimodal models (LMMs). While existing visual instruction datasets often focus on question-answering, they struggle to generalize to broader application scenarios such as creative writing, summarization, or image analysis. To address these limitations, we propose a novel approach to constructing MM-Instruct that leverages the strong instruction-following capabilities of existing LLMs to generate novel visual instruction data from large-scale but conventional image captioning datasets. MM-Instruct first leverages ChatGPT to automatically generate diverse instructions from a small set of seed instructions through augmenting and summarization. It then matches these instructions with images and uses an open-sourced large language model (LLM) to generate coherent answers to the instruction-image pairs. The LLM is grounded by the detailed text descriptions of images in the whole answer generation process to guarantee the alignment of the instruction data. Moreover, we introduce a benchmark based on the generated instruction data to evaluate the instruction-following capabilities of existing LMMs. We demonstrate the effectiveness of MM-Instruct by training a LLaVA-1.5 model on the generated data, denoted as LLaVA-Instruct, which exhibits significant improvements in instruction-following capabilities compared to LLaVA-1.5 models. The MM-Instruct dataset, benchmark, and pre-trained models are available at https://github.com/jihaonew/MM-Instruct.

cs.CV↗

Volume of algebraically integrable foliations and locally stable families

In this paper, we study the volume of algebraically integrable foliations and locally stable families. We show that, for any canonical algebraically integrable foliation, its volume belongs to a discrete set depending only on its rank and the volume of its general leaves. In particular, if the foliation is of general type, then its volume has a positive lower bound depending only on its rank and the volume of its general leaves. This implies some special cases of a question posed by Cascini, Hacon, and Langer. As a consequence, we show that the relative volume of a stable family with a normal generic fiber belongs to a discrete set if the dimension and the volume of its general fibers are bounded. Log versions of the aforementioned theorems are also provided and proved.

math.AG↗