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

Physical Sciences and Mathematics Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 661 - 690 of 7446

Full-Text Articles in Physical Sciences and Mathematics

How Does Credit Risk Affect Cost Management Strategies? Evidence On The Initiation Of Credit Default Swap And Sticky Cost Behavior, Jing Dai, Nan Hu, Rong Huang, Yan Yan Jun 2023

How Does Credit Risk Affect Cost Management Strategies? Evidence On The Initiation Of Credit Default Swap And Sticky Cost Behavior, Jing Dai, Nan Hu, Rong Huang, Yan Yan

Research Collection School Of Computing and Information Systems

In this paper, we examine the effect of credit defaults swaps (CDS) initiation on reference firms' cost management strategies. CDS contracts provide insurance protection for creditors, inducing a shift in bargaining power from borrowers to creditors and an excessive incidence of bankruptcy. Anticipating more intransigent creditors in debt renegotiations and higher bankruptcy risk, CDS firms are incentivized to mitigate risk through decreasing cost stickiness after CDS initiation, as cost stickiness lowers liquidity and triggers early covenant violations. We find that, on average, CDS initiation is associated with a decline in reference firms' cost stickiness. This association is more pronounced for …

Go to article

Glocal Energy-Based Learning For Few-Shot Open-Set Recognition, Haoyu Wang, Guansong Pang, Peng Wang, Lei Zhang, Wei Wei, Yanning Zhang Jun 2023

Glocal Energy-Based Learning For Few-Shot Open-Set Recognition, Haoyu Wang, Guansong Pang, Peng Wang, Lei Zhang, Wei Wei, Yanning Zhang

Research Collection School Of Computing and Information Systems

Few-shot open-set recognition (FSOR) is a challenging task of great practical value. It aims to categorize a sample to one of the pre-defined, closed-set classes illustrated by few examples while being able to reject the sample from unknown classes. In this work, we approach the FSOR task by proposing a novel energy-based hybrid model. The model is composed of two branches, where a classification branch learns a metric to classify a sample to one of closedset classes and the energy branch explicitly estimates the open-set probability. To achieve holistic detection of openset samples, our model leverages both class-wise and pixelwise …

Go to article

Class-Incremental Exemplar Compression For Class-Incremental Learning, Zilin Luo, Yaoyao Liu, Bernt Schiele, Qianru Sun Jun 2023

Class-Incremental Exemplar Compression For Class-Incremental Learning, Zilin Luo, Yaoyao Liu, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Exemplar-based class-incremental learning (CIL) finetunes the model with all samples of new classes but few-shot exemplars of old classes in each incremental phase, where the "few-shot" abides by the limited memory budget. In this paper, we break this "few-shot" limit based on a simple yet surprisingly effective idea: compressing exemplars by downsampling non-discriminative pixels and saving "many-shot" compressed exemplars in the memory. Without needing any manual annotation, we achieve this compression by generating 0-1 masks on discriminative pixels from class activation maps (CAM). We propose an adaptive mask generation model called class-incremental masking (CIM) to explicitly resolve two difficulties of …

Go to article

Extracting Class Activation Maps From Non-Discriminative Features As Well, Zhaozheng Chen, Qianru Sun Jun 2023

Extracting Class Activation Maps From Non-Discriminative Features As Well, Zhaozheng Chen, Qianru Sun

Research Collection School Of Computing and Information Systems

Extracting class activation maps (CAM) from a classification model often results in poor coverage on foreground objects, i.e., only the discriminative region (e.g., the “head” of “sheep”) is recognized and the rest (e.g., the “leg” of “sheep”) mistakenly as background. The crux behind is that the weight of the classifier (used to compute CAM) captures only the discriminative features of objects. We tackle this by introducing a new computation method for CAM that explicitly captures non-discriminative features as well, thereby expanding CAM to cover whole objects. Specifically, we omit the last pooling layer of the classification model, and perform clustering …

Go to article

Freestyle Layout-To-Image Synthesis, Han Xue, Zhiwu Huang, Qianru Sun, Li Song, Wenjun Zhang Jun 2023

