arXiv subjects

Yingjie Li

Publications and source records attributed to Yingjie Li.

At least 37 records · Page 2Linked to original sources

arXiv2025

Differentiable Quadratic Optimization For The Maximum Independent Set Problem

Combinatorial Optimization (CO) addresses many important problems, including the challenging Maximum Independent Set (MIS) problem. Alongside exact and heuristic solvers, differentiable approaches have emerged, often using continuous relaxations of ReLU-based or quadratic objectives. Noting that an MIS in a graph is a Maximum Clique (MC) in its complement, we propose a new quadratic formulation for MIS by incorporating an MC term, improving convergence and exploration. We show that every maximal independent set corresponds to a local minimizer, derive conditions with respect to the MIS size, and characterize stationary points. To tackle the non-convexity of the objective, we propose optimizing several initializations in parallel using momentum-based gradient descent, complemented by an efficient MIS checking criterion derived from our theory. We dub our method as parallelized Clique-Informed Quadratic Optimization for MIS (pCQO-MIS). Our experimental results demonstrate the effectiveness of the proposed method compared to exact, heuristic, sampling, and data-centric approaches. Notably, our method avoids the out-of-distribution tuning and reliance on (un)labeled data required by data-centric methods, while achieving superior MIS sizes and competitive runtime relative to their inference time. Additionally, a key advantage of pCQO-MIS is that, unlike exact and heuristic solvers, the runtime scales only with the number of nodes in the graph, not the number of edges. Our code is available at the GitHub repository: https://github.com/ledenmat/pCQO-mis-benchmark/tree/refactor.

cs.DM↗

arXiv2025

PAFFA: Premeditated Actions For Fast Agents

Modern AI assistants have made significant progress in natural language understanding and tool-use, with emerging efforts to interact with Web interfaces. However, current approaches that heavily rely on repeated LLM-driven HTML parsing are computationally expensive and error-prone, particularly when handling dynamic web interfaces and multi-step tasks. We introduce PAFFA (Premeditated Actions For Fast Agents), a method that makes LLMs faster and more accurate in completing tasks on the internet using a novel inference-time technique that requires no task-specific training. PAFFA constructs an 'Action Library', leveraging the parametric knowledge of the base LLM to pre-compute browser interaction patterns that generalize across tasks. By strategically re-using LLM inference across tasks - either via 'Dist-Map' for task-agnostic identification of key interactive web elements, or 'Unravel' for first-encounter, stateful exploration of novel tasks/sites) - PAFFA drastically reduces inference time tokens by 87% while maintaining robust performance (achieving 0.57 vs. 0.50 step accuracy compared to baseline). Further, Unravel's ability to update its action library based on explorations allows generalization and adaptation to unseen websites. In sum, this work exhibits that LLM reasoning sequences can generalize across prompts, offering a way to scale inference-time techniques for internet-scale data with sublinear token count.

cs.AI↗

arXiv2025

Outflowing Gas in the Planetary Nebula K 3-54

As planetary nebulae (PNe) evolve, they develop slow and strong dust-driven stellar winds, making the joint study of dust and gas essential for understanding their nature. As a pilot investigation, we selected PN K 3-54 as our target, the only known PN in the Milky Way to exhibit infrared emission from both graphene (C$_{24}$) and fullerene (C$_{60}$). The gas is traced via molecular line emissions from $^{12}$CO, $^{13}$CO, and C$^{18}$O ($J = 1 \rightarrow 0$), observed using the 13.7 m telescope of the Purple Mountain Observatory. We investigate the dynamics of this PN and identify a bipolar outflow. Preliminary results suggest that the large dynamical timescale of the outflow and the weak shock environment may account for the simultaneous survival of C$_{24}$ and C$_{60}$ within and around PN K 3-54.

astro-ph.GA↗

arXiv2025

Calibrating the Color-Magnitude Relation of M Giants by Using Open Clusters

