Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 140461 - 140490 of 1826613

Full-Text Articles in Entire DC Network

Interpregnancy Interval And Adverse Perinatal Outcomes: A Within-Individual Comparative Method, Maria Sevoyan, Marco Geraci, Edward A. Frongillo, Jihong Liu, Nansi S. Boghossian Aug 2024

Interpregnancy Interval And Adverse Perinatal Outcomes: A Within-Individual Comparative Method, Maria Sevoyan, Marco Geraci, Edward A. Frongillo, Jihong Liu, Nansi S. Boghossian

Faculty Publications

Background and Aim: Previously observed associations between interpregnancy interval (IPI) and perinatal outcomes using a between-individual method may be confounded by unmeasured maternal factors. This study aims to examine the association between IPI and adverse perinatal outcomes using within-individual comparative analyses. Methods: We studied 10,647 individuals from the National Institute of Child Health and Human Development Consecutive Pregnancies Study in Utah with ≥3 liveborn singleton pregnancies. We matched two IPIs per individual and used conditional logistic regression to examine the association between IPI and adverse perinatal outcomes, including preterm birth (PTB, < 37 weeks’ gestation), small-for-gestational-age (SGA, < 10th percentile of sex-specific birthweight for gestational age), low birthweight (LBW, < 2,500 g), and neonatal intensive care unit (NICU) admission. Point and 95% confidence interval (CI) estimates were adjusted for factors that vary across pregnancies within individuals. Results: CIs did not unequivocally support either an increase or a decrease in the odds of PTB (adjusted odds ratio [aOR]: 1.31, 95% CI: 0.87, 1.96), SGA (aOR: 0.81, 95% CI: 0.51, 1.28), LBW (aOR: 1.59, 95% CI: 0.90, 2.80), or NICU admission (aOR: 0.96, 95% CI: 0.66, 1.40) for an IPI < 6 months compared to 18–23-months IPI (reference), and neither did the CIs for the aOR of IPIs of 6–11 and 12–18 months compared to the reference. In contrast, an IPI ≥24 months was associated with increased odds of LBW (aOR: 1.66, 95% CI: 1.03, 2.66 for 24–29 months; aOR: 2.27, 95% CI: 1.21, 4.29 for 30–35 months; and aOR: 2.09, 95% CI: 1.17, 3.72 for ≥36 months). Conclusions: Using a within-individual comparative method, we did not find evidence that a short IPI compared to the recommended IPI of 18–23 months was associated with increased odds of PTB, SGA, LBW, and NICU admission. IPI ≥ 24 months was associated with increased odds of delivering an LBW infant.

Go to article

Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao Aug 2024

Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao

Research Collection School Of Computing and Information Systems

This paper studies the problem in transportation networks and introduces a novel reinforcement learning-based algorithm, namely. Different from almost all canonical sota solutions, which are usually computationally expensive and lack generalizability to unforeseen destination nodes, segac offers the following appealing characteristics. segac updates the ego vehicle’s navigation policy in a sample efficient manner, reduces the variance of both value network and policy network during training, and is automatically adaptive to new destinations. Furthermore, the pre-trained segac policy network enables its real-time decision-making ability within seconds, outperforming state-of-the-art sota algorithms in simulations across various transportation networks. We also successfully deploy segac …

Go to article

Anopas: Practical Anonymous Transit Pass From Group Signatures With Time-Bound Keys, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Hwee Hwa Pang, Robert H. Deng Aug 2024

Anopas: Practical Anonymous Transit Pass From Group Signatures With Time-Bound Keys, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

An anonymous transit pass system allows passengers to access transport services within fixed time periods, with their privileges automatically deactivating upon time expiration. Although existing transit pass systems are deployable on powerful devices like PCs, their adaptation to more user-friendly devices, such as mobile phones with smart cards, is inefficient due to their reliance on heavy-weight operations like bilinear maps. In this paper, we introduce an innovative anonymous transit pass system, dubbed Anopas, optimized for deployment on mobile phones with smart cards, where the smart card is responsible for crucial lightweight operations and the mobile phone handles key-independent and time-consuming …