Freestyle Layout-To-Image Synthesis, Han Xue, Zhiwu Huang, Qianru Sun, Li Song, Wenjun Zhang

Research Collection School Of Computing and Information Systems

Typical layout-to-image synthesis (LIS) models generate images for a close set of semantic classes, e.g., 182 common objects in COCO-Stuff. In this work, we explore the freestyle capability of the model, i.e., how far can it generate unseen semantics (e.g., classes, attributes, and styles) onto a given layout, and call the task Freestyle LIS (FLIS). Thanks to the development of large-scale pre-trained language-image models, a number of discriminative models (e.g., image classification and object detection) trained on limited base classes are empowered with the ability of unseen class prediction. Inspired by this, we opt to leverage large-scale pre-trained text-to-image diffusion …

Go to article

3d Dental Biometrics: Transformer-Based Dental Arch Extraction And Matching, Zhiyuan Zhang, Zhong Xin Jun 2023

3d Dental Biometrics: Transformer-Based Dental Arch Extraction And Matching, Zhiyuan Zhang, Zhong Xin

Research Collection School Of Computing and Information Systems

The dental arch is a significant anatomical feature that is crucial in assessing tooth arrangement and configuration and has a potential for human identification in biometrics and digital forensic dentistry. In a previous study, we proposed an auto pose-invariant arch feature extraction Radial Ray Algorithm (RRA) and a matching framework [1] based solely on 3D dental geometry. To enhance the identification accuracy and speed of our previous work, we propose in this study a transformer architecture that can extract dental keypoints by encoding both local and global features. The dental arch is then constructed through robust interpolation of the dental …

Go to article

Strategic Planning For Flexible Agent Availability In Large Taxi Fleets, Rajiv Ranjan Kumar, Pradeep Varakantham, Shih-Fen Cheng Jun 2023

Strategic Planning For Flexible Agent Availability In Large Taxi Fleets, Rajiv Ranjan Kumar, Pradeep Varakantham, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

In large scale multi-agent systems like taxi fleets, individual agents (taxi drivers) are self interested (maximizing their own profits) and this can introduce inefficiencies in the system. One such inefficiency is with regards to the "required" availability of taxis at different time periods during the day. Since a taxi driver can work for limited number of hours in a day (e.g., 8-10 hours in a city like Singapore), there is a need to optimize the specific hours, so as to maximize individual as well as social welfare. Technically, this corresponds to solving a large scale multi-stage selfish routing game with …

Go to article

Scanet: Self-Paced Semi-Curricular Attention Network For Non-Homogeneous Image Dehazing, Yu Guo, Yuan Gao, Ryan Wen Liu, Yuxu Lu, Jingxiang Qu, Shengfeng He, Ren Wenqi Jun 2023

Scanet: Self-Paced Semi-Curricular Attention Network For Non-Homogeneous Image Dehazing, Yu Guo, Yuan Gao, Ryan Wen Liu, Yuxu Lu, Jingxiang Qu, Shengfeng He, Ren Wenqi

Research Collection School Of Computing and Information Systems

The presence of non-homogeneous haze can cause scene blurring, color distortion, low contrast, and other degradations that obscure texture details. Existing homogeneous dehazing methods struggle to handle the non-uniform distribution of haze in a robust manner. The crucial challenge of non-homogeneous dehazing is to effectively extract the non-uniform distribution features and reconstruct the details of hazy areas with high quality. In this paper, we propose a novel self-paced semi-curricular attention network, called SCANet, for non-homogeneous image dehazing that focuses on enhancing haze-occluded regions. Our approach consists of an attention generator network and a scene re-construction network. We use the luminance …

Go to article

How To Resuscitate A Sick Vm In The Cloud, Xuhua Ding Jun 2023

How To Resuscitate A Sick Vm In The Cloud, Xuhua Ding

Research Collection School Of Computing and Information Systems

A guest virtual machine in a cloud platform may fall “sick” when its kernel encounters a fatal low-level bug or is subverted by an adversary. The VM owner is hence likely to lose her control over it due to a kernel hang or being denied of remote accesses. While the VM can be rebooted with the assistance from the cloud server, the owner not only faces service disruption but also is left with no opportunity to make an in-depth diagnosis and forensics on the spot, not to mention a live rectification. Currently, the cloud service provider has neither incentive nor …

