SearcharxivSearch

arXiv subjects

Wenjing Yan

Publications and source records attributed to Wenjing Yan.

At least 19 recordsLinked to original sources

Distill on a Diet: Efficient Knowledge Distillation via Learnable Data Pruning

Knowledge Distillation (KD) is widely used to obtain compact models for efficient inference in resource-constrained environments. Yet the computational overhead of the distillation process itself is often overlooked, raising the question of whether a better student model can be obtained with less data and less compute via data pruning. However, existing data pruning methods are not designed for KD: some introduce substantial overhead, such as obtaining training dynamics through retraining, while others rely on heuristic selection rules that fail to capture what KD actually requires, often resulting in suboptimal subsets. To address these issues, we propose IF-Beta, an efficient data pruning framework that combines influence functions with a learnable sampling policy. Empirically, we first demonstrate that influence functions can serve as an effective and efficient estimator of sample impact in KD settings, where only a pretrained teacher is available. Building on this, our sampling policy is specifically parameterized by a Beta distribution, whose highly flexible two-parameter family allows the policy to adapt to diverse pruning regimes rather than being tied to fixed heuristic forms. Next, we formulate KD pruning as optimizing this policy through a bilevel objective, where the inner loop operates in the teacher feature space with a KD-aligned objective, enabling fast proxy training, while the outer loop updates the policy parameters to maximize distillation performance. This design ensures that IF-Beta is both computationally efficient and inherently aligned with the goals of KD. Extensive experiments on CIFAR-10/100 and ImageNet show that IF-Beta consistently outperforms other baselines across a wide range of pruning ratios. Remarkably, IF-Beta enables students trained on less data and less compute to surpass the performance of students distilled on the full dataset.

cs.LG

Feature Resemblance: Towards a Theoretical Understanding of Analogical Reasoning in Transformers

Understanding reasoning in large language models is complicated by evaluations that conflate multiple reasoning types. We isolate analogical reasoning, where a model transfers an attribute between entities that share known properties, and study when such transfer can emerge from training. To make the problem analytically tractable, we study a minimal transformer-style abstraction that isolates how learned representations support analogical reasoning. Within this setting, we prove three key results. First, joint training on similarity and attribution premises enables analogical reasoning through aligned representations. Second, sequential training succeeds only when similarity structure is learned before specific attributes, revealing a curriculum asymmetry. Third, in our stylized setting, two-hop reasoning $(a \to b, b \to c \Rightarrow a \to c)$ can be viewed as analogical reasoning with identity bridges $(b=b)$, which appear explicitly in training data. Together, these results reveal a unified mechanism: entities with shared properties become aligned in representation space, enabling property transfer through feature resemblance. Experiments with architectures up to 8B parameters show qualitative agreement with the theory and suggest that representational geometry plays an important role in analogical reasoning beyond the stylized model.

cs.CL

How Much Thinking is Enough? Quantifying and Understanding Redundancy in LLM Reasoning

Reasoning-capable large language models solve hard problems by emitting long chains of thought, paying heavily in latency, GPU time, and energy. Casual inspection of their traces reveals extensive reformulation, verification, and circular self-reflection, yet how much of this deliberation is actually necessary has never been measured at scale or explained from first principles. This paper closes both gaps. We formalise reasoning redundancy directly in terms of the reasoning model itself: the redundancy of a correct trace is the largest fraction of its trailing segmented steps that can be truncated while $π$, forced to terminate thinking and emit a final answer, still produces the correct answer. A large-scale quantification across four frontier reasoning models and two mathematical benchmarks shows that step-level redundancy is consistently high -- between 61% and 93% across the 8 (model, benchmark) conditions we study, with the median critical prefix equal to a single segmented step in six of the eight conditions -- that the finding is robust to the choice of judge family, and that although $ρ$ decreases with problem difficulty on MATH-500, all four models remain substantially redundant ($ρ\in [46\%, 85\%]$) even on the hardest Level-5 problems. We then prove that this redundancy is a structural consequence of length-agnostic outcome rewards, not a model-specific artefact: under any such reward, no finite expected stopping time is optimal. The result holds regardless of RL algorithm, base model, data distribution, or whether the policy is obtained via RL or distillation; over-thinking is therefore not a bug to be patched in individual models but a structural property of how current reasoning models are trained. Code: https://github.com/zhiyuanZhai20/how-much-thinking-is-enough

