Searcharxiv⌕ Search

arXiv subjects

Yunhao Wang

Publications and source records attributed to Yunhao Wang.

24 records · Page 2Linked to original sources

Adaptive Deep Reasoning: Triggering Deep Thinking When Needed

Large language models (LLMs) have shown impressive capabilities in handling complex tasks through long-chain reasoning. However, the extensive reasoning steps involved can significantly increase computational costs, posing challenges for real-world deployment. Recent efforts have focused on optimizing reasoning efficiency by shortening the Chain-of-Thought (CoT) reasoning processes through various approaches, such as length-aware prompt engineering, supervised fine-tuning on CoT data with variable lengths, and reinforcement learning with length penalties. Although these methods effectively reduce reasoning length, they still necessitate an initial reasoning phase. More recent approaches have attempted to integrate long-chain and short-chain reasoning abilities into a single model, yet they still rely on manual control to toggle between short and long CoT. In this work, we propose a novel approach that autonomously switches between short and long reasoning chains based on problem complexity. Our method begins with supervised fine-tuning of the base model to equip both long-chain and short-chain reasoning abilities. We then employ reinforcement learning to further balance short and long CoT generation while maintaining accuracy through two key strategies: first, integrating reinforcement learning with a long-short adaptive group-wise reward strategy to assess prompt complexity and provide corresponding rewards; second, implementing a logit-based reasoning mode switching loss to optimize the model's initial token choice, thereby guiding the selection of the reasoning type. Evaluations on mathematical datasets demonstrate that our model can dynamically switch between long-chain and short-chain reasoning modes without substantially sacrificing performance. This advancement enhances the practicality of reasoning in large language models for real-world applications.

cs.CL↗

Electrothermal manipulation of current-induced phase transitions in ferrimagnetic Mn$_3$Si$_2$Te$_6$

Phase transitions driven by external stimuli are central to condensed matter physics, providing critical insights into symmetry breaking and emergent phenomena. Recently, ferrimagnetic (FiM) Mn$_3$Si$_2$Te$_6$ has attracted considerable attention for its magnetic-field-induced insulator-metal transitions (IMTs) and unconventional current-driven phase transitions, yet the role of applied currents in the magnetic phase remains poorly understood. Here, by combining local magnetization probes and time-resolved transport measurements, we uncover an electrothermal origin for the current-induced first-order-like phase transitions, characterized by abrupt voltage jumps and distinct magnetic domain evolution. Current-voltage (I-V) characteristics measured under triangular waveforms exhibit strong non-reciprocal and hysteretic behaviors, which are significantly suppressed at frequencies ~1000 Hz. Time-resolved studies using rectangular pulsed currents demonstrate that the resistance dynamics closely mirror the equilibrium resistance-temperature profile, directly implicating Joule heating as the driving mechanism. Furthermore, we reveal that the intrinsic I-V response adheres to Ohm's law, displaying linearity across various magnetic fields and temperatures. Our work advocates for a cautious approach in distinguishing between genuine current-induced nonequilibrium quantum states and thermal effects.

cond-mat.mtrl-sci↗

A Principal Square Response Forward Regression Method for Dimension Reduction

Dimension reduction techniques, such as Sufficient Dimension Reduction (SDR), are indispensable for analyzing high-dimensional datasets. This paper introduces a novel SDR method named Principal Square Response Forward Regression (PSRFR) for estimating the central subspace of the response variable Y, given the vector of predictor variables $\bm{X}$. We provide a computational algorithm for implementing PSRFR and establish its consistency and asymptotic properties. Monte Carlo simulations are conducted to assess the performance, efficiency, and robustness of the proposed method. Notably, PSRFR exhibits commendable performance in scenarios where the variance of each component becomes increasingly dissimilar, particularly when the predictor variables follow an elliptical distribution. Furthermore, we illustrate and validate the effectiveness of PSRFR using a real-world dataset concerning wine quality. Our findings underscore the utility and reliability of the PSRFR method in practical applications of dimension reduction for high-dimensional data analysis.

stat.ME↗

Context Autoencoder for Self-Supervised Representation Learning

We present a novel masked image modeling (MIM) approach, context autoencoder (CAE), for self-supervised representation pretraining. We pretrain an encoder by making predictions in the encoded representation space. The pretraining tasks include two tasks: masked representation prediction - predict the representations for the masked patches, and masked patch reconstruction - reconstruct the masked patches. The network is an encoder-regressor-decoder architecture: the encoder takes the visible patches as input; the regressor predicts the representations of the masked patches, which are expected to be aligned with the representations computed from the encoder, using the representations of visible patches and the positions of visible and masked patches; the decoder reconstructs the masked patches from the predicted encoded representations. The CAE design encourages the separation of learning the encoder (representation) from completing the pertaining tasks: masked representation prediction and masked patch reconstruction tasks, and making predictions in the encoded representation space empirically shows the benefit to representation learning. We demonstrate the effectiveness of our CAE through superior transfer performance in downstream tasks: semantic segmentation, object detection and instance segmentation, and classification. The code will be available at https://github.com/Atten4Vis/CAE.

cs.CV↗

From String Detection to Orthogonal Vector Problem

Considering Grover's Search Algorithm (GSA) with the standard diffuser stage applied, we revisit the $3$-qubit unique String Detection Problem (SDP) and extend the algorithm to $4$-qubit SDP with multiple winners. We then investigate unstructured search problems with non-uniform distributions and define the Orthogonal Vector Problem (OVP) under quantum settings. Although no numerically stable results is reached under the original GSA framework, we provide intuition behind our implementation and further observations on OVP. We further perform a special case analysis under the modified GSA framework which aims to stabilize the final measurement under arbitrary initial distribution. Based on the result of the analysis, we generalize the initial condition under which neither the original framework nor the modification works. Instead of utilizing GSA, we also propose a short-depth circuit that can calculate the orthogonal pair for a given vector represented as a binary string with constant runtime.

quant-ph↗

MAFormer: A Transformer Network with Multi-scale Attention Fusion for Visual Recognition

Vision Transformer and its variants have demonstrated great potential in various computer vision tasks. But conventional vision transformers often focus on global dependency at a coarse level, which suffer from a learning challenge on global relationships and fine-grained representation at a token level. In this paper, we introduce Multi-scale Attention Fusion into transformer (MAFormer), which explores local aggregation and global feature extraction in a dual-stream framework for visual recognition. We develop a simple but effective module to explore the full potential of transformers for visual representation by learning fine-grained and coarse-grained features at a token level and dynamically fusing them. Our Multi-scale Attention Fusion (MAF) block consists of: i) a local window attention branch that learns short-range interactions within windows, aggregating fine-grained local features; ii) global feature extraction through a novel Global Learning with Down-sampling (GLD) operation to efficiently capture long-range context information within the whole image; iii) a fusion module that self-explores the integration of both features via attention. Our MAFormer achieves state-of-the-art performance on common vision tasks. In particular, MAFormer-L achieves 85.9$\%$ Top-1 accuracy on ImageNet, surpassing CSWin-B and LV-ViT-L by 1.7$\%$ and 0.6$\%$ respectively. On MSCOCO, MAFormer outperforms the prior art CSWin by 1.7$\%$ mAPs on object detection and 1.4$\%$ on instance segmentation with similar-sized parameters, demonstrating the potential to be a general backbone network.

cs.CV↗