M giants, with their distinctive properties such as high luminosity, serve as excellent indicators for mapping the structure of the Milky Way. The distance to distant M giants can be determined by using the color-magnitude relation (CMR), which is derived from color-magnitude diagrams of specific systems in previous studies. In this work, we aimed to achieve more accurate distance determination for M giants by focusing on open clusters (OCs) with a large number of member stars and thus improve the CMR. For the first time, we compiled a census of OCs harboring M giants using Gaia Data Release 3 (DR3) and Large Sky Area Multi-Object Fiber Spectroscopic Telescope Data Release 9. We identified 58 M giants associated with 43 OCs and obtained their astrometric and photometric parameters from Gaia DR3. Using the distances of these OCs, we derived the CMR for M giants as a linear correlation, expressed as $M_{Ks}=3.85-8.26(J-K_s$). This linear relation proved superior to the empirical distance relation in characterizing the CMR of M giants. The photometric distances of M giants derived from the CMR are consistent with the parallax distances from Gaia and known spectroscopic distances, with median deviations of 1.5% and 2.3%, respectively. Using the distances of M giants derived from the CMR, we computed their radial velocity ($V_R$), azimuthal velocity ($Vϕ$), and vertical velocity ($V_Z$), respectively. The distributions of these velocities revealed key features of the Galactic disk, including oscillation, north-south rotational asymmetry, and warp. These findings are consistent with previous studies and further validate the reliability of the derived CMR.

astro-ph.SR↗

arXiv2024

PerSphere: A Comprehensive Framework for Multi-Faceted Perspective Retrieval and Summarization

As online platforms and recommendation algorithms evolve, people are increasingly trapped in echo chambers, leading to biased understandings of various issues. To combat this issue, we have introduced PerSphere, a benchmark designed to facilitate multi-faceted perspective retrieval and summarization, thus breaking free from these information silos. For each query within PerSphere, there are two opposing claims, each supported by distinct, non-overlapping perspectives drawn from one or more documents. Our goal is to accurately summarize these documents, aligning the summaries with the respective claims and their underlying perspectives. This task is structured as a two-step end-to-end pipeline that includes comprehensive document retrieval and multi-faceted summarization. Furthermore, we propose a set of metrics to evaluate the comprehensiveness of the retrieval and summarization content. Experimental results on various counterparts for the pipeline show that recent models struggle with such a complex task. Analysis shows that the main challenge lies in long context and perspective extraction, and we propose a simple but effective multi-agent summarization system, offering a promising solution to enhance performance on PerSphere.

cs.CL↗

arXiv2024

XAL: EXplainable Active Learning Makes Classifiers Better Low-resource Learners

Active learning (AL), which aims to construct an effective training set by iteratively curating the most formative unlabeled data for annotation, has been widely used in low-resource tasks. Most active learning techniques in classification rely on the model's uncertainty or disagreement to choose unlabeled data, suffering from the problem of over-confidence in superficial patterns and a lack of exploration. Inspired by the cognitive processes in which humans deduce and predict through causal information, we take an initial attempt towards integrating rationales into AL and propose a novel Explainable Active Learning framework (XAL) for low-resource text classification, which aims to encourage classifiers to justify their inferences and delve into unlabeled data for which they cannot provide reasonable explanations. Specifically, besides using a pre-trained bi-directional encoder for classification, we employ a pre-trained uni-directional decoder to generate and score the explanation. We further facilitate the alignment of the model with human reasoning preference through a proposed ranking loss. During the selection of unlabeled data, the predicted uncertainty of the encoder and the explanation score of the decoder complement each other as the final metric to acquire informative data. Extensive experiments on six datasets show that XAL achieves consistent improvement over 9 strong baselines. Analysis indicates that the proposed method can generate corresponding explanations for its predictions.

cs.CL↗

arXiv2024

Task Calibration: Calibrating Large Language Models on Inference Tasks

Large language models (LLMs) have exhibited impressive zero-shot performance on inference tasks. However, LLMs may suffer from spurious correlations between input texts and output labels, which limits LLMs' ability to reason based purely on general language understanding. In other words, LLMs may make predictions primarily based on premise or hypothesis, rather than both components. To address this problem that may lead to unexpected performance degradation, we propose task calibration (TC), a zero-shot and inference-only calibration method inspired by mutual information which recovers LLM performance through task reformulation. TC encourages LLMs to reason based on both premise and hypothesis, while mitigating the models' over-reliance on individual premise or hypothesis for inference. Experimental results show that TC achieves a substantial improvement on 13 inference tasks in the zero-shot setup. We further validate the effectiveness of TC in few-shot setups and various natural language understanding tasks. Further analysis indicates that TC is also robust to prompt templates and has the potential to be integrated with other calibration methods.

cs.CL↗

arXiv2024

A New Statistical Analysis of the Morphology of Spiral Galaxies

