Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (6878)
- Databases and Information Systems (2867)
- Software Engineering (1846)
- Artificial Intelligence and Robotics (989)
- Numerical Analysis and Scientific Computing (931)
-
- Information Security (895)
- Engineering (770)
- Graphics and Human Computer Interfaces (661)
- Social and Behavioral Sciences (586)
- Business (530)
- Theory and Algorithms (438)
- Computer Engineering (394)
- Operations Research, Systems Engineering and Industrial Engineering (358)
- Programming Languages and Compilers (287)
- OS and Networks (282)
- Communication (272)
- Social Media (220)
- Public Affairs, Public Policy and Public Administration (175)
- Data Storage Systems (157)
- Transportation (156)
- Medicine and Health Sciences (145)
- Management Information Systems (141)
- Education (126)
- E-Commerce (114)
- International and Area Studies (95)
- Asian Studies (94)
- Technology and Innovation (84)
- Health Information Technology (83)
- Finance and Financial Management (77)
- Keyword
-
- Deep learning (103)
- Machine learning (86)
- Social media (65)
- Data mining (56)
- Artificial intelligence (55)
-
- Cloud computing (55)
- Reinforcement learning (51)
- Optimization (49)
- Twitter (46)
- Visualization (46)
- Online learning (45)
- Privacy (45)
- Deep Learning (44)
- Empirical study (44)
- Security (44)
- Software engineering (44)
- Task analysis (44)
- Neural networks (43)
- Feature extraction (41)
- Singapore (40)
- Access control (39)
- Semantics (39)
- Algorithms (38)
- Blockchain (36)
- Classification (36)
- Anomaly detection (34)
- Clustering (34)
- Collaboration (34)
- Android (33)
- Software (32)
- Publication Year
- File Type
Articles 961 - 990 of 6891
Full-Text Articles in Physical Sciences and Mathematics
Legion: Massively Composing Rankers For Improved Bug Localization At Adobe, Darryl Jarman, Jeffrey Berry, Riley Smith, Ferdian Thung, David Lo
Legion: Massively Composing Rankers For Improved Bug Localization At Adobe, Darryl Jarman, Jeffrey Berry, Riley Smith, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Studies have estimated that, in industrial settings, developers spend between 30 and 90 percent of their time fixing bugs. As such, tools that assist in identifying the location of bugs provide value by reducing debugging costs. One such tool is BugLocator. This study initially aimed to determine if developers working on the Adobe Analytics product could use BugLocator. The initial results show that BugLocator achieves a similar accuracy on five of seven Adobe Analytics repositories and on open-source projects. However, these results do not meet the minimum applicability requirement deemed necessary by Adobe Analytics developers prior to possible adoption. Thus, …
Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, Supriyo Ghosh, Laura Wynter, Shiau Hong Lim, Duc Thien Nguyen
Neural-Progressive Hedging: Enforcing Constraints In Reinforcement Learning With Stochastic Programming, Supriyo Ghosh, Laura Wynter, Shiau Hong Lim, Duc Thien Nguyen
Research Collection School Of Computing and Information Systems
We propose a framework, called neural-progressive hedging (NP), that leverages stochastic programming during the online phase of executing a reinforcement learning (RL) policy. The goal is to ensure feasibility with respect to constraints and risk-based objectives such as conditional value-at-risk (CVaR) during the execution of the policy, using probabilistic models of the state transitions to guide policy adjustments. The framework is particularly amenable to the class of sequential resource allocation problems since feasibility with respect to typical resource constraints cannot be enforced in a scalable manner. The NP framework provides an alternative that adds modest overhead during the online phase. …
Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao
Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao
Research Collection School Of Computing and Information Systems
Estimating the time of arrival is a crucial task in intelligent transportation systems. Although considerable efforts have been made to solve this problem, most of them decompose a trajectory into several segments and then compute the travel time by integrating the attributes from all segments. The segment view, though being able to depict the local traffic conditions straightforwardly, is insufficient to embody the intrinsic structure of trajectories on the road network. To overcome the limitation, this study proposes multi-view trajectory representation that comprehensively interprets a trajectory from the segment-, link-, and intersection-views. To fulfill the purpose, we design a hierarchical …
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv
Research Collection School Of Computing and Information Systems
Learning based order dispatching has witnessed tremendous success in ride hailing. However, the success halts within individual ride hailing platforms because sharing raw order dispatching data across platforms may leak user privacy and business secrets. Such data isolation not only impairs user experience but also decreases the potential revenues of the platforms. In this paper, we advocate federated order dispatching for cross-platform ride hailing, where multiple platforms collaboratively make dispatching decisions without sharing their local data. Realizing this concept calls for new federated learning strategies that tackle the unique challenges on effectiveness, privacy and efficiency in the context of order …
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Research Collection School Of Computing and Information Systems
The lottery ticket hypothesis (LTH) states that a randomly initialized dense network contains sub-networks that can be trained in isolation to the performance of the dense network. In this paper, to achieve rapid learning with less computational cost, we explore LTH in the context of meta learning. First, we experimentally show that there are sparse sub-networks, known as meta winning tickets, which can be meta-trained to few-shot classification accuracy to the original backbone. The application of LTH in meta learning enables the adaptation of meta-trained networks on various IoT devices with fewer computation. However, the status quo to identify winning …
Variational Graph Author Topic Modeling, Ce Zhang, Hady Wirawan Lauw
Variational Graph Author Topic Modeling, Ce Zhang, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
While Variational Graph Auto-Encoder (VGAE) has presented promising ability to learn representations for documents, most existing VGAE methods do not model a latent topic structure and therefore lack semantic interpretability. Exploring hidden topics within documents and discovering key words associated with each topic allow us to develop a semantic interpretation of the corpus. Moreover, documents are usually associated with authors. For example, news reports have journalists specializing in writing certain type of events, academic papers have authors with expertise in certain research topics, etc. Modeling authorship information could benefit topic modeling, since documents by the same authors tend to reveal …
Multimodal Private Signatures, Khoa Nguyen, Fuchun Guo, Willy Susilo, Guomin Yang
Multimodal Private Signatures, Khoa Nguyen, Fuchun Guo, Willy Susilo, Guomin Yang
Research Collection School Of Computing and Information Systems
We introduce Multimodal Private Signature (MPS) - an anonymous signature system that offers a novel accountability feature: it allows a designated opening authority to learn some partial information op about the signer’s identity id, and nothing beyond. Such partial information can flexibly be defined as op = id (as in group signatures), or as op = 0 (like in ring signatures), or more generally, as op = Gj (id), where Gj (·) is a certain disclosing function. Importantly, the value of op is known in advance by the signer, and hence, the latter can decide whether she/he wants to disclose …
Destress: Computation-Optimal And Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization, Boyue Li, Zhize Li, Yuejie Chi
Destress: Computation-Optimal And Communication-Efficient Decentralized Nonconvex Finite-Sum Optimization, Boyue Li, Zhize Li, Yuejie Chi
Research Collection School Of Computing and Information Systems
Emerging applications in multiagent environments such as internet-of-things, networked sensing, autonomous systems, and federated learning, call for decentralized algorithms for finite-sum optimizations that are resource efficient in terms of both computation and communication. In this paper, we consider the prototypical setting where the agents work collaboratively to minimize the sum of local loss functions by only communicating with their neighbors over a predetermined network topology. We develop a new algorithm, called DEcentralized STochastic REcurSive gradient methodS (DESTRESS) for nonconvex finite-sum optimization, which matches the optimal incremental first-order oracle complexity of centralized algorithms for finding first-order stationary points, while maintaining communication …
Resumable Zero-Knowledge For Circuits From Symmetric Key Primitives, Handong Zhang, Puwen Wei, Haiyang Xue, Yi Deng, Jinsong Li, Wei Wang, Guoxiao Liu
Resumable Zero-Knowledge For Circuits From Symmetric Key Primitives, Handong Zhang, Puwen Wei, Haiyang Xue, Yi Deng, Jinsong Li, Wei Wang, Guoxiao Liu
Research Collection School Of Computing and Information Systems
Consider the scenario that the prover and the verifier perform the zero-knowledge (ZK) proof protocol for the same statement multiple times sequentially, where each proof is modeled as a session. We focus on the problem of how to resume a ZK proof efficiently in such scenario. We introduce a new primitive called resumable honest verifier zero-knowledge proof of knowledge (resumable HVZKPoK) and propose a general construction of the resumable HVZKPoK for circuits based on the “MPC-in-the-head" paradigm, where the complexity of the resumed session is less than that of the original ZK proofs. To ensure the knowledge soundness for the …
Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Submodularity And Local Search Approaches For Maximum Capture Problems Under Generalized Extreme Value Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study the maximum capture problem in facility location under random utility models, i.e., the problem of seeking to locate new facilities in a competitive market such that the captured user demand is maximized, assuming that each customer chooses among all available facilities according to a random utility maximization model. We employ the generalized extreme value (GEV) family of discrete choice models and show that the objective function in this context is monotonic and submodular. This finding implies that a simple greedy heuristic can always guarantee a (1−1/e) approximation solution. We further develop a new algorithm combining a greedy heuristic, …
Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng
Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng
Research Collection School Of Computing and Information Systems
With widespread deployment of GPS devices, massive spatiotemporal trajectories became more accessible. This booming trend paved the solid data ground for researchers to discover the regularities or patterns of human mobility. However, there are still three challenges in semantic pattern extraction including semantic absence, semantic bias and semantic complexity. In this paper, we invent and apply a novel data structure namely City Semantic Diagram to overcome above three challenges. First, our approach resolves semantic absence by exactly identifying semantic behaviours from raw trajectories. Second, the delicate design of semantic purification helps us to detect semantic complexity from human mobility. Third, …
Individually Rational Collaborative Vehicle Routing Through Give-And-Take Exchanges, Tran Phong, Paul Tang, Hoong Chuin Lau
Individually Rational Collaborative Vehicle Routing Through Give-And-Take Exchanges, Tran Phong, Paul Tang, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we are concerned with the automated exchange of orders between logistics companies in a marketplace platform to optimize total revenues. We introduce a novel multi-agent approach to this problem, focusing on the Collaborative Vehicle Routing Problem (CVRP) through the lens of individual rationality. Our proposed algorithm applies the principles of Vehicle Routing Problem (VRP) to pairs of vehicles from different logistics companies, optimizing the overall routes while considering standard VRP constraints plus individual rationality constraints. By facilitating cooperation among competing logistics agents through a Give-and-Take approach, we show that it is possible to reduce travel distance and …
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding
Research Collection School Of Computing and Information Systems
The lottery ticket hypothesis (LTH) states that a randomly initialized dense network contains sub-networks that can be trained in isolation to the performance of the dense network. In this paper, to achieve rapid learning with less computational cost, we explore LTH in the context of meta learning. First, we experimentally show that there are sparse sub-networks, known as meta winning tickets, which can be meta-trained to few-shot classification accuracy to the original backbone. The application of LTH in meta learning enables the adaptation of meta-trained networks on various IoT devices with fewer computation. However, the status quo to identify winning …
Sound And Complete Certificates For Quantitative Termination Analysis Of Probabilistic Programs, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic
Sound And Complete Certificates For Quantitative Termination Analysis Of Probabilistic Programs, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic
Research Collection School Of Computing and Information Systems
We consider the quantitative problem of obtaining lower-bounds on the probability of termination of a given non-deterministic probabilistic program. Specifically, given a non-termination threshold p∈[0,1], we aim for certificates proving that the program terminates with probability at least 1−p. The basic idea of our approach is to find a terminating stochastic invariant, i.e. a subset SI of program states such that (i) the probability of the program ever leaving SI is no more than p, and (ii) almost-surely, the program either leaves SI or terminates.While stochastic invariants are already well-known, we provide the first proof that the idea above is …
Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham
Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Restless Multi-Armed Bandits (RMAB) is an apt model to represent decision-making problems in public health interventions (e.g., tuberculosis, maternal, and child care), anti-poaching planning, sensor monitoring, personalized recommendations and many more. Existing research in RMAB has contributed mechanisms and theoretical results to a wide variety of settings, where the focus is on maximizing expected value. In this paper, we are interested in ensuring that RMAB decision making is also fair to different arms while maximizing expected value. In the context of public health settings, this would ensure that different people and/or communities are fairly represented while making public health intervention …
P-Meta: Towards On-Device Deep Model Adaptation, Zhongnan Qu, Zimu Zhou, Yongxin Tong, Lothar Thiele
P-Meta: Towards On-Device Deep Model Adaptation, Zhongnan Qu, Zimu Zhou, Yongxin Tong, Lothar Thiele
Research Collection School Of Computing and Information Systems
Data collected by IoT devices are often private and have a large diversity across users. Therefore, learning requires pre-training a model with available representative data samples, deploying the pre-trained model on IoT devices, and adapting the deployed model on the device with local data. Such an on-device adaption for deep learning empowered applications demands data and memory efficiency. However, existing gradient-based meta learning schemes fail to support memory-efficient adaptation. To this end, we propose p-Meta, a new meta learning method that enforces structure-wise partial parameter updates while ensuring fast generalization to unseen tasks. Evaluations on few-shot image classification and reinforcement …
Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham
Efficient Resource Allocation With Fairness Constraints In Restless Multi-Armed Bandits, Dexun Li, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Restless Multi-Armed Bandits (RMAB) is an apt model to represent decision-making problems in public health interventions (e.g., tuberculosis, maternal, and child care), anti-poaching planning, sensor monitoring, personalized recommendations and many more. Existing research in RMAB has contributed mechanisms and theoretical results to a wide variety of settings, where the focus is on maximizing expected value. In this paper, we are interested in ensuring that RMAB decision making is also fair to different arms while maximizing expected value. In the context of public health settings, this would ensure that different people and/or communities are fairly represented while making public health intervention …
Holistic Combination Of Structural And Textual Code Information For Context Based Api Recommendation, Chi Chen, Xin Peng, Zhengchang Xing, Jun Sun, Xin Wang, Yifan Zhao, Wenyun Zhao
Holistic Combination Of Structural And Textual Code Information For Context Based Api Recommendation, Chi Chen, Xin Peng, Zhengchang Xing, Jun Sun, Xin Wang, Yifan Zhao, Wenyun Zhao
Research Collection School Of Computing and Information Systems
Context based API recommendation is an important way to help developers find the needed APIs effectively and efficiently. For effective API recommendation, we need not only a joint view of both structural and textual code information, but also a holistic view of correlated API usage in control and data flow graph as a whole. Unfortunately, existing API recommendation methods exploit structural or textual code information separately. In this work, we propose a novel API recommendation approach called APIRec-CST (API Recommendation by Combining Structural and Textual code information). APIRec-CST is a deep learning model that combines the API usage with the …
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the QoS of the day. Our joint chance-constrained formulation is more rational capturing the correlation between different call types, as compared to separate chance-constrained versions considered in previous studies. We show that, in general, the probability functions in the joint-chance constraints display S-shaped curves, and the optimal solutions should belong to the concave …
Simple And Optimal Stochastic Gradient Methods For Nonsmooth Nonconvex Optimization, Zhize Li, Jian Li
Simple And Optimal Stochastic Gradient Methods For Nonsmooth Nonconvex Optimization, Zhize Li, Jian Li
Research Collection School Of Computing and Information Systems
We propose and analyze several stochastic gradient algorithms for finding stationary points or local minimum in nonconvex, possibly with nonsmooth regularizer, finite-sum and online optimization problems. First, we propose a simple proximal stochastic gradient algorithm based on variance reduction called ProxSVRG+. We provide a clean and tight analysis of ProxSVRG+, which shows that it outperforms the deterministic proximal gradient descent (ProxGD) for a wide range of minibatch sizes, hence solves an open problem proposed in Reddi et al. (2016b). Also, ProxSVRG+ uses much less proximal oracle calls than ProxSVRG (Reddi et al., 2016b) and extends to the online setting by …
Self-Adaptive Systems: A Systematic Literature Review Across Categories And Domains, Terence Wong, Markus Wagner, Christoph Treude
Self-Adaptive Systems: A Systematic Literature Review Across Categories And Domains, Terence Wong, Markus Wagner, Christoph Treude
Research Collection School Of Computing and Information Systems
Context: Championed by IBM’s vision of autonomic computing paper in 2003, the autonomic computing research field has seen increased research activity over the last 20 years. Several conferences (SEAMS, SASO, ICAC) and workshops (SISSY) have been established and have contributed to the autonomic computing knowledge base in search of a new kind of system — a self-adaptive system (SAS). These systems are characterized by being context-aware and can act on that awareness. The actions carried out could be on the system or on the context (or environment). The underlying goal of a SAS is the sustained achievement of its goals …
Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong
Self-Checking Deep Neural Networks For Anomalies And Adversaries In Deployment, Yan Xiao, Ivan Beschastnikh, Yun Lin, Rajdeep Singh Hundal, Xiaofei Xie, David S. Rosenblum, Jin Song Dong
Research Collection School Of Computing and Information Systems
Deep Neural Networks (DNNs) have been widely adopted, yet DNN models are surprisingly unreliable, which raises significant concerns about their use in critical domains. In this work, we propose that runtime DNN mistakes can be quickly detected and properly dealt with in deployment, especially in settings like self-driving vehicles. Just as software engineering (SE) community has developed effective mechanisms and techniques to monitor and check programmed components, our previous work, SelfChecker, is designed to monitor and correct DNN predictions given unintended abnormal test data. SelfChecker triggers an alarm if the decisions given by the internal layer features of the model …
Trajectory Optimization For Safe Navigation In Maritime Traffic Using Historical Data, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar
Trajectory Optimization For Safe Navigation In Maritime Traffic Using Historical Data, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar
Research Collection School Of Computing and Information Systems
Increasing maritime trade often results in congestion in busy ports, thereby necessitating planning methods to avoid close quarter risky situations among vessels. Rapid digitization and automation of port operations and vessel navigation provide unique opportunities for significantly improving navigation safety. Our key contributions are as follows. First, given a set of future candidate trajectories for vessels in a traffic hotspot zone, we develop a multiagent trajectory optimization method to choose trajectories that result in the best overall close quarter risk reduction. Our novel MILP-based optimization method is more than an order-of-magnitude faster than a standard MILP for this problem, and …
Mobile Health With Head-Worn Devices: Challenges And Opportunities, Andrea Ferlini, Dong Ma, Lorena Qendro, Cecilia Mascolo
Mobile Health With Head-Worn Devices: Challenges And Opportunities, Andrea Ferlini, Dong Ma, Lorena Qendro, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
Monitoring human behavior and health status using mobile devices, a.k.a. Mobile Health, has gained increasing attention from both academia and industry in recent years. It allows imperceptible health tracking from the users and remote health management from the healthcare service providers. Headworn devices, such as earbuds, glasses, and BCIs (Brain Computer Interfaces), exhibit great potential for mobile health due to their advantageous wearing position, the human head, which is motion-resilient and full of human bio-signals. Although initial attempts have been conducted for different healthcare applications with head-worn devices, this fast-growing area is still under-explored and retains great promises. With this …
A Low-Cost Virtual Coach For 2d Video-Based Compensation Assessment Of Upper Extremity Rehabilitation Exercises, Ana Rita Coias, Min Hun Lee, Alexandre Bernardino
A Low-Cost Virtual Coach For 2d Video-Based Compensation Assessment Of Upper Extremity Rehabilitation Exercises, Ana Rita Coias, Min Hun Lee, Alexandre Bernardino
Research Collection School Of Computing and Information Systems
Background: The increasing demands concerning stroke rehabilitation and in-home exercise promotion grew the need for affordable and accessible assistive systems to promote patients' compliance in therapy. These assistive systems require quantitative methods to assess patients' quality of movement and provide feedback on their performance. However, state-of-the-art quantitative assessment approaches require expensive motion-capture devices, which might be a barrier to the development of low-cost systems.Methods: In this work, we develop a low-cost virtual coach (VC) that requires only a laptop with a webcam to monitor three upper extremity rehabilitation exercises and provide real-time visual and audio feedback on compensatory motion patterns …
Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu
Automatic Noisy Label Correction For Fine-Grained Entity Typing, Weiran Pan, Wei Wei, Feida Zhu
Research Collection School Of Computing and Information Systems
Fine-grained entity typing (FET) aims to assign proper semantic types to entity mentions according to their context, which is a fundamental task in various entity-leveraging applications. Current FET systems usually establish on large-scale weaklysupervised/distantly annotation data, which may contain abundant noise and thus severely hinder the performance of the FET task. Although previous studies have made great success in automatically identifying the noisy labels in FET, they usually rely on some auxiliary resources which may be unavailable in real-world applications (e.g., pre-defined hierarchical type structures, humanannotated subsets). In this paper, we propose a novel approach to automatically correct noisy labels …
Learning To Ask Critical Questions For Assisting Product Search, Zixuan Li, Lizi Liao, Tat-Seng Chua
Learning To Ask Critical Questions For Assisting Product Search, Zixuan Li, Lizi Liao, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Product search plays an essential role in eCommerce. It was treated as a special type of information retrieval problem. Most existing works make use of historical data to improve the search performance, which do not take the opportunity to ask for user’s current interest directly. Some session-aware methods take the user’s clicks within the session as implicit feedback, but it is still just a guess on user’s preference. To address this problem, recent conversational or question-based search models interact with users directly for understanding the user’s interest explicitly. However, most users do not have a clear picture on what to …
Dynamic Topic Models For Temporal Document Networks, Ce Zhang, Hady Wirawan Lauw
Dynamic Topic Models For Temporal Document Networks, Ce Zhang, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Dynamic topic models explore the time evolution of topics in temporally accumulative corpora. While existing topic models focus on the dynamics of individual documents, we propose two neural topic models aimed at learning unified topic distributions that incorporate both document dynamics and network structure. For the first model, by adding a time dimension, we propose Time-Aware Optimal Transport, which measures the probability of a link between two differently timestamped documents using their semantic distance. Since the gradually evolving topological structure of network may also influence the establishment of a new link, for the second model, we further design a Temporal …
Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu
Declaration-Based Prompt Tuning For Visual Question Answering, Yuhang Liu, Wei Wei, Feida Zhu, Feida Zhu
Research Collection School Of Computing and Information Systems
In recent years, the pre-training-then-fine-tuning paradigm has yielded immense success on a wide spectrum of cross-modal tasks, such as visual question answering (VQA), in which a visual-language (VL) model is first optimized via self-supervised task objectives, e.g., masked language modeling (MLM) and image-text matching (ITM), and then fine-tuned to adapt to downstream task (e.g., VQA) via a brand-new objective function, e.g., answer prediction. However, the inconsistency of the objective forms not only severely limits the generalization of pre-trained VL models to downstream tasks, but also requires a large amount of labeled data for fine-tuning. To alleviate the problem, we propose …
Self-Supervised Video Representation Learning By Uncovering Spatio-Temporal Statistics, Jiangliu Wang, Jianbo Jiao, Linchao Bao, Shengfeng He, Wei Liu, Yun-Hui Liu
Self-Supervised Video Representation Learning By Uncovering Spatio-Temporal Statistics, Jiangliu Wang, Jianbo Jiao, Linchao Bao, Shengfeng He, Wei Liu, Yun-Hui Liu
Research Collection School Of Computing and Information Systems
This paper proposes a novel pretext task to address the self-supervised video representation learning problem. Specifically, given an unlabeled video clip, we compute a series of spatio-temporal statistical summaries, such as the spatial location and dominant direction of the largest motion, the spatial location and dominant color of the largest color diversity along the temporal axis, etc. Then a neural network is built and trained to yield the statistical summaries given the video frames as inputs. In order to alleviate the learning difficulty, we employ several spatial partitioning patterns to encode rough spatial locations instead of exact spatial Cartesian coordinates. …