SearcharxivSearch

arXiv subjects

Yun Liao

Publications and source records attributed to Yun Liao.

17 recordsLinked to original sources

Compositional Generalization from Learned Skills via CoT Training: A Theoretical and Structural Analysis for Reasoning

Chain-of-Thought (CoT) training has markedly advanced the reasoning capabilities of large language models (LLMs), yet the mechanisms by which CoT training enhances generalization remain inadequately understood. In this work, we demonstrate that compositional generalization is fundamental: models systematically combine simpler learned skills during CoT training to address novel and more complex problems. Through a theoretical and structural analysis, we formalize this process: 1) Theoretically, the information-theoretic generalization bounds through distributional divergence can be decomposed into in-distribution (ID) and out-of-distribution (OOD) components. Specifically, the non-CoT models fail on OOD tasks due to unseen compositional patterns, whereas CoT-trained models achieve strong generalization by composing previously learned skills. In addition, controlled experiments and real-world validation confirm that CoT training accelerates convergence and enhances generalization from ID to both ID and OOD scenarios while maintaining robust performance even with tolerable noise. 2) Structurally, CoT training internalizes reasoning into a two-stage compositional circuit, where the number of stages corresponds to the explicit reasoning steps during training. Notably, CoT-trained models resolve intermediate results at shallower layers compared to non-CoT counterparts, freeing up deeper layers to specialize in subsequent reasoning steps. A key insight is that CoT training teaches models how to think-by fostering compositional reasoning-rather than merely what to think, through the provision of correct answers alone. This paper offers valuable insights for designing CoT strategies to enhance LLMs' reasoning robustness.

cs.LG

Rethinking External Slow-Thinking: From Snowball Errors to Probability of Correct Reasoning

Test-time scaling, which is also often referred to as slow-thinking, has been demonstrated to enhance multi-step reasoning in large language models (LLMs). However, despite its widespread utilization, the mechanisms underlying slow-thinking methods remain poorly understood. This paper explores the mechanisms of external slow-thinking from a theoretical standpoint. We begin by examining the snowball error effect within the LLM reasoning process and connect it to the likelihood of correct reasoning using information theory. Building on this, we show that external slow-thinking methods can be interpreted as strategies to mitigate the error probability. We further provide a comparative analysis of popular external slow-thinking approaches, ranging from simple to complex, highlighting their differences and interrelationships. Our findings suggest that the efficacy of these methods is not primarily determined by the specific framework employed, and that expanding the search scope or the model's internal reasoning capacity may yield more sustained improvements in the long term. We open-source our code at https://github.com/ZyGan1999/Snowball-Errors-and-Probability.

cs.AI

TKwinFormer: Top k Window Attention in Vision Transformers for Feature Matching

Local feature matching remains a challenging task, primarily due to difficulties in matching sparse keypoints and low-texture regions. The key to solving this problem lies in effectively and accurately integrating global and local information. To achieve this goal, we introduce an innovative local feature matching method called TKwinFormer. Our approach employs a multi-stage matching strategy to optimize the efficiency of information interaction. Furthermore, we propose a novel attention mechanism called Top K Window Attention, which facilitates global information interaction through window tokens prior to patch-level matching, resulting in improved matching accuracy. Additionally, we design an attention block to enhance attention between channels. Experimental results demonstrate that TKwinFormer outperforms state-of-the-art methods on various benchmarks. Code is available at: https://github.com/LiaoYun0x0/TKwinFormer.

eess.IV

UFM: Unified Feature Matching Pre-training with Multi-Modal Image Assistants

Image feature matching, a foundational task in computer vision, remains challenging for multimodal image applications, often necessitating intricate training on specific datasets. In this paper, we introduce a Unified Feature Matching pre-trained model (UFM) designed to address feature matching challenges across a wide spectrum of modal images. We present Multimodal Image Assistant (MIA) transformers, finely tunable structures adept at handling diverse feature matching problems. UFM exhibits versatility in addressing both feature matching tasks within the same modal and those across different modals. Additionally, we propose a data augmentation algorithm and a staged pre-training strategy to effectively tackle challenges arising from sparse data in specific modals and imbalanced modal datasets. Experimental results demonstrate that UFM excels in generalization and performance across various feature matching tasks. The code will be released at:https://github.com/LiaoYun0x0/UFM.

