arXiv subjects

Yi Guo

Publications and source records attributed to Yi Guo.

At least 91 records · Page 5Linked to original sources

arXiv2024

Online Feedback Droop Scheduling in Distribution Grids for Frequency and Local Voltage Control

This paper presents a novel framework for collective control of Distributed Energy Resources (DERs) in active Distribution Networks (DNs). The proposed approach unifies the commonly employed local (i.e., decentralized) voltage and frequency droop control schemes into a transfer matrix relating frequency and voltage magnitude measurements to active and reactive power injection adjustments. Furthermore, the transfer matrices of individual DER units are adaptively tuned in real-time via slow communication links using a novel online gain scheduling approach to enable primary frequency support provision to the transmission system and ensure that the DN voltages are kept within the allowable limits. A global asymptomatic stability condition of the analyzed droop-controlled DN is analytically established. The considered gain scheduling problem is solved by leveraging an online primal-dual gradient-based method and a suitable linearized power flow model. Additional ancillary service providers can be trivially incorporated into the proposed framework in a plug-and-play fashion. Numerical simulations of the 37-bus IEEE test system and a realistic Swedish 533-bus DN confirm the validity and the scalability of the approach and demonstrate numerous advantages of the proposed scheme over the state-of-the-art.

eess.SY↗

arXiv2024

Design Your Own Universe: A Physics-Informed Agnostic Method for Enhancing Graph Neural Networks

Physics-informed Graph Neural Networks have achieved remarkable performance in learning through graph-structured data by mitigating common GNN challenges such as over-smoothing, over-squashing, and heterophily adaption. Despite these advancements, the development of a simple yet effective paradigm that appropriately integrates previous methods for handling all these challenges is still underway. In this paper, we draw an analogy between the propagation of GNNs and particle systems in physics, proposing a model-agnostic enhancement framework. This framework enriches the graph structure by introducing additional nodes and rewiring connections with both positive and negative weights, guided by node labeling information. We theoretically verify that GNNs enhanced through our approach can effectively circumvent the over-smoothing issue and exhibit robustness against over-squashing. Moreover, we conduct a spectral analysis on the rewired graph to demonstrate that the corresponding GNNs can fit both homophilic and heterophilic graphs. Empirical validations on benchmarks for homophilic, heterophilic graphs, and long-term graph datasets show that GNNs enhanced by our method significantly outperform their original counterparts.

cs.LG↗

arXiv2024

Light Fields during Inflation from BOSS and Future Galaxy Surveys

Primordial non-Gaussianity generated by additional fields present during inflation offers a compelling observational target for galaxy surveys. These fields are of significant theoretical interest since they offer a window into particle physics in the inflaton sector. They also violate the single-field consistency conditions and induce a scale-dependent bias in the galaxy power spectrum. In this paper, we explore this particular signal for light scalar fields and study the prospects for measuring it with galaxy surveys. We find that the sensitivities of current and future surveys are remarkably stable for different configurations, including between spectroscopic and photometric redshift measurements. This is even the case at non-zero masses where the signal is not obviously localized on large scales. For realistic galaxy number densities, we demonstrate that the redshift range and galaxy bias of the sample have the largest impact on the sensitivity in the power spectrum. These results additionally motivated us to explore the potentially enhanced sensitivity of Vera Rubin Observatory's LSST through multi-tracer analyses. Finally, we apply this understanding to current data from the last data release of the Baryon Oscillation Spectroscopic Survey (BOSS DR12) and place new constraints on light fields coupled to the inflaton.

astro-ph.CO↗

arXiv2024

Optical Imaging of Flavor Order in Flat Band Graphene

Spin and valley flavor polarization plays a central role in the many-body physics of flat band graphene, with fermi surface reconstructions often accompanied by quantized anomalous Hall and superconducting state observed in a variety of experimental systems. Here we describe an optical technique that sensitively and selectively detects flavor textures via the exciton response of a proximal transition metal dichalcogenide layer. Through a systematic study of rhombohedral and rotationally faulted graphene bilayers and trilayers, we show that when the semiconducting dichalcogenide is in direct contact with the graphene, the exciton response is most sensitive to the large momentum rearrangement of the Fermi surface, providing information that is distinct from and complementary to electrical compressibility measurements. The wide-field imaging capability of optical probes allows us to obtain spatial maps of flavor orders with high throughput, and with broad temperature and device compatibility. Our work paves the way for optical probing and imaging of flavor orders in flat band graphene systems.

