Search

This paper introduces OpenLS-DGF, an adaptive logic synthesis dataset generation framework, to enhance machine learning~(ML) applications within the logic synthesis process. Previous dataset generation flows were tailored for specific tasks or lacked integrated machine learning capabilities. While OpenLS-DGF supports various machine learning tasks by encapsulating the three fundamental steps of logic synthesis: Boolean representation, logic optimization, and technology mapping. It preserves the original information in both Verilog and machine-learning-friendly GraphML formats. The verilog files offer semi-customizable capabilities, enabling researchers to insert additional steps and incrementally refine the generated dataset. Furthermore, OpenLS-DGF includes an adaptive circuit engine that facilitates the final dataset management and downstream tasks. The generated OpenLS-D-v1 dataset comprises 46 combinational designs from established benchmarks, totaling over 966,000 Boolean circuits. OpenLS-D-v1 supports integrating new data features, making it more versatile for new challenges. This paper demonstrates the versatility of OpenLS-D-v1 through four distinct downstream tasks: circuit classification, circuit ranking, quality of results (QoR) prediction, and probability prediction. Each task is chosen to represent essential steps of logic synthesis, and the experimental results show the generated dataset from OpenLS-DGF achieves prominent diversity and applicability. The source code and datasets are available at https://github.com/Logic-Factory/ACE/blob/master/OpenLS-DGF/readme.md., Comment: 14 pages

Large Language Models (LLMs) like GPT-4, MedPaLM-2, and Med-Gemini achieve performance competitively with human experts across various medical benchmarks. However, they still face challenges in making professional diagnoses akin to physicians, particularly in efficiently gathering patient information and reasoning the final diagnosis. To this end, we introduce the RuleAlign framework, designed to align LLMs with specific diagnostic rules. We develop a medical dialogue dataset comprising rule-based communications between patients and physicians and design an alignment learning approach through preference learning. Experimental results demonstrate the effectiveness of the proposed approach. We hope that our work can serve as an inspiration for exploring the potential of LLMs as AI physicians., Comment: Ongoing work

In recent years, large-scale pre-trained diffusion models have demonstrated their outstanding capabilities in image and video generation tasks. However, existing models tend to produce visual objects commonly found in the training dataset, which diverges from user input prompts. The underlying reason behind the inaccurate generated results lies in the model's difficulty in sampling from specific intervals of the initial noise distribution corresponding to the prompt. Moreover, it is challenging to directly optimize the initial distribution, given that the diffusion process involves multiple denoising steps. In this paper, we introduce a Fine-tuning Initial Noise Distribution (FIND) framework with policy optimization, which unleashes the powerful potential of pre-trained diffusion networks by directly optimizing the initial distribution to align the generated contents with user-input prompts. To this end, we first reformulate the diffusion denoising procedure as a one-step Markov decision process and employ policy optimization to directly optimize the initial distribution. In addition, a dynamic reward calibration module is proposed to ensure training stability during optimization. Furthermore, we introduce a ratio clipping algorithm to utilize historical data for network training and prevent the optimized distribution from deviating too far from the original policy to restrain excessive optimization magnitudes. Extensive experiments demonstrate the effectiveness of our method in both text-to-image and text-to-video tasks, surpassing SOTA methods in achieving consistency between prompts and the generated content. Our method achieves 10 times faster than the SOTA approach. Our homepage is available at \url{https://github.com/vpx-ecnu/FIND-website}.

With the advent of Large Language Models (LLMs), medical artificial intelligence (AI) has experienced substantial technological progress and paradigm shifts, highlighting the potential of LLMs to streamline healthcare delivery and improve patient outcomes. Considering this rapid technical progress, in this survey, we trace the recent advances of Medical Large Language Models (Med-LLMs), including the background, key findings, and mainstream techniques, especially for the evolution from general-purpose models to medical-specialized applications. Firstly, we delve into the foundational technology of Med-LLMs, indicating how general models can be progressively adapted and refined for the complicated medical tasks. Secondly, the wide-ranging applications of Med-LLMs are investigated across various healthcare domains, as well as an up-to-date review of existing Med-LLMs. The transformative impact of these models on daily medical practice is evident through their ability to assist clinicians, educators, and patients. Recognizing the importance of responsible innovation, we discuss the challenges associated with ensuring fairness, accountability, privacy, and robustness. Ethical considerations, rigorous evaluation methodologies, and the establishment of regulatory frameworks are crucial for building trustworthiness in the real-world system. We emphasize the need for ongoing scrutiny and development to maintain high standards of safety and reliability. Finally, we anticipate possible future trajectories for Med-LLMs, identifying key avenues for prudent expansion. By consolidating these insights, our review aims to provide professionals and researchers with a thorough understanding of the strengths and limitations of Med-LLMs, fostering a balanced and ethical approach to their integration into the healthcare ecosystem.

