arXiv subjects

Yang Li

Publications and source records attributed to Yang Li.

At least 685 records · Page 38Linked to original sources

arXiv2024

SRAP-Agent: Simulating and Optimizing Scarce Resource Allocation Policy with LLM-based Agent

Public scarce resource allocation plays a crucial role in economics as it directly influences the efficiency and equity in society. Traditional studies including theoretical model-based, empirical study-based and simulation-based methods encounter limitations due to the idealized assumption of complete information and individual rationality, as well as constraints posed by limited available data. In this work, we propose an innovative framework, SRAP-Agent (Simulating and Optimizing Scarce Resource Allocation Policy with LLM-based Agent), which integrates Large Language Models (LLMs) into economic simulations, aiming to bridge the gap between theoretical models and real-world dynamics. Using public housing allocation scenarios as a case study, we conduct extensive policy simulation experiments to verify the feasibility and effectiveness of the SRAP-Agent and employ the Policy Optimization Algorithm with certain optimization objectives. The source code can be found in https://github.com/jijiarui-cather/SRAPAgent_Framework

cs.CL↗

arXiv2024

A further study on the mass formula for linear codes with prescribed hull dimension

Finding a mass formula for a given class of linear codes is a fundamental problem in combinatorics and coding theory. In this paper, we consider the action of the unitary (resp. symplectic) group on the set of all Hermitian (resp. symplectic) linear complementary dual (LCD) codes, prove that all Hermitian (resp. symplectic) LCD codes are on a unique orbit under this action, and determine the formula for the size of the orbit. Based on this, we develop a general technique to obtain a closed mass formula for linear codes with prescribed Hermitian (resp. symplectic) hull dimension, and further obtain some asymptotic results.

cs.IT↗

arXiv2024

Physical Informed-Inspired Deep Reinforcement Learning Based Bi-Level Programming for Microgrid Scheduling

To coordinate the interests of operator and users in a microgrid under complex and changeable operating conditions, this paper proposes a microgrid scheduling model considering the thermal flexibility of thermostatically controlled loads and demand response by leveraging physical informed-inspired deep reinforcement learning (DRL) based bi-level programming. To overcome the non-convex limitations of karush-kuhn-tucker (KKT)-based methods, a novel optimization solution method based on DRL theory is proposed to handle the bi-level programming through alternate iterations between levels. Specifically, by combining a DRL algorithm named asynchronous advantage actor-critic (A3C) and automated machine learning-prioritized experience replay (AutoML-PER) strategy to improve the generalization performance of A3C to address the above problems, an improved A3C algorithm, called AutoML-PER-A3C, is designed to solve the upper-level problem; while the DOCPLEX optimizer is adopted to address the lower-level problem. In this solution process, AutoML is used to automatically optimize hyperparameters and PER improves learning efficiency and quality by extracting the most valuable samples. The test results demonstrate that the presented approach manages to reconcile the interests between multiple stakeholders in MG by fully exploiting various flexibility resources. Furthermore, in terms of economic viability and computational efficiency, the proposal vastly exceeds other advanced reinforcement learning methods.

eess.SY↗

arXiv2024

SEED-Story: Multimodal Long Story Generation with Large Language Model

With the remarkable advancements in image generation and open-form text generation, the creation of interleaved image-text content has become an increasingly intriguing field. Multimodal story generation, characterized by producing narrative texts and vivid images in an interleaved manner, has emerged as a valuable and practical task with broad applications. However, this task poses significant challenges, as it necessitates the comprehension of the complex interplay between texts and images, and the ability to generate long sequences of coherent, contextually relevant texts and visuals. In this work, we propose SEED-Story, a novel method that leverages a Multimodal Large Language Model (MLLM) to generate extended multimodal stories. Our model, built upon the powerful comprehension capability of MLLM, predicts text tokens as well as visual tokens, which are subsequently processed with an adapted visual de-tokenizer to produce images with consistent characters and styles. We further propose multimodal attention sink mechanism to enable the generation of stories with up to 25 sequences (only 10 for training) in a highly efficient autoregressive manner. Additionally, we present a large-scale and high-resolution dataset named StoryStream for training our model and quantitatively evaluating the task of multimodal story generation in various aspects.

cs.CV↗

arXiv2024

Low Mach number limit for the global large solutions to the $2$D Navier--Stokes--Korteweg system in the critical $\widehat{L^p}$ framework