Go to article

An Llm-Assisted Easy-To-Trigger Poisoning Attack On Code Completion Models: Injecting Disguised Vulnerabilities Against Strong Detection, Shenao Yan, Shen Wang, Yue Duan, Hanbin Hong, Kiho Lee, Doowon Kim, Yuan Hong Aug 2024

An Llm-Assisted Easy-To-Trigger Poisoning Attack On Code Completion Models: Injecting Disguised Vulnerabilities Against Strong Detection, Shenao Yan, Shen Wang, Yue Duan, Hanbin Hong, Kiho Lee, Doowon Kim, Yuan Hong

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have transformed code completion tasks, providing context-based suggestions to boost developer productivity in software engineering. As users often fine-tune these models for specific applications, poisoning and backdoor attacks can covertly alter the model outputs. To address this critical security challenge, we introduce CODEBREAKER, a pioneering LLM-assisted backdoor attack framework on code completion models. Unlike recent attacks that embed malicious payloads in detectable or irrelevant sections of the code (e.g., comments), CODEBREAKER leverages LLMs (e.g., GPT-4) for sophisticated payload transformation (without affecting functionalities), ensuring that both the poisoned data for fine-tuning and generated code can evade strong …

Go to article

Neural Network Semantic Backdoor Detection And Mitigation: A Causality-Based Approach, Bing Sun, Jun Sun, Wayne Koh, Jie Shi Aug 2024

Neural Network Semantic Backdoor Detection And Mitigation: A Causality-Based Approach, Bing Sun, Jun Sun, Wayne Koh, Jie Shi

Research Collection School Of Computing and Information Systems

Different from ordinary backdoors in neural networks which are introduced with artificial triggers (e.g., certain specific patch) and/or by tampering the samples, semantic backdoors are introduced by simply manipulating the semantic, e.g., by labeling green cars as frogs in the training set. By focusing on samples with rare semantic features (such as green cars), the accuracy of the model is often minimally affected. Since the attacker is not required to modify the input sample during training nor inference time, semantic backdoors are challenging to detect and remove. Existing backdoor detection and mitigation techniques are shown to be ineffective with respect …

Go to article

Style: Improving Domain Transferability Of Asking Clarification Questions In Large Language Model Powered Conversational Agents, Yue Chen, Chen Huang, Yang Deng, Wenqiang Lei, Dingnan Jin, Jia Liu, Tat-Seng Chua Aug 2024

Style: Improving Domain Transferability Of Asking Clarification Questions In Large Language Model Powered Conversational Agents, Yue Chen, Chen Huang, Yang Deng, Wenqiang Lei, Dingnan Jin, Jia Liu, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Equipping a conversational search engine with strategies regarding when to ask clarification questions is becoming increasingly important across various domains. Attributing to the context understanding capability of LLMs and their access to domain-specific sources of knowledge, LLM-based clarification strategies feature rapid transfer to various domains in a posthoc manner. However, they still struggle to deliver promising performance on unseen domains, struggling to achieve effective domain transferability. We take the first step to investigate this issue and existing methods tend to produce one-size-fits-all strategies across diverse domains, limiting their search effectiveness. In response, we introduce a novel method, called STYLE, to …

Go to article

Chain-Of-Exemplar: Enhancing Distractor Generation For Multimodal Educational Question Generation, Haohao Luo, Yang Deng, Ying Shen, See-Kiong Ng, Tat-Seng Chua Aug 2024

Chain-Of-Exemplar: Enhancing Distractor Generation For Multimodal Educational Question Generation, Haohao Luo, Yang Deng, Ying Shen, See-Kiong Ng, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Multiple-choice questions (MCQs) are important in enhancing concept learning and student engagement for educational purposes. Despite the multimodal nature of educational content, current methods focus mainly on text-based inputs and often neglect the integration of visual information. In this work, we study the problem of multimodal educational question generation, which aims at generating subject-specific educational questions with plausible yet incorrect distractors based on multimodal educational content. To tackle this problem, we introduce a novel framework, named Chain-of-Exemplar (CoE), which utilizes multimodal large language models (MLLMs) with Chain-of-Thought reasoning to improve the generation of challenging distractors. Furthermore, CoE leverages three-stage contextualized …

