arXiv subjects

Shuyuan Zhang

Publications and source records attributed to Shuyuan Zhang.

At least 37 records · Page 2Linked to original sources

arXiv2025

Region of Synchronization Estimation for Complex Networks via SOS Programming

In this article, we explore the problem of the region of synchronization (ROS) for complex networks with nonlinear dynamics. Given a pair of state- and target- sets, our goal is to estimate the ROS such that the trajectories originating within it reach the target set (i.e., synchronization manifold), without leaving the state set before the first hitting time. In order to do so, an exponential guidance-barrier function is proposed to construct the ROS along the synchronization manifold, and the corresponding sufficient conditions for estimating the ROS are developed. The resulting conditions lead to a sum-of-squares programming problem, thereby affording a polynomial-time solvability. Furthermore, when the synchronization manifold reduces to an equilibrium point, our method not only estimates a larger ROS compared to existing results but also allows the ROS to take more general shapes. Finally, we present two numerical examples to demonstrate the effectiveness of the theoretical results.

math.OC↗

arXiv2025

Improving efficiency and stability for perovskite solar cell with diethylene glycol dimethacrylate modification

The humidity resistance is the key challenges that hinder the commercial application of perovskite solar cells (PSCs). Herein, we propose an ultra-thin acrylate polymer (diethylene glycol dimethacrylate, DGDMA) into perovskite films to investigate the influence of polymerized networks on stability. The monomer molecules containing acrylate and carbonyl groups were selected, and the effects of the polymerized were quantified with different concentration. The experimental results show that, when the concentration of DGDMA is 1 mg/ml, the PCE increases from 18.06% to 21.82%, which is optimum. The monomer molecules with carbonyl groups polymerize, they can chelate with uncoordinated Pb2+ in perovskite films to improve the film quality, reduce the surface defect density to decrease non-radiative recombination, and also significantly enhance the humidity stability of PSCs.

cond-mat.mtrl-sci↗

arXiv2025

Observe Then Act: Asynchronous Active Vision-Action Model for Robotic Manipulation

In real-world scenarios, many robotic manipulation tasks are hindered by occlusions and limited fields of view, posing significant challenges for passive observation-based models that rely on fixed or wrist-mounted cameras. In this paper, we investigate the problem of robotic manipulation under limited visual observation and propose a task-driven asynchronous active vision-action model.Our model serially connects a camera Next-Best-View (NBV) policy with a gripper Next-Best Pose (NBP) policy, and trains them in a sensor-motor coordination framework using few-shot reinforcement learning. This approach allows the agent to adjust a third-person camera to actively observe the environment based on the task goal, and subsequently infer the appropriate manipulation actions.We trained and evaluated our model on 8 viewpoint-constrained tasks in RLBench. The results demonstrate that our model consistently outperforms baseline algorithms, showcasing its effectiveness in handling visual constraints in manipulation tasks.

cs.RO↗

arXiv2023

Reducing Reconfiguration Time in Hybrid Optical-Electrical Datacenter Networks (Extended Abstract)

We study how to reduce the reconfiguration time in hybrid optical-electrical Datacenter Networks (DCNs). With a layer of Optical Circuit Switches (OCSes), hybrid optical-electrical DCNs can reconfigure its logical topologies to better match the on-going traffic patterns, but the reconfiguration time may directly affect the benefits of reconfigurability. The reconfiguration time consists of the topology solver running time and the network convergence time after triggering reconfiguration. However, existing topology solvers either incur high algorithmic complexity or fail to minimize the reconfiguration overhead. In this paper, we propose a novel algorithm that combines the ideas of bipartition and Minimum Cost Flow (MCF) to reduce the overall reconfiguration time. For the first time, we formulate the topology solving problem as a MCF problem with piecewise-linear cost, which strikes a better balance between solver complexity and solution optimality. Our evaluation shows that our algorithm can significantly reduce the network convergence time while consuming less topology solver running time, making its overall performance superior to existing algorithms. Our code and test cases are available at a public repository.

cs.NI↗

arXiv2023

Reach-avoid Analysis for Sampled-data Systems with Measurement Uncertainties