Let A be a commutative noetherian local DG-ring with bounded cohomology. The Intersection Theorem for DG-modules is examined and some of its applications are provided. The first is to prove the DG-setting of the amplitude inequality, New Intersection Theorem and Krull's principle ideal theorem. The second is to solve completely the Minamoto's conjecture in [Israel J. Math. 242 (2021) 1-36]. The third is to show the DG-version of the Bass conjecture about Cohen-Macaulay rings and the Vasconcelos conjecture about Gorenstein rings., Comment: 18 pages, comments welcome!

Large language models (LLMs) are gaining increasing interests to improve clinical efficiency for medical diagnosis, owing to their unprecedented performance in modelling natural language. Ensuring the safe and reliable clinical applications, the evaluation of LLMs indeed becomes critical for better mitigating the potential risks, e.g., hallucinations. However, current evaluation methods heavily rely on labor-intensive human participation to achieve human-preferred judgements. To overcome this challenge, we propose an automatic evaluation paradigm tailored to assess the LLMs' capabilities in delivering clinical services, e.g., disease diagnosis and treatment. The evaluation paradigm contains three basic elements: metric, data, and algorithm. Specifically, inspired by professional clinical practice pathways, we formulate a LLM-specific clinical pathway (LCP) to define the clinical capabilities that a doctor agent should possess. Then, Standardized Patients (SPs) from the medical education are introduced as the guideline for collecting medical data for evaluation, which can well ensure the completeness of the evaluation procedure. Leveraging these steps, we develop a multi-agent framework to simulate the interactive environment between SPs and a doctor agent, which is equipped with a Retrieval-Augmented Evaluation (RAE) to determine whether the behaviors of a doctor agent are in accordance with LCP. The above paradigm can be extended to any similar clinical scenarios to automatically evaluate the LLMs' medical capabilities. Applying such paradigm, we construct an evaluation benchmark in the field of urology, including a LCP, a SPs dataset, and an automated RAE. Extensive experiments are conducted to demonstrate the effectiveness of the proposed approach, providing more insights for LLMs' safe and reliable deployments in clinical practice.

Despite significant strides in multimodal tasks, Multimodal Large Language Models (MLLMs) are plagued by the critical issue of hallucination. The reliable detection of such hallucinations in MLLMs has, therefore, become a vital aspect of model evaluation and the safeguarding of practical application deployment. Prior research in this domain has been constrained by a narrow focus on singular tasks, an inadequate range of hallucination categories addressed, and a lack of detailed granularity. In response to these challenges, our work expands the investigative horizons of hallucination detection. We present a novel meta-evaluation benchmark, MHaluBench, meticulously crafted to facilitate the evaluation of advancements in hallucination detection methods. Additionally, we unveil a novel unified multimodal hallucination detection framework, UNIHD, which leverages a suite of auxiliary tools to validate the occurrence of hallucinations robustly. We demonstrate the effectiveness of UNIHD through meticulous evaluation and comprehensive analysis. We also provide strategic insights on the application of specific tools for addressing various categories of hallucinations., Comment: Accepted by ACL 2024 (main conference)

