Searcharxiv⌕ Search

arXiv subjects

Ming Jin

Publications and source records attributed to Ming Jin.

At least 199 records · Page 11Linked to original sources

Adaptive Fourier decomposition of slice regular functions

In the slice Hardy space over the unit ball of quaternions, we introduce the slice hyperbolic backward shift operator $\mathcal S_a$ with the decomposition process $$f=e_a\langle f, e_a\rangle+B_{a}*\mathcal S_a f,$$ where $e_a$ denotes the slice normalized Szegö kernel and $ B_a $ the slice Blaschke factor. Iterating the above decomposition process, a corresponding maximal selection principle gives rise to the slice adaptive Fourier decomposition. This leads to a adaptive slice Takenaka-Malmquist orthonormal system.

math.CV↗

Elimination of Noise in Optically Rephased Photon Echoes

Photon echo is a fundamental tool for the manipulation of electromagnetic fields. Unavoidable spontaneous emission noise is generated in this process due to the strong rephasing pulse, which limits the achievable signal-to-noise ratio and represents a fundamental obstacle towards their applications in the quantum regime. Here we propose a noiseless photon-echo protocol based on a four-level atomic system. We implement this protocol in a Eu3+:Y2SiO5bcrystal to serve as an optical quantum memory. A storage fidelity of 0.952 is obtained for time-bin qubits encoded with single-photon-level coherent pulses, which is far beyond the maximal fidelity achievable using the classical measure-and-prepare strategy. In this work, the demonstrated noiseless photon-echo quantum memory features spin-wave storage, easy operation and high storage fidelity, which should be easily extended to other physical systems.

quant-ph↗

Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning

Graph representation learning plays a vital role in processing graph-structured data. However, prior arts on graph representation learning heavily rely on labeling information. To overcome this problem, inspired by the recent success of graph contrastive learning and Siamese networks in visual representation learning, we propose a novel self-supervised approach in this paper to learn node representations by enhancing Siamese self-distillation with multi-scale contrastive learning. Specifically, we first generate two augmented views from the input graph based on local and global perspectives. Then, we employ two objectives called cross-view and cross-network contrastiveness to maximize the agreement between node representations across different views and networks. To demonstrate the effectiveness of our approach, we perform empirical experiments on five real-world datasets. Our method not only achieves new state-of-the-art results but also surpasses some semi-supervised counterparts by large margins. Code is made available at https://github.com/GRAND-Lab/MERIT

cs.LG↗

MS-MDA: Multisource Marginal Distribution Adaptation for Cross-subject and Cross-session EEG Emotion Recognition

As an essential element for the diagnosis and rehabilitation of psychiatric disorders, the electroencephalogram (EEG) based emotion recognition has achieved significant progress due to its high precision and reliability. However, one obstacle to practicality lies in the variability between subjects and sessions. Although several studies have adopted domain adaptation (DA) approaches to tackle this problem, most of them treat multiple EEG data from different subjects and sessions together as a single source domain for transfer, which either fails to satisfy the assumption of domain adaptation that the source has a certain marginal distribution, or increases the difficulty of adaptation. We therefore propose the multi-source marginal distribution adaptation (MS-MDA) for EEG emotion recognition, which takes both domain-invariant and domain-specific features into consideration. First, we assume that different EEG data share the same low-level features, then we construct independent branches for multiple EEG data source domains to adopt one-to-one domain adaptation and extract domain-specific features. Finally, the inference is made by multiple branches. We evaluate our method on SEED and SEED-IV for recognizing three and four emotions, respectively. Experimental results show that the MS-MDA outperforms the comparison methods and state-of-the-art models in cross-session and cross-subject transfer scenarios in our settings. Codes at https://github.com/VoiceBeer/MS-MDA.

cs.LG↗

Unitary Approximate Message Passing for Sparse Bayesian Learning

Sparse Bayesian learning (SBL) can be implemented with low complexity based on the approximate message passing (AMP) algorithm. However, it does not work well for a generic measurement matrix, which may cause AMP to diverge. Damped AMP has been used for SBL to alleviate the problem at the cost of reducing convergence speed. In this work, we propose a new SBL algorithm based on structured variational inference, leveraging AMP with a unitary transformation (UAMP). Both single measurement vector and multiple measurement vector problems are investigated. It is shown that, compared to state-of-the-art AMP-based SBL algorithms, the proposed UAMP-SBL is more robust and efficient, leading to remarkably better performance.

