Searcharxiv⌕ Search

arXiv subjects

Liangyu Chen

Publications and source records attributed to Liangyu Chen.

At least 55 records · Page 3Linked to original sources

C3oT: Generating Shorter Chain-of-Thought without Compromising Effectiveness

Generating Chain-of-Thought (CoT) before deriving the answer can effectively improve the reasoning capabilities of large language models (LLMs) and significantly improve the accuracy of the generated answer. However, in most cases, the length of the generated CoT is much longer than the desired final answer, which results in additional decoding costs. Furthermore, existing research has discovered that shortening the reasoning steps in CoT, even while preserving the key information, diminishes LLMs' abilities. These phenomena make it difficult to use LLMs and CoT in many real-world applications that only require the final answer and are sensitive to latency, such as search and recommendation. To reduce the costs of model decoding and shorten the length of the generated CoT, this paper presents $\textbf{C}$onditioned $\textbf{C}$ompressed $\textbf{C}$hain-of-$\textbf{T}$hought (C3oT), a CoT compression framework that involves a compressor to compress an original longer CoT into a shorter CoT while maintaining key information and interpretability, a conditioned training method to train LLMs with both longer CoT and shorter CoT simultaneously to learn the corresponding relationships between them, and a conditioned inference method to gain the reasoning ability learned from longer CoT by generating shorter CoT. We conduct experiments over four datasets from arithmetic and commonsense scenarios, showing that the proposed method is capable of compressing the length of generated CoT by up to more than 50% without compromising its effectiveness.

cs.CL↗

Holographic Renyi entropy of 2d CFT in KdV generalized ensemble

The eigenstate thermalization hypothesis (ETH) in chaotic two dimensional CFTs is subtle due to infinitely many conserved KdV charges. Previous works have demonstrated that primary CFT eigenstates have flat entanglement spectrum, which is very different from the microcanonical ensemble. This result is an apparent contradiction to conventional ETH, which does not take KdV charges into account. In a companion paper \cite{KdVETHgeneral}, we resolve this discrepancy by studying the subsystem entropy of a chaotic CFT in KdV-generalized Gibbs and microcanonical ensembles. In this paper, we carry out parallel computations in the context of AdS/CFT. We focus on the high density limit, which is equivalent to thermodynamic limit in conformal theories. In this limit holographic Renyi entropy can be computed using the so-called gluing construction. We explicitly study the KdV-generalized microcanonical ensemble with the densities of the first two KdV charges $\langle \mathcal{Q}_1\rangle = q_1,\langle \mathcal{Q}_3\rangle = q_3$ fixed and obeying $q_3-q_1^2 \ll q_1^2$. In this regime we found that the refined Renyi entropy $\tilde{S}_n$ is $n$-independent for $n>n_{cut}$, where $n_{cut}$ depends on $q_1,q_3$. By taking the primary state limit $q_3\to q_1^2$, we recover flat entanglement spectrum characteristic of fixed-area states, in agreement with the primary state behavior. This provides a consistency check of the KdV-generalized ETH in 2d CFTs.

hep-th↗

Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving

Cutting planes (cuts) are crucial for solving Mixed Integer Linear Programming (MILP) problems. Advanced MILP solvers typically rely on manually designed heuristic algorithms for cut selection, which require much expert experience and cannot be generalized for different scales of MILP problems. Therefore, learning-based methods for cut selection are considered a promising direction. State-of-the-art learning-based methods formulate cut selection as a sequence-to-sequence problem, easily handled by sequence models. However, the existing sequence models need help with the following issues: (1) the model only captures cut information while neglecting the Linear Programming (LP) relaxation; (2) the sequence model utilizes positional information of the input sequence, which may influence cut selection. To address these challenges, we design a novel learning model HGTSM for better select cuts. We encode MILP problem state as a heterogeneous tripartite graph, utilizing heterogeneous graph networks to fully capture the underlying structure of MILP problems. Simultaneously, we propose a novel sequence model whose architecture is tailored to handle inputs in different orders. Experimental results demonstrate that our model outperforms heuristic methods and learning-based baselines on multiple challenging MILP datasets. Additionally, the model exhibits stability and the ability to generalize to different types of problems.