Morphology is the starting point for understanding galaxies. Elmegreen et al. classified spiral galaxies into flocculent, multiple-arm, and grand-design galaxies based on the regularity of their spiral arm structure. With the release of a vast number of clear spiral galaxy images from the Sloan Digital Sky Survey, we conducted a morphological classification of 5093 blue spiral galaxies. A statistical analysis of this sample shows that the fractions of flocculent, multiple-arm, and grand-design galaxies are 38 $\pm$ 1%, 59 $\pm$ 1%, and 3 $\pm$ 1%, respectively. Redshift has no obvious influence on this classification. However, as the bulge size becomes larger, the fraction of multiple-arm galaxies increases, while that of flocculent galaxies decreases. In addition, we performed a statistical analysis of 3958 galaxies with a clear spiral arm structure, finding 82% of these galaxies have two arms in their inner regions. We also found that the majority (74%) of the barred spiral galaxies exhibit the characteristics of two inner spiral arms and multiple outer spiral arms, and there is no barred spiral galaxy in this work with four continuous spiral arms from the inner to the outer regions. These results highlight that the spiral arm structure of the Milky Way, according to the current mainstream view of a four-arm galaxy with continuous arms extending from the inner to outer regions, is quite unique. However, our findings align with the spiral morphology of the Milky Way proposed by Xu et al., in which case our Galaxy can be considered typical.

astro-ph.GA↗

arXiv2024

A System and Benchmark for LLM-based Q&A on Heterogeneous Data

In many industrial settings, users wish to ask questions whose answers may be found in structured data sources such as a spreadsheets, databases, APIs, or combinations thereof. Often, the user doesn't know how to identify or access the right data source. This problem is compounded even further if multiple (and potentially siloed) data sources must be assembled to derive the answer. Recently, various Text-to-SQL applications that leverage Large Language Models (LLMs) have addressed some of these problems by enabling users to ask questions in natural language. However, these applications remain impractical in realistic industrial settings because they fail to cope with the data source heterogeneity that typifies such environments. In this paper, we address heterogeneity by introducing the siwarex platform, which enables seamless natural language access to both databases and APIs. To demonstrate the effectiveness of siwarex, we extend the popular Spider dataset and benchmark by replacing some of its tables by data retrieval APIs. We find that siwarex does a good job of coping with data source heterogeneity. Our modified Spider benchmark will soon be available to the research community

cs.DB↗

arXiv2024

KModels: Unlocking AI for Business Applications

As artificial intelligence (AI) continues to rapidly advance, there is a growing demand to integrate AI capabilities into existing business applications. However, a significant gap exists between the rapid progress in AI and how slowly AI is being embedded into business environments. Deploying well-performing lab models into production settings, especially in on-premise environments, often entails specialized expertise and imposes a heavy burden of model management, creating significant barriers to implementing AI models in real-world applications. KModels leverages proven libraries and platforms (Kubeflow Pipelines, KServe) to streamline AI adoption by supporting both AI developers and consumers. It allows model developers to focus solely on model development and share models as transportable units (Templates), abstracting away complex production deployment concerns. KModels enables AI consumers to eliminate the need for a dedicated data scientist, as the templates encapsulate most data science considerations while providing business-oriented control. This paper presents the architecture of KModels and the key decisions that shape it. We outline KModels' main components as well as its interfaces. Furthermore, we explain how KModels is highly suited for on-premise deployment but can also be used in cloud environments. The efficacy of KModels is demonstrated through the successful deployment of three AI models within an existing Work Order Management system. These models operate in a client's data center and are trained on local data, without data scientist intervention. One model improved the accuracy of Failure Code specification for work orders from 46% to 83%, showcasing the substantial benefit of accessible and localized AI solutions.

cs.SE↗

arXiv2024

3D Morphology and Motions of the Canis Major Region from Gaia DR3

The Canis Major (CMa) region is known for its prominent arc-shaped morphology, visible at multiple wavelengths. This study integrates molecular gas data with high-precision astrometric parameters of young stellar objects (YSOs) from Gaia DR3 to provide the first three-dimensional (3D) insights into the dynamical evolution and star formation history of the CMa region. By utilizing the average distances and proper motions of the YSOs as proxies for those of the molecular clouds (MCs), we confirm the presence of a slowly expanding shell-like morphology in the CMa region, with the estimated radius of 47$\pm$11 pc and expansion velocity of 1.6$\pm$0.7 km/s. Further, the dynamical evolution of the shell supports its expansion, with an expansion timescale of $\sim$4.4 Myr obtained by the traceback analysis assuming constant velocities. Finally, a momentum estimate suggests that at least 2 supernova explosions (SNe) are needed to power the observed expanding shell, reinforcing the previous hypothesis of multiple SNe events. This study effectively combines the CO data with the astrometric data of YSOs from Gaia, offering significant support for the future studies on the 3D morphology and kinematics of MCs.

astro-ph.GA↗

arXiv2024

Multi-Treatment Multi-Task Uplift Modeling for Enhancing User Growth

