arXiv subjects

Jianwei Huang

Publications and source records attributed to Jianwei Huang.

At least 73 records · Page 4Linked to original sources

arXiv2022

Nonsymmorphic Symmetry-Protected Band Crossings in a Square-Net Metal PtPb$_4$

Topological semimetals with symmetry-protected band crossings have emerged as a rich landscape to explore intriguing electronic phenomena. Nonsymmorphic symmetries in particular have been shown to play an important role in protecting the crossings along a line (rather than a point) in momentum space. Here we report experimental and theoretical evidence for Dirac nodal line crossings along the Brillouin zone boundaries in PtPb$_4$, arising from the nonsymmorphic symmetry of its crystal structure. Interestingly, while the nodal lines would remain gapless in the absence of spin-orbit coupling (SOC), the SOC in this case plays a detrimental role to topology by lifting the band degeneracy everywhere except at a set of isolated points. Nevertheless, the nodal line is observed to have a bandwidth much smaller than that found in density functional theory (DFT). Our findings reveal PtPb$_4$ to be a material system with narrow crossings approximately protected by non-symmorhpic crystalline symmetries.

cond-mat.mtrl-sci↗

arXiv2021

Socially-Optimal Mechanism Design for Incentivized Online Learning

Multi-arm bandit (MAB) is a classic online learning framework that studies the sequential decision-making in an uncertain environment. The MAB framework, however, overlooks the scenario where the decision-maker cannot take actions (e.g., pulling arms) directly. It is a practically important scenario in many applications such as spectrum sharing, crowdsensing, and edge computing. In these applications, the decision-maker would incentivize other selfish agents to carry out desired actions (i.e., pulling arms on the decision-maker's behalf). This paper establishes the incentivized online learning (IOL) framework for this scenario. The key challenge to design the IOL framework lies in the tight coupling of the unknown environment learning and asymmetric information revelation. To address this, we construct a special Lagrangian function based on which we propose a socially-optimal mechanism for the IOL framework. Our mechanism satisfies various desirable properties such as agent fairness, incentive compatibility, and voluntary participation. It achieves the same asymptotic performance as the state-of-art benchmark that requires extra information. Our analysis also unveils the power of crowd in the IOL framework: a larger agent crowd enables our mechanism to approach more closely the theoretical upper bound of social performance. Numerical results demonstrate the advantages of our mechanism in large-scale edge computing.

cs.GT↗

arXiv2021

Tackling System and Statistical Heterogeneity for Federated Learning with Adaptive Client Sampling

Federated learning (FL) algorithms usually sample a fraction of clients in each round (partial participation) when the number of participants is large and the server's communication bandwidth is limited. Recent works on the convergence analysis of FL have focused on unbiased client sampling, e.g., sampling uniformly at random, which suffers from slow wall-clock time for convergence due to high degrees of system heterogeneity and statistical heterogeneity. This paper aims to design an adaptive client sampling algorithm that tackles both system and statistical heterogeneity to minimize the wall-clock convergence time. We obtain a new tractable convergence bound for FL algorithms with arbitrary client sampling probabilities. Based on the bound, we analytically establish the relationship between the total learning time and sampling probabilities, which results in a non-convex optimization problem for training time minimization. We design an efficient algorithm for learning the unknown parameters in the convergence bound and develop a low-complexity algorithm to approximately solve the non-convex problem. Experimental results from both hardware prototype and simulation demonstrate that our proposed sampling scheme significantly reduces the convergence time compared to several baseline sampling schemes. Notably, our scheme in hardware prototype spends 73% less time than the uniform sampling baseline for reaching the same target loss.

cs.LG↗

arXiv2021

Time-of-use Pricing for Energy Storage Investment

Time-of-use (ToU) pricing is widely used by the electricity utility to shave peak load. Such a pricing scheme provides users with incentives to invest in behind-the-meter energy storage and to shift peak load towards low-price intervals. However, without considering the implication on energy storage investment, an improperly designed ToU pricing scheme may lead to significant welfare loss, especially when users over-invest the storage, which leads to new energy consumption peaks. In this paper, we will study how to design a social-optimum ToU pricing scheme by explicitly considering its impact on storage investment. We model the interactions between the utility and users as a two-stage optimization problem. To resolve the challenge of asymmetric information due to users' private storage cost, we propose a ToU pricing scheme based on different storage types and the aggregate demand per type. Each user does not need to reveal his private cost information. We can further compute the optimal ToU pricing with only a linear complexity. Simulations based on real-world data show that the suboptimality gap of our proposed ToU pricing, compared with the social optimum achieved under complete information, is less than 5%.

eess.SY↗

arXiv2021

Virtual Energy Storage Sharing and Capacity Allocation

Energy storage can play an important role in energy management of end users. To promote an efficient utilization of energy storage, we develop a novel business model to enable virtual storage sharing among a group of users. Specifically, a storage aggregator invests and operates the central physical storage unit, by virtualizing it into separable virtual capacities and selling to users. Each user purchases the virtual capacity, and utilize it to reduce the energy cost. We formulate the interaction between the aggregator and users as a two-stage optimization problem. In Stage 1, over the investment horizon, the aggregator determines the investment and pricing decisions. In Stage 2, in each operational horizon, each user decides the virtual capacity to purchase together with the operation of the virtual storage. We characterize a stepwise form of the optimal solution of Stage-2 Problem and a piecewise linear structure of the optimal profit of Stage-1 Problem, both with respect to the virtual capacity price. Based on the solution structure, we design an algorithm to attain the optimal solution of the two-stage problem. In our simulation results, the proposed storage virtualization model can reduce the physical energy storage investment of the aggregator by 54.3% and reduce the users' total costs by 34.7%, compared to the case where users acquire their own physical storage.

eess.SY↗

arXiv2021

Cost-Effective Federated Learning in Mobile Edge Networks

Federated learning (FL) is a distributed learning paradigm that enables a large number of mobile devices to collaboratively learn a model under the coordination of a central server without sharing their raw data. Despite its practical efficiency and effectiveness, the iterative on-device learning process (e.g., local computations and global communications with the server) incurs a considerable cost in terms of learning time and energy consumption, which depends crucially on the number of selected clients and the number of local iterations in each training round. In this paper, we analyze how to design adaptive FL in mobile edge networks that optimally chooses these essential control variables to minimize the total cost while ensuring convergence. We establish the analytical relationship between the total cost and the control variables with the convergence upper bound. To efficiently solve the cost minimization problem, we develop a low-cost sampling-based algorithm to learn the convergence related unknown parameters. We derive important solution properties that effectively identify the design principles for different optimization metrics. Practically, we evaluate our theoretical results both in a simulated environment and on a hardware prototype. Experimental evidence verifies our derived properties and demonstrates that our proposed solution achieves near-optimal performance for different optimization metrics for various datasets and heterogeneous system and statistical settings.

cs.LG↗

arXiv2021

Optimal UAV Hitching on Ground Vehicles

Due to its mobility and agility, unmanned aerial vehicle (UAV) has emerged as a promising technology for various tasks, such as sensing, inspection and delivery. However, a typical UAV has limited energy storage and cannot fly a long distance without being recharged. This motivates several existing proposals to use trucks and other ground vehicles to offer riding to help UAVs save energy and expand the operation radius. We present the first theoretical study regarding how UAVs should optimally hitch on ground vehicles, considering vehicles' different travelling patterns and supporting capabilities. For a single UAV, we derive closed-form optimal vehicle selection and hitching strategy. When vehicles only support hitching, a UAV would prefer the vehicle that can carry it closest to its final destination. When vehicles can offer hitching plus charging, the UAV may hitch on a vehicle that carries it farther away from its destination and hitch a longer distance. The UAV may also prefer to hitch on a slower vehicle for the benefit of battery recharging. For multiple UAVs in need of hitching, we develop the max-saving algorithm (MSA) to optimally match UAV-vehicle collaboration. We prove that the MSA globally optimizes the total hitching benefits for the UAVs.

cs.NI↗

arXiv2021

An Incentive Mechanism for Sustainable Blockchain Storage

Miners in a blockchain system are suffering from ever-increasing storage costs, which in general have not been properly compensated by the users' transaction fees. This reduces the incentives for the miners' participation and may jeopardize the blockchain security. We propose to mitigate this blockchain insufficient fee issue through a Fee and Waiting Tax (FWT) mechanism, which explicitly considers the two types of negative externalities in the system. Specifically, we model the interactions between the protocol designer, users, and miners as a three-stage Stackelberg game. By characterizing the equilibrium of the game, we find that miners neglecting the negative externality in transaction selection cause they are willing to accept insufficient-fee transactions. This leads to the insufficient storage fee issue in the existing protocol. Moreover, our proposed optimal FWT mechanism can motivate users to pay sufficient transaction fees to cover the storage costs and achieve the unconstrained social optimum. Numerical results show that the optimal FWT mechanism guarantees sufficient transaction fees and achieves an average social welfare improvement of 33.73\% or more over the existing protocol. Furthermore, the optimal FWT mechanism achieves the maximum fairness index and performs well even under heterogeneous-storage-cost miners.

cs.GT↗

arXiv2021

The Privacy Paradox and Optimal Bias-Variance Trade-offs in Data Acquisition

While users claim to be concerned about privacy, often they do little to protect their privacy in their online actions. One prominent explanation for this "privacy paradox" is that when an individual shares her data, it is not just her privacy that is compromised; the privacy of other individuals with correlated data is also compromised. This information leakage encourages oversharing of data and significantly impacts the incentives of individuals in online platforms. In this paper, we study the design of mechanisms for data acquisition in settings with information leakage and verifiable data. We design an incentive compatible mechanism that optimizes the worst-case trade-off between bias and variance of the estimation subject to a budget constraint, where the worst-case is over the unknown correlation between costs and data. Additionally, we characterize the structure of the optimal mechanism in closed form and study monotonicity and non-monotonicity properties of the marketplace.

cs.SI↗

arXiv2021

Room-Temperature Topological Phase Transition in Quasi-One-Dimensional Material Bi$_4$I$_4$

Quasi-one-dimensional (1D) materials provide a superior platform for characterizing and tuning topological phases for two reasons: i) existence for multiple cleavable surfaces that enables better experimental identification of topological classification, and ii) stronger response to perturbations such as strain for tuning topological phases compared to higher dimensional crystal structures. In this paper, we present experimental evidence for a room-temperature topological phase transition in the quasi-1D material Bi$_4$I$_4$, mediated via a first order structural transition between two distinct stacking orders of the weakly-coupled chains. Using high resolution angle-resolved photoemission spectroscopy on the two natural cleavable surfaces, we identify the high temperature $β$ phase to be the first weak topological insulator with gapless Dirac cones on the (100) surface and no Dirac crossing on the (001) surface, while in the low temperature $α$ phase, the topological surface state on the (100) surface opens a gap, consistent with a recent theoretical prediction of a higher-order topological insulator beyond the scope of the established topological materials databases that hosts gapless hinge states. Our results not only identify a rare topological phase transition between first-order and second-order topological insulators but also establish a novel quasi-1D material platform for exploring unprecedented physics.