math.OC↗

MMLongBench-Doc: Benchmarking Long-context Document Understanding with Visualizations

Understanding documents with rich layouts and multi-modal components is a long-standing and practical task. Recent Large Vision-Language Models (LVLMs) have made remarkable strides in various tasks, particularly in single-page document understanding (DU). However, their abilities on long-context DU remain an open problem. This work presents MMLongBench-Doc, a long-context, multi-modal benchmark comprising 1,062 expert-annotated questions. Distinct from previous datasets, it is constructed upon 130 lengthy PDF-formatted documents with an average of 49.4 pages and 20,971 textual tokens. Towards comprehensive evaluation, answers to these questions rely on pieces of evidence from (1) different sources (text, image, chart, table, and layout structure) and (2) various locations (i.e. page number). Moreover, 33.2% of the questions are cross-page questions requiring evidence across multiple pages. 22.8% of the questions are designed to be unanswerable for detecting potential hallucinations. Experiments on 14 LVLMs demonstrate that long-context DU greatly challenges current models. Notably, the best-performing model, GPT-4o, achieves an F1 score of only 42.7%, while the second-best, GPT-4V, scores 31.4%. Furthermore, 12 LVLMs (all except GPT-4o and GPT-4V) even present worse performance than their LLM counterparts which are fed with lossy-parsed OCR documents. These results validate the necessity of future research toward more capable long-context LVLMs. Project Page: https://mayubo2333.github.io/MMLongBench-Doc

cs.CV↗

Fast unconditional reset and leakage reduction in fixed-frequency transmon qubits

The realization of fault-tolerant quantum computing requires the execution of quantum error-correction (QEC) schemes, to mitigate the fragile nature of qubits. In this context, to ensure the success of QEC, a protocol capable of implementing both qubit reset and leakage reduction is highly desirable. We demonstrate such a protocol in an architecture consisting of fixed-frequency transmon qubits pair-wise coupled via tunable couplers -- an architecture that is compatible with the surface code. We use tunable couplers to transfer any undesired qubit excitation to the readout resonator of the qubit, from which this excitation decays into the feedline. In total, the combination of qubit reset, leakage reduction, and coupler reset takes only 83ns to complete. Our reset scheme is fast, unconditional, and achieves fidelities well above 99%, thus enabling fixed-frequency qubit architectures as future implementations of fault-tolerant quantum computers. Our protocol also provides a means to both reduce QEC cycle runtime and improve algorithmic fidelity on quantum computers.

quant-ph↗

Subsystem entropy in 2d CFT and KdV ETH

We study subsystem entropy in 2d CFTs, for subsystems constituting a finite fraction of the full system. We focus on the extensive contribution, which scales linearly with the subsystem size in the thermodynamic limit. We employ the so-called diagonal approximation to evaluate subsystem entropy for the chaotic CFTs in thermal state (canonical ensemble), microcanonical ensemble, and in a primary state, matching previously known results. We then proceed to find analytic expressions for the subsystem entropy at leading order in $c$, when the global CFT state is the KdV generalized Gibbs ensemble or the KdV microcanonical ensemble. Previous studies of primary eigenstates have shown that, akin to fixed-area states in AdS/CFT, corresponding subsystem entanglement spectrum is flat. This behavior is seemingly in sharp contradiction with the one for the thermal (microcanonical) state, and thus in apparent contradiction with the subsystem Eigenstate Thermalization Hypothesis (ETH). In this work, we resolve this issue by comparing the primary state with the KdV (micro)canonical ensemble. We show that the results are consistent with the KdV-generalized version of the subsystem ETH, in which local properties of quantum eigenstates are governed by their values of conserved KdV charges. Our work solidifies evidence for the KdV-generalized ETH in 2d CFTs and emphasizes Renyi entropy as a sensitive probe of the reduced-density matrix.

hep-th↗

Diversify and Conquer: Diversity-Centric Data Selection with Iterative Refinement