We introduce RJUA-QA, a novel medical dataset for question answering (QA) and reasoning with clinical evidence, contributing to bridge the gap between general large language models (LLMs) and medical-specific LLM applications. RJUA-QA is derived from realistic clinical scenarios and aims to facilitate LLMs in generating reliable diagnostic and advice. The dataset contains 2,132 curated Question-Context-Answer pairs, corresponding about 25,000 diagnostic records and clinical cases. The dataset covers 67 common urological disease categories, where the disease coverage exceeds 97.6\% of the population seeking medical services in urology. Each data instance in RJUA-QA comprises: (1) a question mirroring real patient to inquiry about clinical symptoms and medical conditions, (2) a context including comprehensive expert knowledge, serving as a reference for medical examination and diagnosis, (3) a doctor response offering the diagnostic conclusion and suggested examination guidance, (4) a diagnosed clinical disease as the recommended diagnostic outcome, and (5) clinical advice providing recommendations for medical examination. RJUA-QA is the first medical QA dataset for clinical reasoning over the patient inquiries, where expert-level knowledge and experience are required for yielding diagnostic conclusions and medical examination advice. A comprehensive evaluation is conducted to evaluate the performance of both medical-specific and general LLMs on the RJUA-QA dataset. Our data is are publicly available at \url{https://github.com/alipay/RJU_Ant_QA}., Comment: An initial version

Recently, large language model (LLM) based artificial intelligence (AI) systems have demonstrated remarkable capabilities in natural language understanding and generation. However, these models face a significant challenge when it comes to sensitive applications, such as reasoning over medical knowledge and answering medical questions in a physician-like manner. Prior studies attempted to overcome this challenge by increasing the model size (>100B) to learn more general medical knowledge, while there is still room for improvement in LLMs with smaller-scale model sizes (<100B). In this work, we start from a pre-trained general LLM model (AntGLM-10B) and fine-tune it from a medical beginner towards a medical expert (called AntGLM-Med-10B), which leverages a 3-stage optimization procedure, i.e., general medical knowledge injection, medical domain instruction tuning, and specific medical task adaptation. Our contributions are threefold: (1) We specifically investigate how to adapt a pre-trained general LLM in medical domain, especially for a specific medical task. (2) We collect and construct large-scale medical datasets for each stage of the optimization process. These datasets encompass various data types and tasks, such as question-answering, medical reasoning, multi-choice questions, and medical conversations. (3) Specifically for multi-choice questions in the medical domain, we propose a novel Verification-of-Choice approach for prompting engineering, which significantly enhances the reasoning ability of LLMs. Remarkably, by combining the above approaches, our AntGLM-Med-10B model can outperform the most of LLMs on PubMedQA, including both general and medical LLMs, even when these LLMs have larger model size., Comment: Developed by Ant Group for PubMedQA leaderboard

Memory-augmented Large Language Models (LLMs) have demonstrated remarkable performance in long-term human-machine interactions, which basically relies on iterative recalling and reasoning of history to generate high-quality responses. However, such repeated recall-reason steps easily produce biased thoughts, \textit{i.e.}, inconsistent reasoning results when recalling the same history for different questions. On the contrary, humans can keep thoughts in the memory and recall them without repeated reasoning. Motivated by this human capability, we propose a novel memory mechanism called TiM (Think-in-Memory) that enables LLMs to maintain an evolved memory for storing historical thoughts along the conversation stream. The TiM framework consists of two crucial stages: (1) before generating a response, a LLM agent recalls relevant thoughts from memory, and (2) after generating a response, the LLM agent post-thinks and incorporates both historical and new thoughts to update the memory. Thus, TiM can eliminate the issue of repeated reasoning by saving the post-thinking thoughts as the history. Besides, we formulate the basic principles to organize the thoughts in memory based on the well-established operations, (\textit{i.e.}, insert, forget, and merge operations), allowing for dynamic updates and evolution of the thoughts. Furthermore, we introduce Locality-Sensitive Hashing into TiM to achieve efficient retrieval for the long-term conversations. We conduct qualitative and quantitative experiments on real-world and simulated dialogues covering a wide range of topics, demonstrating that equipping existing LLMs with TiM significantly enhances their performance in generating responses for long-term interactions.

High-quality labeled datasets are essential for deep learning. Traditional manual annotation methods are not only costly and inefficient but also pose challenges in specialized domains where expert knowledge is needed. Self-supervised methods, despite leveraging unlabeled data for feature extraction, still require hundreds or thousands of labeled instances to guide the model for effective specialized image classification. Current unsupervised learning methods offer automatic classification without prior annotation but often compromise on accuracy. As a result, efficiently procuring high-quality labeled datasets remains a pressing challenge for specialized domain images devoid of annotated data. Addressing this, an unsupervised classification method with three key ideas is introduced: 1) dual-step feature dimensionality reduction using a pre-trained model and manifold learning, 2) a voting mechanism from multiple clustering algorithms, and 3) post-hoc instead of prior manual annotation. This approach outperforms supervised methods in classification accuracy, as demonstrated with fungal image data, achieving 94.1% and 96.7% on public and private datasets respectively. The proposed unsupervised classification method reduces dependency on pre-annotated datasets, enabling a closed-loop for data classification. The simplicity and ease of use of this method will also bring convenience to researchers in various fields in building datasets, promoting AI applications for images in specialized domains.

