arXiv subjects

Zixuan Zhang

Publications and source records attributed to Zixuan Zhang.

53 records · Page 3Linked to original sources

arXiv2023

RESIN-EDITOR: A Schema-guided Hierarchical Event Graph Visualizer and Editor

In this paper, we present RESIN-EDITOR, an interactive event graph visualizer and editor designed for analyzing complex events. Our RESIN-EDITOR system allows users to render and freely edit hierarchical event graphs extracted from multimedia and multi-document news clusters with guidance from human-curated event schemas. RESIN-EDITOR's unique features include hierarchical graph visualization, comprehensive source tracing, and interactive user editing, which is more powerful and versatile than existing Information Extraction (IE) visualization tools. In our evaluation of RESIN-EDITOR, we demonstrate ways in which our tool is effective in understanding complex events and enhancing system performance. The source code, a video demonstration, and a live website for RESIN-EDITOR have been made publicly available.

cs.HC↗

arXiv2023

RigLSTM: Recurrent Independent Grid LSTM for Generalizable Sequence Learning

Sequential processes in real-world often carry a combination of simple subsystems that interact with each other in certain forms. Learning such a modular structure can often improve the robustness against environmental changes. In this paper, we propose recurrent independent Grid LSTM (RigLSTM), composed of a group of independent LSTM cells that cooperate with each other, for exploiting the underlying modular structure of the target task. Our model adopts cell selection, input feature selection, hidden state selection, and soft state updating to achieve a better generalization ability on the basis of the recent Grid LSTM for the tasks where some factors differ between training and evaluation. Specifically, at each time step, only a fraction of cells are activated, and the activated cells select relevant inputs and cells to communicate with. At the end of one time step, the hidden states of the activated cells are updated by considering the relevance between the inputs and the hidden states from the last and current time steps. Extensive experiments on diversified sequential modeling tasks are conducted to show the superior generalization ability when there exist changes in the testing environment. Source code is available at \url{https://github.com/ziyuwwang/rig-lstm}.

cs.LG↗

arXiv2023

Smoothening block rewards: How much should miners pay for mining pools?

The rewards a blockchain miner earns vary with time. Most of the time is spent mining without receiving any rewards, and only occasionally the miner wins a block and earns a reward. Mining pools smoothen the stochastic flow of rewards, and in the ideal case, provide a steady flow of rewards over time. Smooth block rewards allow miners to choose an optimal mining power growth strategy that will result in a higher reward yield for a given investment. We quantify the economic advantage for a given miner of having smooth rewards, and use this to define a maximum percentage of rewards that a miner should be willing to pay for the mining pool services.

cs.CR↗

arXiv2023

An Agent-Based Model Framework for Utility-Based Cryptoeconomies

In this paper, we outline a framework for modeling utility-based blockchain-enabled economic systems using Agent Based Modeling (ABM). Our approach is to model the supply dynamics based on metrics of the cryptoeconomy. We then build autonomous agents that make decisions based on those metrics. Those decisions, in turn, impact the metrics in the next time-step, creating a closed loop that models the evolution of cryptoeconomies over time. We apply this framework as a case-study to Filecoin, a decentralized blockchain-based storage network. We perform several experiments that explore the effect of different strategies, capitalization, and external factors to agent rewards, that highlight the efficacy of our approach to modeling blockchain based cryptoeconomies.

cs.CR↗

arXiv2023

Effective Minkowski Dimension of Deep Nonparametric Regression: Function Approximation and Statistical Theories

Existing theories on deep nonparametric regression have shown that when the input data lie on a low-dimensional manifold, deep neural networks can adapt to the intrinsic data structures. In real world applications, such an assumption of data lying exactly on a low dimensional manifold is stringent. This paper introduces a relaxed assumption that the input data are concentrated around a subset of $\mathbb{R}^d$ denoted by $\mathcal{S}$, and the intrinsic dimension of $\mathcal{S}$ can be characterized by a new complexity notation -- effective Minkowski dimension. We prove that, the sample complexity of deep nonparametric regression only depends on the effective Minkowski dimension of $\mathcal{S}$ denoted by $p$. We further illustrate our theoretical findings by considering nonparametric regression with an anisotropic Gaussian random design $N(0,Σ)$, where $Σ$ is full rank. When the eigenvalues of $Σ$ have an exponential or polynomial decay, the effective Minkowski dimension of such an Gaussian random design is $p=\mathcal{O}(\sqrt{\log n})$ or $p=\mathcal{O}(n^γ)$, respectively, where $n$ is the sample size and $γ\in(0,1)$ is a small constant depending on the polynomial decay rate. Our theory shows that, when the manifold assumption does not hold, deep neural networks can still adapt to the effective Minkowski dimension of the data, and circumvent the curse of the ambient dimensionality for moderate sample sizes.

cs.LG↗

arXiv2023

Ultra-low-loss optical interconnect enabled by topological unidirectional guided resonance

Grating couplers that interconnect photonic chips to off-chip components are of essential importance for various optoelectronics applications. Despite numerous efforts in past decades, existing grating couplers still suffer from poor energy efficiency and thus hinder photonic integration toward a larger scale. Here, we theoretically propose and experimentally demonstrate a method to achieve ultra-low-loss grating coupler by employing topological unidirectional guided resonances (UGRs). Leveraging the unidirectional emitting nature of UGRs, the useless downward radiation is greatly suppressed with no mirror placed on the bottom. By engineering the dispersion and apodizing the geometry of grating, we realize a grating coupler on 340 nm silicon-on-insulator platform with a record-low-loss of 0.34 dB and bandwidth exceeding 30 nm at the telecom wavelength of 1550 nm. We further show a pair of grating couplers works as optic via that interconnects two stacked photonic chips with a loss of only 0.94 dB. Our work sheds light on the feasibility of energy-efficient optical interconnect for silicon photonics, and paving the way to large-scale photonic integration for applications from optical communication to photonic computing.

physics.optics↗

arXiv2023

Rethinking Safe Control in the Presence of Self-Seeking Humans

Safe control methods are often intended to behave safely even in worst-case human uncertainties. However, humans may exploit such safety-first systems, which results in greater risk for everyone. Despite their significance, no prior work has investigated and accounted for such factors in safe control. In this paper, we leverage an interaction-based payoff structure from game theory to model humans' short-sighted, self-seeking behaviors and how humans change their strategies toward machines based on prior experience. We integrate such strategic human behaviors into a safe control architecture. As a result, our approach achieves better safety and performance trade-offs when compared to both deterministic worst-case safe control techniques and equilibrium-based stochastic methods. Our findings suggest an urgent need to fundamentally rethink the safe control framework used in human-technology interaction in pursuit of greater safety for all.

cs.HC↗

arXiv2023

Slow light silicon modulator beyond 110 GHz bandwidth

Silicon modulators are key components in silicon photonics to support the dense integration of electro-optic (EO) functional elements on a compact chip for various applications including high-speed data transmission, signal processing, and photonic computing. Despite numerous advances in promoting the operation speed of silicon modulators, a bandwidth ceiling of 67 GHz emerges in practices and becomes an obstacle to paving silicon photonics toward Tbps level data throughput on a single chip. Here, we theoretically propose and experimentally demonstrate a design strategy for silicon modulators by employing the slow light effect, which shatters the present bandwidth ceiling of silicon modulators and pushes its limit beyond 110 GHz in a small footprint. The proposed silicon modulator is built on a coupled-resonator optical waveguide (CROW) architecture, in which a set of Bragg gratings are appropriately cascaded to give rise to a slow light effect. By comprehensively balancing a series of merits including the group index, photon lifetime, electrical bandwidth, and losses, we found the modulators can benefit from the slow light for better modulation efficiency and compact size while remaining their bandwidth sufficiently high to support ultra-high-speed data transmission. Consequently, we realize a modulator with an EO bandwidth of 110 GHz in a length of 124 μm, and demonstrate a data rate beyond 110 Gbps by applying simple on-off keying modulation for a DSP-free operation. Our work proves that silicon modulators beyond 110 GHz are feasible, thus shedding light on the potentials of silicon photonics in ultra-high-bandwidth applications such as data communication, optical interconnection, and photonic machine learning.

physics.optics↗

arXiv2022

Language Model Pre-Training with Sparse Latent Typing

Modern large-scale Pre-trained Language Models (PLMs) have achieved tremendous success on a wide range of downstream tasks. However, most of the LM pre-training objectives only focus on text reconstruction, but have not sought to learn latent-level interpretable representations of sentences. In this paper, we manage to push the language models to obtain a deeper understanding of sentences by proposing a new pre-training objective, Sparse Latent Typing, which enables the model to sparsely extract sentence-level keywords with diverse latent types. Experimental results show that our model is able to learn interpretable latent type categories in a self-supervised manner without using any external knowledge. Besides, the language model pre-trained with such an objective also significantly improves Information Extraction related downstream tasks in both supervised and few-shot settings. Our code is publicly available at: https://github.com/renll/SparseLT.

cs.CL↗

arXiv2022

Federated Reinforcement Learning for Real-Time Electric Vehicle Charging and Discharging Control

With the recent advances in mobile energy storage technologies, electric vehicles (EVs) have become a crucial part of smart grids. When EVs participate in the demand response program, the charging cost can be significantly reduced by taking full advantage of the real-time pricing signals. However, many stochastic factors exist in the dynamic environment, bringing significant challenges to design an optimal charging/discharging control strategy. This paper develops an optimal EV charging/discharging control strategy for different EV users under dynamic environments to maximize EV users' benefits. We first formulate this problem as a Markov decision process (MDP). Then we consider EV users with different behaviors as agents in different environments. Furthermore, a horizontal federated reinforcement learning (HFRL)-based method is proposed to fit various users' behaviors and dynamic environments. This approach can learn an optimal charging/discharging control strategy without sharing users' profiles. Simulation results illustrate that the proposed real-time EV charging/discharging control strategy can perform well among various stochastic factors.

eess.SY↗

arXiv2022

Schema-Guided Event Graph Completion

We tackle a new task, event graph completion, which aims to predict missing event nodes for event graphs. Existing link prediction or graph completion methods have difficulty dealing with event graphs because they are usually designed for a single large graph such as a social network or a knowledge graph, rather than multiple small dynamic event graphs. Moreover, they can only predict missing edges rather than missing nodes. In this work, we propose to utilize event schema, a template that describes the stereotypical structure of event graphs, to address the above issues. Our schema-guided event graph completion approach first maps an instance event graph to a subgraph of the schema graph by a heuristic subgraph matching algorithm. Then it predicts whether a candidate event node in the schema graph should be added to the instantiated schema subgraph by characterizing two types of local topology of the schema graph: neighbors of the candidate node and the subgraph, and paths that connect the candidate node and the subgraph. These two modules are later combined together for the final prediction. We also propose a self-supervised strategy to construct training samples, as well as an inference algorithm that is specifically designed to complete event graphs. Extensive experimental results on four datasets demonstrate that our proposed method achieves state-of-the-art performance, with 4.3% to 19.4% absolute F1 gains over the best baseline method on the four datasets.

cs.LG↗

arXiv2022

Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning

In today's economy, it becomes important for Internet platforms to consider the sequential information design problem to align its long term interest with incentives of the gig service providers. This paper proposes a novel model of sequential information design, namely the Markov persuasion processes (MPPs), where a sender, with informational advantage, seeks to persuade a stream of myopic receivers to take actions that maximizes the sender's cumulative utilities in a finite horizon Markovian environment with varying prior and utility functions. Planning in MPPs thus faces the unique challenge in finding a signaling policy that is simultaneously persuasive to the myopic receivers and inducing the optimal long-term cumulative utilities of the sender. Nevertheless, in the population level where the model is known, it turns out that we can efficiently determine the optimal (resp. $ε$-optimal) policy with finite (resp. infinite) states and outcomes, through a modified formulation of the Bellman equation. Our main technical contribution is to study the MPP under the online reinforcement learning (RL) setting, where the goal is to learn the optimal signaling policy by interacting with with the underlying MPP, without the knowledge of the sender's utility functions, prior distributions, and the Markov transition kernels. We design a provably efficient no-regret learning algorithm, the Optimism-Pessimism Principle for Persuasion Process (OP4), which features a novel combination of both optimism and pessimism principles. Our algorithm enjoys sample efficiency by achieving a sublinear $\sqrt{T}$-regret upper bound. Furthermore, both our algorithm and theory can be applied to MPPs with large space of outcomes and states via function approximation, and we showcase such a success under the linear setting.

cs.AI↗

arXiv2021

Deep image prior for undersampling high-speed photoacoustic microscopy

Photoacoustic microscopy (PAM) is an emerging imaging method combining light and sound. However, limited by the laser's repetition rate, state-of-the-art high-speed PAM technology often sacrifices spatial sampling density (i.e., undersampling) for increased imaging speed over a large field-of-view. Deep learning (DL) methods have recently been used to improve sparsely sampled PAM images; however, these methods often require time-consuming pre-training and large training dataset with ground truth. Here, we propose the use of deep image prior (DIP) to improve the image quality of undersampled PAM images. Unlike other DL approaches, DIP requires neither pre-training nor fully-sampled ground truth, enabling its flexible and fast implementation on various imaging targets. Our results have demonstrated substantial improvement in PAM images with as few as 1.4$\%$ of the fully sampled pixels on high-speed PAM. Our approach outperforms interpolation, is competitive with pre-trained supervised DL method, and is readily translated to other high-speed, undersampling imaging modalities.

eess.IV↗

arXiv2021

Observation of miniaturized bound states in the continuum with ultra-high quality factors

Light trapping is a constant pursuit in photonics because of its importance in science and technology. Many mechanisms have been explored, including the use of mirrors made of materials or structures that forbid outgoing waves, and bound states in the continuum that are mirror-less but based on topology. Here we report a compound method, combing mirrors and bound states in the continuum in an optimized way, to achieve a class of on-chip optical cavities that have high quality factors and small modal volumes. Specifically, light is trapped in the transverse direction by the photonic band gap of the lateral hetero-structure and confined in the vertical direction by the constellation of multiple bound states in the continuum. As a result, unlike most bound states in the continuum found in photonic crystal slabs that are de-localized Bloch modes, we achieve light-trapping in all three dimensions and experimentally demonstrate quality factors as high as $Q = 1.09 \times 10^6$ and modal volumes as low as $V = 3.56~ μm^3$ in the telecommunication regime. We further prove the robustness of our method through the statistical study of multiple fabricated devices. Our work provides a new method of light trapping, which can find potential applications in photonic integration, nonlinear optics and quantum computing.

physics.optics↗

arXiv2019

Learning Latent Process from High-Dimensional Event Sequences via Efficient Sampling

We target modeling latent dynamics in high-dimension marked event sequences without any prior knowledge about marker relations. Such problem has been rarely studied by previous works which would have fundamental difficulty to handle the arisen challenges: 1) the high-dimensional markers and unknown relation network among them pose intractable obstacles for modeling the latent dynamic process; 2) one observed event sequence may concurrently contain several different chains of interdependent events; 3) it is hard to well define the distance between two high-dimension event sequences. To these ends, in this paper, we propose a seminal adversarial imitation learning framework for high-dimension event sequence generation which could be decomposed into: 1) a latent structural intensity model that estimates the adjacent nodes without explicit networks and learns to capture the temporal dynamics in the latent space of markers over observed sequence; 2) an efficient random walk based generation model that aims at imitating the generation process of high-dimension event sequences from a bottom-up view; 3) a discriminator specified as a seq2seq network optimizing the rewards to help the generator output event sequences as real as possible. Experimental results on both synthetic and real-world datasets demonstrate that the proposed method could effectively detect the hidden network among markers and make decent prediction for future marked events, even when the number of markers scales to million level.

