arXiv subjects

Hong Chen

Publications and source records attributed to Hong Chen.

At least 235 records · Page 13Linked to original sources

arXiv2022

Markov subsampling based Huber Criterion

Subsampling is an important technique to tackle the computational challenges brought by big data. Many subsampling procedures fall within the framework of importance sampling, which assigns high sampling probabilities to the samples appearing to have big impacts. When the noise level is high, those sampling procedures tend to pick many outliers and thus often do not perform satisfactorily in practice. To tackle this issue, we design a new Markov subsampling strategy based on Huber criterion (HMS) to construct an informative subset from the noisy full data; the constructed subset then serves as a refined working data for efficient processing. HMS is built upon a Metropolis-Hasting procedure, where the inclusion probability of each sampling unit is determined using the Huber criterion to prevent over scoring the outliers. Under mild conditions, we show that the estimator based on the subsamples selected by HMS is statistically consistent with a sub-Gaussian deviation bound. The promising performance of HMS is demonstrated by extensive studies on large scale simulations and real data examples.

stat.ML↗

arXiv2022

Equilibrium Defaultable Corporate Debt and Investment

In dynamic capital structure models with an investor break-even condition, the firm's Bellman equation may not generate a contraction mapping, so the standard existence and uniqueness conditions do not apply. First, we provide an example showing the problem in a classical trade-off model. The firm can issue one-period defaultable debt, invest in capital and pay a dividend. If the firm cannot meet the required debt payment, it is liquidated. Second, we show how to use a dual to the original problem and a change of measure, such that existence and uniqueness can be proved. In the unique Markov-perfect equilibrium, firm decisions reflect state-dependent capital and debt targets. Our approach may be useful for other dynamic firm models that have an investor break-even condition.

q-fin.GN↗

arXiv2022

Local well-posedness to the 2D Cauchy problem of full compressible magnetohydrodynamic equations with vacuum at infinity

This paper concerns the Cauchy problem of two-dimensional (2D) full compressible magnetohydrodynamic (MHD) equations in the whole plane $\mathbb{R}^2$ with zero density at infinity. By spatial weighted energy method, we derive the local existence and uniqueness of strong solutions provided that the initial density and the initial magnetic field decay not too slowly at infinity. Note that the initial temperature does not need to decay slowly at infinity. In particular, vacuum states at both the interior domain and the far field are allowed.

math.AP↗

arXiv2022

Spin and polarization analysis of $Z_{cs}$ state

A polarization analysis is performed for the recent observation of $Z_{cs}$ exotic state in the $e^+e^-$ annihilation experiment with motivation for measuring its spin quantum number in the future. Starting with the unpolarized electron and positron beam, the polarization transfer to the $Z_{cs}$ state and its decay angular distribution patterns are investigated. Some observables are suggested for determination of the spin parity quantum numbers. An ensemble of Monte-Carlo events are used to show some moment distributions special for manifestation of the different $Z_{cs}$ spin scenarios.

hep-ph↗

arXiv2022

Robust Learning-based Predictive Control for Discrete-time Nonlinear Systems with Unknown Dynamics and State Constraints

Robust model predictive control (MPC) is a well-known control technique for model-based control with constraints and uncertainties. In classic robust tube-based MPC approaches, an open-loop control sequence is computed via periodically solving an online nominal MPC problem, which requires prior model information and frequent access to onboard computational resources. In this paper, we propose an efficient robust MPC solution based on receding horizon reinforcement learning, called r-LPC, for unknown nonlinear systems with state constraints and disturbances. The proposed r-LPC utilizes a Koopman operator-based prediction model obtained off-line from pre-collected input-output datasets. Unlike classic tube-based MPC, in each prediction time interval of r-LPC, we use an actor-critic structure to learn a near-optimal feedback control policy rather than a control sequence. The resulting closed-loop control policy can be learned off-line and deployed online or learned online in an asynchronous way. In the latter case, online learning can be activated whenever necessary; for instance, the safety constraint is violated with the deployed policy. The closed-loop recursive feasibility, robustness, and asymptotic stability are proven under function approximation errors of the actor-critic networks. Simulation and experimental results on two nonlinear systems with unknown dynamics and disturbances have demonstrated that our approach has better or comparable performance when compared with tube-based MPC and LQR, and outperforms a recently developed actor-critic learning approach.

eess.SY↗

arXiv2022

An Accelerator for Rule Induction in Fuzzy Rough Theory