cond-mat.mtrl-sci↗

arXiv2021

Pricing Fresh Data

We introduce the concept of {\it fresh data trading}, in which a destination user requests, and pays for, fresh data updates from a source provider, and data freshness is captured by the {\it age of information} (AoI) metric. Keeping data fresh relies on frequent data updates by the source, which motivates the source to {\it price fresh data}. In this work, the destination incurs an age-related cost, modeled as a general increasing function of the AoI. The source designs a pricing mechanism to maximize its profit; the destination chooses a data update schedule to trade off its payments to the source and its age-related cost. Depending on different real-time applications and scenarios, we study both a predictable-deadline and an unpredictable-deadline models. The key challenge of designing the optimal pricing scheme lies in the destination's time-interdependent valuations, due to the nature of AoI and the infinite-dimensional and dynamic optimization. To this end, we consider three pricing schemes that exploit and understand the profitability of three different dimensions in designing pricing: a {\it time-dependent} pricing scheme, in which the price for each update depends on when it is requested; a {\it quantity-based} pricing scheme, in which the price of each update depends on how many updates have been previously requested; a {\it subscription-based} pricing scheme, in which the price for each update is flat-rate but the source charges an additional subscription fee. Our analysis reveals that the optimal subscription-based pricing maximizes the source's profit among all possible pricing schemes under both predictable deadline and unpredictable deadline models; the optimal quantity-based pricing scheme is only optimal with a predictable deadline; the time-dependent pricing scheme, under the unpredictable deadline, is asymptotically optimal under significant time discounting.

