Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (9373)
- Social and Behavioral Sciences (9192)
- Computer Sciences (9065)
- Business (6916)
- International and Area Studies (3689)
-
- Asian Studies (3597)
- Databases and Information Systems (3567)
- Economics (2446)
- Law (2307)
- Software Engineering (2227)
- Artificial Intelligence and Robotics (1922)
- Finance and Financial Management (1291)
- Public Affairs, Public Policy and Public Administration (1144)
- Information Security (1120)
- Sociology (1117)
- Engineering (1102)
- Psychology (1081)
- Organizational Behavior and Theory (1064)
- Numerical Analysis and Scientific Computing (1060)
- Graphics and Human Computer Interfaces (959)
- Accounting (917)
- Education (903)
- Econometrics (824)
- Communication (823)
- Technology and Innovation (821)
- Strategic Management Policy (732)
- Arts and Humanities (692)
- Corporate Finance (665)
- Political Science (665)
- Higher Education (599)
- Keyword
-
- Singapore (1058)
- China (354)
- Singapore Management University (275)
- Innovation (206)
- COVID-19 (178)
-
- Machine learning (176)
- Artificial intelligence (145)
- Social media (137)
- Deep learning (135)
- Sustainability (130)
- Higher education (129)
- Corporate governance (117)
- Culture (113)
- Asia (110)
- Technology (109)
- Trust (97)
- Pandemic (92)
- Creativity (85)
- Performance (84)
- Well-being (84)
- Leadership (83)
- Education (81)
- Privacy (78)
- Climate change (77)
- Data mining (77)
- Reinforcement learning (74)
- India (73)
- Collaboration (72)
- Marketing (71)
- Southeast Asia (70)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8722)
- Research Collection Lee Kong Chian School Of Business (3273)
- Research Collection School of Social Sciences (2262)
- Research Collection Yong Pung How School Of Law (2078)
- Research Collection School Of Economics (1760)
-
- Dissertations and Theses Collection (Open Access) (894)
- Research Collection School Of Accountancy (816)
- Perspectives@SMU (663)
- Research Collection College of Integrative Studies (534)
- Knowledge@SMU (403)
- Asian Management Insights (317)
- SMU Press Releases and News (243)
- Research Collection Library (223)
- Social Space (210)
- Research Collection Institute of Service Excellence (2007-2024) (85)
- Sim Kee Boon Institute for Financial Economics (62)
- Oral History Collection (50)
- Singapore Law Journal (Lexicon) (50)
- Digital Narratives of Asia (46)
- Dissertations and Theses Collection (45)
- Research@SMU: Connecting the Dots (45)
- Research Collection BNP Paribas Hedge Fund Centre (37)
- ROSA Research Briefs (34)
- Report to Stakeholders (25)
- Lien Centre for Social Innovation: Research (22)
- Research Collection Lee Kong Chian School of Business (22)
- Research Collection Office of Impact (21)
- CCX Research (20)
- Friends of the Museum Collection (20)
- SMU Corporate Reports (19)
- Publication Type
- File Type
Articles 2341 - 2370 of 23255
Full-Text Articles in Entire DC Network
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
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 …
Informativeness Of Key Audit Matters: Evidence From China, Beng Wee Goh, Kiat Bee Jimmy Lee, Dan Li, Muzhi Wang
Informativeness Of Key Audit Matters: Evidence From China, Beng Wee Goh, Kiat Bee Jimmy Lee, Dan Li, Muzhi Wang
Research Collection School Of Accountancy
This study examines whether the key audit matters (KAMs) disclosed in expanded audit reports as a part of recent regulatory reforms are informative for investors in an emerging economy setting. Using the recent adoption of expanded audit reports for firms listed exclusively in Mainland China, we find robust evidence that the abnormal trading volume and earnings response coefficients (ERCs) are higher and that stock price synchronicity is lower during the postadoption than preadoption period. In additional tests, we find evidence that KAMs are more informative for non-state-owned enterprises (non-SOEs), smaller firms, and firms with a smaller analyst following. Finally, we …
Simc 2.0: Improved Secure Ml Inference Against Malicious Clients, Guowen Xu, Xingshuo Han, Tianwei Zhang, Shengmin Xu, Jianting Ning, Xinyi Huang, Hongwei Li, Deng, Robert H.
Simc 2.0: Improved Secure Ml Inference Against Malicious Clients, Guowen Xu, Xingshuo Han, Tianwei Zhang, Shengmin Xu, Jianting Ning, Xinyi Huang, Hongwei Li, Deng, Robert H.
Research Collection School Of Computing and Information Systems
In this paper, we study the problem of secure ML inference against a malicious client and a semi-trusted server such that the client only learns the inference output while the server learns nothing. This problem is first formulated by Lehmkuhl et al. with a solution (MUSE, Usenix Security’21), whose performance is then substantially improved by Chandran et al.'s work (SIMC, USENIX Security’22). However, there still exists a nontrivial gap in these efforts towards practicality, giving the challenges of overhead reduction and secure inference acceleration in an all-round way. Based on this, we propose SIMC 2.0, which complies with the underlying …
Gamification In Erp Systems: A Study On Intrinsic Motivation And User Behavioral Intentions, Esi Adeborna, Fiona Fui-Hoon Nah, Luvai Motiwalla
Gamification In Erp Systems: A Study On Intrinsic Motivation And User Behavioral Intentions, Esi Adeborna, Fiona Fui-Hoon Nah, Luvai Motiwalla
Research Collection School Of Computing and Information Systems
In the evolving landscape of Enterprise Resource Planning (ERP) systems, integrating gamification shows promise for enhancing user training and education. However, empirical research on gamification's effect on intrinsic motivation in using ERP is limited. Hence, we examined the intrinsic motivational effects of a gamified ERP environment in this research. We created a Gamified Web Application linked to SAP ERP to investigate how gamification affects users' behavioral intention. Leveraging self-determination theory, we examined the influence of perceived competence, autonomy, and relatedness on usage intent. In a controlled experiment with 63 participants, data collected via survey revealed that gamification enhances perceived competence, …
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
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 …
Chain-Of-Exemplar: Enhancing Distractor Generation For Multimodal Educational Question Generation, Haohao Luo, Yang Deng, Ying Shen, See-Kiong Ng, Tat-Seng Chua
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 …
Self-Chats From Large Language Models Make Small Emotional Support Chatbot Better, Zhonghua Zheng, Lizi Liao, Yang Deng, Libo Qin, Liqiang Nie
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 …
Ee-Lce: An Event Extraction Framework Based On Llm-Generated Cot Explanation, Yanhua Yu, Yuanlong Wang, Yunshan Ma, Jie Li, Kangkang Lu, Zhiyong Huang, Tat-Seng Chua
Ee-Lce: An Event Extraction Framework Based On Llm-Generated Cot Explanation, Yanhua Yu, Yuanlong Wang, Yunshan Ma, Jie Li, Kangkang Lu, Zhiyong Huang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Generative models have been widely used in event extraction. However, the interpretability of event extraction has not been fully investigated. In this paper, we propose an Event Extraction framework based on LLM-generated CoT Explanation EE-LCE, which can generate chain-of-thought-style (CoT-style) explanations for events. To this end, we provide each sample of event datasets with an explanation of the reasoning process using a large language model (LLM) GPT-3.5, and fine-tune the Flan-T5 lightweight language model (LM) supervised by the augmented dataset, enhancing both interpretability and performance of the event extraction. Moreover, we use a prefix tree (trie) to normalize the decoding …
Watme: Towards Lossless Watermarking Through Lexical Redundancy, Liang Chen, Yatao Bian, Yang Deng, Deng Cai, Shuaiyi Li, Peilin Zhao, Kam-Fai Wong
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 …
Enabling Sustainable Freight Forwarding Network Via Collaborative Games, Pang Jin Tan, Shih-Fen Cheng, Richard Chen
Enabling Sustainable Freight Forwarding Network Via Collaborative Games, Pang Jin Tan, Shih-Fen Cheng, Richard Chen
Research Collection School Of Computing and Information Systems
Freight forwarding plays a crucial role in facilitating global trade and logistics. However, as the freight forwarding market is extremely fragmented, freight forwarders often face the issue of not being able to fill the available shipping capacity. This recurrent issue motivates the creation of various freight forwarding networks that aim at exchanging capacities and demands so that the resource utilization of individual freight forwarders can be maximized. In this paper, we focus on how to design such a collaborative network based on collaborative game theory, with the Shapley value representing a fair scheme for profit sharing. Noting that the exact …
Hierarchical Neural Constructive Solver For Real-World Tsp Scenarios, Yong Liang Goh, Zhiguang Cao, Yining Ma, Yanfei Dong, Mohammed Haroon Dupty, Wee Sun Lee
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 …
Retirement And Life Satisfaction Among Middle-Aged And Older Adults: A Piecewise Growth Mixture Analysis, Jonathan L. Chia, Andree Hartanto, William Tov
Retirement And Life Satisfaction Among Middle-Aged And Older Adults: A Piecewise Growth Mixture Analysis, Jonathan L. Chia, Andree Hartanto, William Tov
Research Collection School of Social Sciences
Retirement represents a significant life transition typically occurring in later adulthood, often accompanied by substantial lifestyle changes. Several theoretical frameworks suggest that these changes present both opportunities and challenges for well-being, and the extent to which individuals experience positive versus negative well-being outcomes may be influenced by various factors. To study such heterogeneity in retirement experiences, researchers have embraced person-centered methodologies. Yet, some previous studies have not robustly delineated retirement- from age-related changes in well-being, accounted for statistical uncertainties, or examined these diverse experiences outside of a Western context. These limitations preclude conclusions about the diverse experience of retirement. Using …
Buy Now Pay (Pain?) Later, Ed Dehaan, Jungbae Kim, Ben Lourie, Chenqi Zhu
Buy Now Pay (Pain?) Later, Ed Dehaan, Jungbae Kim, Ben Lourie, Chenqi Zhu
Research Collection School Of Accountancy
“Buy-now-pay-later” (BNPL) is a relatively unregulated FinTech innovation that provides consumers with easy access to credit for retail purchases. BNPL spending is projected to reach $1 trillion by 2025, but we know little about its effects. Using banking data for10.6 million U.S. consumers, we investigate the effects of BNPL on leading indicators of users’ financial health. We find that new BNPL users experience rapid increases in bank overdraft charges and credit card interest and fees compared with nonusers, consistent with BNPL facilitating overborrowing. An instrumental variable exploiting consumers’ pre-BNPL shopping habits bolsters our inferences. Our results inform regulatory investigations into …
How Can Cbdcs Be Designed To Drive Financial Inclusion?, Heng Wang
How Can Cbdcs Be Designed To Drive Financial Inclusion?, Heng Wang
Research Collection Yong Pung How School Of Law
As a new form of national currency, central bank digital currencies (CBDCs) hold the potential to be a transformative innovation that can enhance financial inclusion. However, the realization of this potential is very much contingent on their design. The realization of the benefit is also influenced by the barriers to financial inclusion that were identified in our first blog such as financial literacy, digital divide, and complexity.
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
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 …
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
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 …
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
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 …
Exponential Qubit Reduction In Optimization For Financial Transaction Settlement, Elias X. Huber, Benjamin Y. L. Tan, Paul Robert Griffin, Dimitris G. Angelakis
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 …
Cross-Problem Learning For Solving Vehicle Routing Problems, Zhuoyi Lin, Yaoxin Wu, Bangjian Zhou, Zhiguang Cao, Wen Song, Yingqian Zhang, Senthilnath Jayavelu
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. …
Certified Policy Verification And Synthesis For Mdps Under Distributional Reach-Avoidance Properties, S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic
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 …
Decoding Gpt Mania In Chinese Stock Market, Yan Ma, Nan Hu, Shuyang Jia
Decoding Gpt Mania In Chinese Stock Market, Yan Ma, Nan Hu, Shuyang Jia
Research Collection School Of Computing and Information Systems
This study investigates the impact of investor attention on stock market reactions to ChatGPT using dialogues on the Chinese interactive investor platforms (IIPs). We measure investor attention by the number of investors’ questions toward ChatGPT on the IIPs and categorize the firms’ answers as Investing, Speculative, and Absent. The research reveals positive and statistically significant market reactions surrounding the initial questions that occur before firm responses. Positive abnormal returns are also observed around the initial answer dates, with Investing firms evoking the highest market response, followed by Speculative firms, and Absent firms exhibiting the lowest reactions. Our results suggest that …
Self-Adaptive Psro : Towards An Automatic Population-Based Game Solver, Pengdeng Li, Shuxin Li, Chang Yang, Xinrun Wang, Xiao Huang, Hau Chan, Bo An
Self-Adaptive Psro : Towards An Automatic Population-Based Game Solver, Pengdeng Li, Shuxin Li, Chang Yang, Xinrun Wang, Xiao Huang, Hau Chan, Bo An
Research Collection School Of Computing and Information Systems
Policy-Space Response Oracles (PSRO) as a general algorithmic framework has achieved state-of-the-art performance in learning equilibrium policies of two-player zero-sum games. However, the hand-crafted hyperparameter value selection in most of the existing works requires extensive domain knowledge, forming the main barrier to applying PSRO to different games. In this work, we make the first attempt to investigate the possibility of self-adaptively determining the optimal hyperparameter values in the PSRO framework. Our contributions are three-fold: (1) Using several hyperparameters, we propose a parametric PSRO that unifies the gradient descent ascent (GDA) and different PSRO variants. (2) We propose the self-adaptive PSRO …
A Multimodal Foundation Agent For Financial Trading : Tool-Augmented, Diversified, And Generalist, Wentao Zhang, Lingxuan Zhao, Haochong Xia, Shuo Sun, Jiaze Sun, Molei Qin, Xinyi Li, Yuqing Zhao, Yilei Zhao, Xinyu Cai, Longtao Zheng, Xinrun Wang, Bo An
A Multimodal Foundation Agent For Financial Trading : Tool-Augmented, Diversified, And Generalist, Wentao Zhang, Lingxuan Zhao, Haochong Xia, Shuo Sun, Jiaze Sun, Molei Qin, Xinyi Li, Yuqing Zhao, Yilei Zhao, Xinyu Cai, Longtao Zheng, Xinrun Wang, Bo An
Research Collection School Of Computing and Information Systems
Financial trading is a crucial component of the markets, informed by a multimodal information landscape encompassing news, prices, and Kline charts, and encompasses diverse tasks such as quantitative trading and high-frequency trading with various assets. While advanced AI techniques like deep learning and reinforcement learning are extensively utilized in finance, their application in financial trading tasks often faces challenges due to inadequate handling of multimodal data and limited generalizability across various tasks. To address these challenges, we present FinAgent, a multimodal foundational agent with tool augmentation for financial trading. FinAgent's market intelligence module processes a diverse range of data-numerical, textual, …
Macrohft : Memory Augmented Context-Aware Reinforcement Learning On High Frequency Trading, Chuqiao Zong, Chaojie Wang, Molei Qin, Lei Feng, Xinrun Wang, Xinrun Wang
Macrohft : Memory Augmented Context-Aware Reinforcement Learning On High Frequency Trading, Chuqiao Zong, Chaojie Wang, Molei Qin, Lei Feng, Xinrun Wang, Xinrun Wang
Research Collection School Of Computing and Information Systems
High-frequency trading (HFT) that executes algorithmic trading in short time scales, has recently occupied the majority of cryptocurrency market. Besides traditional quantitative trading methods, reinforcement learning (RL) has become another appealing approach for HFT due to its terrific ability of handling high-dimensional financial data and solving sophisticated sequential decision-making problems, e.g., hierarchical reinforcement learning (HRL) has shown its promising performance on second-level HFT by training a router to select only one sub-agent from the agent pool to execute the current transaction. However, existing RL methods for HFT still have some defects: 1) standard RL-based trading agents suffer from the overfitting …
Reinforcement Tuning For Detecting Stances And Debunking Rumors Jointly With Large Language Models, Ruichao Yang, Wei Gao, Jing Ma, Hongzhan Ling, Bo Wang
Reinforcement Tuning For Detecting Stances And Debunking Rumors Jointly With Large Language Models, Ruichao Yang, Wei Gao, Jing Ma, Hongzhan Ling, Bo Wang
Research Collection School Of Computing and Information Systems
Learning multi-task models for jointly detecting stance and verifying rumors poses challenges due to the need for training data of stance at post level and rumor veracity at claim level, which are difficult to obtain. To address this issue, we leverage large language models (LLMs) as the foundation annotators for the joint stance detection (SD) and rumor verification (RV) tasks, dubbed as JSDRV. We introduce a novel reinforcement tuning framework to enhance the joint predictive capabilities of LLM-based SD and RV components. Specifically, we devise a policy for selecting LLM-annotated data at the two levels, employing a hybrid reward mechanism …
Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An
Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An
Research Collection School Of Computing and Information Systems
Nash Equilibrium (NE) is the canonical solution concept of game theory, which provides an elegant tool to understand the rationalities. Though mixed strategy NE exists in any game with finite players and actions, computing NE in two- or multi-player general-sum games is PPAD-Complete. Various alternative solutions, e.g., Correlated Equilibrium (CE), and learning methods, e.g., fictitious play (FP), are proposed to approximate NE. For convenience, we call these methods as "inexact solvers", or "solvers" for short. However, the alternative solutions differ from NE and the learning methods generally fail to converge to NE. Therefore, in this work, we propose REinforcement Nash …
The Fourth International Workshop On Smart Data For Blockchain And Distributed Ledger (Sdbd '24), Feida Zhu, Jian Pei, Michael Zeller, Bingxue Zhang
The Fourth International Workshop On Smart Data For Blockchain And Distributed Ledger (Sdbd '24), Feida Zhu, Jian Pei, Michael Zeller, Bingxue Zhang
Research Collection School Of Computing and Information Systems
With the advent of Bitcoin, a cryptographically-enabled peer-to-peer digital payment system, blockchain together with a whole package of distributed ledger technologies, which serve as the underlying foundation of all the crypto-currencies, have been gaining attention from both academia and industry in the last fifteen years. The recent years have witnessed tremendous momentum in the development of blockchain and distributed ledger technologies, largely due to the impressive rise in the market capital of these digital tokens. More and more industries, from banking and insurance, to supply chain and e-commerce, are quickly realizing the great potential in blockchain technology in efficiency boost, …
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
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 …
How To Avoid Jumping To Conclusions: Measuring The Robustness Of Outstanding Facts In Knowledge Graphs, Hanhua Xiao, Yuchen Li, Yanhao Wang, Panagiotis Karras, Kyriakos Mouratidis, Natalia Rozalia Avlona
How To Avoid Jumping To Conclusions: Measuring The Robustness Of Outstanding Facts In Knowledge Graphs, Hanhua Xiao, Yuchen Li, Yanhao Wang, Panagiotis Karras, Kyriakos Mouratidis, Natalia Rozalia Avlona
Research Collection School Of Computing and Information Systems
An outstanding fact (OF) is a striking claim by which some entities stand out from their peers on someattribute. OFs serve data journalism, fact checking, and recommendation. However, one could jump to conclusions by selecting truthful OFs while intentionally or inadvertently ignoring lateral contexts and data that render them less striking. This jumping conclusion bias from unstable OFs may disorient the public, including voters and consumers, raising concerns about fairness and transparency in political and business competition. It is thus ethically imperative for several stakeholders to measure the robustness of OFs with respect to lateral contexts and data. Unfortunately, a …
Heterogeneous Graph Transformer With Poly-Tokenization, Zhiyuan Lu, Yuan Fang, Cheng Yang, Chuan Shi
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 …