Searcharxiv⌕ Search

arXiv subjects

Yujie Wang

Publications and source records attributed to Yujie Wang.

At least 73 records · Page 4Linked to original sources

Proxy Control Barrier Functions: Integrating Barrier-Based and Lyapunov-Based Safety-Critical Control Design

This work introduces a novel Proxy Control Barrier Function (PCBF) scheme that integrates barrier-based and Lyapunov-based safety-critical control strategies for strict-feedback systems with potentially unknown dynamics. The proposed method employs a modular design procedure, decomposing the original system into a proxy subsystem and a virtual tracking subsystem that are controlled by the control barrier function (CBF)-based and Lyapunov-based controllers, respectively. By integrating these separately designed controllers, the overall system's safety is ensured. Moreover, a new filter-based disturbance observer is utilized to design a PCBF-based safe controller for strict-feedback systems subject to mismatched disturbances. This approach broadens the class of systems to which CBF-based methods can be applied and significantly simplifies CBF construction by requiring only the model of the proxy subsystem. The effectiveness of the proposed method is demonstrated through numerical simulations.

eess.SY↗

Towards Effective Graph Rationalization via Boosting Environment Diversity

Graph Neural Networks (GNNs) perform effectively when training and testing graphs are drawn from the same distribution, but struggle to generalize well in the face of distribution shifts. To address this issue, existing mainstreaming graph rationalization methods first identify rationale and environment subgraphs from input graphs, and then diversify training distributions by augmenting the environment subgraphs. However, these methods merely combine the learned rationale subgraphs with environment subgraphs in the representation space to produce augmentation samples, failing to produce sufficiently diverse distributions. Thus, in this paper, we propose to achieve an effective Graph Rationalization by Boosting Environmental diversity, a GRBE approach that generates the augmented samples in the original graph space to improve the diversity of the environment subgraph. Firstly, to ensure the effectiveness of augmentation samples, we propose a precise rationale subgraph extraction strategy in GRBE to refine the rationale subgraph learning process in the original graph space. Secondly, to ensure the diversity of augmented samples, we propose an environment diversity augmentation strategy in GRBE that mixes the environment subgraphs of different graphs in the original graph space and then combines the new environment subgraphs with rationale subgraphs to generate augmented graphs. The average improvements of 7.65% and 6.11% in rationalization and classification performance on benchmark datasets demonstrate the superiority of GRBE over state-of-the-art approaches.

cs.LG↗

Riemannian Gradient Descent Method to Joint Blind Super-Resolution and Demixing in ISAC

Integrated Sensing and Communication (ISAC) has emerged as a promising technology for next-generation wireless networks. In this work, we tackle an ill-posed parameter estimation problem within ISAC, formulating it as a joint blind super-resolution and demixing problem. Leveraging the low-rank structures of the vectorized Hankel matrices associated with the unknown parameters, we propose a Riemannian gradient descent (RGD) method. Our theoretical analysis demonstrates that the proposed method achieves linear convergence to the target matrices under standard assumptions. Additionally, extensive numerical experiments validate the effectiveness of the proposed approach.

cs.IT↗

Absolute State-wise Constrained Policy Optimization: High-Probability State-wise Constraints Satisfaction

Enforcing state-wise safety constraints is critical for the application of reinforcement learning (RL) in real-world problems, such as autonomous driving and robot manipulation. However, existing safe RL methods only enforce state-wise constraints in expectation or enforce hard state-wise constraints with strong assumptions. The former does not exclude the probability of safety violations, while the latter is impractical. Our insight is that although it is intractable to guarantee hard state-wise constraints in a model-free setting, we can enforce state-wise safety with high probability while excluding strong assumptions. To accomplish the goal, we propose Absolute State-wise Constrained Policy Optimization (ASCPO), a novel general-purpose policy search algorithm that guarantees high-probability state-wise constraint satisfaction for stochastic systems. We demonstrate the effectiveness of our approach by training neural network policies for extensive robot locomotion tasks, where the agent must adhere to various state-wise safety constraints. Our results show that ASCPO significantly outperforms existing methods in handling state-wise constraints across challenging continuous control tasks, highlighting its potential for real-world applications.

cs.LG↗

Identifying Bridges from Asymmetric Load-Bearing Structures in Tapped Granular Packings