Go to article

On The Multi-Turn Instruction Following For Conversational Web Agents, Yang Deng, Xuan Zhang, Wenxuan Zhang, Yifei Yuan, See-Kiong Ng, Tat-Seng Chua Aug 2024

On The Multi-Turn Instruction Following For Conversational Web Agents, Yang Deng, Xuan Zhang, Wenxuan Zhang, Yifei Yuan, See-Kiong Ng, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Web agents powered by Large Language Models (LLMs) have demonstrated remarkable abilities in planning and executing multi-step interactions within complex web-based environments, fulfilling a wide range of web navigation tasks. Despite these advancements, the potential for LLM-powered agents to effectively engage with sequential user instructions in real-world scenarios has not been fully explored. In this work, we introduce a new task of Conversational Web Navigation, which necessitates sophisticated interactions that span multiple turns with both the users and the environment, supported by a specially developed dataset named Multi-Turn Mind2Web (MT-Mind2Web). To tackle the limited context length of LLMs and the …

Go to article

Watme: Towards Lossless Watermarking Through Lexical Redundancy, Liang Chen, Yatao Bian, Yang Deng, Deng Cai, Shuaiyi Li, Peilin Zhao, Kam-Fai Wong Aug 2024

Watme: Towards Lossless Watermarking Through Lexical Redundancy, Liang Chen, Yatao Bian, Yang Deng, Deng Cai, Shuaiyi Li, Peilin Zhao, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Text watermarking has emerged as a pivotal technique for identifying machine-generated text. However, existing methods often rely on arbitrary vocabulary partitioning during decoding to embed watermarks, which compromises the availability of suitable tokens and significantly degrades the quality of responses. This study assesses the impact of watermarking on different capabilities of large language models (LLMs) from a cognitive science lens. Our finding highlights a significant disparity; knowledge recall and logical reasoning are more adversely affected than language generation. These results suggest a more profound effect of watermarking on LLMs than previously understood. To address these challenges, we introduce Watermarking with …

Go to article

Clamber: A Benchmark Of Identifying And Clarifying Ambiguous Information Needs In Large Language Models, Tong Zhang, Peixin Qin, Yang Deng, Chen Huang, Wenqiang Lei, Junhong Liu, Dingnan Jin, Hongru Liang, Tat-Seng Chua Aug 2024

Clamber: A Benchmark Of Identifying And Clarifying Ambiguous Information Needs In Large Language Models, Tong Zhang, Peixin Qin, Yang Deng, Chen Huang, Wenqiang Lei, Junhong Liu, Dingnan Jin, Hongru Liang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Large language models (LLMs) are increasingly used to meet user information needs, but their effectiveness in dealing with user queries that contain various types of ambiguity remains unknown, ultimately risking user trust and satisfaction. To this end, we introduce CLAMBER, a benchmark for evaluating LLMs using a well-organized taxonomy. Building upon the taxonomy, we construct 12K high-quality data to assess the strengths, weaknesses, and potential risks of various off-the-shelf LLMs.Our findings indicate the limited practical utility of current LLMs in identifying and clarifying ambiguous user queries, even enhanced by chain-of-thought (CoT) and few-shot prompting. These techniques may result in overconfidence …

Go to article

Self-Chats From Large Language Models Make Small Emotional Support Chatbot Better, Zhonghua Zheng, Lizi Liao, Yang Deng, Libo Qin, Liqiang Nie Aug 2024

Self-Chats From Large Language Models Make Small Emotional Support Chatbot Better, Zhonghua Zheng, Lizi Liao, Yang Deng, Libo Qin, Liqiang Nie

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have shown strong generalization abilities to excel in various tasks, including emotion support conversations. However, deploying such LLMs like GPT-3 (175B parameters) is resource-intensive and challenging at scale. In this study, we utilize LLMs as “Counseling Teacher” to enhance smaller models’ emotion support response abilities, significantly reducing the necessity of scaling up model size. To this end, we first introduce an iterative expansion framework, aiming to prompt the large teacher model to curate an expansive emotion support dialogue dataset. This curated dataset, termed ExTES, encompasses a broad spectrum of scenarios and is crafted with meticulous strategies …