Go to article

Semantic Scene Completion With Cleaner Self, Fengyun Wang, Dong Zhang, Hanwang Zhang, Jinhui Tang, Qianru Sun Jun 2023

Semantic Scene Completion With Cleaner Self, Fengyun Wang, Dong Zhang, Hanwang Zhang, Jinhui Tang, Qianru Sun

Research Collection School Of Computing and Information Systems

Semantic Scene Completion (SSC) transforms an image of single-view depth and/or RGB 2D pixels into 3D voxels, each of whose semantic labels are predicted. SSC is a well-known ill-posed problem as the prediction model has to “imagine” what is behind the visible surface, which is usually represented by Truncated Signed Distance Function (TSDF). Due to the sensory imperfection of the depth camera, most existing methods based on the noisy TSDF estimated from depth values suffer from 1) incomplete volumetric predictions and 2) confused semantic labels. To this end, we use the ground-truth 3D voxels to generate a perfect visible surface, …

Go to article

Unbiased Multiple Instance Learning For Weakly Supervised Video Anomaly Detection, Hui Lyu, Zhongqi Yue, Qianru Sun, Bin Luo, Zhen Cui, Hanwang Zhang Jun 2023

Unbiased Multiple Instance Learning For Weakly Supervised Video Anomaly Detection, Hui Lyu, Zhongqi Yue, Qianru Sun, Bin Luo, Zhen Cui, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Weakly Supervised Video Anomaly Detection (WSVAD) is challenging because the binary anomaly label is only given on the video level, but the output requires snippet-level predictions. So, Multiple Instance Learning (MIL) is prevailing in WSVAD. However, MIL is notoriously known to suffer from many false alarms because the snippet-level detector is easily biased towards the abnormal snippets with simple context, confused by the normality with the same bias, and missing the anomaly with a different pattern. To this end, we propose a new MIL framework: Unbiased MIL (UMIL), to learn unbiased anomaly features that improve WSVAD. At each MIL training …

Go to article

Livoauth: Liveness Detection In Voiceprint Authentication With Random Challenges And Detection Modes, Rui Zhang, Zheng Yan, Xueru Wang, Robert H. Deng Jun 2023

Livoauth: Liveness Detection In Voiceprint Authentication With Random Challenges And Detection Modes, Rui Zhang, Zheng Yan, Xueru Wang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Voiceprint authentication provides great convenience to users in many application scenarios. However, it easily suffers from spoofing attacks including speech synthesis, speech conversion, and speech replay. Liveness detection is an effective way to resist these attacks. But existing methods suffer from many disadvantages, such as extra deployment costs due to precise data collection, environmental disturbance, high computational overhead, and operational complexity. A uniform platform that can offer voiceprint authentication as a service (VAaS) over the cloud is also lacked. Hence, it is imperative to design an economic and effective method for liveness detection in voiceprint authentication. In this article, we …

Go to article

The Bemi Stardust: A Structured Ensemble Of Binarized Neural Networks, Ambrogio Maria Bernardelli, Stefano Gualandi, Hoong Chuin Lau, Simone Milanesi Jun 2023

The Bemi Stardust: A Structured Ensemble Of Binarized Neural Networks, Ambrogio Maria Bernardelli, Stefano Gualandi, Hoong Chuin Lau, Simone Milanesi

Research Collection School Of Computing and Information Systems

Binarized Neural Networks (BNNs) are receiving increasing attention due to their lightweight architecture and ability to run on low-power devices, given the fact that they can be implemented using Boolean operations. The state-of-the-art for training classification BNNs restricted to few-shot learning is based on a Mixed Integer Programming (MIP) approach. This paper proposes the BeMi ensemble, a structured architecture of classification-designed BNNs based on training a single BNN for each possible pair of classes and applying a majority voting scheme to predict the final output. The training of a single BNN discriminating between two classes is achieved by a MIP …

Go to article

Imitating Opponent To Win: Adversarial Policy Imitation Learning In Two-Player Competitive Games, The Viet Bui, Tien Mai, Thanh H. Nguyen Jun 2023