Digital control has become increasingly prevalent in modern systems, making continuous-time plants controlled by discrete-time (digital) controllers ubiquitous and crucial across industries, including aerospace, automotive, and manufacturing. This paper focuses on investigating the reach-avoid problem in such systems, where the objective is to reach a goal set while avoiding unsafe states, especially in the presence of state measurement uncertainties. We propose an approach that builds upon the concept of exponential control guidance barrier functions, originally used for synthesizing continuous-time feedback controllers. We introduce a sufficient condition that, if met by a given continuous-time feedback controller, ensures the safe guidance of the system into the goal set in its sampled-data implementation, despite state measurement uncertainties. The event of reaching the goal set is determined based on state measurements obtained at the sampling time instants. Numerical examples are provided to demonstrate the validity of our theoretical developments, showcasing successful implementation in solving the reach-avoid problem in sampled-data systems with state measurement uncertainties.

eess.SY↗

arXiv2022

Revisiting Heterophily For Graph Neural Networks

Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by using graph structures based on the relational inductive bias (homophily assumption). While GNNs have been commonly believed to outperform NNs in real-world tasks, recent work has identified a non-trivial set of datasets where their performance compared to NNs is not satisfactory. Heterophily has been considered the main cause of this empirical observation and numerous works have been put forward to address it. In this paper, we first revisit the widely used homophily metrics and point out that their consideration of only graph-label consistency is a shortcoming. Then, we study heterophily from the perspective of post-aggregation node similarity and define new homophily metrics, which are potentially advantageous compared to existing ones. Based on this investigation, we prove that some harmful cases of heterophily can be effectively addressed by local diversification operation. Then, we propose the Adaptive Channel Mixing (ACM), a framework to adaptively exploit aggregation, diversification and identity channels node-wisely to extract richer localized information for diverse node heterophily situations. ACM is more powerful than the commonly used uni-channel framework for node classification tasks on heterophilic graphs and is easy to be implemented in baseline GNN layers. When evaluated on 10 benchmark node classification tasks, ACM-augmented baselines consistently achieve significant performance gain, exceeding state-of-the-art GNNs on most tasks without incurring significant computational burden.

cs.LG↗

arXiv2022

Constrained Optimal Querying: Huffman Coding and Beyond

Huffman coding is well known to be useful in certain decision problems involving minimizing the average number of (freely chosen) queries to determine an unknown random variable. However, in problems where the queries are more constrained, the original Huffman coding no longer works. In this paper, we proposed a general model to describe such problems and two code schemes: one is Huffman-based, and the other called GBSC (Greedy Binary Separation Coding). We proved the optimality of GBSC by induction on a binary decision tree, telling us that GBSC is at least as good as Shannon coding. We then compared the two algorithms based on these two codes, by testing them with two problems: DNA detection and 1-player Battleship, and found both to be decent approximating algorithms, with Huffman-based algorithm giving an expected length 1.1 times the true optimal in DNA detection problem, and GBSC yielding an average number of queries 1.4 times the theoretical optimal in 1-player Battleship.

cs.IT↗

arXiv2022

N-Grammer: Augmenting Transformers with latent n-grams

Transformer models have recently emerged as one of the foundational models in natural language processing, and as a byproduct, there is significant recent interest and investment in scaling these models. However, the training and inference costs of these large Transformer language models are prohibitive, thus necessitating more research in identifying more efficient variants. In this work, we propose a simple yet effective modification to the Transformer architecture inspired by the literature in statistical language modeling, by augmenting the model with n-grams that are constructed from a discrete latent representation of the text sequence. We evaluate our model, the N-Grammer on language modeling on the C4 data-set as well as text classification on the SuperGLUE data-set, and find that it outperforms several strong baselines such as the Transformer and the Primer. We open-source our model for reproducibility purposes in Jax.

cs.CL↗

arXiv2021

A Consciousness-Inspired Planning Agent for Model-Based Reinforcement Learning

We present an end-to-end, model-based deep reinforcement learning agent which dynamically attends to relevant parts of its state during planning. The agent uses a bottleneck mechanism over a set-based representation to force the number of entities to which the agent attends at each planning step to be small. In experiments, we investigate the bottleneck mechanism with several sets of customized environments featuring different challenges. We consistently observe that the design allows the planning agents to generalize their learned task-solving abilities in compatible unseen environments by attending to the relevant objects, leading to better out-of-distribution generalization performance.

cs.AI↗

arXiv2021

Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?