Finetuning large language models on instruction data is crucial for enhancing pre-trained knowledge and improving instruction-following capabilities. As instruction datasets proliferate, selecting optimal data for effective training becomes increasingly important. This work addresses the question: How can we determine the optimal subset of data for effective training? While existing research often emphasizes local criteria like instance quality for subset selection, we argue that a global approach focused on data diversity is more critical. Our method employs k-means clustering to ensure the selected subset effectively represents the full dataset. We propose an iterative refinement method inspired by active learning techniques to resample instances from clusters, reassessing each cluster's importance and sampling weight in every training iteration. This approach reduces the effect of outliers and automatically filters out clusters containing low-quality data. Through extensive evaluation across natural language reasoning, general world knowledge, code and math reasoning tasks, and by fine-tuning models from various families, we observe consistent improvements, achieving a 7% increase over random selection and a 3.8% improvement over state-of-the-art sampling methods. Our work highlights the significance of diversity-first sampling when finetuning LLMs to enhance performance across a broad array of evaluation tasks. Our code is available at https://github.com/for-ai/iterative-data-selection.

cs.CL↗

Signal crosstalk in a flip-chip quantum processor

Quantum processors require a signal-delivery architecture with high addressability (low crosstalk) to ensure high performance already at the scale of dozens of qubits. Signal crosstalk causes inadvertent driving of quantum gates, which will adversely affect quantum-gate fidelities in scaled-up devices. Here, we demonstrate packaged flip-chip superconducting quantum processors with signal-crosstalk performance competitive with those reported in other platforms. For capacitively coupled qubit-drive lines, we find on-resonant crosstalk better than -27 dB (average -37 dB). For inductively coupled magnetic-flux-drive lines, we find less than 0.13 % direct-current flux crosstalk (average 0.05 %). These observed crosstalk levels are adequately small and indicate a decreasing trend with increasing distance, which is promising for further scaling up to larger numbers of qubits. We discuss the implication of our results for the design of a low-crosstalk, on-chip signal delivery architecture, including the influence of a shielding tunnel structure, potential sources of crosstalk, and estimation of crosstalk-induced qubit-gate error in scaled-up quantum processors.

quant-ph↗

A small footprint travelling-wave parametric amplifier with a high Signal-to-Noise Ratio improvement in a wide band

We characterise a small footprint travelling-wave parametric amplifier (TWPA). The TWPA is built with magnetically flux-tunable superconducting nonlinear asymmetric inductive elements (SNAILs) and parallel-plate capacitors. It implements three-wave mixing (3WM) with resonant phase matching (RPM), a small cutoff frequency for high gain per unitcell and impedance matching networks for large bandwidth impedance matching. The device has 200 unitcells and a physical footprint of only 1.1 mm^2, yet demonstrates an average parametric gain of 19 dB over a 3 GHz bandwidth, an average effective signal-to-noise ratio improvement of 10 dB and a clear speedup of qubit readout time.

physics.app-ph↗

Unveiling Visual Biases in Audio-Visual Localization Benchmarks

Audio-Visual Source Localization (AVSL) aims to localize the source of sound within a video. In this paper, we identify a significant issue in existing benchmarks: the sounding objects are often easily recognized based solely on visual cues, which we refer to as visual bias. Such biases hinder these benchmarks from effectively evaluating AVSL models. To further validate our hypothesis regarding visual biases, we examine two representative AVSL benchmarks, VGG-SS and EpicSounding-Object, where the vision-only models outperform all audiovisual baselines. Our findings suggest that existing AVSL benchmarks need further refinement to facilitate audio-visual learning.

cs.MM↗

Dissecting Quantum Many-body Chaos in the Krylov Space