cs.LG↗

arXiv2019

Engineering Token Economy with System Modeling

Cryptocurrencies and blockchain networks have attracted tremendous attention from their volatile price movements and the promise of decentralization. However, most projects run on business narratives with no way to test and verify their assumptions and promises about the future. The complex nature of system dynamics within networked economies has rendered it difficult to reason about the growth and evolution of these networks. This paper drew concepts from differential games, classical control engineering, and stochastic dynamical system to come up with a framework and example to model, simulate, and engineer networked token economies. A model on a generalized token economy is proposed where miners provide service to a platform in exchange for a cryptocurrency and users consume service from the platform. Simulations of this model allow us to observe outcomes of complex dynamics and reason about the evolution of the system. Speculative price movements and engineered block rewards were then experimented to observe their impact on system dynamics and network-level goals. The model presented is necessarily limited so we conclude by exploring those limitations and outlining future research directions.

cs.MA↗

arXiv2018

A State-Space Modeling Framework for Engineering Blockchain-Enabled Economic Systems

Decentralized Ledger Technology, popularized by the Bitcoin network, aims to keep track of a ledger of valid transactions between agents of a virtual economy without a central institution for coordination. In order to keep track of a faithful and accurate list of transactions, the ledger is broadcast and replicated across machines in a peer-to-peer network. To enforce validity of transactions in the ledger (i.e., no negative balance or double spending), the network as a whole coordinates to accept or reject new transactions based on a set of rules aiming to detect and block operations of malicious agents (i.e., Byzantine attacks). Consensus protocols are particularly important to coordinate operation of the network, since they are used to reconcile potentially conflicting versions of the ledger. Regardless of architecture and consensus mechanism used, resulting economic networks remain largely similar, with economic agents driven by incentives under a set of rules. Due to the intense activity in this area, proper mathematical frameworks to model and analyze behavior of blockchain-enabled systems are essential. In this paper, we address this need and provide the following contributions: (i) we establish a formal framework, with tools from dynamical systems theory, to mathematically describe core concepts in blockchain-enabled networks, (ii) we apply this framework to the Bitcoin network and recover its key properties, and (iii) we connect our modeling framework with powerful tools from control engineering, such as Lyapunov-like functions, to properly engineer economic systems with provable properties. Apart from the aforementioned contributions, the mathematical framework herein proposed lays a foundation for engineering more general economic systems built on emerging Turing complete networks, such as the Ethereum network, through which complex alternative economic models are explored.

eess.SY↗