Searcharxiv⌕ Search

arXiv subjects

Yi Hu

Publications and source records attributed to Yi Hu.

At least 109 records · Page 6Linked to original sources
arXiv2023

GiPH: Generalizable Placement Learning for Adaptive Heterogeneous Computing

Careful placement of a computational application within a target device cluster is critical for achieving low application completion time. The problem is challenging due to its NP-hardness and combinatorial nature. In recent years, learning-based approaches have been proposed to learn a placement policy that can be applied to unseen applications, motivated by the problem of placing a neural network across cloud servers. These approaches, however, generally assume the device cluster is fixed, which is not the case in mobile or edge computing settings, where heterogeneous devices move in and out of range for a particular application. We propose a new learning approach called GiPH, which learns policies that generalize to dynamic device clusters via 1) a novel graph representation gpNet that efficiently encodes the information needed for choosing a good placement, and 2) a scalable graph neural network (GNN) that learns a summary of the gpNet information. GiPH turns the placement problem into that of finding a sequence of placement improvements, learning a policy for selecting this sequence that scales to problems of arbitrary size. We evaluate GiPH with a wide range of task graphs and device clusters and show that our learned policy rapidly find good placements for new problem instances. GiPH finds placements with up to 30.5% lower completion times, searching up to 3X faster than other search-based placement policies.

cs.LG↗
arXiv2023

Not All Pixels Are Equal: Learning Pixel Hardness for Semantic Segmentation

Semantic segmentation has recently witnessed great progress. Despite the impressive overall results, the segmentation performance in some hard areas (e.g., small objects or thin parts) is still not promising. A straightforward solution is hard sample mining, which is widely used in object detection. Yet, most existing hard pixel mining strategies for semantic segmentation often rely on pixel's loss value, which tends to decrease during training. Intuitively, the pixel hardness for segmentation mainly depends on image structure and is expected to be stable. In this paper, we propose to learn pixel hardness for semantic segmentation, leveraging hardness information contained in global and historical loss values. More precisely, we add a gradient-independent branch for learning a hardness level (HL) map by maximizing hardness-weighted segmentation loss, which is minimized for the segmentation head. This encourages large hardness values in difficult areas, leading to appropriate and stable HL map. Despite its simplicity, the proposed method can be applied to most segmentation methods with no and marginal extra cost during inference and training, respectively. Without bells and whistles, the proposed method achieves consistent/significant improvement (1.37% mIoU on average) over most popular semantic segmentation methods on Cityscapes dataset, and demonstrates good generalization ability across domains. The source codes are available at https://github.com/Menoly-xin/Hardness-Level-Learning .

cs.CV↗
arXiv2023

Solving Graph Problems Using Gaussian Boson Sampling

Gaussian boson sampling (GBS) is not only a feasible protocol for demonstrating quantum computational advantage, but also mathematically associated with certain graph-related and quantum chemistry problems. In particular, it is proposed that the generated samples from the GBS could be harnessed to enhance the classical stochastic algorithms in searching some graph features. Here, we use Jiuzhang, a noisy intermediate-scale quantum computer, to solve graph problems. The samples are generated from a 144-mode fully-connected photonic processor, with photon-click up to 80 in the quantum computational advantage regime. We investigate the open question of whether the GBS enhancement over the classical stochastic algorithms persists -- and how it scales -- with an increasing system size on noisy quantum devices in the computationally interesting regime. We experimentally observe the presence of GBS enhancement with large photon-click number and a robustness of the enhancement under certain noise. Our work is a step toward testing real-world problems using the existing noisy intermediate-scale quantum computers, and hopes to stimulate the development of more efficient classical and quantum-inspired algorithms.

quant-ph↗
arXiv2023

Machine learning-based seeing estimation and prediction using multi-layer meteorological data at Dome A, Antarctica

Atmospheric seeing is one of the most important parameters for evaluating and monitoring an astronomical site. Moreover, being able to predict the seeing in advance can guide observing decisions and significantly improve the efficiency of telescopes. However, it is not always easy to obtain long-term and continuous seeing measurements from a standard instrument such as differential image motion monitor (DIMM), especially for those unattended observatories with challenging environments such as Dome A, Antarctica. In this paper, we present a novel machine learning-based framework for estimating and predicting seeing at a height of 8 m at Dome A, Antarctica, using only the data from a multi-layer automated weather station (AWS). In comparison with DIMM data, our estimate has a root mean square error (RMSE) of 0.18 arcsec, and the RMSE of predictions 20 minutes in the future is 0.12 arcsec for the seeing range from 0 to 2.2 arcsec. Compared with the persistence, where the forecast is the same as the last data point, our framework reduces the RMSE by 37 percent. Our method predicts the seeing within a second of computing time, making it suitable for real-time telescope scheduling.