cond-mat.mes-hall↗

arXiv2024

decoupleQ: Towards 2-bit Post-Training Uniform Quantization via decoupling Parameters into Integer and Floating Points

Quantization emerges as one of the most promising compression technologies for deploying efficient large models for various real time application in recent years. Considering that the storage and IO of weights take up the vast majority of the overhead inside a large model, weight only quantization can lead to large gains. However, existing quantization schemes suffer from significant accuracy degradation at very low bits, or require some additional computational overhead when deployed, making it difficult to be applied to large-scale applications in industry. In this paper, we propose decoupleQ, achieving a substantial increase in model accuracy, especially at very low bits. decoupleQ abandons the traditional heuristic quantization paradigm and decouples the model parameters into integer and floating-point parts, thus transforming the quantization problem into a traditional mathematical optimization problem with constraints, which is then solved alternatively by off-the-shelf optimization methods. Quantization via decoupleQ is linear and uniform, making it hardware-friendlier than non-uniform counterpart, and enabling the idea to be migrated to high-bit quantization to enhance its robustness. Our method has achieved well on-line accuracy near fp16/bf16 on the 2-bit quantization of large speech models in ByteDance. The code is available at https://github.com/bytedance/decoupleQ

cs.LG↗

arXiv2024

Multiple Joint Chance Constraints Approximation for Uncertainty Modeling in Dispatch Problems

Uncertainty modeling has become increasingly important in power system decision-making. The widely-used tractable uncertainty modeling method-chance constraints with Conditional Value at Risk (CVaR) approximation, can be overconservative and even turn an originally feasible problem into an infeasible one. This paper proposes a new approximation method for multiple joint chance constraints (JCCs) to model the uncertainty in dispatch problems, which solves the conservativeness and potential infeasibility concerns of CVaR. The proposed method is also convenient for controlling the risk levels of different JCCs, which is necessary for power system applications since different resources may be affected by varying degrees of uncertainty or have different importance to the system. We then formulate a data-driven distributionally robust chance-constrained programming model for the power system multiperiod dispatch problem and leverage the proposed approximation method to solve it. In the numerical simulations, two small general examples clearly demonstrate the superiority of the proposed method, and the results of the multiperiod dispatch problem on IEEE test cases verify its practicality.

math.OC↗

arXiv2024

Chart2Vec: A Universal Embedding of Context-Aware Visualizations

The advances in AI-enabled techniques have accelerated the creation and automation of visualizations in the past decade. However, presenting visualizations in a descriptive and generative format remains a challenge. Moreover, current visualization embedding methods focus on standalone visualizations, neglecting the importance of contextual information for multi-view visualizations. To address this issue, we propose a new representation model, Chart2Vec, to learn a universal embedding of visualizations with context-aware information. Chart2Vec aims to support a wide range of downstream visualization tasks such as recommendation and storytelling. Our model considers both structural and semantic information of visualizations in declarative specifications. To enhance the context-aware capability, Chart2Vec employs multi-task learning on both supervised and unsupervised tasks concerning the cooccurrence of visualizations. We evaluate our method through an ablation study, a user study, and a quantitative comparison. The results verified the consistency of our embedding method with human cognition and showed its advantages over existing methods.

cs.HC↗

arXiv2024

OpenMEDLab: An Open-source Platform for Multi-modality Foundation Models in Medicine