In the present paper, we consider the compressible Navier--Stokes--Korteweg system on the $2$D whole plane and show that a unique global solution exists in the scaling critical Fourier--Besov spaces for arbitrary large initial data provided that the Mach number is sufficiently small. Moreover, we also show that the global solution converges to the $2$D incompressible Navier--Stokes flow in the singular limit of zero Mach number. The key ingredient of the proof lies in the nonlinear stability estimates around the large incompressible flow via the Strichartz estimate for the linearized equations in Fourier--Besov spaces.

math.AP↗

arXiv2024

Linear and nonlinear stability for the $3$D stratified Boussinesq equations with the horizontal viscosity and diffusivity

In this manuscript, we consider the $3$D Boussinesq equations for stably stratified fluids with the horizontal viscosity and thermal diffusivity and investigate the large time behavior of the solutions. Making use of the anisotropic Littlewood--Paley theory, we obtain their precise $L^1$-$L^p$ decay estimates, which provide us information on both the anisotropic and dispersive structure of the system. More precisely, we reveal that the dispersion from the skew symmetric terms of stratification makes the decay rates of some portions of the solutions faster and furthermore the third component of the velocity field exhibit the enhanced dissipative effect, which provides the additional fast decay rate.

math.AP↗

arXiv2024

Cosmic Simulations of Axion String-Wall Networks: Probing Dark Matter and Gravitational Waves for Discovery

We simultaneously study gravitational waves (GWs) and free axions emitted from axionic string-wall networks in the early universe using advanced 3D lattice simulations. Our simulations start before the Peccei-Quinn phase transition and end with the destruction of string-wall networks below the QCD scale. The axion dark matter (DM) relic abundance radiated from string-wall networks are updated and refined for the scenarios of $N_{\rm DW}>1$. In this scenario, we observe that the GW spectrum is almost independent of the bias term and $N_{\rm DW}$, and $Ω_{\rm GW}h^2\propto f^{1.29}(f^{-0.43})$ in the IR and middle-frequency regions. After considering the constraints from DM relic abundance, we found that the QCD axion model predicts undetectable GW emissions, and the axion-like particles model allows for a detectable GW signal in the nano-Hertz to the milli-Hertz frequency range corresponding to axion masses range from KeV to TeV. For $N_{\rm DW}=1$, the GW energy density appears undetectable for QCD axions and axion-like particles.

astro-ph.CO↗

arXiv2024

Selecting the Best Sequential Transfer Path for Medical Image Segmentation with Limited Labeled Data

The medical image processing field often encounters the critical issue of scarce annotated data. Transfer learning has emerged as a solution, yet how to select an adequate source task and effectively transfer the knowledge to the target task remains challenging. To address this, we propose a novel sequential transfer scheme with a task affinity metric tailored for medical images. Considering the characteristics of medical image segmentation tasks, we analyze the image and label similarity between tasks and compute the task affinity scores, which assess the relatedness among tasks. Based on this, we select appropriate source tasks and develop an effective sequential transfer strategy by incorporating intermediate source tasks to gradually narrow the domain discrepancy and minimize the transfer cost. Thereby we identify the best sequential transfer path for the given target task. Extensive experiments on three MRI medical datasets, FeTS 2022, iSeg-2019, and WMH, demonstrate the efficacy of our method in finding the best source sequence. Compared with directly transferring from a single source task, the sequential transfer results underline a significant improvement in target task performance, achieving an average of 2.58% gain in terms of segmentation Dice score, notably, 6.00% for FeTS 2022. Code is available at the git repository.

eess.IV↗

arXiv2024

Gradual Learning: Optimizing Fine-Tuning with Partially Mastered Knowledge in Large Language Models

During the pretraining phase, large language models (LLMs) acquire vast amounts of knowledge from extensive text corpora. Nevertheless, in later stages such as fine-tuning and inference, the model may encounter knowledge not covered in the initial training, which can lead to hallucinations and degraded performance. This issue has a profound impact on the model's capabilities, as it will inevitably face out-of-scope knowledge after pretraining. Furthermore, fine-tuning is often required to adapt LLMs to domain-specific tasks. However, this phenomenon limits the model's ability to learn and integrate new information during fine-tuning. The effectiveness of fine-tuning largely depends on the type of knowledge involved. Existing research suggests that fine-tuning the model on partially mastered knowledge-for instance, question-answer pairs where the model has a chance of providing correct responses under non-greedy decoding-can enable the model to acquire new knowledge while mitigating hallucination. Notably, this approach can still lead to the forgetting of fully mastered knowledge, constraining the fine-tuning dataset to a narrower range and limiting the model's overall potential for improvement. Given the model's intrinsic reasoning abilities and the interconnectedness of different knowledge areas, it is likely that as the model's capacity to utilize existing knowledge improves during fine-tuning, previously unmastered knowledge may become more understandable. To explore this hypothesis, we conducted experiments and, based on the results, proposed a two-stage fine-tuning strategy. This approach not only improves the model's overall test accuracy and knowledge retention but also preserves its accuracy on previously mastered content. When fine-tuning on the WikiQA dataset, our method increases the amount of knowledge acquired by the model in this stage by 24%.