astro-ph.IM↗
arXiv2023

A Modified Sequence-to-point HVAC Load Disaggregation Algorithm

This paper presents a modified sequence-to-point (S2P) algorithm for disaggregating the heat, ventilation, and air conditioning (HVAC) load from the total building electricity consumption. The original S2P model is convolutional neural network (CNN) based, which uses load profiles as inputs. We propose three modifications. First, the input convolution layer is changed from 1D to 2D so that normalized temperature profiles are also used as inputs to the S2P model. Second, a drop-out layer is added to improve adaptability and generalizability so that the model trained in one area can be transferred to other geographical areas without labelled HVAC data. Third, a fine-tuning process is proposed for areas with a small amount of labelled HVAC data so that the pre-trained S2P model can be fine-tuned to achieve higher disaggregation accuracy (i.e., better transferability) in other areas. The model is first trained and tested using smart meter and sub-metered HVAC data collected in Austin, Texas. Then, the trained model is tested on two other areas: Boulder, Colorado and San Diego, California. Simulation results show that the proposed modified S2P algorithm outperforms the original S2P model and the support-vector machine based approach in accuracy, adaptability, and transferability.

eess.SY↗
arXiv2023

Data Release of the AST3-2 Automatic Survey from Dome A, Antarctica

AST3-2 is the second of the three Antarctic Survey Telescopes, aimed at wide-field time-domain optical astronomy. It is located at Dome A, Antarctica, which is by many measures the best optical astronomy site on the Earth's surface. Here we present the data from the AST3-2 automatic survey in 2016 and the photometry results. The median 5$σ$ limiting magnitude in $i$-band is 17.8 mag and the light curve precision is 4 mmag for bright stars. The data release includes photometry for over 7~million stars, from which over 3,500 variable stars were detected, with 70 of them newly discovered. We classify these new variables into different types by combining their light curve features with stellar properties from surveys such as StarHorse.

astro-ph.SR↗
arXiv2023

A Multilevel Scheduling Framework for Distributed Time-domain Large-area Sky Survey Telescope Array

Telescope arrays are receiving increasing attention due to their promise of higher resource utilization, greater sky survey area, and higher frequency of full space-time monitoring than single telescopes. Compared with the ordinary coordinated operation of several telescopes, the new astronomical observation mode has an order of magnitude difference in the number of telescopes. It requires efficient coordinated observation by large-domain telescopes distributed at different sites. Coherent modeling of various abstract environmental constraints is essential for responding to multiple complex science goals. Also, due to competing science priorities and field visibility, how the telescope arrays are scheduled for observations can significantly affect observation efficiency. This paper proposes a multilevel scheduling model oriented toward the problem of telescope-array scheduling for time-domain surveys. A flexible framework is developed with basic functionality encapsulated in software components implemented on hierarchical architectures. An optimization metric is proposed to self-consistently weight contributions from time-varying observation conditions to maintain uniform coverage and efficient time utilization from a global perspective. The performance of the scheduler is evaluated through simulated instances. The experimental results show that our scheduling framework performs correctly and provides acceptable solutions considering the percentage of time allocation efficiency and sky coverage uniformity in a feasible amount of time. Using a generic version of the telescope-array scheduling framework, we also demonstrate its scalability and its potential to be applied to other astronomical applications.

astro-ph.IM↗
arXiv2022

Load Profile Inpainting for Missing Load Data Restoration and Baseline Estimation