eess.SP↗

A Unified Framework for Task-Driven Data Quality Management

High-quality data is critical to train performant Machine Learning (ML) models, highlighting the importance of Data Quality Management (DQM). Existing DQM schemes often cannot satisfactorily improve ML performance because, by design, they are oblivious to downstream ML tasks. Besides, they cannot handle various data quality issues (especially those caused by adversarial attacks) and have limited applications to only certain types of ML models. Recently, data valuation approaches (e.g., based on the Shapley value) have been leveraged to perform DQM; yet, empirical studies have observed that their performance varies considerably based on the underlying data and training process. In this paper, we propose a task-driven, multi-purpose, model-agnostic DQM framework, DataSifter, which is optimized towards a given downstream ML task, capable of effectively removing data points with various defects, and applicable to diverse models. Specifically, we formulate DQM as an optimization problem and devise a scalable algorithm to solve it. Furthermore, we propose a theoretical framework for comparing the worst-case performance of different DQM strategies. Remarkably, our results show that the popular strategy based on the Shapley value may end up choosing the worst data subset in certain practical scenarios. Our evaluation shows that DataSifter achieves and most often significantly improves the state-of-the-art performance over a wide range of DQM tasks, including backdoor, poison, noisy/mislabel data detection, data summarization, and data debiasing.

cs.LG↗

Imitation Learning with Stability and Safety Guarantees

A method is presented to learn neural network (NN) controllers with stability and safety guarantees through imitation learning (IL). Convex stability and safety conditions are derived for linear time-invariant plant dynamics with NN controllers by merging Lyapunov theory with local quadratic constraints to bound the nonlinear activation functions in the NN. These conditions are incorporated in the IL process, which minimizes the IL loss, and maximizes the volume of the region of attraction associated with the NN controller simultaneously. An alternating direction method of multipliers based algorithm is proposed to solve the IL problem. The method is illustrated on an inverted pendulum system, aircraft longitudinal dynamics, and vehicle lateral dynamics.

eess.SY↗

Deep Learning for Reactive Power Control of Smart Inverters under Communication Constraints

Aiming for the median solution between cyber-intensive optimal power flow (OPF) solutions and subpar local control, this work advocates deciding inverter injection setpoints using deep neural networks (DNNs). Instead of fitting OPF solutions in a black-box manner, inverter DNNs are naturally integrated with the feeder model and trained to minimize a grid-wide objective subject to inverter and network constraints enforced on the average over uncertain grid conditions. Learning occurs in a quasi-stationary fashion and is posed as a stochastic OPF, handled via stochastic primal-dual updates acting on grid data scenarios. Although trained as a whole, the proposed DNN is operated in a master-slave architecture. Its master part is run at the utility to output a condensed control signal broadcast to all inverters. Its slave parts are implemented by inverters and are driven by the utility signal along with local inverter readings. This novel DNN structure uniquely addresses the small-big data conundrum where utilities collect detailed smart meter readings yet on an hourly basis, while in real time inverters should be driven by local inputs and minimal utility coordination to save on communication. Numerical tests corroborate the efficacy of this physics-aware DNN-based inverter solution over an optimal control policy.

math.OC↗

Reliable coherent optical memory based on a laser-written waveguide

$\mathrm {^{151}Eu^{3+}}$-doped yttrium silicate ($\mathrm {^{151}Eu^{3+}:Y_2SiO_5}$ ) crystal is a unique material that possesses hyperfine states with coherence time up to 6 h. Many efforts have been devoted to the development of this material as optical quantum memories based on the bulk crystals, but integrable structures (such as optical waveguides) that can promote $\mathrm {^{151}Eu^{3+}:Y_2SiO_5}$-based quantum memories to practical applications, have not been demonstrated so far. Here we report the fabrication of type 2 waveguides in a $\mathrm {^{151}Eu^{3+}:Y_2SiO_5}$ crystal using femtosecond-laser micromachining. The resulting waveguides are compatible with single-mode fibers and have the smallest insertion loss of $4.95\ dB$. On-demand light storage is demonstrated in a waveguide by employing the spin-wave atomic frequency comb (AFC) scheme and the revival of silenced echo (ROSE) scheme. We implement a series of interference experiments based on these two schemes to characterize the storage fidelity. Interference visibility of the readout pulse is $0.99\pm 0.03$ for the spin-wave AFC scheme and $0.97\pm 0.02$ for the ROSE scheme, demonstrating the reliability of the integrated optical memory.