Let $R$ be a commutative noetherian ring and $\mathfrak{a}$ an ideal of $R$. The goal of this paper is to establish the local-global principle for the artinianness dimension $r_{\mathfrak{a}}(M)$, where $r_{\mathfrak{a}}(M)$ is the smallest integer such that the local homology module of $M$ is not artinian. For an artinian $R$-module $M$ with the set $\mathrm{Coass}_{R}\mathrm{H}_{r_{\mathfrak{a}}(M)}^{\mathfrak{a}}(M)$ finite, we show that $r_{\mathfrak{a}}(M)=\mathrm{inf}\{r_{\mathfrak{a}R_{\mathfrak{p}}}(\mathrm{Hom}_{R}(R_{\mathfrak{p}},M)) \hspace{0.03cm}|\hspace{0.03cm}\mathfrak{p}\in \mathrm{Spec}R\}$. And the class of all modules $N$ such that $\mathrm{Coass}_{R}N$ is finite is studied., Comment: 9 pages

In recent years, novel view synthesis has gained popularity in generating high-fidelity images. While demonstrating superior performance in the task of synthesizing novel views, the majority of these methods are still based on the conventional multi-layer perceptron for scene embedding. Furthermore, light field models suffer from geometric blurring during pixel rendering, while radiance field-based volume rendering methods have multiple solutions for a certain target of density distribution integration. To address these issues, we introduce the Convolutional Neural Radiance Fields to model the derivatives of radiance along rays. Based on 1D convolutional operations, our proposed method effectively extracts potential ray representations through a structured neural network architecture. Besides, with the proposed ray modeling, a proposed recurrent module is employed to solve geometric ambiguity in the fully neural rendering process. Extensive experiments demonstrate the promising results of our proposed model compared with existing state-of-the-art methods., Comment: 16 pages, 11 figures

With the growing popularity of various mobile devices, user targeting has received a growing amount of attention, which aims at effectively and efficiently locating target users that are interested in specific services. Most pioneering works for user targeting tasks commonly perform similarity-based expansion with a few active users as seeds, suffering from the following major issues: the unavailability of seed users for newcoming services and the unfriendliness of black-box procedures towards marketers. In this paper, we design an Entity Graph Learning (EGL) system to provide explainable user targeting ability meanwhile applicable to addressing the cold-start issue. EGL System follows the hybrid online-offline architecture to satisfy the requirements of scalability and timeliness. Specifically, in the offline stage, the system focuses on the heavyweight entity graph construction and user entity preference learning, in which we propose a Three-stage Relation Mining Procedure (TRMP), breaking loose from the expensive seed users. At the online stage, the system offers the ability of user targeting in real-time based on the entity graph from the offline stage. Since the user targeting process is based on graph reasoning, the whole process is transparent and operation-friendly to marketers. Finally, extensive offline experiments and online A/B testing demonstrate the superior performance of the proposed EGL System., Comment: Accepted by ICDE 2023