Rule-based classifier, that extract a subset of induced rules to efficiently learn/mine while preserving the discernibility information, plays a crucial role in human-explainable artificial intelligence. However, in this era of big data, rule induction on the whole datasets is computationally intensive. So far, to the best of our knowledge, no known method focusing on accelerating rule induction has been reported. This is first study to consider the acceleration technique to reduce the scale of computation in rule induction. We propose an accelerator for rule induction based on fuzzy rough theory; the accelerator can avoid redundant computation and accelerate the building of a rule classifier. First, a rule induction method based on consistence degree, called Consistence-based Value Reduction (CVR), is proposed and used as basis to accelerate. Second, we introduce a compacted search space termed Key Set, which only contains the key instances required to update the induced rule, to conduct value reduction. The monotonicity of Key Set ensures the feasibility of our accelerator. Third, a rule-induction accelerator is designed based on Key Set, and it is theoretically guaranteed to display the same results as the unaccelerated version. Specifically, the rank preservation property of Key Set ensures consistency between the rule induction achieved by the accelerator and the unaccelerated method. Finally, extensive experiments demonstrate that the proposed accelerator can perform remarkably faster than the unaccelerated rule-based classifier methods, especially on datasets with numerous instances.

cs.AI↗

arXiv2022

CODE: Contrastive Pre-training with Adversarial Fine-tuning for Zero-shot Expert Linking

Expert finding, a popular service provided by many online websites such as Expertise Finder, LinkedIn, and AMiner, is beneficial to seeking candidate qualifications, consultants, and collaborators. However, its quality is suffered from lack of ample sources of expert information. This paper employs AMiner as the basis with an aim at linking any external experts to the counterparts on AMiner. As it is infeasible to acquire sufficient linkages from arbitrary external sources, we explore the problem of zero-shot expert linking. In this paper, we propose CODE, which first pre-trains an expert linking model by contrastive learning on AMiner such that it can capture the representation and matching patterns of experts without supervised signals, then it is fine-tuned between AMiner and external sources to enhance the models transferability in an adversarial manner. For evaluation, we first design two intrinsic tasks, author identification and paper clustering, to validate the representation and matching capability endowed by contrastive learning. Then the final external expert linking performance on two genres of external sources also implies the superiority of the adversarial fine-tuning method. Additionally, we show the online deployment of CODE, and continuously improve its online performance via active learning.

cs.IR↗

arXiv2021

Eco-Coasting Strategies Using Road Grade Preview: Evaluation and Online Implementation Based on Mixed Integer Model Predictive Control

Coasting has been widely used in the eco-driving guidelines to reduce fuel consumption by profiting from kinetic energy. However, the comprehensive comparison between different coasting strategies and online performance of the eco-coasting strategy using road grade preview are still unclear because of the oversimplification and the integer variable in the optimal control problems. Herein, two different coasting strategies (fuel cut-off and engine start/stop) are proposed to reveal the potential benefit of eco-coasting using the road grade preview. Engine drag torque and energy cost used for engine restart are considered in the modeling to give a fair evaluation of the offline and online performance. The offline performance of these two coasting methods is evaluated through dynamic programming (DP) under various driving scenarios with different slope profiles. Offline simulation shows that the engine start/stop method outperforms the fuel cut-off method in terms of fuel consumption and travel time by getting rid of the engine drag torque. Then, online performance of these two coasting methods is evaluated using Mixed Integer Model Predictive Control (MIMPC). A novel operational constraint on the minimum off steps is added in the MIMPC formulation to avoid frequent switch of the integer variables which represent the fuel cut-off and the engine start/stop mechanism. Simulation results show that, for both fuel cut-off and engine start/stop coasting methods, the MPC controller reduces fuel consumption to a level comparable to DP without sacrificing the travel time.

eess.SY↗

arXiv2021

Power-Efficient Silicon Nitride Thermo-Optic Phase Shifters for Visible Light

We demonstrate power-efficient, thermo-optic, silicon nitride waveguide phase shifters for blue, green, and yellow wavelengths. The phase shifters operated with low power consumption due to a suspended structure and multi-pass waveguide design. The devices were fabricated on 200-mm silicon wafers using deep ultraviolet lithography as part of an active visible-light integrated photonics platform. The measured power consumption to achieve a $π$ phase shift (averaged over multiple devices) was 0.78, 0.93, 1.09, and 1.20 mW at wavelengths of 445, 488, 532, and 561 nm, respectively. The phase shifters were integrated into Mach-Zehnder interferometer switches, and $10- 90$\% rise(fall) times of about 570(590) $μ$s were measured.