Using high-resolution x-ray tomography, we experimentally investigate the bridge structures in tapped granular packings composed of particles with varying friction coefficients. We find that gravity can induce subtle structural changes on the load-bearing contacts, allowing us to identify the correct load-bearing contacts based on structural information alone. Using these identified load-bearing contacts, we investigate the cooperative bridge structures which are mechanical backbones of the system. We characterize the geometric properties of these bridges and find that their cooperativity increases as the packing fraction decreases. The knowledge of bridges can enhance our understanding of the rheological properties of granular materials.

cond-mat.soft↗

Testing Adam-Gibbs relationship in tapped Granular Packings

Disordered granular packings share many similarities with supercooled liquids, particu-larly in the rapid increase of structural relaxation time within a narrow range of temperature or packing fraction. However, it is unclear whether the dynamics of granular materials align with those of their corresponding thermal hard sphere liquids, and the particular influence of friction of a granular system remains largely unexplored. Here, we experimentally study the slow relaxation and the steady state of monodisperse granular sphere packings with X-ray tomography. We first quantify the thermodynamic parameters under the Edwards' ensemble, (i.e., effective temperature and configurational entropy), of granular spheres with varying friction, and measure their characteristic relaxation time during compaction processes. We then demonstrate a unified picture of the relaxation process in granular systems in which the Adam-Gibbs (AG) relationship is generally followed. These results clarify the close relation-ship between granular materials and the ideal frictionless hard sphere model.

cond-mat.soft↗

Restricted sumsets in $\mathbb{Z}$

Let $k\geqslant 3$ and let $A=\{0=a_{0}<a_{1}<\cdots<a_{k-1}\}$ with $\gcd(A)=1$. Freiman-Lev conjecture [V.F. Lev, Restricted set addition in groups, I. The classical setting, J. London Math. Soc. 62(2000), 27-40] is a well-known conjecture which related to restricted sumsets. Up to now, Freiman-Lev conjecture is open for all $a_{k-1}\geqslant 2k-2$. In this paper, we prove the Freiman-Lev conjecture is true for $a_{k-1}\geqslant 2k-2$ and $a_{k-2}<2k-4$. That is, Freiman-Lev conjecture is still open for the case $a_{k-1}\geqslant 2k-2$ and $a_{k-2}\geq 2k-4$.

math.NT↗

Microscopic Structural Study on the Growth History of Granular Heaps Prepared by the Raining Method

Granular heaps are critical in both industrial applications and natural processes, exhibiting complex behaviors that have sparked significant research interest. The stress dip phenomenon observed beneath granular heaps continues to be a topic of significant debate. Current models based on force transmission often assume that the packing is near the isostatic point, overlooking the critical influence of internal structure and formation history on the mechanical properties of granular heaps. Consequently, these models fail to fully account for diverse observations. In this study, we experimentally explore the structural evolution of three dimensional (3D) granular heaps composed of monodisperse spherical particles prepared using the raining method. Our results reveal the presence of two distinct regions within the heaps, characterized by significant differences in structural properties such as packing fraction, contact number, and contact anisotropy. We attribute these structural variations to the differing formation mechanisms during heap growth. Our findings emphasize the substantial influence of the preparation protocols on the internal structure of granular heaps and provide valuable insights into stress distribution within granular materials. This research may contribute to the development of more accurate constitutive relations for granular materials by informing and refining future modeling approaches

cond-mat.soft↗

Jamming, Yielding, and Rheology during Submerged Granular Avalanche

Jamming transitions and the rheology of granular avalanches in fluids are investigated using experiments and numerical simulations. Simulations use the lattice-Boltzmann method coupled with the discrete element method, providing detailed stress and deformation data. Both simulations and experiments present a perfect match with each other in carefully conducted deposition experiments, validating the simulation method. We analyze transient rheological laws and jamming transitions using our recently introduced length-scale ratio $G$. $G$ serves as a unified metric for the pressure and shear rate capturing the dynamics of sheared fluid-granular systems. Two key transition points, $G_{Y}$ and $G_{0}$, categorize the material's state into solid-like, creeping, and fluid-like states. Yielding at $G_{Y}$ marks the transition from solid-like to creeping, while $G_{0}$ signifies the shift to the fluid-like state. The $μ-G$ relationship converges towards the equilibrium $μ_{eq}(G)$ after $G>G_0$ showing the critical point where the established rheological laws for steady states apply during transient conditions.

cond-mat.soft↗

First Activations Matter: Training-Free Methods for Dynamic Activation in Large Language Models