cs.NI↗

arXiv2021

Electronic Structure Examination on the Topological Properties of CaMnSb$_{2}$ by Angle-Resolved Photoemission Spectroscopy

We have carried out detailed high resolution ARPES measurements and band structure calculations to study the electronic structure of CaMnSb$_{2}$. The observed Fermi surface mainly consists of one hole pocket around $Γ$ point and one tiny hole pocket at Y point. Strong spectral weight accumulation along the $Γ$-X direction is observed on the hole-like Fermi surface around $Γ$ point, suggesting strong anisotropy of the density of states along the Fermi surface. The tiny hole pocket at Y point originates from an anisotropic Dirac-like band with the crossing point of the linear bands lying $\sim$ 10 meV above the Fermi level. These observations are in a good agreement with the band structure calculations. In addition, we observe additional features along the $Γ$-Y line that cannot be accounted for by the band structure calculations. Our results provide important information in understanding and exploration of novel properties in CaMnSb$_{2}$ and related materials.

cond-mat.mtrl-sci↗

arXiv2021

Common ($π$,$π$) Band Folding and Surface Reconstruction in FeAs-Based Superconductors

High resolution angle-resolved photoemission spectroscopy (ARPES) measurements are carried out on CaKFe$_4$As$_4$, KCa$_2$Fe$_4$As$_4$F$_2$ and (Ba$_{0.6}$K$_{0.4}$)Fe$_2$As$_2$ superconductors. Clear evidence of band folding between the Brillouin zone center and corners with a ($π$,$π$) wave vector has been found from the measured Fermi surface and band structures in all the three kinds of superconductors. A dominant $\sqrt{2}\,\times\,\sqrt{2}$ surface reconstruction is observed on the cleaved surface of CaKFe$_4$As$_4$ by scanning tunneling microscopy (STM) measurements. We propose that the commonly observed $\sqrt{2}\,\times\,\sqrt{2}$ reconstruction in the FeAs-based superconductors provides a general scenario to understand the origin of the ($π$,$π$) band folding. Our observations provide new insights in understanding the electronic structure and superconductivity mechanism in iron-based superconductors.