physics.optics↗

arXiv2021

SciXGen: A Scientific Paper Dataset for Context-Aware Text Generation

Generating texts in scientific papers requires not only capturing the content contained within the given input but also frequently acquiring the external information called \textit{context}. We push forward the scientific text generation by proposing a new task, namely \textbf{context-aware text generation} in the scientific domain, aiming at exploiting the contributions of context in generated texts. To this end, we present a novel challenging large-scale \textbf{Sci}entific Paper Dataset for Conte\textbf{X}t-Aware Text \textbf{Gen}eration (SciXGen), consisting of well-annotated 205,304 papers with full references to widely-used objects (e.g., tables, figures, algorithms) in a paper. We comprehensively benchmark, using state-of-the-arts, the efficacy of our newly constructed SciXGen dataset in generating description and paragraph. Our dataset and benchmarks will be made publicly available to hopefully facilitate the scientific text generation research.

cs.CL↗

arXiv2021

Omnidirectional nonreciprocal absorber realized by the magneto-optical hypercrystal

Photonic bandgap design is one of the most basic ways to effectively control the interaction between light and matter. However, the traditional photonic bandgap is always dispersive (blueshift with the increase of the incident angle), which is disadvantageous to the construction of wide-angle optical devices. Hypercrystal, that the photonic crystal with layered hyperbolic metamaterials (HMMs), can strongly modify the bandgap properties based on the anomalous wavevector dispersion of the HMM. Here, based on phase variation compensation between HMM and isotropic dielectric layers, we propose for the first time to design nonreciprocal and flexible photonic bandgaps using magneto-optical HMMs in one-dimensional photonic crystals. Especially for the forward and backward incident light, the blueshift and dispersionless of the forward and backward cavity modes are designed respectively to realize the interesting omnidirectional nonreciprocal absorber. Our results show high (low) absorption about 0.99 (0.25) in an angle range of 20-75 degrees for the forward (backward) incident light at the wavelength of 367 nm. The nonreciprocal omnidirectional cavity mode not only facilitates the design of perfect unidirectional optical absorbers working in a wide-angle range, but also possesses significant applications for all-angle reflectors and filters.

physics.optics↗

arXiv2021

Energy cost study for controlling complex social networks with conformity behavior

In order to understand controlling a complex system, an estimation of the required effort needed to achieve control is vital. Previous works have addressed this issue by studying the scaling laws of energy cost in a general way with continuous-time linear dynamics. However, continuous-time linear dynamics is unable to capture conformity behavior, which is common in many complex social systems. Therefore, to understand controlling social systems with conformity, discrete-time modelling is used and the energy cost scaling laws are derived. The results are validated numerically with model and real networks. In addition, the energy costs needed for controlling systems with and without conformity are compared, and it was found that controlling networked systems with conformity features always requires less control energy. Finally, it is shown through simulations that heterogeneous scale-free networks are less controllable, requiring a higher number of minimum drivers. Since the conformity-based model relates to various complex systems, such as flocking, or evolutionary games, the results of this paper represent a step forward towards developing realistic control of complex social systems.

physics.soc-ph↗

arXiv2021

Zero-index and Hyperbolic Metacavities: Fundamentals and Applications

As a basic building block, optical resonant cavities (ORCs) are widely used in light manipulation; they can confine electromagnetic waves and improve the interaction between light and matter, which also plays an important role in cavity quantum electrodynamics, nonlinear optics and quantum optics. Especially in recent years, the rise of metamaterials, artificial materials composed of subwavelength unit cells, greatly enriches the design and function of ORCs. Here, we review zero-index and hyperbolic metamaterials for constructing the novel ORCs. Firstly, this paper introduces the classification and implementation of zero-index and hyperbolic metamaterials. Secondly, the distinctive properties of zero-index and hyperbolic cavities are summarized, including the geometry-invariance, homogeneous/inhomogeneous field distribution, and the topological protection (anomalous scaling law, size independence, continuum of high-order modes, and dispersionless modes) for the zero-index (hyperbolic) metacavities. Finally, the paper introduces some typical applications of zero-index and hyperbolic metacavities, and prospects the research of metacavities.

physics.optics↗

arXiv2021

FLAME: Differentially Private Federated Learning in the Shuffle Model