Imitating Opponent To Win: Adversarial Policy Imitation Learning In Two-Player Competitive Games, The Viet Bui, Tien Mai, Thanh H. Nguyen

Research Collection School Of Computing and Information Systems

Recent research on vulnerabilities of deep reinforcement learning (RL) has shown that adversarial policies adopted by an adversary agent can influence a target RL agent (victim agent) to perform poorly in a multi-agent environment. In existing studies, adversarial policies are directly trained based on experiences of interacting with the victim agent. There is a key shortcoming of this approach --- knowledge derived from historical interactions may not be properly generalized to unexplored policy regions of the victim agent, making the trained adversarial policy significantly less effective. In this work, we design a new effective adversarial policy learning algorithm that overcomes …

Go to article

Groundnlq @ Ego4d Natural Language Queries Challenge 2023, Zhijian Hou, Lei Ji, Difei Gao, Wanjun Zhong, Kun Yan, Chong-Wah Ngo, Wing-Kwong Chan, Chong-Wah Ngo, Nan Duan, Mike Zheng Shou Jun 2023

Groundnlq @ Ego4d Natural Language Queries Challenge 2023, Zhijian Hou, Lei Ji, Difei Gao, Wanjun Zhong, Kun Yan, Chong-Wah Ngo, Wing-Kwong Chan, Chong-Wah Ngo, Nan Duan, Mike Zheng Shou

Research Collection School Of Computing and Information Systems

In this report, we present our champion solution for Ego4D Natural Language Queries (NLQ) Challenge in CVPR 2023. Essentially, to accurately ground in a video, an effective egocentric feature extractor and a powerful grounding model are required. Motivated by this, we leverage a two-stage pre-training strategy to train egocentric feature extractors and the grounding model on video narrations, and further fine-tune the model on annotated data. In addition, we introduce a novel grounding model GroundNLQ, which employs a multi-modal multiscale grounding module for effective video and text fusion and various temporal intervals, especially for long videos. On the blind test …

Go to article

Curricular Contrastive Regularization For Physics-Aware Single Image Dehazing, Yu Zheng, Jiahui Zhan, Shengfeng He, Yong Du Jun 2023

Curricular Contrastive Regularization For Physics-Aware Single Image Dehazing, Yu Zheng, Jiahui Zhan, Shengfeng He, Yong Du

Research Collection School Of Computing and Information Systems

Considering the ill-posed nature, contrastive regularization has been developed for single image dehazing, introducing the information from negative images as a lower bound. However, the contrastive samples are non-consensual, as the negatives are usually represented distantly from the clear (i.e., positive) image, leaving the solution space still under-constricted. Moreover, the interpretability of deep dehazing models is underexplored towards the physics of the hazing process. In this paper, we propose a novel curricular contrastive regularization targeted at a consensual contrastive space as opposed to a non-consensual one. Our negatives, which provide better lower-bound constraints, can be assembled from 1) the hazy …

Go to article

Where Is My Spot? Few-Shot Image Generation Via Latent Subspace Optimization, Chenxi Zheng, Bangzhen Liu, Huaidong Zhang, Xuemiao Xu, Shengfeng He Jun 2023

Where Is My Spot? Few-Shot Image Generation Via Latent Subspace Optimization, Chenxi Zheng, Bangzhen Liu, Huaidong Zhang, Xuemiao Xu, Shengfeng He

Research Collection School Of Computing and Information Systems

Image generation relies on massive training data that can hardly produce diverse images of an unseen category according to a few examples. In this paper, we address this dilemma by projecting sparse few-shot samples into a continuous latent space that can potentially generate infinite unseen samples. The rationale behind is that we aim to locate a centroid latent position in a conditional StyleGAN, where the corresponding output image on that centroid can maximize the similarity with the given samples. Although the given samples are unseen for the conditional StyleGAN, we assume the neighboring latent subspace around the centroid belongs to …

Go to article

Towards A Smaller Student: Capacity Dynamic Distillation For Efficient Image Retrieval, Yi Xie, Huaidong Zhang, Xuemiao Xu, Jianqing Zhu, Shengfeng He Jun 2023