Go to article

A New Hope: Contextual Privacy Policies For Mobile Applications And An Approach Toward Automated Generation, Shidong Pan, Zhen Tao, Thong Hoang, Dawen Zhang, Tianshi Li, Zhenchang Xing, Xiwei Xu, Mark Staples, Thierry Rakotoarivelo, David Lo Aug 2024

A New Hope: Contextual Privacy Policies For Mobile Applications And An Approach Toward Automated Generation, Shidong Pan, Zhen Tao, Thong Hoang, Dawen Zhang, Tianshi Li, Zhenchang Xing, Xiwei Xu, Mark Staples, Thierry Rakotoarivelo, David Lo

Research Collection School Of Computing and Information Systems

Privacy policies have emerged as the predominant approach to conveying privacy notices to mobile application users. In an effort to enhance both readability and user engagement, the concept of contextual privacy policies (CPPs) has been proposed by researchers. The aim of CPPs is to fragment privacy policies into concise snippets, displaying them only within the corresponding contexts within the application’s graphical user interfaces (GUIs). In this paper, we first formulate CPP in mobile application scenario, and then present a novel multimodal framework, named SEEPRIVACY, specifically designed to automatically generate CPPs for mobile applications. This method uniquely integrates vision-based GUI understanding …

Go to article

G2face: High-Fidelity Reversible Face Anonymization Via Generative And Geometric Priors, Haoxin Yang, Xuemiao Xu, Cheng Xu, Huaidong Zhang, Jing Qin, Yi Wang, Pheng-Ann Heng, Shengfeng He Aug 2024

G2face: High-Fidelity Reversible Face Anonymization Via Generative And Geometric Priors, Haoxin Yang, Xuemiao Xu, Cheng Xu, Huaidong Zhang, Jing Qin, Yi Wang, Pheng-Ann Heng, Shengfeng He

Research Collection School Of Computing and Information Systems

Reversible face anonymization, unlike traditional face pixelization, seeks to replace sensitive identity information in facial images with synthesized alternatives, preserving privacy without sacrificing image clarity. Traditional methods, such as encoder-decoder networks, often result in significant loss of facial details due to their limited learning capacity. Additionally, relying on latent manipulation in pre-trained GANs can lead to changes in ID-irrelevant attributes, adversely affecting data utility due to GAN inversion inaccuracies. This paper introduces G 2 Face, which leverages both generative and geometric priors to enhance identity manipulation, achieving high-quality reversible face anonymization without compromising data utility. We utilize a 3D face …

Go to article

Exponential Qubit Reduction In Optimization For Financial Transaction Settlement, Elias X. Huber, Benjamin Y. L. Tan, Paul Robert Griffin, Dimitris G. Angelakis Aug 2024

Exponential Qubit Reduction In Optimization For Financial Transaction Settlement, Elias X. Huber, Benjamin Y. L. Tan, Paul Robert Griffin, Dimitris G. Angelakis

Research Collection School Of Computing and Information Systems

We extend the qubit-efficient encoding presented in (Tan et al. in Quantum 5:454, 2021) and apply it to instances of the financial transaction settlement problem constructed from data provided by a regulated financial exchange. Our methods are directly applicable to any QUBO problem with linear inequality constraints. Our extension of previously proposed methods consists of a simplification in varying the number of qubits used to encode correlations as well as a new class of variational circuits which incorporate symmetries thereby reducing sampling overhead, improving numerical stability and recovering the expression of the cost objective as a Hermitian observable. We also …

Go to article

Interpretable Tensor Fusion, Saurabh Varshneya, Antoine Ledent, Philipp Liznerski, Andriy Balinskyy, Purvanshi Mehta, Waleed Mustafa, Marius Kloft Aug 2024