cs.AI

Does RL Expand the Capability Boundary of LLM Agents? A PASS@(k,T) Analysis

Does reinforcement learning genuinely expand what LLM agents can do, or merely make them more reliable? For static reasoning, recent work answers the second: base and RL pass@k curves converge at large k. We ask whether this holds for agentic tool use, where T rounds of interaction enable compositional strategies that re-sampling cannot recover. We introduce PASS@(k,T), a two-dimensional metric that jointly varies sampling budget k and interaction depth T, separating capability expansion from efficiency improvement. Our main finding is that, contrary to the static-reasoning result, tool-use RL genuinely enlarges the capability boundary: the RL agent's pass-curve pulls above the base model's and the gap widens at large k rather than converging. The expansion is specific to compositional, sequential information gathering; on simpler tasks RL behaves as prior work predicts. Under matched training data, supervised fine-tuning regresses the boundary on the same compositional tasks, isolating self-directed exploration as the causal factor. Mechanism analysis shows RL reweights the base strategy distribution toward the subset whose downstream reasoning more often yields a correct answer, with the improvement concentrated on how the agent integrates retrieved information. These results reconcile optimistic and pessimistic readings of RL for LLMs: both are correct, on different task types.

cs.LG

Sub-wavelength mid-infrared imaging of locally driven photocurrents using diamond campanile probes

Precise and high efficiency concentration of mid-infrared (mid-IR) light into sub wavelength volumes is essential for probing low-energy excitations and achieving strong field enhancements, which can be hindered by absorption losses and coupling inefficiencies at long wavelengths. Here, we introduce an innovative diamond-based metal-insulator-metal campanile probe that adiabatically compresses free-space mid infrared light (10 \mum) into \approx 1 \mum domains. Integrated into a scanning photovoltage microscope, the probe enables sub-wavelength mapping of locally driven photocurrents in graphene, resolving polarization dependent and contact-sensitive responses at energies down to \approx 0.1 eV. Experiments reveal a photocurrent signal density enhancement of 10^3 and coupling efficiencies approaching 80%, in agreement with numerical simulations. Operation of the probe with quantum cascade and free electron lasers demonstrates a robust, spectrally tunable platform for high-resolution exploration of low-energy carrier dynamics in atomically thin materials, opening opportunities for mid-IR optoelectronics and quantum photonics.

cond-mat.mes-hall

Temporal Consistency-Aware Text-to-Motion Generation

Text-to-Motion (T2M) generation aims to synthesize realistic human motion sequences from natural language descriptions. While two-stage frameworks leveraging discrete motion representations have advanced T2M research, they often neglect cross-sequence temporal consistency, i.e., the shared temporal structures present across different instances of the same action. This leads to semantic misalignments and physically implausible motions. To address this limitation, we propose TCA-T2M, a framework for temporal consistency-aware T2M generation. Our approach introduces a temporal consistency-aware spatial VQ-VAE (TCaS-VQ-VAE) for cross-sequence temporal alignment, coupled with a masked motion transformer for text-conditioned motion generation. Additionally, a kinematic constraint block mitigates discretization artifacts to ensure physical plausibility. Experiments on HumanML3D and KIT-ML benchmarks demonstrate that TCA-T2M achieves state-of-the-art performance, highlighting the importance of temporal consistency in robust and coherent T2M generation.

cs.CV

FISMO: Fisher-Structured Momentum-Orthogonalized Optimizer

Training large-scale neural networks requires solving nonconvex optimization where the choice of optimizer fundamentally determines both convergence behavior and computational efficiency. While adaptive methods like Adam have long dominated practice, the recently proposed Muon optimizer achieves superior performance through orthogonalized momentum updates that enforce isotropic geometry with uniform singular values. However, this strict isotropy discards potentially valuable curvature information encoded in gradient spectra, motivating optimization methods that balance geometric structure with adaptivity. We introduce FISMO (Fisher-Structured Momentum-Orthogonalized) optimizer, which generalizes isotropic updates to incorporate anisotropic curvature information through Fisher information geometry. By reformulating the optimizer update as a trust-region problem constrained by a Kronecker-factored Fisher metric, FISMO achieves structured preconditioning that adapts to local loss landscape geometry while maintaining computational tractability. We establish convergence guarantees for FISMO in stochastic nonconvex settings, proving an $\mathcal{O}(1/\sqrt{T})$ rate for the expected squared gradient norm with explicit characterization of variance reduction through mini-batching. Empirical evaluation on image classification and language modeling benchmarks demonstrates that FISMO achieves superior training efficiency and final performance compared to established baselines.