cond-mat.supr-con↗

arXiv2021

Strategic Information Revelation in Crowdsourcing Systems Without Verification

We study a crowdsourcing problem where the platform aims to incentivize distributed workers to provide high quality and truthful solutions without the ability to verify the solutions. While most prior work assumes that the platform and workers have symmetric information, we study an asymmetric information scenario where the platform has informational advantages. Specifically, the platform knows more information regarding worker average solution accuracy, and can strategically reveal such information to workers. Workers will utilize the announced information to determine the likelihood that they obtain a reward if exerting effort on the task. We study two types of workers, naive workers who fully trust the announcement, and strategic workers who update prior belief based on the announcement. For naive workers, we show that the platform should always announce a high average accuracy to maximize its payoff. However, this is not always optimal for strategic workers, as it may reduce the credibility of the platform announcement and hence reduce the platform payoff. Interestingly, the platform may have an incentive to even announce an average accuracy lower than the actual value when facing strategic workers. Another counterintuitive result is that the platform payoff may decrease in the number of high accuracy workers.

cs.GT↗

arXiv2021

Genuine Electronic Structure and Superconducting Gap Structure in (Ba$_{0.6}$K$_{0.4}$)Fe$_{2}$As$_{2}$ Superconductor

The electronic structure and superconducting gap structure are prerequisites to establish microscopic theories in understanding the superconductivity mechanism of iron-based superconductors. However, even for the most extensively studied optimally-doped (Ba$_{0.6}$K$_{0.4}$)Fe$_2$As$_2$, there remain outstanding controversies on its electronic structure and superconducting gap structure. Here we resolve these issues by carrying out high-resolution angle-resolved photoemission spectroscopy (ARPES) measurements on the optimally-doped (Ba$_{0.6}$K$_{0.4}$)Fe$_2$As$_2$ superconductor using both Helium lamp and laser light sources. Our results indicate the "flat band" feature observed around the Brillouin zone center in the superconducting state originates from the combined effect of the superconductivity-induced band back-bending and the folding of a band from the zone corner to the center. We found direct evidence of the band folding between the zone corner and the center in both the normal and superconducting state. Our resolution of the origin of the flat band makes it possible to assign the three hole-like bands around the zone center and determine their superconducting gap correctly. Around the zone corner, we observe a tiny electron-like band and an M-shaped band simultaneously in both the normal and superconducting states. The obtained gap size for the bands around the zone corner ($\sim$5.5 meV) is significantly smaller than all the previous ARPES measurements. Our results establish a new superconducting gap structure around the zone corner and resolve a number of prominent controversies concerning the electronic structure and superconducting gap structure in the optimally-doped (Ba$_{0.6}$K$_{0.4}$)Fe$_2$As$_2$. They provide new insights in examining and establishing theories in understanding superconductivity mechanism in iron-based superconductors.