The emerging trend of advancing generalist artificial intelligence, such as GPTv4 and Gemini, has reshaped the landscape of research (academia and industry) in machine learning and many other research areas. However, domain-specific applications of such foundation models (e.g., in medicine) remain untouched or often at their very early stages. It will require an individual set of transfer learning and model adaptation techniques by further expanding and injecting these models with domain knowledge and data. The development of such technologies could be largely accelerated if the bundle of data, algorithms, and pre-trained foundation models were gathered together and open-sourced in an organized manner. In this work, we present OpenMEDLab, an open-source platform for multi-modality foundation models. It encapsulates not only solutions of pioneering attempts in prompting and fine-tuning large language and vision models for frontline clinical and bioinformatic applications but also building domain-specific foundation models with large-scale multi-modal medical data. Importantly, it opens access to a group of pre-trained foundation models for various medical image modalities, clinical text, protein engineering, etc. Inspiring and competitive results are also demonstrated for each collected approach and model in a variety of benchmarks for downstream tasks. We welcome researchers in the field of medical artificial intelligence to continuously contribute cutting-edge methods and models to OpenMEDLab, which can be accessed via https://github.com/openmedlab.

cs.CV↗

arXiv2024

Real-Time Coordination of Integrated Transmission and Distribution Systems: Flexibility Modeling and Distributed NMPC Scheduling

This paper proposes a real-time distributed operational architecture to efficiently coordinate intergrated transmission and distribution systems (ITD). At the distribution system level, the distribution system operator (DSO) computes the aggregated flexibility of all controllable devices by power-energy envelopes and provides them to the transmission system operators. At the transmission system level, a distributed nonlinear MPC approach is proposed to coordinate the economic dispatch of multiple TSOs, considering the aggregated flexibility of all distribution systems. The subproblems of the proposed approach are associated with different TSOs and individual time periods. In addition, the aggregated flexibility of controllable devices in distribution networks is encapsulated, re-calculated, and communicated through the power-energy envelopes, facilitating a reduction in computational complexity and eliminating redundant information exchanges between TSOs and DSOs, thereby enhancing privacy and security. The framework's effectiveness and applicability in real-world scenarios are validated through simulated operational scenarios on a summer day in Germany, highlighting its robustness in the face of significant prediction mismatches due to severe weather conditions.

math.OC↗

arXiv2024

Feasibility of Identifying Factors Related to Alzheimer's Disease and Related Dementia in Real-World Data

A comprehensive view of factors associated with AD/ADRD will significantly aid in studies to develop new treatments for AD/ADRD and identify high-risk populations and patients for prevention efforts. In our study, we summarized the risk factors for AD/ADRD by reviewing existing meta-analyses and review articles on risk and preventive factors for AD/ADRD. In total, we extracted 477 risk factors in 10 categories from 537 studies. We constructed an interactive knowledge map to disseminate our study results. Most of the risk factors are accessible from structured Electronic Health Records (EHRs), and clinical narratives show promise as information sources. However, evaluating genomic risk factors using RWD remains a challenge, as genetic testing for AD/ADRD is still not a common practice and is poorly documented in both structured and unstructured EHRs. Considering the constantly evolving research on AD/ADRD risk factors, literature mining via NLP methods offers a solution to automatically update our knowledge map.

cs.AI↗

arXiv2024

Advancing Distributed AC Optimal Power Flow for Integrated Transmission-Distribution Systems

This paper introduces a distributed operational solution for coordinating integrated transmission-distribution (ITD) systems regarding data privacy. To tackle the nonconvex challenges of AC optimal power flow (OPF) problems, our research proposes an enhanced version of the Augmented Lagrangian based Alternating Direction Inexact Newton method (ALADIN). This proposed framework incorporates a second-order correction strategy and convexification, thereby enhancing numerical robustness and computational efficiency. The theoretical studies demonstrate that the proposed distributed algorithm operates the ITD systems with a local quadratic convergence guarantee. Extensive simulations on various ITD configurations highlight the superior performance of our distributed approach in terms of convergence speed, computational efficiency, scalability, and adaptability.

eess.SY↗

arXiv2024

Image based Crop Monitoring Technologies in Protected Horticulture: A Review