This paper introduces a Generative Adversarial Nets (GAN) based, Load Profile Inpainting Network (Load-PIN) for restoring missing load data segments and estimating the baseline for a demand response event. The inputs are time series load data before and after the inpainting period together with explanatory variables (e.g., weather data). We propose a Generator structure consisting of a coarse network and a fine-tuning network. The coarse network provides an initial estimation of the data segment in the inpainting period. The fine-tuning network consists of self-attention blocks and gated convolution layers for adjusting the initial estimations. Loss functions are specially designed for the fine-tuning and the discriminator networks to enhance both the point-to-point accuracy and realisticness of the results. We test the Load-PIN on three real-world data sets for two applications: patching missing data and deriving baselines of conservation voltage reduction (CVR) events. We benchmark the performance of Load-PIN with five existing deep-learning methods. Our simulation results show that, compared with the state-of-the-art methods, Load-PIN can handle varying-length missing data events and achieve 15-30% accuracy improvement.

eess.SP↗
arXiv2022

CSSAM:Code Search via Attention Matching of Code Semantics and Structures

Despite the continuous efforts in improving both the effectiveness and efficiency of code search, two issues remained unsolved. First, programming languages have inherent strong structural linkages, and feature mining of code as text form would omit the structural information contained inside it. Second, there is a potential semantic relationship between code and query, it is challenging to align code and text across sequences so that vectors are spatially consistent during similarity matching. To tackle both issues, in this paper, a code search model named CSSAM (Code Semantics and Structures Attention Matching) is proposed. By introducing semantic and structural matching mechanisms, CSSAM effectively extracts and fuses multidimensional code features. Specifically, the cross and residual layer was developed to facilitate high-latitude spatial alignment of code and query at the token level. By leveraging the residual interaction, a matching module is designed to preserve more code semantics and descriptive features, that enhances the adhesion between the code and its corresponding query text. Besides, to improve the model's comprehension of the code's inherent structure, a code representation structure named CSRG (Code Semantic Representation Graph) is proposed for jointly representing abstract syntax tree nodes and the data flow of the codes. According to the experimental results on two publicly available datasets containing 540k and 330k code segments, CSSAM significantly outperforms the baselines in terms of achieving the highest SR@1/5/10, MRR, and NDCG@50 on both datasets respectively. Moreover, the ablation study is conducted to quantitatively measure the impact of each key component of CSSAM on the efficiency and effectiveness of code search, which offers the insights into the improvement of advanced code search solutions.

cs.SE↗
arXiv2022

Resolution of Singularities in Arbitrary Characteristic

Let $X$ be an integral affine or projective scheme of finite presentation over a perfect field. We prove that $X$ admits a resolution, that is, there exists a smooth scheme $\widetilde X$ and a projective birational morphism from $\widetilde X$ onto $X$.

math.AG↗
arXiv2022

Equilibrium Fluctuations in Mean-field Disordered Models

Mean-field models of glasses that present a random first order transition exhibit highly non-trivial fluctuations. Building on previous studies that focused on the critical scaling regime, we here obtain a fully quantitative framework for all equilibrium conditions. By means of the replica method we evaluate Gaussian fluctuations of the overlaps around the thermodynamic limit, decomposing them in thermal fluctuations inside each state and heterogeneous fluctuations between different states. We first test and compare our analytical results with numerical simulation results for the p-spin spherical model and the random orthogonal model, and then analyze the random Lorentz gas. In all cases, a strong quantitative agreement is obtained. Our analysis thus provides a robust scheme for identifying the key finite-size (or finite-dimensional) corrections to the mean-field treatment of these paradigmatic glass models.

cond-mat.dis-nn↗
arXiv2022

Grassmannians and Singularities

Let $X$ be an integral scheme of finite presentation over a perfect field. Let $q$ be a singular closed point of $X$. We prove that there exists an open subset $V$ of $X$ containing $q$ such that $V$ admits a resolution, that is, there exists a smooth scheme $\widetilde V$ and a proper birational morphism from $\widetilde V$ onto $V$.

math.AG↗
arXiv2022

Local dynamical heterogeneity in glass formers

We study the local dynamical fluctuations in glass-forming models of particles embedded in $d$-dimensional space, in the mean-field limit of $d\to\infty$. Our analytical calculation reveals that single-particle observables, such as squared particle displacements, display divergent fluctuations around the dynamical (or mode-coupling) transition, due to the emergence of nontrivial correlations between displacements along different directions. This effect notably gives rise to a divergent non-Gaussian parameter, $α_2$. The $d\to\infty$ local dynamics therefore becomes quite rich upon approaching the glass transition. The finite-$d$ remnant of this phenomenon further provides a long sought-after, first-principle explanation for the growth of $α_2$ around the glass transition that is \emph{not based on multi-particle correlations}.