cond-mat.supr-con↗

arXiv2021

Federated Few-Shot Learning with Adversarial Learning

We are interested in developing a unified machine learning model over many mobile devices for practical learning tasks, where each device only has very few training data. This is a commonly encountered situation in mobile computing scenarios, where data is scarce and distributed while the tasks are distinct. In this paper, we propose a federated few-shot learning (FedFSL) framework to learn a few-shot classification model that can classify unseen data classes with only a few labeled samples. With the federated learning strategy, FedFSL can utilize many data sources while keeping data privacy and communication efficiency. There are two technical challenges: 1) directly using the existing federated learning approach may lead to misaligned decision boundaries produced by client models, and 2) constraining the decision boundaries to be similar over clients would overfit to training tasks but not adapt well to unseen tasks. To address these issues, we propose to regularize local updates by minimizing the divergence of client models. We also formulate the training in an adversarial fashion and optimize the client models to produce a discriminative feature space that can better represent unseen data samples. We demonstrate the intuitions and conduct experiments to show our approaches outperform baselines by more than 10% in learning vision tasks and 5% in language tasks.

cs.LG↗

arXiv2021

Reputation and Pricing Dynamics in Online Markets

We study the economic interactions among sellers and buyers in online markets. In such markets, buyers have limited information about the product quality, but can observe the sellers' reputations which depend on their past transaction histories and ratings from past buyers. Sellers compete in the same market through pricing, while considering the impact of their heterogeneous reputations. We consider sellers with limited as well as unlimited capacities, which correspond to different practical market scenarios. In the unlimited seller capacity scenario, buyers prefer the seller with the highest reputation-price ratio. If the gap between the highest and second highest seller reputation levels is large enough, then the highest reputation seller dominates the market as a monopoly. If sellers' reputation levels are relatively close to each other, then those sellers with relatively high reputations will survive at the equilibrium, while the remaining relatively low reputation sellers will get zero market share. In the limited seller capacity scenario, we further consider two different cases. If each seller can only serve one buyer, then it is possible for sellers to set their monopoly prices at the equilibrium while all sellers gain positive market shares; if each seller can serve multiple buyers, then it is possible for sellers to set maximum prices at the equilibrium. Simulation results show that the dynamics of reputations and prices in the longer-term interactions will converge to stable states, and the initial buyer ratings of the sellers play the critical role in determining sellers' reputations and prices at the stable state.

cs.GT↗

arXiv2021

Taming Time-Varying Information Asymmetry in Fresh Status Acquisition

Many online platforms are providing valuable real-time contents (e.g., traffic) by continuously acquiring the status of different Points of Interest (PoIs). In status acquisition, it is challenging to determine how frequently a PoI should upload its status to a platform, since they are self-interested with private and possibly time-varying preferences. This paper considers a general multi-period status acquisition system, aiming to maximize the aggregate social welfare and ensure the platform freshness. The freshness is measured by a metric termed age of information. For this goal, we devise a long-term decomposition (LtD) mechanism to resolve the time-varying information asymmetry. The key idea is to construct a virtual social welfare that only depends on the current private information, and then decompose the per-period operation into multiple distributed bidding problems for the PoIs and platforms. The LtD mechanism enables the platforms to achieve a tunable trade-off between payoff maximization and freshness conditions. Moreover, the LtD mechanism retains the same social performance compared to the benchmark with symmetric information and asymptotically ensures the platform freshness conditions. Numerical results based on real-world data show that when the platforms pay more attention to payoff maximization, each PoI still obtains a non-negative payoff in the long-term.

cs.GT↗