cs.CL↗

arXiv2024

Active Evaluation Acquisition for Efficient LLM Benchmarking

As large language models (LLMs) become increasingly versatile, numerous large scale benchmarks have been developed to thoroughly assess their capabilities. These benchmarks typically consist of diverse datasets and prompts to evaluate different aspects of LLM performance. However, comprehensive evaluations on hundreds or thousands of prompts incur tremendous costs in terms of computation, money, and time. In this work, we investigate strategies to improve evaluation efficiency by selecting a subset of examples from each benchmark using a learned policy. Our approach models the dependencies across test examples, allowing accurate prediction of the evaluation outcomes for the remaining examples based on the outcomes of the selected ones. Consequently, we only need to acquire the actual evaluation outcomes for the selected subset. We rigorously explore various subset selection policies and introduce a novel RL-based policy that leverages the captured dependencies. Empirical results demonstrate that our approach significantly reduces the number of evaluation prompts required while maintaining accurate performance estimates compared to previous methods.

cs.LG↗

arXiv2024

Fueter sections and $\mathbb{Z}_2$-harmonic 1-forms

Motivated by a conjecture of Donaldson and Segal on the counts of monopoles and special Lagrangians in Calabi-Yau 3-folds, we prove a compactness theorem for Fueter sections of charge 2 monopole bundles over 3-manifolds: Let $u_k$ be a sequence of Fueter sections of the charge 2 monopole bundle over a closed oriented Riemannian 3-manifold $(M,g)$, with $L^\infty$-norm diverging to infinity. Then a renormalized sequence derived from $u_k$ subsequentially converges to a non-zero $\mathbb{Z}_2$-harmonic 1-form $\mathcal{V}$ on $M$ in the $W^{1,2}$-topology.

math.DG↗

arXiv2024

Large time behavior for solutions to the anisotropic Navier-Stokes equations in a 3D half-space

We consider the large time behavior of the solution to the anisotropic Navier--Stokes equations in a $3$D half-space. Investigating the precise anisotropic nature of linearized solutions, we obtain the optimal decay estimates for the nonlinear global solutions in anisotropic Lebesgue norms. In particular, we reveal the enhanced dissipation mechanism for the third component of velocity field. We notice that, in contrast to the whole space case, some difficulties arises on the $L^1(\mathbb{R}^3_+)$-estimates of the solution due to the nonlocal operators appearing in the linear solution formula. To overcome this, we introduce suitable Besov type spaces and employ the Littlewood--Paley analysis on the tangential space.

math.AP↗

arXiv2024

AIM 2024 Challenge on Video Super-Resolution Quality Assessment: Methods and Results

This paper presents the Video Super-Resolution (SR) Quality Assessment (QA) Challenge that was part of the Advances in Image Manipulation (AIM) workshop, held in conjunction with ECCV 2024. The task of this challenge was to develop an objective QA method for videos upscaled 2x and 4x by modern image- and video-SR algorithms. QA methods were evaluated by comparing their output with aggregate subjective scores collected from >150,000 pairwise votes obtained through crowd-sourced comparisons across 52 SR methods and 1124 upscaled videos. The goal was to advance the state-of-the-art in SR QA, which had proven to be a challenging problem with limited applicability of traditional QA methods. The challenge had 29 registered participants, and 5 teams had submitted their final results, all outperforming the current state-of-the-art. All data, including the private test subset, has been made publicly available on the challenge homepage at https://challenges.videoprocessing.ai/challenges/super-resolution-metrics-challenge.html

eess.IV↗

arXiv2024

Scaling Parameter-Constrained Language Models with Quality Data