Interpretable Tensor Fusion, Saurabh Varshneya, Antoine Ledent, Philipp Liznerski, Andriy Balinskyy, Purvanshi Mehta, Waleed Mustafa, Marius Kloft

Research Collection School Of Computing and Information Systems

Conventional machine learning methods are predominantly designed to predict outcomes based on a single data type. However, practical applications may encompass data of diverse types, such as text, images, and audio. We introduce interpretable tensor fusion (InTense), a multimodal learning method training a neural network to simultaneously learn multiple data representations and their interpretable fusion. InTense can separately capture both linear combinations and multiplicative interactions of the data types, thereby disentangling higher-order interactions from the individual effects of each modality. InTense provides interpretability out of the box by assigning relevance scores to modalities and their associations, respectively. The approach is …

Go to article

Cross-Problem Learning For Solving Vehicle Routing Problems, Zhuoyi Lin, Yaoxin Wu, Bangjian Zhou, Zhiguang Cao, Wen Song, Yingqian Zhang, Senthilnath Jayavelu Aug 2024

Cross-Problem Learning For Solving Vehicle Routing Problems, Zhuoyi Lin, Yaoxin Wu, Bangjian Zhou, Zhiguang Cao, Wen Song, Yingqian Zhang, Senthilnath Jayavelu

Research Collection School Of Computing and Information Systems

Existing neural heuristics often train a deep architecture from scratch for each specific vehicle routing problem (VRP), ignoring the transferable knowledge across different VRP variants. This paper proposes the cross-problem learning to assist heuristics training for different downstream VRP variants. Particularly, we modularize neural architectures for complex VRPs into 1) the backbone Transformer for tackling the travelling salesman problem (TSP), and 2) the additional lightweight modules for processing problem-specific features in complex VRPs. Accordingly, we propose to pre-train the backbone Transformer for TSP, and then apply it in the process of fine-tuning the Transformer models for each target VRP variant. …

Go to article

Hierarchical Neural Constructive Solver For Real-World Tsp Scenarios, Yong Liang Goh, Zhiguang Cao, Yining Ma, Yanfei Dong, Mohammed Haroon Dupty, Wee Sun Lee Aug 2024

Hierarchical Neural Constructive Solver For Real-World Tsp Scenarios, Yong Liang Goh, Zhiguang Cao, Yining Ma, Yanfei Dong, Mohammed Haroon Dupty, Wee Sun Lee

Research Collection School Of Computing and Information Systems

Existing neural constructive solvers for routing problems have predominantly employed transformer architectures, conceptualizing the route construction as a set-to-sequence learning task. However, their efficacy has primarily been demonstrated on entirely random problem instances that inadequately capture real-world scenarios. In this paper, we introduce realistic Traveling Salesman Problem (TSP) scenarios relevant to industrial settings and derive the following insights: (1) The optimal next node (or city) to visit often lies within proximity to the current node, suggesting the potential benefits of biasing choices based on current locations. (2) Effectively solving the TSP requires robust tracking of unvisited nodes and warrants succinct …

Go to article

Certified Policy Verification And Synthesis For Mdps Under Distributional Reach-Avoidance Properties, S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic Aug 2024

Certified Policy Verification And Synthesis For Mdps Under Distributional Reach-Avoidance Properties, S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic

Research Collection School Of Computing and Information Systems

Markov Decision Processes (MDPs) are a classical model for decision making in the presence of uncertainty. Often they are viewed as state transformers with planning objectives defined with respect to paths over MDP states. An increasingly popular alternative is to view them as distribution transformers, giving rise to a sequence of probability distributions over MDP states. For instance, reachability and safety properties in modeling robot swarms or chemical reaction networks are naturally defined in terms of probability distributions over states. Verifying such distributional properties is known to be hard and often beyond the reach of classical state-based verification techniques. In …

Go to article

Peep With A Mirror: Breaking The Integrity Of Android App Sandboxing Via Unprivileged Cache Side Channel, Yan Lin, Joshua Wong, Xiang Li, Haoyu Ma, Debin Gao Aug 2024