Towards A Smaller Student: Capacity Dynamic Distillation For Efficient Image Retrieval, Yi Xie, Huaidong Zhang, Xuemiao Xu, Jianqing Zhu, Shengfeng He

Research Collection School Of Computing and Information Systems

Previous Knowledge Distillation based efficient image retrieval methods employ a lightweight network as the student model for fast inference. However, the lightweight student model lacks adequate representation capacity for effective knowledge imitation during the most critical early training period, causing final performance degeneration. To tackle this issue, we propose a Capacity Dynamic Distillation framework, which constructs a student model with editable representation capacity. Specifically, the employed student model is initially a heavy model to fruitfully learn distilled knowledge in the early training epochs, and the student model is gradually compressed during the training. To dynamically adjust the model capacity, our …

Go to article

Venus: A Geometrical Representation For Quantum State Visualization, Shaolun Ruan, Ribo Yuan, Qiang Guan, Yanna Lin, Ying Mao, Weiwen Jiang, Zhepeng Wang, Wei Xu, Yong Wang Jun 2023

Venus: A Geometrical Representation For Quantum State Visualization, Shaolun Ruan, Ribo Yuan, Qiang Guan, Yanna Lin, Ying Mao, Weiwen Jiang, Zhepeng Wang, Wei Xu, Yong Wang

Research Collection School Of Computing and Information Systems

Visualizations have played a crucial role in helping quantum computing users explore quantum states in various quantum computing applications. Among them, Bloch Sphere is the widely-used visualization for showing quantum states, which leverages angles to represent quantum amplitudes. However, it cannot support the visualization of quantum entanglement and superposition, the two essential properties of quantum computing. To address this issue, we propose VENUS, a novel visualization for quantum state representation. By explicitly correlating 2D geometric shapes based on the math foundation of quantum computing characteristics, VENUS effectively represents quantum amplitudes of both the single qubit and two qubits for quantum …

Go to article

Efficient Privacy-Preserving Spatial Range Query Over Outsourced Encrypted Data, Yinbin Miao, Yutao Yang, Xinghua Li, Zhiquan Liu, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng Jun 2023

Efficient Privacy-Preserving Spatial Range Query Over Outsourced Encrypted Data, Yinbin Miao, Yutao Yang, Xinghua Li, Zhiquan Liu, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

With the rapid development of Location-Based Services (LBS), a large number of LBS providers outsource spatial data to cloud servers to reduce their high computational and storage burdens, but meanwhile incur some security issues such as location privacy leakage. Thus, extensive privacy-preserving LBS schemes have been proposed. However, the existing solutions using Bloom filter do not take into account the redundant bits that do not map information in Bloom filter, resulting in high computational overheads, and reveal the inclusion relationship in Bloom filter. To solve these issues, we propose an efficient Privacy-preserving Spatial Range Query (PSRQ) scheme by skillfully combining …

Go to article

Privacy-Preserving Ranked Spatial Keyword Query In Mobile Cloud-Assisted Fog Computing, Qiuyun Tong, Yinbin Li Miao, Ximeng Liu, Robert H. Deng, Robert H. Deng Jun 2023

Privacy-Preserving Ranked Spatial Keyword Query In Mobile Cloud-Assisted Fog Computing, Qiuyun Tong, Yinbin Li Miao, Ximeng Liu, Robert H. Deng, Robert H. Deng

Research Collection School Of Computing and Information Systems

With the increasing popularity of GPS-equipped mobile devices in cloud-assisted fog computing scenarios, massive spatio-textual data is generated and outsourced to cloud servers for storage and analysis. Existing privacy-preserving range query or ranked keyword search schemes does not support a unified index, and are just applicable for the symmetric environment where all users sharing the same secret key. To solve this issue, we propose a Privacy-preserving Ranked Spatial keyword Query in mobile cloud-assisted Fog computing (PRSQ-F). Specifically, we design a novel comparable product encoding strategy that combines both spatial and textual conditions tightly to retrieve the objects in query range …

Go to article