cs.LG

Problem-Parameter-Free Decentralized Bilevel Optimization

Decentralized bilevel optimization has garnered significant attention due to its critical role in solving large-scale machine learning problems. However, existing methods often rely on prior knowledge of problem parameters-such as smoothness, convexity, or communication network topologies-to determine appropriate stepsizes. In practice, these problem parameters are typically unavailable, leading to substantial manual effort for hyperparameter tuning. In this paper, we propose AdaSDBO, a fully problem-parameter-free algorithm for decentralized bilevel optimization with a single-loop structure. AdaSDBO leverages adaptive stepsizes based on cumulative gradient norms to update all variables simultaneously, dynamically adjusting its progress and eliminating the need for problem-specific hyperparameter tuning. Through rigorous theoretical analysis, we establish that AdaSDBO achieves a convergence rate of $\widetilde{\mathcal{O}}\left(\frac{1}{T}\right)$, matching the performance of well-tuned state-of-the-art methods up to polylogarithmic factors. Extensive numerical experiments demonstrate that AdaSDBO delivers competitive performance compared to existing decentralized bilevel optimization methods while exhibiting remarkable robustness across diverse stepsize configurations.

math.OC

Decentralized Multi-Task Online Convex Optimization Under Random Link Failures

Decentralized optimization methods often entail information exchange between neighbors. Transmission failures can happen due to network congestion, hardware/software issues, communication outage, and other factors. In this paper, we investigate the random link failure problem in decentralized multi-task online convex optimization, where agents have individual decisions that are coupled with each other via pairwise constraints. Although widely used in constrained optimization, conventional saddle-point algorithms are not directly applicable here because of random packet dropping. To address this issue, we develop a robust decentralized saddle-point algorithm against random link failures with heterogeneous probabilities by replacing the missing decisions of neighbors with their latest received values. Then, by judiciously bounding the accumulated deviation stemming from this replacement, we first establish that our algorithm achieves $\mathcal{O}(\sqrt{T})$ regret and $\mathcal{O}(T^\frac{3}{4})$ constraint violations for the full information scenario, where the complete information on the local cost function is revealed to each agent at the end of each time slot. These two bounds match, in order sense, the performance bounds of algorithms with perfect communications. Further, we extend our algorithm and analysis to the two-point bandit feedback scenario, where only the values of the local cost function at two random points are disclosed to each agent sequentially. Performance bounds of the same orders as the full information case are derived. Finally, we corroborate the efficacy of the proposed algorithms and the analytical results through numerical simulations.

cs.LG

Zero-Regret Performative Prediction Under Inequality Constraints

Performative prediction is a recently proposed framework where predictions guide decision-making and hence influence future data distributions. Such performative phenomena are ubiquitous in various areas, such as transportation, finance, public policy, and recommendation systems. To date, work on performative prediction has only focused on unconstrained scenarios, neglecting the fact that many real-world learning problems are subject to constraints. This paper bridges this gap by studying performative prediction under inequality constraints. Unlike most existing work that provides only performative stable points, we aim to find the optimal solutions. Anticipating performative gradients is a challenging task, due to the agnostic performative effect on data distributions. To address this issue, we first develop a robust primal-dual framework that requires only approximate gradients up to a certain accuracy, yet delivers the same order of performance as the stochastic primal-dual algorithm without performativity. Based on this framework, we then propose an adaptive primal-dual algorithm for location families. Our analysis demonstrates that the proposed adaptive primal-dual algorithm attains $\ca{O}(\sqrt{T})$ regret and constraint violations, using only $\sqrt{T} + 2T$ samples, where $T$ is the time horizon. To our best knowledge, this is the first study and analysis on the optimality of the performative prediction problem under inequality constraints. Finally, we validate the effectiveness of our algorithm and theoretical results through numerical simulations.

cs.LG

Room temperature quantum Hall effect in a gated ferroelectric-graphene heterostructure