cs.CV

Super-efficiency of Listed Banks in China and Determinants Analysis (2006-2021)

This study employs the annual unbalanced panel data of 42 listed banks in China from 2006 to 2021, adopts the non-radial and non-oriented super-efficiency Data envelopment analysis (Super-SBM-UND-VRS based DEA) model considering NPL as undesired output. Our results show that the profitability super-efficiency of State-owned banks and Rural/City Commercial Banks is better than that of Joint-stock Banks. In terms of intermediary efficiency(deposit and loan), state-owned banks have advantage on other two type of banks. The determinants analysis shows that all type of banks significantly benefits from the decrease of ownership concentration which support reformation and IPO. Regional commercial banks significantly benefit from the decrease of customer concentration and the increase of reserves. On the other hand, State-owned banks should increase its loan to deposit ratio while joint-stock banks should do the opposite.

q-fin.GN

Super-efficiency and Stock Market Valuation: Evidence from Listed Banks in China (2006 to 2023)

This study investigates the relationship between bank efficiency and stock market valuation using an unbalanced panel dataset of 42 listed banks in China from 2006 to 2023. We employ a non-radial and non-oriented slack based super-efficiency Data Envelopment Analysis (Super-SBM-UND-VRS based DEA) model, which treats Non-Performing Loans (NPLs) as an undesired output. Our results show that the relationship between super-efficiency and stock market valuation is stronger than that between Return on Asset (ROA) and stock market performance, as measured by Tobin's Q. Notably, the Super-SBM-UND-VRS model yields novel results compared to other efficiency methods, such as the Stochastic Frontier Analysis (SFA) approach and traditional DEA models. Furthermore, our results suggest that bank evaluations benefit from decreased ownership concentration, whereas interest rate liberalization has the opposite effect.

q-fin.PR

Ahpatron: A New Budgeted Online Kernel Learning Machine with Tighter Mistake Bound

In this paper, we study the mistake bound of online kernel learning on a budget. We propose a new budgeted online kernel learning model, called Ahpatron, which significantly improves the mistake bound of previous work and resolves the open problem posed by Dekel, Shalev-Shwartz, and Singer (2005). We first present an aggressive variant of Perceptron, named AVP, a model without budget, which uses an active updating rule. Then we design a new budget maintenance mechanism, which removes a half of examples,and projects the removed examples onto a hypothesis space spanned by the remaining examples. Ahpatron adopts the above mechanism to approximate AVP. Theoretical analyses prove that Ahpatron has tighter mistake bounds, and experimental results show that Ahpatron outperforms the state-of-the-art algorithms on the same or a smaller budget.

cs.LG

Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based Approach

While constructing polar codes for successive-cancellation decoding can be implemented efficiently by sorting the bit-channels, finding optimal polar codes for cyclic-redundancy-check-aided successive-cancellation list (CA-SCL) decoding in an efficient and scalable manner still awaits investigation. This paper first maps a polar code to a unique heterogeneous graph called the polar-code-construction message-passing (PCCMP) graph. Next, a heterogeneous graph-neural-network-based iterative message-passing (IMP) algorithm is proposed which aims to find a PCCMP graph that corresponds to the polar code with minimum frame error rate under CA-SCL decoding. This new IMP algorithm's major advantage lies in its scalability power. That is, the model complexity is independent of the blocklength and code rate, and a trained IMP model over a short polar code can be readily applied to a long polar code's construction. Numerical experiments show that IMP-based polar-code constructions outperform classical constructions under CA-SCL decoding. In addition, when an IMP model trained on a length-128 polar code directly applies to the construction of polar codes with different code rates and blocklengths, simulations show that these polar code constructions deliver comparable performance to the 5G polar codes.

cs.IT

Path Integral Based Convolution and Pooling for Heterogeneous Graph Neural Networks