Graph Neural Networks (GNNs) extend basic Neural Networks (NNs) by using the graph structures based on the relational inductive bias (homophily assumption). Though GNNs are believed to outperform NNs in real-world tasks, performance advantages of GNNs over graph-agnostic NNs seem not generally satisfactory. Heterophily has been considered as a main cause and numerous works have been put forward to address it. In this paper, we first show that not all cases of heterophily are harmful for GNNs with aggregation operation. Then, we propose new metrics based on a similarity matrix which considers the influence of both graph structure and input features on GNNs. The metrics demonstrate advantages over the commonly used homophily metrics by tests on synthetic graphs. From the metrics and the observations, we find some cases of harmful heterophily can be addressed by diversification operation. With this fact and knowledge of filterbanks, we propose the Adaptive Channel Mixing (ACM) framework to adaptively exploit aggregation, diversification and identity channels in each GNN layer to address harmful heterophily. We validate the ACM-augmented baselines with 10 real-world node classification tasks. They consistently achieve significant performance gain and exceed the state-of-the-art GNNs on most of the tasks without incurring significant computational burden.

cs.LG↗

arXiv2021

Interfacial Electron-Phonon Coupling Constants Extracted from Intrinsic Replica Bands in Monolayer FeSe/SrTiO$_3$

The observation of replica bands by angle-resolved photoemission spectroscopy has ignited interest in the study of electron-phonon coupling at low carrier densities, particularly in monolayer FeSe/SrTiO$_3$, where the appearance of replica bands has motivated theoretical work suggesting that the interfacial coupling of electrons in the FeSe layer to optical phonons in the SrTiO$_3$ substrate might contribute to the enhanced superconducting pairing temperature. Alternatively, it has also been recently proposed that such replica bands might instead originate from extrinsic final state losses associated with the photoemission process. Here, we perform a quantitative examination of replica bands in monolayer FeSe/SrTiO$_3$, where we are able to conclusively demonstrate that the replica bands are indeed signatures of intrinsic electron-boson coupling, and not associated with final state effects. A detailed analysis of the energy splittings between the higher-order replicas, as well as other self-energy effects, allow us to determine that the interfacial electron-phonon coupling in the system corresponds to a value of $λ= 0.19 \pm 0.02$.

cond-mat.mtrl-sci↗

arXiv2020

Broad-Spectral-Range Sustainability and Controllable Excitation of Hyperbolic Phonon Polaritons in $α$-MoO3

Hyperbolic phonon polaritons (HPhPs) in orthorhombic-phase molybdenum trioxide ($α$-MoO3) show in-plane hyperbolicity, great wavelength compression and ultra-long lifetime, therefore holding great potential in nanophotonic applications. However, its polaritonic response in the far-infrared (FIR) range has long remained unexplored due to challenges in experimental characterization. Here, using monochromated electron energy loss spectroscopy (EELS) in a scanning transmission electron microscope (STEM), we probe HPhPs in $α$-MoO3 in both mid-infrared (MIR) and FIR frequencies and correlate their behaviors with microstructures and orientations. We find that low-structural symmetry leads to various phonon modes and multiple Reststrahlen bands (RBs) over a broad spectral range (over 70 meV) and in different directions (55-63 meV and 119-125 meV along b axis, 68-106 meV along c axis, 101-121 meV along a axis). These HPhPs can be selectively excited by controlling the direction of swift electrons. These findings provide new opportunities in nanophotonic and optoelectronic applications such as directed light propagation, hyperlenses and heat transfer.

cond-mat.mtrl-sci↗

arXiv2020

Topologically Nontrivial Interband Plasmons in Type-II Weyl Semimetal MoTe$_2$

In many realistic topological materials, more than one kind of fermions contribute to the electronic bands crossing the Fermi level, leading to various novel phenomena. Here, using momentum-resolved inelastic electron scattering, we investigate the plasmons and their evolution across the phase transition in a type-II Weyl Semimetal MoTe$_2$, in which both Weyl fermions and trivial nonrelativistic fermions contribute to the Fermi surface in the Td phase. One plasmon mode in the 1T' phase at high temperature and two plasmon modes in the topological T$_d$ phase at low temperature are observed. Combining with first-priciples calculations, we show that all the plasmon modes are dominated by the interband correlations between the inverted bands of MoTe$_2$. Especially in the T$_d$ phase, since the electronic bands split due to inversion symmetry breaking and spin-orbit coupling, the plasmon modes manifest the interband correlation between the topological Weyl fermions and the trivial nonrelativistic electrons. Our work emphasizes the significance of the interplay between different kinds of carriers in plasmons of topological materials.