The growth of simple operators is essential for the emergence of chaotic dynamics and quantum thermalization. Recent studies have proposed different measures, including the out-of-time-order correlator and Krylov complexity. It is established that the out-of-time-order correlator serves as the signature of quantum many-body chaos, while the Krylov complexity provides its upper bound. However, there exist non-chaotic systems in which Krylov complexity grows exponentially, indicating that the Krylov complexity itself is not a witness of many-body chaos. In this letter, we introduce the missing ingredient, named as the Krylov metric $K_{mn}$, which probes the size of the Krylov basis. We propose that the universal criteria for fast scramblers include (i) the exponential growth of Krylov complexity, (ii) the diagonal elements $K_{nn}\sim n^h$ with $h\in(0,1]$, and (iii) the negligibility of off-diagonal elements $K_{mn}$ with $m\neq n$. We further show that $h=\varkappa / 2α$ is a ratio between the quantum Lyapunov exponent $\varkappa$ and the Krylov exponent $α$. This proposal is supported by both generic arguments and explicit examples, including solvable SYK models, Luttinger Liquids, and many-body localized systems. Our results provide a refined understanding of how chaotic dynamics emerge from the Krylov space perspective.

quant-ph↗

From LLM to Conversational Agent: A Memory Enhanced Architecture with Fine-Tuning of Large Language Models

This paper introduces RAISE (Reasoning and Acting through Scratchpad and Examples), an advanced architecture enhancing the integration of Large Language Models (LLMs) like GPT-4 into conversational agents. RAISE, an enhancement of the ReAct framework, incorporates a dual-component memory system, mirroring human short-term and long-term memory, to maintain context and continuity in conversations. It entails a comprehensive agent construction scenario, including phases like Conversation Selection, Scene Extraction, CoT Completion, and Scene Augmentation, leading to the LLMs Training phase. This approach appears to enhance agent controllability and adaptability in complex, multi-turn dialogues. Our preliminary evaluations in a real estate sales context suggest that RAISE has some advantages over traditional agents, indicating its potential for broader applications. This work contributes to the AI field by providing a robust framework for developing more context-aware and versatile conversational agents.

cs.CL↗

FAAC: Facial Animation Generation with Anchor Frame and Conditional Control for Superior Fidelity and Editability

Over recent years, diffusion models have facilitated significant advancements in video generation. Yet, the creation of face-related videos still confronts issues such as low facial fidelity, lack of frame consistency, limited editability and uncontrollable human poses. To address these challenges, we introduce a facial animation generation method that enhances both face identity fidelity and editing capabilities while ensuring frame consistency. This approach incorporates the concept of an anchor frame to counteract the degradation of generative ability in original text-to-image models when incorporating a motion module. We propose two strategies towards this objective: training-free and training-based anchor frame methods. Our method's efficacy has been validated on multiple representative DreamBooth and LoRA models, delivering substantial improvements over the original outcomes in terms of facial fidelity, text-to-image editability, and video motion. Moreover, we introduce conditional control using a 3D parametric face model to capture accurate facial movements and expressions. This solution augments the creative possibilities for facial animation generation through the integration of multiple control signals. For additional samples, please visit https://paper-faac.github.io/.

cs.CV↗

Panoptic Video Scene Graph Generation

Towards building comprehensive real-world visual perception systems, we propose and study a new problem called panoptic scene graph generation (PVSG). PVSG relates to the existing video scene graph generation (VidSGG) problem, which focuses on temporal interactions between humans and objects grounded with bounding boxes in videos. However, the limitation of bounding boxes in detecting non-rigid objects and backgrounds often causes VidSGG to miss key details crucial for comprehensive video understanding. In contrast, PVSG requires nodes in scene graphs to be grounded by more precise, pixel-level segmentation masks, which facilitate holistic scene understanding. To advance research in this new area, we contribute the PVSG dataset, which consists of 400 videos (289 third-person + 111 egocentric videos) with a total of 150K frames labeled with panoptic segmentation masks as well as fine, temporal scene graphs. We also provide a variety of baseline methods and share useful design practices for future work.

cs.CV↗

DUMA: a Dual-Mind Conversational Agent with Fast and Slow Thinking