The quantum Hall effect is widely used for the investigation of fundamental phenomena, ranging from topological phases to composite fermions. In particular, the discovery of a room temperature resistance quantum in graphene is significant for compact resistance standards that can operate above cryogenic temperatures. However, this requires large magnetic fields that are accessible only in a few high magnetic field facilities. Here, we report on the quantum Hall effect in graphene encapsulated by the ferroelectric insulator CuInP2S6. Electrostatic gating of the graphene channel enables the Fermi energy to be tuned so that electrons in the localized states of the insulator are in equilibrium with the current-carrying, delocalized states of graphene. Due to the presence of strongly bound states in this hybrid system, a quantum Hall plateau can be achieved at room temperature in relatively modest magnetic fields. This phenomenon offers the prospect for the controlled manipulation of the quantum Hall effect at room temperature.

cond-mat.mes-hall

Frequency Reflection Modulation for Reconfigurable Intelligent Surface Aided OFDM Systems

Reconfigurable intelligent surface (RIS) based reflection modulation has been considered as a promising information delivery mechanism, and has the potential to realize passive information transfer of a RIS without consuming any additional radio frequency chain and time/frequency/energy resources. The existing on-off reflection modulation (ORM) schemes are based on manipulating the "on/off" states of RIS elements, which may lead to the degradation of RIS reflection efficiency. This paper proposes a frequency reflection modulation (FRM) method for RIS-aided OFDM systems. The FRM-OFDM scheme modulates the frequency of the incident electromagnetic waves, and the RIS information is embedded in the frequency-hoping states of RIS elements. Unlike the ORM-OFDM scheme, the FRM-OFDM scheme can achieve higher reflection efficiency, since the latter does not turn off any reflection element in reflection modulation. We propose a block coordinate descent (BCD) algorithm to maximize the user achievable rate for the FRM-OFDM system by jointly optimizing the phase shift of the RIS and the power allocation at the transmitter. Further, we design a bilinear message passing (BMP) algorithm for the bilinear recovery of both the user symbols and the RIS data. Numerical simulations have verified the efficiency of the designed BCD algorithm for system optimization and the BMP algorithm for signal detection, as well as the superiority of the proposed FRM-OFDM scheme over the ORM-OFDM scheme.

eess.SP

Hierarchical Passive Beamforming for Reconfigurable Intelligent Surface Aided Communications

In reconfigurable intelligent surfaces (RISs) aided communications, the existing passive beamforming (PB) design involves polynomial complexity in the number of reflecting elements, and thus is difficult to implement due to a massive number of reflecting elements. To overcome this difficulty, we propose a reflection-angle-based cascaded channel model by adopting the generalized Snell's law, in which the dimension of the variable space involved in optimization is significantly reduced, resulting in a simplified hierarchical passive beamforming (HPB) design. We develop an efficient two-stage HPB algorithm, which exploits the angular domain property of the channel, to maximize the achievable rate of the target user. Simulation results demonstrate the appealing performance and low complexity of the proposed HPB design.

cs.IT

RAF-AU Database: In-the-Wild Facial Expressions with Subjective Emotion Judgement and Objective AU Annotations

Much of the work on automatic facial expression recognition relies on databases containing a certain number of emotion classes and their exaggerated facial configurations (generally six prototypical facial expressions), based on Ekman's Basic Emotion Theory. However, recent studies have revealed that facial expressions in our human life can be blended with multiple basic emotions. And the emotion labels for these in-the-wild facial expressions cannot easily be annotated solely on pre-defined AU patterns. How to analyze the action units for such complex expressions is still an open question. To address this issue, we develop a RAF-AU database that employs a sign-based (i.e., AUs) and judgement-based (i.e., perceived emotion) approach to annotating blended facial expressions in the wild. We first reviewed the annotation methods in existing databases and identified crowdsourcing as a promising strategy for labeling in-the-wild facial expressions. Then, RAF-AU was finely annotated by experienced coders, on which we also conducted a preliminary investigation of which key AUs contribute most to a perceived emotion, and the relationship between AUs and facial expressions. Finally, we provided a baseline for AU recognition in RAF-AU using popular features and multi-label learning methods.

cs.CV

Reconfigurable-Intelligent-Surface Empowered Wireless Communications: Challenges and Opportunities