cond-mat.mtrl-sci↗

arXiv2019

A comparison of end-to-end models for long-form speech recognition

End-to-end automatic speech recognition (ASR) models, including both attention-based models and the recurrent neural network transducer (RNN-T), have shown superior performance compared to conventional systems. However, previous studies have focused primarily on short utterances that typically last for just a few seconds or, at most, a few tens of seconds. Whether such architectures are practical on long utterances that last from minutes to hours remains an open question. In this paper, we both investigate and improve the performance of end-to-end models on long-form transcription. We first present an empirical comparison of different end-to-end models on a real world long-form task and demonstrate that the RNN-T model is much more robust than attention-based systems in this regime. We next explore two improvements to attention-based systems that significantly improve its performance: restricting the attention to be monotonic, and applying a novel decoding algorithm that breaks long utterances into shorter overlapping segments. Combining these two improvements, we show that attention-based end-to-end models can be very competitive to RNN-T on long-form speech recognition.

eess.AS↗

arXiv2019

Electron-phonon Coupling and Kohn Anomaly due to the Floating 2D Electronic Bands on the Surface of ZrSiS

ZrSiS, an intriguing candidate of topological nodal line semimetals, was discovered to have exotic surface floating two-dimensional (2D) electrons [Phys. Rev. X 7, 041073 (2017)], which are likely to interact with surface phonons. Here, we reveal a prominent Kohn anomaly in a surface phonon branch by mapping out the surface phonon dispersions of ZrSiS using high-resolution electron energy loss spectroscopy. Theoretical analysis via an electron-phonon coupling (EPC) model attributes the strong renormalization of the surface phonon branch to the interactions with the surface floating 2D electrons. With the random phase approximation, we calculate the phonon self-energy and evaluate the mode-specific EPC constant by fitting the experimental data. The EPC picture provided here may be important for potential applications of topological nodal line semimetals.

cond-mat.mtrl-sci↗

arXiv2019

Superconductivity of the FeSe/SrTiO3 Interface in the View of BCS-BEC Crossover

In paired Fermi systems, strong many-body effects exhibit in the crossover regime between the Bardeen-Cooper-Schrieffer (BCS) and the Bose-Einstein condensation (BEC) limits. The concept of the BCS-BEC crossover, which is studied intensively in the research field of cold atoms, has been extended to condensed matters. Here, by analyzing the typical superconductors within the BCS-BEC phase diagram, we find that FeSe-based superconductors are prone to shift their positions in the BCS-BEC crossover regime by charge doping or substrate substitution, since their Fermi energies and the superconducting gap sizes are comparable. Especially at the interface of a single-layer FeSe on SrTiO3 substrate, the superconductivity is relocated closer to the crossover unitary than other doped FeSe-based materials, indicating that the pairing interaction is effectively modulated. We further show that hole-doping can drive the interfacial system into the phase with possible pre-paired electrons, demonstrating its flexible tunability within the BCS-BEC crossover regime.

cond-mat.supr-con↗

arXiv2019

Gmail Smart Compose: Real-Time Assisted Writing

In this paper, we present Smart Compose, a novel system for generating interactive, real-time suggestions in Gmail that assists users in writing mails by reducing repetitive typing. In the design and deployment of such a large-scale and complicated system, we faced several challenges including model selection, performance evaluation, serving and other practical issues. At the core of Smart Compose is a large-scale neural language model. We leveraged state-of-the-art machine learning techniques for language model training which enabled high-quality suggestion prediction, and constructed novel serving infrastructure for high-throughput and real-time inference. Experimental results show the effectiveness of our proposed system design and deployment approach. This system is currently being served in Gmail.

cs.CL↗

arXiv2019

Lingvo: a Modular and Scalable Framework for Sequence-to-Sequence Modeling

Lingvo is a Tensorflow framework offering a complete solution for collaborative deep learning research, with a particular focus towards sequence-to-sequence models. Lingvo models are composed of modular building blocks that are flexible and easily extensible, and experiment configurations are centralized and highly customizable. Distributed training and quantized inference are supported directly within the framework, and it contains existing implementations of a large number of utilities, helper functions, and the newest research ideas. Lingvo has been used in collaboration by dozens of researchers in more than 20 papers over the last two years. This document outlines the underlying design of Lingvo and serves as an introduction to the various pieces of the framework, while also offering examples of advanced features that showcase the capabilities of the framework.

cs.LG↗