Future food security is a major concern of the 21st century with the growing global population and climate changes. In addressing these challenges, protected cropping ensures food production year-round and increases crop production per land area by controlling environment conditions. Maintaining the growth and health of crops in these facilities is essential to ensure optimum food production. However, this is a laborious work and is currently done manually. Image-based non-destructive plant phenotyping is an emerging research area that reduces the skilled labour cost while enhancing the monitoring of crop growth, health, and identifying phenotype-genotype relations for plant breeding. With the proliferations of protected infrastructures and targeted plants, different technologies and sensor setups are needed for image-based crop monitoring. Conveyor-type plant-to-sensor systems, bench-top or gantry-based systems are commonly found in research facilities focussing on phenotyping of small, relatively short, or movable model plants. This review examines the literature on crop monitoring and phenotyping platforms in both field and protected facilities and explains different camera technologies and their ability to extract different plant traits. The review highlights the future research directions of image-based monitoring of commercial scale protected crops where crops can be relatively tall or vertically supported under semi controlled environments, which presents new challenges and is rarely covered in the literature.

cs.CE↗

arXiv2024

USFM: A Universal Ultrasound Foundation Model Generalized to Tasks and Organs towards Label Efficient Image Analysis

Inadequate generality across different organs and tasks constrains the application of ultrasound (US) image analysis methods in smart healthcare. Building a universal US foundation model holds the potential to address these issues. Nevertheless, the development of such foundational models encounters intrinsic challenges in US analysis, i.e., insufficient databases, low quality, and ineffective features. In this paper, we present a universal US foundation model, named USFM, generalized to diverse tasks and organs towards label efficient US image analysis. First, a large-scale Multi-organ, Multi-center, and Multi-device US database was built, comprehensively containing over two million US images. Organ-balanced sampling was employed for unbiased learning. Then, USFM is self-supervised pre-trained on the sufficient US database. To extract the effective features from low-quality US images, we proposed a spatial-frequency dual masked image modeling method. A productive spatial noise addition-recovery approach was designed to learn meaningful US information robustly, while a novel frequency band-stop masking learning approach was also employed to extract complex, implicit grayscale distribution and textural variations. Extensive experiments were conducted on the various tasks of segmentation, classification, and image enhancement from diverse organs and diseases. Comparisons with representative US image analysis models illustrate the universality and effectiveness of USFM. The label efficiency experiments suggest the USFM obtains robust performance with only 20% annotation, laying the groundwork for the rapid development of US models in clinical practices.

eess.IV↗

arXiv2023

RdimKD: Generic Distillation Paradigm by Dimensionality Reduction

Knowledge Distillation (KD) emerges as one of the most promising compression technologies to run advanced deep neural networks on resource-limited devices. In order to train a small network (student) under the guidance of a large network (teacher), the intuitive method is regularizing the feature maps or logits of the student using the teacher's information. However, existing methods either over-restrict the student to learn all information from the teacher, which lead to some bad local minimum, or use various fancy and elaborate modules to process and align features, which are complex and lack generality. In this work, we proposed an abstract and general paradigm for the KD task, referred to as DIMensionality Reduction KD (RdimKD), which solely relies on dimensionality reduction, with a very minor modification to naive L2 loss. RdimKD straightforwardly utilizes a projection matrix to project both the teacher's and student's feature maps onto a low-dimensional subspace, which are then optimized during training. RdimKD achieves the goal in the simplest way that not only does the student get valuable information from the teacher, but it also ensures sufficient flexibility to adapt to the student's low-capacity reality. Our extensive empirical findings indicate the effectiveness of RdimKD across various learning tasks and diverse network architectures.

cs.LG↗

arXiv2023

XCloud-VIP: Virtual Peak Enables Highly Accelerated NMR Spectroscopy and Faithful Quantitative Measures

Nuclear Magnetic Resonance (NMR) spectroscopy is an important bio-engineering tool to determine the metabolic concentrations, molecule structures and so on. The data acquisition time, however, is very long in multi-dimensional NMR. To accelerate data acquisition, non-uniformly sampling is an effective way but may encounter severe spectral distortions and unfaithful quantitative measures when the acceleration factor is high. By modelling the acquired signal as the superimposed exponentials, we proposed a virtual peak (VIP) approach to selfadapt the prior spectral information, such as the resonance frequency and peak lineshape, and then feed these information into the reconstruction. The proposed method is further implemented with cloud computing to facilitate online, open, and easy access. Results on simulated and experimental data demonstrate that, compared with the low-rank Hankel matrix method, the new approach reconstructs high-fidelity NMR spectra from highly undersampled data and achieves more accurate quantification. The maximum quantitative errors of distances between nuclear pairs and concentrations of metabolites in mixtures have been reduced by 61.1% and 57.7%, respectively.

