arXiv subjects

Yueyang Liu

Publications and source records attributed to Yueyang Liu.

29 records · Page 2Linked to original sources

arXiv2024

AED: An black-box NLP classifier model attacker

Deep Neural Networks (DNNs) have been successful in solving real-world tasks in domains such as connected and automated vehicles, disease, and job hiring. However, their implications are far-reaching in critical application areas. Hence, there is a growing concern regarding the potential bias and robustness of these DNN models. A transparency and robust model is always demanded in high-stakes domains where reliability and safety are enforced, such as healthcare and finance. While most studies have focused on adversarial image attack scenarios, fewer studies have investigated the robustness of DNN models in natural language processing (NLP) due to their adversarial samples are difficult to generate. To address this gap, we propose a word-level NLP classifier attack model called "AED," which stands for Attention mechanism enabled post-model Explanation with Density peaks clustering algorithm for synonyms search and substitution. AED aims to test the robustness of NLP DNN models by interpretability their weaknesses and exploring alternative ways to optimize them. By identifying vulnerabilities and providing explanations, AED can help improve the reliability and safety of DNN models in critical application areas such as healthcare and automated transportation. Our experiment results demonstrate that compared with other existing models, AED can effectively generate adversarial examples that can fool the victim model while maintaining the original meaning of the input.

cs.LG↗

arXiv2024

Neural Collaborative Filtering to Detect Anomalies in Human Semantic Trajectories

Human trajectory anomaly detection has become increasingly important across a wide range of applications, including security surveillance and public health. However, existing trajectory anomaly detection methods are primarily focused on vehicle-level traffic, while human-level trajectory anomaly detection remains under-explored. Since human trajectory data is often very sparse, machine learning methods have become the preferred approach for identifying complex patterns. However, concerns regarding potential biases and the robustness of these models have intensified the demand for more transparent and explainable alternatives. In response to these challenges, our research focuses on developing a lightweight anomaly detection model specifically designed to detect anomalies in human trajectories. We propose a Neural Collaborative Filtering approach to model and predict normal mobility. Our method is designed to model users' daily patterns of life without requiring prior knowledge, thereby enhancing performance in scenarios where data is sparse or incomplete, such as in cold start situations. Our algorithm consists of two main modules. The first is the collaborative filtering module, which applies collaborative filtering to model normal mobility of individual humans to places of interest. The second is the neural module, responsible for interpreting the complex spatio-temporal relationships inherent in human trajectory data. To validate our approach, we conducted extensive experiments using simulated and real-world datasets comparing to numerous state-of-the-art trajectory anomaly detection approaches.

cs.LG↗

arXiv2023

Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Sampling

Real-world applications of contextual bandits often exhibit non-stationarity due to seasonality, serendipity, and evolving social trends. While a number of non-stationary contextual bandit learning algorithms have been proposed in the literature, they excessively explore due to a lack of prioritization for information of enduring value, or are designed in ways that do not scale in modern applications with high-dimensional user-specific features and large action set, or both. In this paper, we introduce a novel non-stationary contextual bandit algorithm that addresses these concerns. It combines a scalable, deep-neural-network-based architecture with a carefully designed exploration mechanism that strategically prioritizes collecting information with the most lasting value in a non-stationary environment. Through empirical evaluations on two real-world recommendation datasets, which exhibit pronounced non-stationarity, we demonstrate that our approach significantly outperforms the state-of-the-art baselines.

cs.LG↗

arXiv2023

A Definition of Non-Stationary Bandits

Despite the subject of non-stationary bandit learning having attracted much recent attention, we have yet to identify a formal definition of non-stationarity that can consistently distinguish non-stationary bandits from stationary ones. Prior work has characterized non-stationary bandits as bandits for which the reward distribution changes over time. We demonstrate that this definition can ambiguously classify the same bandit as both stationary and non-stationary; this ambiguity arises in the existing definition's dependence on the latent sequence of reward distributions. Moreover, the definition has given rise to two widely used notions of regret: the dynamic regret and the weak regret. These notions are not indicative of qualitative agent performance in some bandits. Additionally, this definition of non-stationary bandits has led to the design of agents that explore excessively. We introduce a formal definition of non-stationary bandits that resolves these issues. Our new definition provides a unified approach, applicable seamlessly to both Bayesian and frequentist formulations of bandits. Furthermore, our definition ensures consistent classification of two bandits offering agents indistinguishable experiences, categorizing them as either both stationary or both non-stationary. This advancement provides a more robust framework for non-stationary bandit learning.