Inspired by the dual-process theory of human cognition, we introduce DUMA, a novel conversational agent framework that embodies a dual-mind mechanism through the utilization of two generative Large Language Models (LLMs) dedicated to fast and slow thinking respectively. The fast thinking model serves as the primary interface for external interactions and initial response generation, evaluating the necessity for engaging the slow thinking model based on the complexity of the complete response. When invoked, the slow thinking model takes over the conversation, engaging in meticulous planning, reasoning, and tool utilization to provide a well-analyzed response. This dual-mind configuration allows for a seamless transition between intuitive responses and deliberate problem-solving processes based on the situation. We have constructed a conversational agent to handle online inquiries in the real estate industry. The experiment proves that our method balances effectiveness and efficiency, and has a significant improvement compared to the baseline.

cs.CL↗

Large Language Models are Visual Reasoning Coordinators

Visual reasoning requires multimodal perception and commonsense cognition of the world. Recently, multiple vision-language models (VLMs) have been proposed with excellent commonsense reasoning ability in various domains. However, how to harness the collective power of these complementary VLMs is rarely explored. Existing methods like ensemble still struggle to aggregate these models with the desired higher-order communications. In this work, we propose Cola, a novel paradigm that coordinates multiple VLMs for visual reasoning. Our key insight is that a large language model (LLM) can efficiently coordinate multiple VLMs by facilitating natural language communication that leverages their distinct and complementary capabilities. Extensive experiments demonstrate that our instruction tuning variant, Cola-FT, achieves state-of-the-art performance on visual question answering (VQA), outside knowledge VQA, visual entailment, and visual spatial reasoning tasks. Moreover, we show that our in-context learning variant, Cola-Zero, exhibits competitive performance in zero and few-shot settings, without finetuning. Through systematic ablation studies and visualizations, we validate that a coordinator LLM indeed comprehends the instruction prompts as well as the separate functionalities of VLMs; it then coordinates them to enable impressive visual reasoning capabilities.

cs.CV↗

LAMP: Learn A Motion Pattern for Few-Shot-Based Video Generation

With the impressive progress in diffusion-based text-to-image generation, extending such powerful generative ability to text-to-video raises enormous attention. Existing methods either require large-scale text-video pairs and a large number of training resources or learn motions that are precisely aligned with template videos. It is non-trivial to balance a trade-off between the degree of generation freedom and the resource costs for video generation. In our study, we present a few-shot-based tuning framework, LAMP, which enables text-to-image diffusion model Learn A specific Motion Pattern with 8~16 videos on a single GPU. Specifically, we design a first-frame-conditioned pipeline that uses an off-the-shelf text-to-image model for content generation so that our tuned video diffusion model mainly focuses on motion learning. The well-developed text-to-image techniques can provide visually pleasing and diverse content as generation conditions, which highly improves video quality and generation freedom. To capture the features of temporal dimension, we expand the pretrained 2D convolution layers of the T2I model to our novel temporal-spatial motion learning layers and modify the attention blocks to the temporal level. Additionally, we develop an effective inference trick, shared-noise sampling, which can improve the stability of videos with computational costs. Our method can also be flexibly applied to other tasks, e.g. real-world image animation and video editing. Extensive experiments demonstrate that LAMP can effectively learn the motion pattern on limited data and generate high-quality videos. The code and models are available at https://rq-wu.github.io/projects/LAMP.

cs.CV↗

ChatHome: Development and Evaluation of a Domain-Specific Language Model for Home Renovation

This paper presents the development and evaluation of ChatHome, a domain-specific language model (DSLM) designed for the intricate field of home renovation. Considering the proven competencies of large language models (LLMs) like GPT-4 and the escalating fascination with home renovation, this study endeavors to reconcile these aspects by generating a dedicated model that can yield high-fidelity, precise outputs relevant to the home renovation arena. ChatHome's novelty rests on its methodology, fusing domain-adaptive pretraining and instruction-tuning over an extensive dataset. This dataset includes professional articles, standard documents, and web content pertinent to home renovation. This dual-pronged strategy is designed to ensure that our model can assimilate comprehensive domain knowledge and effectively address user inquiries. Via thorough experimentation on diverse datasets, both universal and domain-specific, including the freshly introduced "EvalHome" domain dataset, we substantiate that ChatHome not only amplifies domain-specific functionalities but also preserves its versatility.

cs.CL↗