Dynamic activation (DA) techniques, such as DejaVu and MoEfication, have demonstrated their potential to significantly enhance the inference efficiency of large language models (LLMs). However, these techniques often rely on ReLU activation functions or require additional parameters and training to maintain performance. This paper introduces a training-free Threshold-based Dynamic Activation(TDA) method that leverage sequence information to exploit the inherent sparsity of models across various architectures. This method is designed to accelerate generation speed by 18-25\% without significantly compromising task performance, thereby addressing the limitations of existing DA techniques. Moreover, we delve into the root causes of LLM sparsity and theoretically analyze two of its critical features: history-related activation uncertainty and semantic-irrelevant activation inertia. Our comprehensive analyses not only provide a robust theoretical foundation for DA methods but also offer valuable insights to guide future research in optimizing LLMs for greater efficiency and effectiveness.

cs.CL↗

Pupil-Adaptive 3D Holography Beyond Coherent Depth-of-Field

Recent holographic display approaches propelled by deep learning have shown remarkable success in enabling high-fidelity holographic projections. However, these displays have still not been able to demonstrate realistic focus cues, and a major gap still remains between the defocus effects possible with a coherent light-based holographic display and those exhibited by incoherent light in the real world. Moreover, existing methods have not considered the effects of the observer's eye pupil size variations on the perceived quality of 3D projections, especially on the defocus blur due to varying depth-of-field of the eye. In this work, we propose a framework that bridges the gap between the coherent depth-of-field of holographic displays and what is seen in the real world due to incoherent light. To this end, we investigate the effect of varying shape and motion of the eye pupil on the quality of holographic projections, and devise a method that changes the depth-of-the-field of holographic projections dynamically in a pupil-adaptive manner. Specifically, we introduce a learning framework that adjusts the receptive fields on-the-go based on the current state of the observer's eye pupil to produce image effects that otherwise are not possible in current computer-generated holography approaches. We validate the proposed method both in simulations and on an experimental prototype holographic display, and demonstrate significant improvements in the depiction of depth-of-field effects, outperforming existing approaches both qualitatively and quantitatively by at least 5 dB in peak signal-to-noise ratio.

cs.CV↗

QQQ: Quality Quattuor-Bit Quantization for Large Language Models

Quantization is a proven effective method for compressing large language models. Although popular techniques like W8A8 and W4A16 effectively maintain model performance, they often fail to concurrently speed up the prefill and decoding stages of inference. W4A8 is a promising strategy to accelerate both of them while usually leads to a significant performance degradation. To address these issues, we present QQQ, a Quality Quattuor-bit Quantization method with 4-bit weights and 8-bit activations. QQQ employs adaptive smoothing and Hessian-based compensation, significantly enhancing the performance of quantized models without extensive training. Furthermore, we meticulously engineer W4A8 GEMM kernels to increase inference speed. Our specialized per-channel W4A8 GEMM and per-group W4A8 GEMM achieve impressive speed increases of 3.67$\times$ and 3.29 $\times$ over FP16 GEMM. Our extensive experiments show that QQQ achieves performance on par with existing state-of-the-art LLM quantization methods while significantly accelerating inference, achieving speed boosts up to 2.24 $\times$, 2.10$\times$, and 1.25$\times$ compared to FP16, W8A8, and W4A16, respectively.

cs.LG↗

Cost-efficient Crowdsourcing for Span-based Sequence Labeling: Worker Selection and Data Augmentation

This paper introduces a novel crowdsourcing worker selection algorithm, enhancing annotation quality and reducing costs. Unlike previous studies targeting simpler tasks, this study contends with the complexities of label interdependencies in sequence labeling. The proposed algorithm utilizes a Combinatorial Multi-Armed Bandit (CMAB) approach for worker selection, and a cost-effective human feedback mechanism. The challenge of dealing with imbalanced and small-scale datasets, which hinders offline simulation of worker selection, is tackled using an innovative data augmentation method termed shifting, expanding, and shrinking (SES). Rigorous testing on CoNLL 2003 NER and Chinese OEI datasets showcased the algorithm's efficiency, with an increase in F1 score up to 100.04% of the expert-only baseline, alongside cost savings up to 65.97%. The paper also encompasses a dataset-independent test emulating annotation evaluation through a Bernoulli distribution, which still led to an impressive 97.56% F1 score of the expert baseline and 59.88% cost savings. Furthermore, our approach can be seamlessly integrated into Reinforcement Learning from Human Feedback (RLHF) systems, offering a cost-effective solution for obtaining human feedback.