Graph neural networks (GNN) extends deep learning to graph-structure dataset. Similar to Convolutional Neural Networks (CNN) using on image prediction, convolutional and pooling layers are the foundation to success for GNN on graph prediction tasks. In the initial PAN paper, it uses a path integral based graph neural networks for graph prediction. Specifically, it uses a convolution operation that involves every path linking the message sender and receiver with learnable weights depending on the path length, which corresponds to the maximal entropy random walk. It further generalizes such convolution operation to a new transition matrix called maximal entropy transition (MET). Because the diagonal entries of the MET matrix is directly related to the subgraph centrality, it provide a trial mechanism for pooling based on centrality score. While the initial PAN paper only considers node features. We further extends its capability to handle complex heterogeneous graph including both node and edge features.

cs.LG

Construction of Polar Codes with Reinforcement Learning

This paper formulates the polar-code construction problem for the successive-cancellation list (SCL) decoder as a maze-traversing game, which can be solved by reinforcement learning techniques. The proposed method provides a novel technique for polar-code construction that no longer depends on sorting and selecting bit-channels by reliability. Instead, this technique decides whether the input bits should be frozen in a purely sequential manner. The equivalence of optimizing the polar-code construction for the SCL decoder under this technique and maximizing the expected reward of traversing a maze is drawn. Simulation results show that the standard polar-code constructions that are designed for the successive-cancellation decoder are no longer optimal for the SCL decoder with respect to the frame error rate. In contrast, the simulations show that, with a reasonable amount of training, the game-based construction method finds code constructions that have lower frame-error rate for various code lengths and decoders compared to standard constructions.

cs.IT

Deep Neural Network Symbol Detection for Millimeter Wave Communications

This paper proposes to use a deep neural network (DNN)-based symbol detector for mmWave systems such that CSI acquisition can be bypassed. In particular, we consider a sliding bidirectional recurrent neural network (BRNN) architecture that is suitable for the long memory length of typical mmWave channels. The performance of the DNN detector is evaluated in comparison to that of the Viterbi detector. The results show that the performance of the DNN detector is close to that of the optimal Viterbi detector with perfect CSI, and that it outperforms the Viterbi algorithm with CSI estimation error. Further experiments show that the DNN detector is robust to a wide range of noise levels and varying channel conditions, and that a pretrained detector can be reliably applied to different mmWave channel realizations with minimal overhead.

eess.SP

Fast Budgeted Influence Maximization over Multi-Action Event Logs

In a social network, influence maximization is the problem of identifying a set of users that own the maximum {\it influence ability} across the network. In this paper, a novel credit distribution (CD) based model, termed as the multi-action CD (mCD) model, is introduced to quantify the influence ability of each user, which works with practical datasets where one type of action could be recorded for multiple times. Based on this model, influence maximization is formulated as a submodular maximization problem under a general knapsack constraint, which is NP-hard. An efficient streaming algorithm with one-round scan over the user set is developed to find a suboptimal solution. Specifically, we first solve a special case of knapsack constraints, i.e., a cardinality constraint, and show that the developed streaming algorithm can achieve ($\frac{1}{2}-ε$)-approximation of the optimality. Furthermore, for the general knapsack case, we show that the modified streaming algorithm can achieve ($\frac{1}{3}-ε$)-approximation of the optimality. Finally, experiments are conducted over real Twitter dataset and demonstrate that the mCD model enjoys high accuracy compared to the conventional CD model in estimating the total number of people who get influenced in a social network. Moreover, through the comparison to the conventional CD, non-CD models, and the mCD model with the greedy algorithm on the performance of the influence maximization problem, we show the effectiveness and efficiency of the proposed mCD model with the streaming algorithm.

cs.SI

D2D-U: Device-to-Device Communications in Unlicensed Bands for 5G and Beyond

Device-to-Device (D2D) communication, which enables direct communication between nearby mobile devices, is an attractive add-on component to improve spectrum efficiency and user experience by reusing licensed cellular spectrum in 5G system. In this paper, we propose to enable D2D communication in unlicensed spectrum (D2D-U) as an underlay of the uplink LTE network for further booming the network capacity. A sensing-based protocol is designed to support the unlicensed channel access for both LTE and D2D users. We further investigate the subchannel allocation problem to maximize the sum rate of LTE and D2D users while taking into account their interference to the existing Wi-Fi systems. Specifically, we formulate the subchannel allocation as a many-to-many matching problem with externalities, and develop an iterative user-subchannel swap algorithm. Analytical and simulation results show that the proposed D2D-U scheme can significantly improve the system sum-rate.