cs.LG↗

arXiv2023

Visualization of Mobility Digital Twin: Framework Design, Case Study, and Future Challenges

A Mobility Digital Twin is an emerging implementation of digital twin technology in the transportation domain, which creates digital replicas for various physical mobility entities, such as vehicles, drivers, and pedestrians. Although a few work have investigated the applications of mobility digital twin recently, the extent to which it can facilitate safer autonomous vehicles remains insufficiently explored. In this paper, we first propose visualization of mobility digital twin, which aims to augment the existing perception systems in connected and autonomous vehicles through twinning high-fidelity and manipulable geometry representations for causal traffic participants, such as surrounding pedestrians and vehicles, in the digital space. An end-to-end system framework, including image data crowdsourcing, preprocessing, offloading, and edge-assisted 3D geometry reconstruction, is designed to enable real-world development of the proposed visualization of mobility digital twin. We implement the proposed system framework and conduct a case study to assess the twinning fidelity and physical-to-digital synchronicity within different image sampling scenarios and wireless network conditions. Based on the case study, future challenges of the proposed visualization of mobility digital twin are discussed toward the end of the paper.

cs.NI↗

arXiv2023

A Semi-Supervised Framework for Misinformation Detection

The spread of misinformation in social media outlets has become a prevalent societal problem and is the cause of many kinds of social unrest. Curtailing its prevalence is of great importance and machine learning has shown significant promise. However, there are two main challenges when applying machine learning to this problem. First, while much too prevalent in one respect, misinformation, actually, represents only a minor proportion of all the postings seen on social media. Second, labeling the massive amount of data necessary to train a useful classifier becomes impractical. Considering these challenges, we propose a simple semi-supervised learning framework in order to deal with extreme class imbalances that has the advantage, over other approaches, of using actual rather than simulated data to inflate the minority class. We tested our framework on two sets of Covid-related Twitter data and obtained significant improvement in F1-measure on extremely imbalanced scenarios, as compared to simple classical and deep-learning data generation methods such as SMOTE, ADASYN, or GAN-based data generation.

cs.AI↗

arXiv2023

Brain Model State Space Reconstruction Using an LSTM Neural Network

Objective Kalman filtering has previously been applied to track neural model states and parameters, particularly at the scale relevant to EEG. However, this approach lacks a reliable method to determine the initial filter conditions and assumes that the distribution of states remains Gaussian. This study presents an alternative, data-driven method to track the states and parameters of neural mass models (NMMs) from EEG recordings using deep learning techniques, specifically an LSTM neural network. Approach An LSTM filter was trained on simulated EEG data generated by a neural mass model using a wide range of parameters. With an appropriately customised loss function, the LSTM filter can learn the behaviour of NMMs. As a result, it can output the state vector and parameters of NMMs given observation data as the input. Main Results Test results using simulated data yielded correlations with R squared of around 0.99 and verified that the method is robust to noise and can be more accurate than a nonlinear Kalman filter when the initial conditions of the Kalman filter are not accurate. As an example of real-world application, the LSTM filter was also applied to real EEG data that included epileptic seizures, and revealed changes in connectivity strength parameters at the beginnings of seizures. Significance Tracking the state vector and parameters of mathematical brain models is of great importance in the area of brain modelling, monitoring, imaging and control. This approach has no need to specify the initial state vector and parameters, which is very difficult to do in practice because many of the variables being estimated cannot be measured directly in physiological experiments. This method may be applied using any neural mass model and, therefore, provides a general, novel, efficient approach to estimate brain model variables that are often difficult to measure.