cond-mat.dis-nn↗
arXiv2021

On the nature of valence charge and spin excitations via multi-orbital Hubbard models for infinite-layer nickelates

Building upon the recent progress on the intriguing underlying physics for the newly discovered infinite-layer nickelates, in this article we review an examination of valence charge and spin excitations via multi-orbital Hubbard models as way to determine the fundamental building blocks for Hamiltonians that can describe the low energy properties of infinite-layer nickelates. We summarize key results from density-functional approaches, and apply them to the study of x-ray absorption to determine the valence ground states of infinite-layer nickelates in their parent form, and show that a fundamental $d^9$ configuration as in the cuprates is incompatible with a self-doped ground state having holes in both $d_{x^2-y^2}$ and a rare-earth-derived axial orbital. When doped, we determine that the rare-earth-derived orbitals empty and additional holes form low spin $(S=0)$ $d^8$ Ni states, which can be well-described as a doped single-band Hubbard model. Using exact diagonalization for a 2-orbital model involving Ni and rare earth orbitals, we find clear magnons at 1/2 filling that persist when doped, albeit with larger damping, and with a dependence on the precise orbital energy separation between the Ni- and rare-earth-derived orbitals. Taken together, a full two-band model for infinite-layer nickelates can well describe the valence charge and spin excitations observed experimentally.

cond-mat.supr-con↗
arXiv2021

The dimensional evolution of structure and dynamics in hard sphere liquids

The formulation of the mean-field, infinite-dimensional solution of hard sphere glasses is a significant milestone for theoretical physics. How relevant this description might be for understanding low-dimensional glass-forming liquids, however, remains unclear. These liquids indeed exhibit a complex interplay between structure and dynamics, and the importance of this interplay might only slowly diminish as dimension $d$ increases. A careful numerical assessment of the matter has long been hindered by the exponential increase of computational costs with $d$. By revisiting a once common simulation technique involving the use of periodic boundary conditions modeled on $D_d$ lattices, we here partly sidestep this difficulty, thus allowing the study of hard sphere liquids up to $d=13$. Parallel efforts by Mangeat and Zamponi [Phys. Rev. E 93, 012609 (2016)] have expanded the mean-field description of glasses to finite $d$ by leveraging standard liquid-state theory, and thus help bridge the gap from the other direction. The relatively smooth evolution of both structure and dynamics across the $d$ gap allows us to relate the two approaches, and to identify some of the missing features that a finite-$d$ theory of glasses might hope to include to achieve near quantitative agreement.

cond-mat.stat-mech↗
arXiv2021

Discriminator-Free Generative Adversarial Attack

The Deep Neural Networks are vulnerable toadversarial exam-ples(Figure 1), making the DNNs-based systems collapsed byadding the inconspicuous perturbations to the images. Most of the existing works for adversarial attack are gradient-based and suf-fer from the latency efficiencies and the load on GPU memory. Thegenerative-based adversarial attacks can get rid of this limitation,and some relative works propose the approaches based on GAN.However, suffering from the difficulty of the convergence of train-ing a GAN, the adversarial examples have either bad attack abilityor bad visual quality. In this work, we find that the discriminatorcould be not necessary for generative-based adversarial attack, andpropose theSymmetric Saliency-based Auto-Encoder (SSAE)to generate the perturbations, which is composed of the saliencymap module and the angle-norm disentanglement of the featuresmodule. The advantage of our proposed method lies in that it is notdepending on discriminator, and uses the generative saliency map to pay more attention to label-relevant regions. The extensive exper-iments among the various tasks, datasets, and models demonstratethat the adversarial examples generated by SSAE not only make thewidely-used models collapse, but also achieves good visual quality.The code is available at https://github.com/BravoLu/SSAE.

cs.CV↗
arXiv2021

Universal Upper Bound on The Blowup Rate of Nonlinear Schrödinger Equation with Rotation

In this paper, we prove a universal upper bound on the blowup rate of a focusing nonlinear Schrödinger equation with an angular momentum under a trapping harmonic potential, assuming that the initial data is radially symmetric in the weighted Sobolev space. The nonlinearity is in the mass supercritical and energy subcritical regime. Numerical simulations are also presented.

math.AP↗