Mosaic: Spatially-Multiplexed Edge Ai Optimization Over Multiple Concurrent Video Sensing Streams, Ila Gokarn, Hemanth Sabbella, Yigong Hu, Tarek Abdelzaher, Archan Misra Jun 2023

Mosaic: Spatially-Multiplexed Edge Ai Optimization Over Multiple Concurrent Video Sensing Streams, Ila Gokarn, Hemanth Sabbella, Yigong Hu, Tarek Abdelzaher, Archan Misra

Research Collection School Of Computing and Information Systems

Sustaining high fidelity and high throughput of perception tasks over vision sensor streams on edge devices remains a formidable challenge, especially given the continuing increase in image sizes (e.g., generated by 4K cameras) and complexity of DNN models. One promising approach involves criticality-aware processing, where the computation is directed selectively to "critical" portions of individual image frames. We introduce MOSAIC, a novel system for such criticality-aware concurrent processing of multiple vision sensing streams that provides a multiplicative increase in the achievable throughput with negligible loss in perception fidelity. MOSAIC determines critical regions from images received from multiple vision …

Go to article

Preference-Aware Delivery Planning For Last-Mile Logistics, Qian Shao, Shih-Fen Cheng Jun 2023

Preference-Aware Delivery Planning For Last-Mile Logistics, Qian Shao, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Optimizing delivery routes for last-mile logistics service is challenging and has attracted the attention of many researchers. These problems are usually modeled and solved as variants of vehicle routing problems (VRPs) with challenging real-world constraints (e.g., time windows, precedence). However, despite many decades of solid research on solving these VRP instances, we still see significant gaps between optimized routes and the routes that are actually preferred by the practitioners. Most of these gaps are due to the difference between what's being optimized, and what the practitioners actually care about, which is hard to be defined exactly in many instances. In …

Go to article

Avoiding Starvation Of Arms In Restless Multi-Armed Bandit, Dexun Li, Pradeep Varakantham Jun 2023

Avoiding Starvation Of Arms In Restless Multi-Armed Bandit, Dexun Li, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Restless multi-armed bandits (RMAB) is a popular framework for optimizing performance with limited resources under uncertainty. It is an extremely useful model for monitoring beneficiaries (arms) and executing timely interventions using health workers (limited resources) to ensure optimal benefit in public health settings. For instance, RMAB has been used to track patients' health and monitor their adherence in tuberculosis settings, ensure pregnant mothers listen to automated calls about good pregnancy practices, etc. Due to the limited resources, typically certain individuals, communities, or regions are starved of interventions, which can potentially have a significant negative impact on the individual/community in the …

Go to article

Enhancing Third-Party Software Reliability Through Bug Bounty Programs, Tianlu Zhou, Dan Ma, Nan Feng Jun 2023

Enhancing Third-Party Software Reliability Through Bug Bounty Programs, Tianlu Zhou, Dan Ma, Nan Feng

Research Collection School Of Computing and Information Systems

Bug Bounty Programs (BBPs) reward external hackers for identifying and reporting software vulnerabilities. As the number of security issues caused by third-party applications has been significantly increased recently, many digital platforms are considering launching BBPs to help enhance the reliability of third-party software. BBPs bring benefits to the platform and vendors, meanwhile impose additional costs on them as well. As a result, the overall impact of using BBP is unclear. In this paper, we present an analytical model to examine the strategic decisions of launching and participating in a BBP for the platform and the third-party vendor, respectively. We find …

Go to article

Improving Quantal Cognitive Hierarchy Model Through Iterative Population Learning, Yuhong Xu, Shih-Fen Cheng, Xinyu Chen Jun 2023

Improving Quantal Cognitive Hierarchy Model Through Iterative Population Learning, Yuhong Xu, Shih-Fen Cheng, Xinyu Chen

Research Collection School Of Computing and Information Systems

In this paper, we propose to enhance the state-of-the-art quantal cognitive hierarchy (QCH) model with iterative population learning (IPL) to estimate the empirical distribution of agents’ reasoning levels and fit human agents’ behavioral data. We apply our approach to a real-world dataset from the Swedish lowest unique positive integer (LUPI) game and show that our proposed approach outperforms the theoretical Poisson Nash equilibrium predictions and the QCH approach by 49.8% and 46.6% in Wasserstein distance respectively. Our approach also allows us to explicitly measure an agent’s reasoning level distribution, which is not previously possible.