cs.CL↗

Edwards thermodynamic framework controls density segregation in cyclically sheared granular materials

Using X-ray tomography, we experimentally investigate granular segregation phenomena in a mixture of particles with different densities under quasi-static cyclic shear. We quantitatively characterize their height distributions at steady states by minimizing effective free energy based on a segregation temperature that captures the competition between the mixing entropy and gravitational potential energy. We find this temperature coincides with Edwards' compactivity within error under various pressures and cyclic shear amplitudes. Therefore, we find that granular segregation in quasi-static conditions can be fundamentally explained by an effective granular thermodynamic framework including real energy terms based on the Edwards statistical ensemble.

cond-mat.soft↗

MOYU: A Theoretical Study on Massive Over-activation Yielded Uplifts in LLMs

Massive Over-activation Yielded Uplifts(MOYU) is an inherent property of large language models, and dynamic activation(DA) based on the MOYU property is a clever yet under-explored strategy designed to accelerate inference in these models. Existing methods that utilize MOYU often face a significant 'Impossible Trinity': struggling to simultaneously maintain model performance, enhance inference speed, and extend applicability across various architectures. Due to the theoretical ambiguities surrounding MOYU, this paper elucidates the root cause of the MOYU property and outlines the mechanisms behind two primary limitations encountered by current DA methods: 1) history-related activation uncertainty, and 2) semantic-irrelevant activation inertia. Our analysis not only underscores the limitations of current dynamic activation strategies within large-scale LLaMA models but also proposes opportunities for refining the design of future sparsity schemes.

cs.LG↗

Immersion and Invariance-based Disturbance Observer and Its Application to Safe Control

When the disturbance input matrix is nonlinear, existing disturbance observer design methods rely on the solvability of a partial differential equation or the existence of an output function with a uniformly well-defined disturbance relative degree, which can pose significant limitations. This note introduces a systematic approach for designing an Immersion and Invariance-based Disturbance Observer (IIDOB) that circumvents these strong assumptions. The proposed IIDOB ensures the disturbance estimation error is globally uniformly ultimately bounded by approximately solving a partial differential equation while compensating for the approximation error. Furthermore, by integrating IIDOB into the framework of control barrier functions, a filter-based safe control design method for control-affine systems with disturbances is established where the filter is used to generate an alternative disturbance estimation signal with a known derivative. Sufficient conditions are established to guarantee the safety of the disturbed systems. Simulation results demonstrate the effectiveness of the proposed method.

eess.SY↗

Mask-coding-assisted continuous-variable quantum direct communication with orbital angular momentum multiplexing

Quantum secure direct communication (QSDC) is a approach of communication to transmit secret messages base on quantum mechanics. Different from the quantum key distribution, secret messages can be transmitted directly on quantum channel with QSDC. Higher channel capacity and noise suppression capabilities are key to achieving long-distance quantum communication. Here we report a continuous-variable QSDC scheme based on mask-coding and orbital angular momentum, in which the mask-coding is employed to protect the security of the transmitting messages and to suppression the influence of excess noise. And the combination of orbital angular momentum and the information block transmission can effectively improve the secrecy capacity. In the 800 information blocks * 1310 bits length 10-km experiment, the results show that the statistical average of bit error rate has decreased by 36% and reached 0.38% comparing to existing solutions, and the system excess noise is 0.0184 SNU, and the final secrecy capacity is 6.319 * 106 bps. Therefore, this scheme reduces error bits while increasing secrecy capacity, providing a solution for long-distance large-scale quantum communication.

quant-ph↗

LSEnet: Lorentz Structural Entropy Neural Network for Deep Graph Clustering

Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. Such limitation motivates us to pose a more challenging problem of graph clustering with unknown cluster number. We propose to address this problem from a fresh perspective of graph information theory (i.e., structural information). In the literature, structural information has not yet been introduced to deep clustering, and its classic definition falls short of discrete formulation and modeling node features. In this work, we first formulate a differentiable structural information (DSI) in the continuous realm, accompanied by several theoretical results. By minimizing DSI, we construct the optimal partitioning tree where densely connected nodes in the graph tend to have the same assignment, revealing the cluster structure. DSI is also theoretically presented as a new graph clustering objective, not requiring the predefined cluster number. Furthermore, we design a neural LSEnet in the Lorentz model of hyperbolic space, where we integrate node features to structural information via manifold-valued graph convolution. Extensive empirical results on real graphs show the superiority of our approach.

cs.LG↗