cs.NI

Listen-and-Talk: Protocol Design and Analysis for Full-duplex Cognitive Radio Networks

In traditional cognitive radio networks, secondary users (SUs) typically access the spectrum of primary users (PUs) by a two-stage "listen-before-talk" (LBT) protocol, i.e., SUs sense the spectrum holes in the first stage before transmitting in the second. However, there exist two major problems: 1) transmission time reduction due to sensing, and 2) sensing accuracy impairment due to data transmission. In this paper, we propose a "listen-and-talk" (LAT) protocol with the help of full-duplex (FD) technique that allows SUs to simultaneously sense and access the vacant spectrum. Spectrum utilization performance is carefully analyzed, with the closed-form spectrum waste ratio and collision ratio with the PU provided. Also, regarding the secondary throughput, we report the existence of a tradeoff between the secondary transmit power and throughput. Based on the power-throughput tradeoff, we derive the analytical local optimal transmit power for SUs to achieve both high throughput and satisfying sensing accuracy. Numerical results are given to verify the proposed protocol and the theoretical results.

cs.NI

Full-duplex MAC Protocol Design and Analysis

The idea of in-band full-duplex (FD) communications revives in recent years owing to the significant progress in the self-interference cancellation and hardware design techniques, offering the potential to double spectral efficiency. The adaptations in upper layers are highly demanded in the design of FD communication systems. In this letter, we propose a novel medium access control (MAC) using FD techniques that allows transmitters to monitor the channel usage while transmitting, and backoff as soon as collision happens. Analytical saturation throughput of the FD-MAC protocol is derived with the consideration of imperfect sensing brought by residual self- interference (RSI) in the PHY layer. Both analytical and simulation results indicate that the normalized saturation throughput of the proposed FD-MAC can significantly outperforms conventional CSMA/CA under various network conditions.

cs.NI

Full-Duplex Cognitive Radio: A New Design Paradigm for Enhancing Spectrum Usage

With the rapid growth of demand for ever-increasing data rate, spectrum resources have become more and more scarce. As a promising technique to increase the efficiency of the spectrum utilization, cognitive radio (CR) technique has the great potential to meet such a requirement by allowing un-licensed users to coexist in licensed bands. In conventional CR systems, the spectrum sensing is performed at the beginning of each time slot before the data transmission. This unfortunately results in two major problems: 1) transmission time reduction due to sensing, and 2) sensing accuracy impairment due to data transmission. To tackle these problems, in this paper we present a new design paradigm for future CR by exploring the full-duplex (FD) techniques to achieve the simultaneous spectrum sensing and data transmission. With FD radios equipped at the secondary users (SUs), SUs can simultaneously sense and access the vacant spectrum, and thus, significantly improve sensing performances and meanwhile increase data transmission efficiency. The aim of this article is to transform the promising conceptual framework into the practical wireless network design by addressing a diverse set of challenges such as protocol design and theoretical analysis. Several application scenarios with FD enabled CR are elaborated, and key open research directions and novel algorithms in these systems are discussed.

cs.NI

Listen-and-Talk: Full-duplex Cognitive Radio Networks

In traditional cognitive radio networks, secondary users (SUs) typically access the spectrum of primary users (PUs) by a two-stage "listen-before-talk" (LBT) protocol, i.e., SUs sense the spectrum holes in the first stage before transmit in the second stage. In this paper, we propose a novel "listen-and-talk" (LAT) protocol with the help of the full-duplex (FD) technique that allows SUs to simultaneously sense and access the vacant spectrum. Analysis of sensing performance and SU's throughput are given for the proposed LAT protocol. And we find that due to self-interference caused by FD, increasing transmitting power of SUs does not always benefit to SU's throughput, which implies the existence of a power-throughput tradeoff. Besides, though the LAT protocol suffers from self-interference, it allows longer transmission time, while the performance of the traditional LBT protocol is limited by channel spatial correction and relatively shorter transmission period. To this end, we also present an adaptive scheme to improve SUs' throughput by switching between the LAT and LBT protocols. Numerical results are provided to verify the proposed methods and the theoretical results.

cs.NI