Go to article

Catching The Fast Payments Trend: Optimal Designs And Leadership Strategies Of Retail Payment And Settlement Systems, Zhiling Guo, Dan Ma Jun 2023

Catching The Fast Payments Trend: Optimal Designs And Leadership Strategies Of Retail Payment And Settlement Systems, Zhiling Guo, Dan Ma

Research Collection School Of Computing and Information Systems

Recent financial technologies have enabled fast payments and are reshaping retail payment and settlement systems globally. We developed an analytical model to study the optimal design of a new retail payment system in terms of settlement speed and system capability under both bank and fintech firm heterogeneous participation incentives. We found that three types of payment systems emerge as equilibrium outcomes: batch retail (BR), expedited retail (ER), and real-time retail (RR) payment systems. Although the base value of the payment service positively affects both settlement speed and system capability, the expected liquidity cost negatively impacts settlement speed, and total transaction …

Go to article

Towards Explaining Sequences Of Actions In Multi-Agent Deep Reinforcement Learning Models, Phyo Wai Khaing, Minghong Geng, Budhitama Subagdja, Shubham Pateria, Ah-Hwee Tan Jun 2023

Towards Explaining Sequences Of Actions In Multi-Agent Deep Reinforcement Learning Models, Phyo Wai Khaing, Minghong Geng, Budhitama Subagdja, Shubham Pateria, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Although Multi-agent Deep Reinforcement Learning (MADRL) has shown promising results in solving complex real-world problems, the applicability and reliability of MADRL models are often limited by a lack of understanding of their inner workings for explaining the decisions made. To address this issue, this paper proposes a novel method for explaining MADRL by generalizing the sequences of action events performed by agents into high-level abstract strategies using a spatio-temporal neural network model. Specifically, an interval-based memory retrieval procedure is developed to generalize the encoded sequences of action events over time into short sequential patterns. In addition, two abstraction algorithms are …

Go to article

A Mixed-Integer Linear Programming Reduction Of Disjoint Bilinear Programs Via Symbolic Variable Elimination, Jihwan Jeong, Scott Sanner, Akshat Kumar Jun 2023

A Mixed-Integer Linear Programming Reduction Of Disjoint Bilinear Programs Via Symbolic Variable Elimination, Jihwan Jeong, Scott Sanner, Akshat Kumar

Research Collection School Of Computing and Information Systems

A disjointly constrained bilinear program (DBLP) has various practical and industrial applications, e.g., in game theory, facility location, supply chain management, and multi-agent planning problems. Although earlier work has noted the equivalence of DBLP and mixed-integer linear programming (MILP) from an abstract theoretical perspective, a practical and exact closed-form reduction of a DBLP to a MILP has remained elusive. Such explicit reduction would allow us to leverage modern MILP solvers and techniques along with their solution optimality and anytime approximation guarantees. To this end, we provide the first constructive closed-form MILP reduction of a DBLP by extending the technique of …

Go to article

Evading Deepfake Detectors Via Adversarial Statistical Consistency, Yang Hou, Qing Guo, Yihao Huang, Xiaofei Xie, Lei Ma, Jianjun Zhao Jun 2023

Evading Deepfake Detectors Via Adversarial Statistical Consistency, Yang Hou, Qing Guo, Yihao Huang, Xiaofei Xie, Lei Ma, Jianjun Zhao

Research Collection School Of Computing and Information Systems

In recent years, as various realistic face forgery techniques known as DeepFake improves by leaps and bounds, more and more DeepFake detection techniques have been proposed. These methods typically rely on detecting statistical differences between natural (i.e., real) and DeepFake-generated images in both spatial and frequency domains. In this work, we propose to explicitly minimize the statistical differences to evade state-of-the-art DeepFake detectors. To this end, we propose a statistical consistency attack (StatAttack) against DeepFake detectors, which contains two main parts. First, we select several statistical-sensitive natural degradations (i.e., exposure, blur, and noise) and add them to the fake images …

Go to article

First Prev Next Last