Peep With A Mirror: Breaking The Integrity Of Android App Sandboxing Via Unprivileged Cache Side Channel, Yan Lin, Joshua Wong, Xiang Li, Haoyu Ma, Debin Gao

Research Collection School Of Computing and Information Systems

Application sandboxing is a well-established security principle employed in the Android platform to safeguard sensitive information. However, hardware resources, specifically the CPU caches, are beyond the protection of this software-based mechanism, leaving room for potential side-channel attacks. Existing attacks against this particular weakness of app sandboxing mainly target shared components among apps, hence can only observe system-level program dynamics (such as UI tracing). In this work, we advance cache side-channel attacks by demonstrating the viability of non-intrusive and fine-grained probing across different app sandboxes, which have the potential to uncover app-specific and private program behaviors, thereby highlighting the importance of …

Go to article

Fuel-Saving Route Planning With Data-Driven And Learning-Based Approaches: A Systematic Solution For Harbor Tugs, Shengming Wang, Xiaocai Zhang, Jing Li, Xiaoyang Wei, Hoong Chuin Lau, Bing Tian Dai, Binbin Huang Huang, Zhe Xiao, Xiuju Fu, Zheng Qin Aug 2024

Fuel-Saving Route Planning With Data-Driven And Learning-Based Approaches: A Systematic Solution For Harbor Tugs, Shengming Wang, Xiaocai Zhang, Jing Li, Xiaoyang Wei, Hoong Chuin Lau, Bing Tian Dai, Binbin Huang Huang, Zhe Xiao, Xiuju Fu, Zheng Qin

Research Collection School Of Computing and Information Systems

In recent years, there are trends toward cleaner port environments through enforcement by imposed legislation. Transit optimisation of fuel-based port service boats like harbour tugs has emerged as a critical task to reduce fuel consumption and carbon emission. In this paper, an innovative learning-based method, comprising a Reinforcement Learning (RL) model together with a fuel consumption prediction model, was proposed to formulate fuel-saving transit routes. Firstly, an ensemble model is established by combining a Long Short-Term Memory (LSTM) model with a Multilayer Perceptron (MLP) model, predicting fuel use based on tugboat movement and environment factors. Subsequently, an innovative RL based …

Go to article

Anopay: Anonymous Payment For Vehicle Parking With Updatable Credential, Yang Yang, Wenyi Xue, Yonghua Zhan, Minming Huang, Yingjiu Li, Robert H. Deng Aug 2024

Anopay: Anonymous Payment For Vehicle Parking With Updatable Credential, Yang Yang, Wenyi Xue, Yonghua Zhan, Minming Huang, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Many existing anonymous parking payment schemes lack high efficiency and flexibility. For instance, the calculation and communication costs involved in payment may linearly increase with the payment amount. In this paper, we propose an anonymous payment system (dubbed AnoPay) for vehicle parking, which leverages updatable attribute-based anonymous credentials and efficient zero-knowledge proof (ZKP) to achieve user anonymity and constant overhead for parking fee payment. To further improve the efficiency, we design a secure parking fee aggregation protocol based on linear homomorphic encryption to aggregate parking transactions, where the amount of each parking transaction is hidden and the privacy of the …

Go to article

Is Aggregation The Only Choice? Federated Learning Via Layer-Wise Model Recombination, Ming Hu, Zhihao Yue, Xiaofei Xie, Cheng Chen Chen Aug 2024

Is Aggregation The Only Choice? Federated Learning Via Layer-Wise Model Recombination, Ming Hu, Zhihao Yue, Xiaofei Xie, Cheng Chen Chen

Research Collection School Of Computing and Information Systems

Although Federated Learning (FL) enables global model training Xiaofei Xie [email protected] Singapore Management University Singapore, Singapore Xian Wei [email protected] East China Normal University Shanghai, China Mingsong Chen∗ [email protected] East China Normal University Shanghai, China • Computing methodologies → Distributed artificial intelligence. across clients without compromising their raw data, due to the unevenly distributed data among clients, existing Federated Averaging (FedAvg)-based methods suffer from the problem of low inference performance. Specifically, different data distributions among clients lead to various optimization directions of local models. Aggregating local models usually results in a low-generalized global model, which performs worse on most of the …