Scaling laws in language modeling traditionally quantify training loss as a function of dataset size and model parameters, providing compute-optimal estimates but often neglecting the impact of data quality on model generalization. In this paper, we extend the conventional understanding of scaling law by offering a microscopic view of data quality within the original formulation -- effective training tokens -- which we posit to be a critical determinant of performance for parameter-constrained language models. Specifically, we formulate the proposed term of effective training tokens to be a combination of two readily-computed indicators of text: (i) text diversity and (ii) syntheticity as measured by a teacher model. We pretrained over $200$ models of 25M to 1.5B parameters on a diverse set of sampled, synthetic data, and estimated the constants that relate text quality, model size, training tokens, and eight reasoning task accuracy scores. We demonstrated the estimated constants yield +0.83 Pearson correlation with true accuracies, and analyzed it in scenarios involving widely-used data techniques such as data sampling and synthesis which aim to improve data quality.

cs.CL↗

arXiv2024

Towards Cost Sensitive Decision Making

Many real-world situations allow for the acquisition of additional relevant information when making decisions with limited or uncertain data. However, traditional RL approaches either require all features to be acquired beforehand (e.g. in a MDP) or regard part of them as missing data that cannot be acquired (e.g. in a POMDP). In this work, we consider RL models that may actively acquire features from the environment to improve the decision quality and certainty, while automatically balancing the cost of feature acquisition process and the reward of task decision process. We propose the Active-Acquisition POMDP and identify two types of the acquisition process for different application domains. In order to assist the agent in the actively-acquired partially-observed environment and alleviate the exploration-exploitation dilemma, we develop a model-based approach, where a deep generative model is utilized to capture the dependencies of the features and impute the unobserved features. The imputations essentially represent the beliefs of the agent. Equipped with the dynamics model, we develop hierarchical RL algorithms to resolve both types of the AA-POMDPs. Empirical results demonstrate that our approach achieves considerably better performance than existing POMDP-RL solutions.

cs.LG↗

arXiv2024

Distribution Guided Active Feature Acquisition

Human agents routinely reason on instances with incomplete and muddied data (and weigh the cost of obtaining further features). In contrast, much of ML is devoted to the unrealistic, sterile environment where all features are observed and further information on an instance is obviated. Here we extend past static ML and develop an active feature acquisition (AFA) framework that interacts with the environment to obtain new information on-the-fly and can: 1) make inferences on an instance in the face of incomplete features, 2) determine a plan for feature acquisitions to obtain additional information on the instance at hand. We build our AFA framework on a backbone of understanding the information and conditional dependencies that are present in the data. First, we show how to build generative models that can capture dependencies over arbitrary subsets of features and employ these models for acquisitions in a greedy scheme. After, we show that it is possible to guide the training of RL agents for AFA via side-information and auxiliary rewards stemming from our generative models. We also examine two important factors for deploying AFA models in real-world scenarios, namely interpretability and robustness. Extensive experiments demonstrate the state-of-the-art performance of our AFA framework.

cs.LG↗

arXiv2024

Effective Tuning Strategies for Generalist Robot Manipulation Policies

Generalist robot manipulation policies (GMPs) have the potential to generalize across a wide range of tasks, devices, and environments. However, existing policies continue to struggle with out-of-distribution scenarios due to the inherent difficulty of collecting sufficient action data to cover extensively diverse domains. While fine-tuning offers a practical way to quickly adapt a GMPs to novel domains and tasks with limited samples, we observe that the performance of the resulting GMPs differs significantly with respect to the design choices of fine-tuning strategies. In this work, we first conduct an in-depth empirical study to investigate the effect of key factors in GMPs fine-tuning strategies, covering the action space, policy head, supervision signal and the choice of tunable parameters, where 2,500 rollouts are evaluated for a single configuration. We systematically discuss and summarize our findings and identify the key design choices, which we believe give a practical guideline for GMPs fine-tuning. We observe that in a low-data regime, with carefully chosen fine-tuning strategies, a GMPs significantly outperforms the state-of-the-art imitation learning algorithms. The results presented in this work establish a new baseline for future studies on fine-tuned GMPs, and provide a significant addition to the GMPs toolbox for the community.

cs.RO↗

arXiv2024

DsubCox: A Fast Subsampling Algorithm for Cox Model with Distributed and Massive Survival Data

To ensure privacy protection and alleviate computational burden, we propose a fast subsmaling procedure for the Cox model with massive survival datasets from multi-centered, decentralized sources. The proposed estimator is computed based on optimal subsampling probabilities that we derived and enables transmission of subsample-based summary level statistics between different storage sites with only one round of communication. For inference, the asymptotic properties of the proposed estimator were rigorously established. An extensive simulation study demonstrated that the proposed approach is effective. The methodology was applied to analyze a large dataset from the U.S. airlines.

stat.CO↗