As a key component in boosting online user growth, uplift modeling aims to measure individual user responses (e.g., whether to play the game) to various treatments, such as gaming bonuses, thereby enhancing business outcomes. However, previous research typically considers a single-task, single-treatment setting, where only one treatment exists and the overall treatment effect is measured by a single type of user response. In this paper, we propose a Multi-Treatment Multi-Task (MTMT) uplift network to estimate treatment effects in a multi-task scenario. We identify the multi-treatment problem as a causal inference problem with a tiered response, comprising a base effect (from offering a treatment) and an incremental effect (from offering a specific type of treatment), where the base effect can be numerically much larger than the incremental effect. Specifically, MTMT separately encodes user features and treatments. The user feature encoder uses a multi-gate mixture of experts (MMOE) network to encode relevant user features, explicitly learning inter-task relations. The resultant embeddings are used to measure natural responses per task. Furthermore, we introduce a treatment-user feature interaction module to model correlations between each treatment and user feature. Consequently, we separately measure the base and incremental treatment effect for each task based on the produced treatment-aware representations. Experimental results based on an offline public dataset and an online proprietary dataset demonstrate the effectiveness of MTMT in single/multi-treatment and single/multi-task settings. Additionally, MTMT has been deployed in our gaming platform to improve user experience.

cs.LG↗

arXiv2024

MapTune: Advancing ASIC Technology Mapping via Reinforcement Learning Guided Library Tuning

Technology mapping involves mapping logical circuits to a library of cells. Traditionally, the full technology library is used, leading to a large search space and potential overhead. Motivated by randomly sampled technology mapping case studies, we propose MapTune framework that addresses this challenge by utilizing reinforcement learning to make design-specific choices during cell selection. By learning from the environment, MapTune refines the cell selection process, resulting in a reduced search space and potentially improved mapping quality. The effectiveness of MapTune is evaluated on a wide range of benchmarks, different technology libraries and technology mappers. The experimental results demonstrate that MapTune achieves higher mapping accuracy and reducing delay/area across diverse circuit designs, technology libraries and mappers. The paper also discusses the Pareto-Optimal exploration and confirms the perpetual delay-area trade-off. Conducted on benchmark suites ISCAS 85/89, ITC/ISCAS 99, VTR8.0 and EPFL benchmarks, the post-technology mapping and post-sizing quality-of-results (QoR) have been significantly improved, with average Area-Delay Product (ADP) improvement of 22.54\% among all different exploration settings in MapTune. The improvements are consistently remained for four different technologies (7nm, 45nm, 130nm, and 180 nm) and two different mappers.

cs.AR↗

arXiv2024

DAG-aware Synthesis Orchestration

The key methodologies of modern logic synthesis techniques are conducted on multi-level technology-independent representations such as And-Inverter-Graphs (AIGs) of the digital logic via directed-acyclic-graph (DAGs) traversal based structural rewriting, resubstitution, and refactoring. Existing state-of-the-art DAG-aware logic synthesis algorithms are all designed to perform stand-alone optimizations during a single DAG traversal. However, we empirically identify and demonstrate that these algorithms are limited in quality-of-results and runtime complexity due to this design concept. This work proposes Synthesis Orchestration, which orchestrates stand-alone operations within the single traversal of AIG. Thus, orchestration method explores more optimization opportunities and results in better performance. Our experimental results are comprehensively conducted on all 104 designs collected from ISCAS'85/89/99, VTR, and EPFL benchmark suites, with consistent logic minimization improvements over rewriting, resubstitution, refactoring, leading to an average of 4% more node reduction with improved runtime efficiency for the single optimization. Moreover, we evaluate orchestration as a plug-in algorithm in resyn and resyn3 flows in ABC, which demonstrates consistent logic minimization improvements (3.8% and 10.9% more node reduction on average). The runtime analysis demonstrates the orchestration outperforms stand-alone algorithms in both AIG minimization and runtime efficiency. Finally, we integrate the orchestration into OpenROAD for end-to-end performance evaluation. Our results demonstrate the advantages of the orchestration optimization technique, even after technology mapping and post-routing in the design flow have been conducted.

cs.AR↗

arXiv2024

Search for Classical Cepheids in Galactic Open Clusters and Calibration of the Period Wesenheit Metallicity Relation in the Gaia Bands