We define and study a notion of G-dimension for DG-modules over a non-positively graded commutative noetherian DG-ring $A$. Some criteria for the finiteness of the G-dimension of a DG-module are given by applying a DG-version of projective resolution introduced by Minamoto [Israel J. Math. 245 (2021) 409-454]. Moreover, it is proved that the finiteness of G-dimension characterizes the local Gorenstein property of $A$. Applications go in three directions. The first is to establish the connection between G-dimensions and the little finitistic dimensions of &\mathcal{A}&. The second is to characterize Cohen-Macaulay and Gorenstein DG-rings by the relations between the class of maximal local-Cohen-Macaulay DG-modules and a special G-class of DG-modules. The third is to extend the classical Buchwtweiz-Happel Theorem and its inverse from commutative noetherian local rings to the setting of commutative noetherian local DG-rings., Comment: 18 pages. Any comments or suggestions are welcome!

Let $\mathfrak{a}$ be an ideal of a commutative noetherian ring $R$, $\mathcal{S}$ a Serre subcategory of $R$-modules satisfying the condition $C_\mathfrak{a}$ and $\mathcal{N}$ the subcategory of finitely generated $R$-modules. In this paper, we continue the study of $\mathcal{NS}$-$\mathfrak{a}$-cofinite modules with respect to the extension subcategory $\mathcal{NS}$, show that some classical results of $\mathfrak{a}$-cofiniteness hold for $\mathcal{NS}$-$\mathfrak{a}$-cofiniteness in the cases $\mathrm{dim}R=d$ or $\mathrm{dim}R/\mathfrak{a}=d-1$, where $d$ is a positive integer. We also study $\mathcal{NS}$-$\mathfrak{a}$-cofiniteness of local cohomology modules and the modules $\mathrm{Ext}^i_R(N,M)$ and $\mathrm{Tor}_i^R(N,M)$., Comment: 14 pages, comments welcome

Let $\mathfrak{a}$ be an ideal of a commutative noetherian ring $R$ and $M, N$ two finitely generated $R$-modules. By using a spectral sequence argument, it is shown that if either $\mathrm{dim}_RM\leq2$ and $\mathrm{H}^{i}_\mathfrak{a}(N)$ are $\mathfrak{a}$-cofinite for all $i\geq0$, or $\mathrm{H}^{i}_\mathfrak{a}(N)$ is an $\mathfrak{a}$-cofinite module of dimension $\leq1$ for each $i\geq1$, or $q(\mathfrak{a},R)\leq1$, then the $R$-modules $\mathrm{H}^{t}_\mathfrak{a}(M,N)$ are $\mathfrak{a}$-cofinite for all $t\geq0$., Comment: 9 pages, Comments welcome!

The materials exhibiting exchange bias (EB) have been extensively investigated mainly due to their great technological applications in magnetic sensors, but its underlying mechanism remains elusive. Here we report the novel coexistence of in-plane and out-of-plane EB in the Cr-doped Mn3Sn, a non-colinear antiferromagnet with a geometrically frustrated Kagome plane of Mn. Field-cooling experiments with the applied field parallel and perpendicular to the frustrated Kagome plane exhibits loop shifts and enhanced coercivities. Interestingly, a maximum EB field of 1090 Oe is observed along out-of-plane direction in the Mn2.58Cr0.42Sn sample, higher than that of in-plane value. Our results indicate that the exchange bias along perpendicular kagome plane is primarily induced by Dzyaloshinskii-Moriya interactions due to the breaking of interfacial symmetry, while the EB along kagome plane is due to the exchange effects at interface of AFM and FM component originating from the net moment. These findings provide a new insight on EB in the kagome AFM materials, which are important and highly potential to the application of antiferromagnetic spintronics.