quant-ph↗

Slice Dirac operator over octonions

The slice Dirac operator over octonions is a slice counterpart of the Dirac operator over quaternions. It involves a new theory of stem functions, which is the extension from the commutative $ O(1) $ case to the non-commutative $ O(3) $ case. For functions in the kernel of the slice Dirac operator over octonions, we establish the representation formula, the Cauchy integral formula (and, more in general, the Cauchy-Pompeiu formula), and the Taylor as well as the Laurent series expansion formulas.

math.CV↗

Boundary Defense against Cyber Threat for Power System Operation

The operation of power grids is becoming increasingly data-centric. While the abundance of data could improve the efficiency of the system, it poses major reliability challenges. In particular, state estimation aims to learn the behavior of the network from data but an undetected attack on this problem could lead to a large-scale blackout. Nevertheless, understanding vulnerability of state estimation against cyber attacks has been hindered by the lack of tools studying the topological and data-analytic aspects of the network. Algorithmic robustness is of critical need to extract reliable information from abundant but untrusted grid data. We propose a robust state estimation framework that leverages network sparsity and data abundance. For a large-scale power grid, we quantify, analyze, and visualize the regions of the network prone to cyber attacks. We also propose an optimization-based graphical boundary defense mechanism to identify the border of the geographical area whose data has been manipulated. The proposed method does not allow a local attack to have a global effect on the data analysis of the entire network, which enhances the situational awareness of the grid especially in the face of adversity. The developed mathematical framework reveals key geometric and algebraic factors that can affect algorithmic robustness and is used to study the vulnerability of the U.S. power grid in this paper.

eess.SP↗

Unilateral Left-Tail Anderson Darling Test Based Spectrum Sensing with Laplacian Noise

This paper focuses on spectrum sensing under Laplacian noise. To remit the negative effects caused by heavy-tailed behavior of Laplacian noise, the fractional lower order moments (FLOM) technology is employed to pre-process the received samples before spectrum sensing. Via exploiting the asymmetrical difference between the distribution for the FLOM of received samples in the absence and presence of primary users, we formulate the spectrum sensing problem under Laplacian noise as a unilateral goodness-of-fit (GoF) test problem. Based on this test problem, we propose a new GoF-based detector which is called unilateral left-tail Anderson Darling (ULAD) detector. The analytical expressions for the theoretical performance, in terms of false-alarm and detection probabilities, of the ULAD are derived. Moreover, a closed-form expression for the optimal detection threshold is also derived to minimize the total error rate. Simulation results are provided to validate the theoretical analyses and to demonstrate the superior performance of the proposed detector than others.

cs.IT↗

Stability-certified reinforcement learning: A control-theoretic perspective

We investigate the important problem of certifying stability of reinforcement learning policies when interconnected with nonlinear dynamical systems. We show that by regulating the input-output gradients of policies, strong guarantees of robust stability can be obtained based on a proposed semidefinite programming feasibility problem. The method is able to certify a large set of stabilizing controllers by exploiting problem-specific structures; furthermore, we analyze and establish its (non)conservatism. Empirical evaluations on two decentralized control tasks, namely multi-flight formation and power system frequency regulation, demonstrate that the reinforcement learning agents can have high performance within the stability-certified parameter space, and also exhibit stable learning behaviors in the long run.

eess.SY↗

Entangling cavity modes in a double-cavity optomechanical system

We study entanglement of the cavity modes in a double-cavity optomechanical system in strong-coupling regime. The system consists of two optomechanical systems coupled by a single photon hopping between them. With the radiation pressure of the photon, entanglement of the cavity modes can be generated. The concurrence between the cavity modes is at least twice larger than that between the mechanical modes. Moreover, when we change the ratio between coupling strength and resonant frequency of mechanical modes, the entanglement in cavity and mechanical modes are influenced differently.

physics.optics↗

Inverse Reinforcement Learning via Deep Gaussian Process