Reconfigurable intelligent surfaces (RISs) are regarded as a promising emerging hardware technology to improve the spectrum and energy efficiency of wireless networks by artificially reconfiguring the propagation environment of electromagnetic waves. Due to the unique advantages in enhancing wireless channel capacity, RISs have recently become a hot research topic. In this article, we focus on three fundamental physical-layer challenges for the incorporation of RISs into wireless networks, namely, channel state information acquisition, passive information transfer, and low-complexity robust system design. We summarize the state-of-the-art solutions and explore potential research directions. Furthermore, we discuss other promising research directions of RISs, including edge intelligence and physical-layer security.

cs.IT

Spin Hall Effect in Bilayer Graphene Combined with an Insulator up to Room Temperature

Spin-orbit coupling in graphene can be enhanced by chemical functionalization, adatom decoration or proximity with a van der Waals material. As it is expected that such enhancement gives rise to a sizeable spin Hall effect, a spin-to-charge current conversion phenomenon of technological relevance, it has sparked wide research interest. However, it has only been measured in graphene/transition metal dichalcogenide van der Waals heterostructures with limited scalability. Here, we experimentally demonstrate spin Hall effect up to room temperature in bilayer graphene combined with a nonmagnetic insulator, an evaporated bismuth oxide layer. The measured spin Hall effect raises most likely from an extrinsic mechanism. With a large spin-to-charge conversion efficiency, scalability, and ease of integration to electronic devices, we show a promising material heterostructure suitable for spin-based device applications.

cond-mat.mes-hall

Passive Beamforming and Information Transfer Design for Reconfigurable Intelligent Surfaces Aided Multiuser MIMO Systems

This paper investigates the passive beamforming and information transfer (PBIT) technique for the multiuser multiple-input multiple-output (MIMO) systems with the aid of a reconfigurable intelligent surface (RIS), where the RIS enhances the primary communication via passive beamforming and at the same time delivers additional information by the spatial modulation (which adjusts the on-off states of the reflecting elements). For the passive beamforming design, we propose to maximize the sum channel capacity of the RIS-aided multiuser MIMO channel and formulate the problem as a two-step stochastic program. A sample average approximation (SAA) based iterative algorithm is developed for the efficient passive beamforming design of the considered scheme. To strike a balance between complexity and performance, we then propose a simplified beamforming algorithm by approximating the stochastic program as a deterministic alternating optimization problem. For the receiver design, the signal detection at the receiver is a bilinear estimation problem since the RIS information is multiplicatively modulated onto the reflected signals of the reflecting elements. To solve this bilinear estimation problem, we develop a turbo message passing (TMP) algorithm in which the factor graph associated with the problem is divided into two modules: one for the estimation of the user signals and the other for the estimation of the RIS's on-off states. The two modules are executed iteratively to yield a near-optimal low-complexity solution. Furthermore, we extend the design of the multiuser MIMO PBIT scheme from single-RIS to multi-RIS, by leveraging the similarity between the single-RIS and multi-RIS system models. Extensive simulation results are provided to demonstrate the advantages of our passive beamforming and receiver designs.

cs.IT

Double-Sparsity Learning Based Channel-and-Signal Estimation in Massive MIMO with Generalized Spatial Modulation

In this paper, we study joint antenna activity detection, channel estimation, and multiuser detection for massive multiple-input multiple-output (MIMO) systems with general spatial modulation (GSM). We first establish a double-sparsity massive MIMO model by considering the channel sparsity of the massive MIMO channel and the signal sparsity of GSM. Based on the double-sparsity model, we formulate a blind detection problem. To solve the blind detection problem, we develop message-passing based blind channel-and-signal estimation (BCSE) algorithm. The BCSE algorithm basically follows the affine sparse matrix factorization technique, but with critical modifications to handle the double-sparsity property of the model. We show that the BCSE algorithm significantly outperforms the existing blind and training-based algorithms, and is able to closely approach the genie bounds (with either known channel or known signal). In the BCSE algorithm, short pilots are employed to remove the phase and permutation ambiguities after sparse matrix factorization. To utilize the short pilots more efficiently, we further develop the semi-blind channel-and-signal estimation (SBCSE) algorithm to incorporate the estimation of the phase and permutation ambiguities into the iterative message-passing process. We show that the SBCSE algorithm substantially outperforms the counterpart algorithms including the BCSE algorithm in the short-pilot regime.

cs.IT