Federated Learning (FL) is a promising machine learning paradigm that enables the analyzer to train a model without collecting users' raw data. To ensure users' privacy, differentially private federated learning has been intensively studied. The existing works are mainly based on the \textit{curator model} or \textit{local model} of differential privacy. However, both of them have pros and cons. The curator model allows greater accuracy but requires a trusted analyzer. In the local model where users randomize local data before sending them to the analyzer, a trusted analyzer is not required but the accuracy is limited. In this work, by leveraging the \textit{privacy amplification} effect in the recently proposed shuffle model of differential privacy, we achieve the best of two worlds, i.e., accuracy in the curator model and strong privacy without relying on any trusted party. We first propose an FL framework in the shuffle model and a simple protocol (SS-Simple) extended from existing work. We find that SS-Simple only provides an insufficient privacy amplification effect in FL since the dimension of the model parameter is quite large. To solve this challenge, we propose an enhanced protocol (SS-Double) to increase the privacy amplification effect by subsampling. Furthermore, for boosting the utility when the model size is greater than the user population, we propose an advanced protocol (SS-Topk) with gradient sparsification techniques. We also provide theoretical analysis and numerical evaluations of the privacy amplification of the proposed protocols. Experiments on real-world dataset validate that SS-Topk improves the testing accuracy by 60.7\% than the local model based FL.

cs.LG↗

arXiv2021

Commonsense Knowledge Aware Concept Selection For Diverse and Informative Visual Storytelling

Visual storytelling is a task of generating relevant and interesting stories for given image sequences. In this work we aim at increasing the diversity of the generated stories while preserving the informative content from the images. We propose to foster the diversity and informativeness of a generated story by using a concept selection module that suggests a set of concept candidates. Then, we utilize a large scale pre-trained model to convert concepts and images into full stories. To enrich the candidate concepts, a commonsense knowledge graph is created for each image sequence from which the concept candidates are proposed. To obtain appropriate concepts from the graph, we propose two novel modules that consider the correlation among candidate concepts and the image-concept correlation. Extensive automatic and human evaluation results demonstrate that our model can produce reasonable concepts. This enables our model to outperform the previous models by a large margin on the diversity and informativeness of the story, while retaining the relevance of the story to the image sequence.

cs.CV↗

arXiv2021

GraphPlan: Story Generation by Planning with Event Graph

Story generation is a task that aims to automatically produce multiple sentences to make up a meaningful story. This task is challenging because it requires high-level understanding of semantic meaning of sentences and causality of story events. Naive sequence-to-sequence models generally fail to acquire such knowledge, as the logical correctness can hardly be guaranteed in a text generation model without the strategic planning. In this paper, we focus on planning a sequence of events assisted by event graphs, and use the events to guide the generator. Instead of using a sequence-to-sequence model to output a storyline as in some existing works, we propose to generate an event sequence by walking on an event graph. The event graphs are built automatically based on the corpus. To evaluate the proposed approach, we conduct human evaluation both on event planning and story generation. Based on large-scale human annotation results, our proposed approach is shown to produce more logically correct event sequences and stories.

cs.CL↗

arXiv2021

On a Conjecture of Bahri-Xu

In order to study the Yamabe changing-sign problem, Bahri and Xu proposed a conjecture which is a universal inequality for $p$ points in $\mathbb R^m$. They have verified the conjecture for $p\leq3$. In this paper, we first simplify this conjecture by giving two sufficient and necessary conditions inductively. Then we prove the conjecture for the basic case $m=1$ with arbitrary $p$. In addition, for the cases when $p=4,5$ and $m\geq2$, we manage to reduce them to the basic case $m=1$ and thus prove them as well.

math.CA↗

arXiv2021

Optimizing target nodes selection for the control energy of directed complex networks

The energy needed in controlling a complex network is a problem of practical importance. Recent works have focused on the reduction of control energy either via strategic placement of driver nodes, or by decreasing the cardinality of nodes to be controlled. However, optimizing control energy with respect to target nodes selection has yet been considered. In this work, we propose an iterative method based on Stiefel manifold optimization of selectable target node matrix to reduce control energy. We derive the matrix derivative gradient needed for the search algorithm in a general way, and search for target nodes which result in reduced control energy, assuming that driver nodes placement is fixed. Our findings reveal that the control energy is optimal when the path distances from driver nodes to target nodes are minimized. We corroborate our algorithm with extensive simulations on elementary network topologies, random and scale-free networks, as well as various real networks. The simulation results show that the control energy found using our algorithm outperforms heuristic selection strategies for choosing target nodes by a few orders of magnitude. Our work may be applicable to opinion networks, where one is interested in identifying the optimal group of individuals that the driver nodes can influence.

physics.soc-ph↗