cs.LG↗

arXiv2022

Magnetically tunable zero-index metamaterials

Zero-index metamaterials (ZIMs) feature a uniform electromagnetic mode over a large area in arbitrary shapes, enabling many applications including high-transmission supercouplers with arbitrary shapes, direction-independent phase matching for nonlinear optics, and collective emission of many quantum emitters. However, most ZIMs reported till date are passive, with no method for the dynamic modulation of their electromagnetic properties. Here, we design and fabricate a magnetically tunable ZIM consisting of yttrium iron garnet (YIG) pillars sandwiched between two copper clad laminates in the microwave regime. By harnessing the Cotton-Mouton effect of YIG, the metamaterial was successfully toggled between gapless and bandgap states, leading to a "phase transition" between a zero-index phase and a single negative phase of the metamaterial. Using an S-shaped ZIM supercoupler, we experimentally demonstrated a tunable supercoupling state with a low intrinsic loss of 0.95 dB and a high extinction ratio of up to 30.63 dB at 9 GHz. Our work enables dynamic modulation of the electromagnetic characteristics of ZIMs, enabling various applications in tunable linear, nonlinear, quantum and nonreciprocal electromagnetic devices.

physics.app-ph↗

arXiv2022

Gaussian Imagination in Bandit Learning

Assuming distributions are Gaussian often facilitates computations that are otherwise intractable. We study the performance of an agent that attains a bounded information ratio with respect to a bandit environment with a Gaussian prior distribution and a Gaussian likelihood function when applied instead to a Bernoulli bandit. Relative to an information-theoretic bound on the Bayesian regret the agent would incur when interacting with the Gaussian bandit, we bound the increase in regret when the agent interacts with the Bernoulli bandit. If the Gaussian prior distribution and likelihood function are sufficiently diffuse, this increase grows at a rate which is at most linear in the square-root of the time horizon, and thus the per-timestep increase vanishes. Our results formalize the folklore that so-called Bayesian agents remain effective when instantiated with diffuse misspecified distributions.

cs.LG↗

arXiv2021

Robust Convergence in Federated Learning through Label-wise Clustering

Non-IID dataset and heterogeneous environment of the local clients are regarded as a major issue in Federated Learning (FL), causing a downturn in the convergence without achieving satisfactory performance. In this paper, we propose a novel Label-wise clustering algorithm that guarantees the trainability among geographically dispersed heterogeneous local clients, by selecting only the local models trained with a dataset that approximates into uniformly distributed class labels, which is likely to obtain faster minimization of the loss and increment the accuracy among the FL network. Through conducting experiments on the suggested six common non-IID scenarios, we empirically show that the vanilla FL aggregation model is incapable of gaining robust convergence generating biased pre-trained local models and drifting the local weights to mislead the trainability in the worst case. Moreover, we quantitatively estimate the expected performance of the local models before training, which offers a global server to select the optimal clients, saving additional computational costs. Ultimately, in order to gain resolution of the non-convergence in such non-IID situations, we design clustering algorithms based on local input class labels, accommodating the diversity and assorting clients that could lead the overall system to attain the swift convergence as global training continues. Our paper shows that proposed Label-wise clustering demonstrates prompt and robust convergence compared to other FL algorithms when local training datasets are non-IID or coexist with IID through multiple experiments.

cs.LG↗

arXiv2020

Low-loss Zero-Index Materials

Materials with a zero refractive index support electromagnetic modes that exhibit stationary phase profiles. While such materials have been realized across the visible and near-infrared spectral range, radiative and dissipative optical losses have hindered their development. We reduce losses in zero-index, on-chip photonic crystals by introducing high-Q resonances via resonance-trapped and symmetry-protected states. Using these approaches, we experimentally obtain quality factors of 2.6*10^3 and 7.8*10^3 at near-infrared wavelengths, corresponding to an order-of-magnitude reduction in propagation loss over previous designs. Our work presents a viable approach to fabricate zero-index on-chip nanophotonic devices with low-loss.

physics.optics↗