Go to article

A Learned Generalized Geodesic Distance Function-Based Approach For Node Feature Augmentation On Graphs, Amitoz Azad, Yuan Fang Aug 2024

A Learned Generalized Geodesic Distance Function-Based Approach For Node Feature Augmentation On Graphs, Amitoz Azad, Yuan Fang

Research Collection School Of Computing and Information Systems

Geodesic distances on manifolds have numerous applications in image processing, computer graphics and computer vision. In this work, we introduce an approach called 'LGGD' (Learned Generalized Geodesic Distances). This method involves generating node features by learning a generalized geodesic distance function through a training pipeline that incorporates training data, graph topology and the node content features. The strength of this method lies in the proven robustness of the generalized geodesic distances to noise and outliers. Our contributions encompass improved performance in node classification tasks, competitive results with state-of-the-art methods on real-world graph datasets, the demonstration of the learnability of parameters …

Go to article

Heterogeneous Graph Transformer With Poly-Tokenization, Zhiyuan Lu, Yuan Fang, Cheng Yang, Chuan Shi Aug 2024

Heterogeneous Graph Transformer With Poly-Tokenization, Zhiyuan Lu, Yuan Fang, Cheng Yang, Chuan Shi

Research Collection School Of Computing and Information Systems

Graph neural networks have shown widespread success for learning on graphs, but they still face fundamental drawbacks, such as limited expressive power, over-smoothing, and over-squashing. Meanwhile, the transformer architecture offers a potential solution to these issues. However, existing graph transformers primarily cater to homogeneous graphs and are unable to model the intricate semantics of heterogeneous graphs. Moreover, unlike small molecular graphs where the entire graph can be considered as the receptive field in graph transformers, real-world heterogeneous graphs comprise a significantly larger number of nodes and cannot be entirely treated as such. Consequently, existing graph transformers struggle to capture the …

Go to article

Robust Asynchronous Federated Learning With Time-Weighted And Stale Model Aggregation, Yinbin Miao, Ziteng Liu, Xinghua Li, Meng Li, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng Aug 2024

Robust Asynchronous Federated Learning With Time-Weighted And Stale Model Aggregation, Yinbin Miao, Ziteng Liu, Xinghua Li, Meng Li, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

Federated Learning (FL) ensures collaborative learning among multiple clients while maintaining data locally. However, the traditional synchronous FL solutions have lower accuracy and require more communication time in scenarios where most devices drop out during learning. Therefore, we propose an Asynchronous Federated Learning (AsyFL) scheme using time-weighted and stale model aggregation, which effectively solves the problem of poor model performance due to the heterogeneity of devices. Then, we integrate Symmetric Homomorphic Encryption (SHE) into AsyFL to propose Asynchronous Privacy-Preserving Federated Learning (Asy-PPFL), which protects the privacy of clients and achieves lightweight computing. Privacy analysis shows that Asy-PPFL is indistinguishable under …

Go to article

Planning Like Human : A Dual-Process Framework For Dialogue Planning, Tao He, Lizi Liao, Yixin Cao, Yuanxing Liu, Ming Liu, Zerui Chen, Bing Qin Aug 2024

Planning Like Human : A Dual-Process Framework For Dialogue Planning, Tao He, Lizi Liao, Yixin Cao, Yuanxing Liu, Ming Liu, Zerui Chen, Bing Qin

Research Collection School Of Computing and Information Systems

In proactive dialogue, the challenge lies not just in generating responses but in steering conversations toward predetermined goals, a task where Large Language Models (LLMs) typically struggle due to their reactive nature. Traditional approaches to enhance dialogue planning in LLMs, ranging from elaborate prompt engineering to the integration of policy networks, either face efficiency issues or deliver suboptimal performance. Inspired by the dual-process theory in psychology, which identifies two distinct modes of thinking—intuitive (fast) and analytical (slow), we propose the Dual-Process Dialogue Planning (DPDP) framework. DPDP embodies this theory through two complementary planning systems: an instinctive policy model for familiar …