physics.med-ph↗

arXiv2023

Revisiting Generalized p-Laplacian Regularized Framelet GCNs: Convergence, Energy Dynamic and Training with Non-Linear Diffusion

This paper presents a comprehensive theoretical analysis of the graph p-Laplacian regularized framelet network (pL-UFG) to establish a solid understanding of its properties. We conduct a convergence analysis on pL-UFG, addressing the gap in the understanding of its asymptotic behaviors. Further by investigating the generalized Dirichlet energy of pL-UFG, we demonstrate that the Dirichlet energy remains non-zero throughout convergence, ensuring the avoidance of over-smoothing issues. Additionally, we elucidate the energy dynamic perspective, highlighting the synergistic relationship between the implicit layer in pL-UFG and graph framelets. This synergy enhances the model's adaptability to both homophilic and heterophilic data. Notably, we reveal that pL-UFG can be interpreted as a generalized non-linear diffusion process, thereby bridging the gap between pL-UFG and differential equations on the graph. Importantly, these multifaceted analyses lead to unified conclusions that offer novel insights for understanding and implementing pL-UFG, as well as other graph neural network (GNN) models. Finally, based on our dynamic analysis, we propose two novel pL-UFG models with manually controlled energy dynamics. We demonstrate empirically and theoretically that our proposed models not only inherit the advantages of pL-UFG but also significantly reduce computational costs for training on large-scale graph datasets.

cs.LG↗

arXiv2023

Unifying over-smoothing and over-squashing in graph neural networks: A physics informed approach and beyond

Graph Neural Networks (GNNs) have emerged as one of the leading approaches for machine learning on graph-structured data. Despite their great success, critical computational challenges such as over-smoothing, over-squashing, and limited expressive power continue to impact the performance of GNNs. In this study, inspired from the time-reversal principle commonly utilized in classical and quantum physics, we reverse the time direction of the graph heat equation. The resulted reversing process yields a class of high pass filtering functions that enhance the sharpness of graph node features. Leveraging this concept, we introduce the Multi-Scaled Heat Kernel based GNN (MHKG) by amalgamating diverse filtering functions' effects on node features. To explore more flexible filtering conditions, we further generalize MHKG into a model termed G-MHKG and thoroughly show the roles of each element in controlling over-smoothing, over-squashing and expressive power. Notably, we illustrate that all aforementioned issues can be characterized and analyzed via the properties of the filtering functions, and uncover a trade-off between over-smoothing and over-squashing: enhancing node feature sharpness will make model suffer more from over-squashing, and vice versa. Furthermore, we manipulate the time again to show how G-MHKG can handle both two issues under mild conditions. Our conclusive experiments highlight the effectiveness of proposed models. It surpasses several GNN baseline models in performance across graph datasets characterized by both homophily and heterophily.

cs.LG↗

arXiv2023

MusicJam: Visualizing Music Insights via Generated Narrative Illustrations

Visualizing the insights of the invisible music is able to bring listeners an enjoyable and immersive listening experience, and therefore has attracted much attention in the field of information visualization. Over the past decades, various music visualization techniques have been introduced. However, most of them are manually designed by following the visual encoding rules, thus shown in form of a graphical visual representation whose visual encoding schema is usually taking effort to understand. Recently, some researchers use figures or illustrations to represent music moods, lyrics, and musical features, which are more intuitive and attractive. However, in these techniques, the figures are usually pre-selected or statically generated, so they cannot precisely convey insights of different pieces of music. To address this issue, in this paper, we introduce MusicJam, a music visualization system that is able to generate narrative illustrations to represent the insight of the input music. The system leverages a novel generation model designed based on GPT-2 to generate meaningful lyrics given the input music and then employs the stable diffusion model to transform the lyrics into coherent illustrations. Finally, the generated results are synchronized and rendered as an MP4 video accompanied by the input music. We evaluated the proposed lyric generation model by comparing it to the baseline models and conducted a user study to estimate the quality of the generated illustrations and the final music videos. The results showed the power of our technique.

cs.HC↗