We propose a new approach to inverse reinforcement learning (IRL) based on the deep Gaussian process (deep GP) model, which is capable of learning complicated reward structures with few demonstrations. Our model stacks multiple latent GP layers to learn abstract representations of the state feature space, which is linked to the demonstrations through the Maximum Entropy learning framework. Incorporating the IRL engine into the nonlinear latent structure renders existing deep GP inference approaches intractable. To tackle this, we develop a non-standard variational approximation framework which extends previous inference schemes. This allows for approximate Bayesian treatment of the feature space and guards against overfitting. Carrying out representation and inverse reinforcement learning simultaneously within our model outperforms state-of-the-art approaches, as we demonstrate with experiments on standard benchmarks ("object world","highway driving") and a new benchmark ("binary world").

cs.LG↗

A Robust Utility Learning Framework via Inverse Optimization

In many smart infrastructure applications flexibility in achieving sustainability goals can be gained by engaging end-users. However, these users often have heterogeneous preferences that are unknown to the decision-maker tasked with improving operational efficiency. Modeling user interaction as a continuous game between non-cooperative players, we propose a robust parametric utility learning framework that employs constrained feasible generalized least squares estimation with heteroskedastic inference. To improve forecasting performance, we extend the robust utility learning scheme by employing bootstrapping with bagging, bumping, and gradient boosting ensemble methods. Moreover, we estimate the noise covariance which provides approximated correlations between players which we leverage to develop a novel correlated utility learning framework. We apply the proposed methods both to a toy example arising from Bertrand-Nash competition between two firms as well as to data from a social game experiment designed to encourage energy efficient behavior amongst smart building occupants. Using occupant voting data for shared resources such as lighting, we simulate the game defined by the estimated utility functions to demonstrate the performance of the proposed methods.

cs.GT↗

Building-in-Briefcase (BiB)

A building's environment has profound influence on occupant comfort and health. Continuous monitoring of building occupancy and environment is essential to fault detection, intelligent control, and building commissioning. Though many solutions for environmental measuring based on wireless sensor networks exist, they are not easily accessible to households and building owners who may lack time or technical expertise needed to set up a system and get quick and detailed overview of environmental conditions. Building-in-Briefcase (BiB) is a portable sensor network platform that is trivially easy to deploy in any building environment. Once the sensors are distributed, the environmental data is collected and communicated to the BiB router via TCP/IP protocol and WiFi technology which then forwards the data to the central database securely over the internet through a 3G radio. The user, with minimal effort, can access the aggregated data and visualize the trends in real time on the BiB web portal. Paramount to the adoption and continued operation of an indoor sensing platform is battery lifetime. This design has achieved a multi-year lifespan by careful selection of components, an efficient binary communications protocol and data compression. Our BiB sensor is capable of collecting a rich set of environmental parameters, and is expandable to measure others, such as CO2. This paper describes the power characteristics of BiB sensors and their occupancy estimation and activity recognition functionality. Our vision is large-scale deployment of BiB in thousands of buildings, which would provide ample research opportunities and opportunities to identify ways to improve the building environment and energy efficiency.

cs.CY↗

SoundLoc: Acoustic Method for Indoor Localization without Infrastructure

Identifying locations of occupants is beneficial to energy management in buildings. A key observation in indoor environment is that distinct functional areas are typically controlled by separate HVAC and lighting systems and room level localization is sufficient to provide a powerful tool for energy usage reduction by occupancy-based actuation of the building facilities. Based upon this observation, this paper focuses on identifying the room where a person or a mobile device is physically present. Existing room localization methods, however, require special infrastructure to annotate rooms. SoundLoc is a room-level localization system that exploits the intrinsic acoustic properties of individual rooms and obviates the needs for infrastructures. As we show in the study, rooms' acoustic properties can be characterized by Room Impulse Response (RIR). Nevertheless, obtaining precise RIRs is a time-consuming and expensive process. The main contributions of our work are the following. First, a cost-effective RIR measurement system is implemented and the Noise Adaptive Extraction of Reverberation (NAER) algorithm is developed to estimate room acoustic parameters in noisy conditions. Second, a comprehensive physical and statistical analysis of features extracted from RIRs is performed. Also, SoundLoc is evaluated using the dataset consisting of ten (10) different rooms. The overall accuracy of 97.8% achieved demonstrates the potential to be integrated into automatic mapping of building space.

cs.HC↗