Go to article

Analyzing Temporal Complex Events With Large Language Models? A Benchmark Towards Temporal, Long Context Understanding, Zhihan Zhang, Yixin Cao, Chenchen Ye, Ma. Yunshan, Lizi Liao, Tat-Seng Chua Aug 2024

Analyzing Temporal Complex Events With Large Language Models? A Benchmark Towards Temporal, Long Context Understanding, Zhihan Zhang, Yixin Cao, Chenchen Ye, Ma. Yunshan, Lizi Liao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

The digital landscape is rapidly evolving with an ever-increasing volume of online news, emphasizing the need for swift and precise analysis of complex events.We refer to the complex events composed of many news articles over an extended period as Temporal Complex Event (TCE). This paper proposes a novel approach using Large Language Models (LLMs) to systematically extract and analyze the event chain within TCE, characterized by their key points and timestamps. We establish a benchmark, named TCELongBench, to evaluate the proficiency of LLMs in handling temporal dynamics and understanding extensive text. This benchmark encompasses three distinct tasks - reading comprehension, …

Go to article

Synergizing Large Language Models And Pre-Trained Smaller Models For Conversational Intent Discovery, Jinggui Liang, Lizi Liao, Hao Fei, Jing Jiang Aug 2024

Synergizing Large Language Models And Pre-Trained Smaller Models For Conversational Intent Discovery, Jinggui Liang, Lizi Liao, Hao Fei, Jing Jiang

Research Collection School Of Computing and Information Systems

In Conversational Intent Discovery (CID), Small Language Models (SLMs) struggle with overfitting to familiar intents and fail to label newly discovered ones. This issue stems from their limited grasp of semantic nuances and their intrinsically discriminative framework. Therefore, we propose Synergizing Large Language Models (LLMs) with pre-trained SLMs for CID (SynCID). It harnesses the profound semantic comprehension of LLMs alongside the operational agility of SLMs. By utilizing LLMs to refine both utterances and existing intent labels, SynCID significantly enhances the semantic depth, subsequently realigning these enriched descriptors within the SLMs’ feature space to correct cluster distortion and promote robust learning …

Go to article

Reachability-Aware Fair Influence Maximization, Wenyue Ma, Maximilian K. Egger, Andreas Pavlogiannis, Yuchen Li, Panagiotis Karras Aug 2024

Reachability-Aware Fair Influence Maximization, Wenyue Ma, Maximilian K. Egger, Andreas Pavlogiannis, Yuchen Li, Panagiotis Karras

Research Collection School Of Computing and Information Systems

How can we ensure that an information dissemination campaign reaches every corner of society and also achieves high overall reach? The problem of maximizing the spread of influence over a social network has commonly been considered with an aggregate objective. Less attention has been paid to achieving equality of opportunity, reducing information barriers, and ensuring that everyone in the network has a fair chance to be reached. To that end, the fairness objective aims to maximize the minimum probability of reaching an individual. To address this inapproximable problem, past research has proposed heuristics, which, however, perform less well when the …

Go to article

Firm-Level Ai Ethical Awareness: Measurement And Effects, Yan Ma, Nan Hu Aug 2024

Firm-Level Ai Ethical Awareness: Measurement And Effects, Yan Ma, Nan Hu

Research Collection School Of Computing and Information Systems

With rapid integration of AI technologies into business operation, ethical issues associated with AI development, implementation, and deployment, has become increasingly conspicuous. An effective measure of firm-level AI Ethical Awareness (FAIEA) is crucial for both academics and practitioners to assess FAIEA efficiently. In this study, based on qualitative information in earning conference call, we construct and validate a firm specific measure of FAIEA. Upon establishing a reliable measure, we explore the determinants and consequence of FAIEA. We find Corporate Social Responsibility (CSR) engagement and the presence of a Chief Information Officer (CIO) as key determinants of higher FAIEA, suggesting the …

Go to article

First Prev Next Last