It is beneficial to calibrate the period Wesenheit metallicity relation (PWZR) of Delta Cephei stars (DCEPs), i.e., classical Cepheids, using accurate parallaxes of associated open clusters (OCs) from Gaia data release 3 (DR3). To this aim, we obtain a total of 43 OC-DCEPs (including 33 fundamental mode, 9 first overtone mode, and 1 multimode DCEPs.) and calibrate the PWZR as $W_G=(-3.356 \,\pm\, 0.033) \,(\log{P-1})+(-5.947 \,\pm\, 0.025)+(-0.285 \,\pm\, 0.064)[\textrm{Fe/H}]$. The concurrently obtained residual parallax offset in OC, $zp = -4\pm5\,μ\textrm{as}$, demonstrate the adequacy of the parallax corrections within the magnitude range of OC member stars. By comparing the field DCEPs' DR3 parallaxes with their photometric parallaxes derived by our PWZR, we estimated the residual parallax offset in field DCEPs as $zp = -15\pm3\,μ\textrm{as}$. Using our PWZR, we estimate the distance modulus of the Large Magellanic Cloud to be $18.482 \,\pm\, 0.040$ mag, which aligns well with the most accurate published value obtained through geometric methods.

astro-ph.SR↗

arXiv2024

CUPID: Improving Battle Fairness and Position Satisfaction in Online MOBA Games with a Re-matchmaking System

The multiplayer online battle arena (MOBA) genre has gained significant popularity and economic success, attracting considerable research interest within the Human-Computer Interaction community. Enhancing the gaming experience requires a deep understanding of player behavior, and a crucial aspect of MOBA games is matchmaking, which aims to assemble teams of comparable skill levels. However, existing matchmaking systems often neglect important factors such as players' position preferences and team assignment, resulting in imbalanced matches and reduced player satisfaction. To address these limitations, this paper proposes a novel framework called CUPID, which introduces a novel process called ``re-matchmaking'' to optimize team and position assignments to improve both fairness and player satisfaction. CUPID incorporates a pre-filtering step to ensure a minimum level of matchmaking quality, followed by a pre-match win-rate prediction model that evaluates the fairness of potential assignments. By simultaneously considering players' position satisfaction and game fairness, CUPID aims to provide an enhanced matchmaking experience. Extensive experiments were conducted on two large-scale, real-world MOBA datasets to validate the effectiveness of CUPID. The results surpass all existing state-of-the-art baselines, with an average relative improvement of 7.18% in terms of win prediction accuracy. Furthermore, CUPID has been successfully deployed in a popular online mobile MOBA game. The deployment resulted in significant improvements in match fairness and player satisfaction, as evidenced by critical Human-Computer Interaction (HCI) metrics covering usability, accessibility, and engagement, observed through A/B testing. To the best of our knowledge, CUPID is the first re-matchmaking system designed specifically for large-scale MOBA games.

cs.HC↗

arXiv2024

Differentiable Combinatorial Scheduling at Scale

This paper addresses the complex issue of resource-constrained scheduling, an NP-hard problem that spans critical areas including chip design and high-performance computing. Traditional scheduling methods often stumble over scalability and applicability challenges. We propose a novel approach using a differentiable combinatorial scheduling framework, utilizing Gumbel-Softmax differentiable sampling technique. This new technical allows for a fully differentiable formulation of linear programming (LP) based scheduling, extending its application to a broader range of LP formulations. To encode inequality constraints for scheduling tasks, we introduce \textit{constrained Gumbel Trick}, which adeptly encodes arbitrary inequality constraints. Consequently, our method facilitates an efficient and scalable scheduling via gradient descent without the need for training data. Comparative evaluations on both synthetic and real-world benchmarks highlight our capability to significantly improve the optimization efficiency of scheduling, surpassing state-of-the-art solutions offered by commercial and open-source solvers such as CPLEX, Gurobi, and CP-SAT in the majority of the designs.

cs.LG↗

arXiv2024

CODIS: Benchmarking Context-Dependent Visual Comprehension for Multimodal Large Language Models

Multimodal large language models (MLLMs) have demonstrated promising results in a variety of tasks that combine vision and language. As these models become more integral to research and applications, conducting comprehensive evaluations of their capabilities has grown increasingly important. However, most existing benchmarks fail to consider that, in certain situations, images need to be interpreted within a broader context. In this work, we introduce a new benchmark, named as CODIS, designed to assess the ability of models to use context provided in free-form text to enhance visual comprehension. Our findings indicate that MLLMs consistently fall short of human performance on this benchmark. Further analysis confirms that these models struggle to effectively extract and utilize contextual information to improve their understanding of images. This underscores the pressing need to enhance the ability of MLLMs to comprehend visuals in a context-dependent manner. View our project website at https://thunlp-mt.github.io/CODIS.

cs.CV↗