Let $\mathfrak{a}$ be a proper ideal of a commutative noetherian ring $R$ and $d$ a positive integer. We answer Hartshorne's question on cofinite complexes completely in the cases $\mathrm{dim}R=d$ or $\mathrm{dim}R/\mathfrak{a}=d-1$ or $\mathrm{ara}(\mathfrak{a})=d-1$, show that if $d\leq2$ then an $R$-complex $X\in\mathrm{D}_\sqsubset(R)$ is $\mathfrak{a}$-cofinite if and only if each homology module $\mathrm{H}_i(X)$ is $\mathfrak{a}$-cofinite; if $\mathfrak{a}$ is a perfect ideal and $R$ is regular local with $d\leq2$ then an $R$-complex $X\in\mathrm{D}(R)$ is $\mathfrak{a}$-cofinite if and only if $\mathrm{H}_i(X)$ is $\mathfrak{a}$-cofinite for every $i\in\mathbb{Z}$; if $d\geq3$ then for an $R$-complex $X$ of $\mathfrak{a}$-cofinite $R$-modules, each $\mathrm{H}_i(X)$ is $\mathfrak{a}$-cofinite if and only if $\mathrm{Ext}^j_R(R/\mathfrak{a},\mathrm{coker}d_i)$ are finitely generated for $j\leq d-2$. We also study cofiniteness of local cohomology $\mathrm{H}^i_\mathfrak{a}(X)$ for an $R$-complex $X\in\mathrm{D}_\sqsubset(R)$ in the above cases. The crucial step to achieve these is to recruit the technique of spectral sequences., Comment: 20 pages, 3 figure, Comments welcome! arXiv admin note: text overlap with arXiv:2109.04613; text overlap with arXiv:2010.03013 by other authors

Let $(R,\mathfrak{m})$ be a commutative noetherian local ring with $\mathfrak{m}$-adic topology, $I$ an ideal of $R$. We investigate coartinianess of $\mathrm{Ext}$ and $\mathrm{Tor}$, show that the $R$-module $\mathrm{Ext}_{R}^{i}(N,M)$ is $I$-coartinian if $M$ is a linearly compact $I$-coartinian $R$-module and $N$ is an $I$-cofinite $R$-module of dimension at most $1$; the $R$-module $\mathrm{Tor}_{i}^{R}(N,M)$ is $I$-coartinian in the case $M$ is semi-discrete linearly compact $I$-coartinian and $N$ is finitely generated with dimension at most $2$., Comment: Comments welcome

Let $(R,\mathfrak{m})$ be a commutative local noetherian ring. For an artinian $R$-module $M$, we show the equality $$\mathrm{cosupp}_RM=\mathrm{Cosupp}_RM$$ using the semi-discrete linearly compactness of $R$-module $\mathrm{Hom}_R(R_\mathfrak{p},M)$ where $\mathfrak{p}$ is a prime ideal of $R$., Comment: 7 pages,comments welcome

Let $\mathfrak{a}$ be an ideal of a commutative noetherian ring $R$ and $M$ an $R$-module with Cosupport in $\mathrm{V}(\mathfrak{a})$. We show that $M$ is $\mathfrak{a}$-coartinian if and only if $\mathrm{Ext}_{R}^{i}(R/\mathfrak{a},M)$ is artinian for all $0\leq i\leq \mathrm{cd}(\mathfrak{a},M)$, which provides a computable finitely many steps to examine $\mathfrak{a}$-coartinianness. We also consider the duality of Hartshorne's questions: for which rings $R$ and ideals $\mathfrak{a}$ are the modules $\mathrm{H}^{\mathfrak{a}}_{i}(M)$ $\mathfrak{a}$-coartinian for all $i\geq 0$; whether the category $\mathcal{C}(R,\mathfrak{a})_{coa}$ of $\mathfrak{a}$-coartinian modules is an Abelian subcategory of the category of all $R$-modules, and establish affirmative answers to these questions in the case $\mathrm{cd}(\mathfrak{a},R)\leq 1$ and $\mathrm{dim}R/\mathfrak{a}\leq 1$., Comment: 14 pages. Comments welcome

Let $\mathfrak{a}$ be an ideal of a noetherian (not necessarily local) ring $R$ and $M$ an $R$-module with $\mathrm{Supp}_RM\subseteq\mathrm{V}(\mathfrak{a})$. We show that if $\mathrm{dim}_RM\leq2$, then $M$ is $\mathfrak{a}$-cofinite if and only if $\mathrm{Ext}^i_R(R/\mathfrak{a},M)$ are finitely generated for all $i\leq 2$, which generalizes one of the main results in [Algebr. Represent. Theory 18 (2015) 369--379]. Some new results concerning cofiniteness of local cohomology modules $\mathrm{H}^i_\mathfrak{a}(M)$ for any finitely generated $R$-module $M$ are obtained., Comment: comments welcome