Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8556)
- Computer Sciences (8539)
- Databases and Information Systems (3453)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1071)
- Numerical Analysis and Scientific Computing (1025)
- Graphics and Human Computer Interfaces (933)
- Engineering (888)
- Social and Behavioral Sciences (681)
- Business (642)
- Theory and Algorithms (493)
- Computer Engineering (451)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (324)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (181)
- Education (170)
- Management Information Systems (167)
- Data Storage Systems (162)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (110)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (122)
- Social media (74)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Privacy (65)
- Data mining (64)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (54)
- Visualization (51)
- Task analysis (50)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Anomaly detection (47)
- Feature extraction (46)
- Twitter (46)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 2821 - 2850 of 8597
Full-Text Articles in Entire DC Network
Attack As Defense: Characterizing Adversarial Examples Using Robustness, Zhe Zhao, Guangke Chen, Jingyi Wang, Yiwei Yang, Fu Song, Jun Sun
Attack As Defense: Characterizing Adversarial Examples Using Robustness, Zhe Zhao, Guangke Chen, Jingyi Wang, Yiwei Yang, Fu Song, Jun Sun
Research Collection School Of Computing and Information Systems
As a new programming paradigm, deep learning has expanded its application to many real-world problems. At the same time, deep learning based software are found to be vulnerable to adversarial attacks. Though various defense mechanisms have been proposed to improve robustness of deep learning software, many of them are ineffective against adaptive attacks. In this work, we propose a novel characterization to distinguish adversarial examples from benign ones based on the observation that adversarial examples are significantly less robust than benign ones. As existing robustness measurement does not scale to large networks, we propose a novel defense framework, named attack …
Task Similarity Aware Meta Learning: Theory-Inspired Improvement On Maml, Pan Zhou, Yingtian Zpu, Xiaotong Yuan, Jiashi Feng, Caiming Xiong, Steven C. H. Hoi
Task Similarity Aware Meta Learning: Theory-Inspired Improvement On Maml, Pan Zhou, Yingtian Zpu, Xiaotong Yuan, Jiashi Feng, Caiming Xiong, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Few-shot learning ability is heavily desired for machine intelligence. By meta-learning a model initialization from training tasks with fast adaptation ability to new tasks, model-agnostic meta-learning (MAML) has achieved remarkable success in a number of few-shot learning applications. However, theoretical understandings on the learning ability of MAML remain absent yet, hindering developing new and more advanced meta learning methods in a principled way. In this work, we solve this problem by theoretically justifying the fast adaptation capability of MAML when applied to new tasks. Specifically, we prove that the learnt meta-initialization can benefit the fast adaptation to new tasks with …
Order-Agnostic Cross Entropy For Non-Autoregressive Machine Translation, Cunxiao Du, Zhaopeng Tu, Jing Jiang
Order-Agnostic Cross Entropy For Non-Autoregressive Machine Translation, Cunxiao Du, Zhaopeng Tu, Jing Jiang
Research Collection School Of Computing and Information Systems
We propose a new training objective named orderagnostic cross entropy (OAXE) for fully nonautoregressive translation (NAT) models. OAXE improves the standard cross-entropy loss to ameliorate the effect of word reordering, which is a common source of the critical multimodality problem in NAT. Concretely, OAXE removes the penalty for word order errors, and computes the cross entropy loss based on the best possible alignment between model predictions and target tokens. Since the log loss is very sensitive to invalid references, we leverage cross entropy initialization and loss truncation to ensure the model focuses on a good part of the search space. …
Optimization Planning For 3d Convnets, Zhaofan Qiu, Ting Yao, Chong-Wah Ngo, Tao Mei
Optimization Planning For 3d Convnets, Zhaofan Qiu, Ting Yao, Chong-Wah Ngo, Tao Mei
Research Collection School Of Computing and Information Systems
It is not trivial to optimally learn a 3D Convolutional Neural Networks (3D ConvNets) due to high complexity and various options of the training scheme. The most common hand-tuning process starts from learning 3D ConvNets using short video clips and then is followed by learning long-term temporal dependency using lengthy clips, while gradually decaying the learning rate from high to low as training progresses. The fact that such process comes along with several heuristic settings motivates the study to seek an optimal "path" to automate the entire training. In this paper, we decompose the path into a series of training …
Dehumor: Visual Analytics For Decomposing Humor, Xingbo Wang, Yao Ming, Tongshuang Wu, Haipeng Zeng, Yong Wang, Huamin Qu
Dehumor: Visual Analytics For Decomposing Humor, Xingbo Wang, Yao Ming, Tongshuang Wu, Haipeng Zeng, Yong Wang, Huamin Qu
Research Collection School Of Computing and Information Systems
Despite being a critical communication skill, grasping humor is challenginga successful use of humor requires a mixture of both engaging content build-up and an appropriate vocal delivery (e.g., pause). Prior studies on computational humor emphasize the textual and audio features immediately next to the punchline, yet overlooking longer-term context setup. Moreover, the theories are usually too abstract for understanding each concrete humor snippet. To fill in the gap, we develop DeHumor, a visual analytical system for analyzing humorous behaviors in public speaking. To intuitively reveal the building blocks of each concrete example, DeHumor decomposes each humorous video into multimodal features …
Claim: Curriculum Learning Policy For Influence Maximization In Unknown Social Networks, Dexun Li, Meghna Lowalekar, Pradeep Varakantham
Claim: Curriculum Learning Policy For Influence Maximization In Unknown Social Networks, Dexun Li, Meghna Lowalekar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Influence maximization is the problem of finding a small subset of nodes in a network that can maximize the diffusion of information. Recently, it has also found application in HIV prevention, substance abuse prevention, micro-finance adoption, etc., where the goal is to identify the set of peer leaders in a real-world physical social network who can disseminate information to a large group of people. Unlike online social networks, real-world networks are not completely known, and collecting information about the network is costly as it involves surveying multiple people. In this paper, we focus on this problem of network discovery for …
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Research Collection School Of Computing and Information Systems
Semi-supervised node classification on graphs is an important research problem, with many real-world applications in information retrieval such as content classification on a social network and query intent classification on an e-commerce query graph. While traditional approaches are largely transductive, recent graph neural networks (GNNs) integrate node features with network structures, thus enabling inductive node classification models that can be applied to new nodes or even new graphs in the same feature space. However, inter-graph differences still exist across graphs within the same domain. Thus, training just one global model (e.g., a state-of-the-art GNN) to handle all new graphs, whilst …
Rnnrepair: Automatic Rnn Repair Via Model-Based Analysis, Xiaofei Xie, Wenbo Guo, Lei Ma, Wei Le, Jian Wang, Lingjun Zhou, Yang Liu, Xinyu Xing
Rnnrepair: Automatic Rnn Repair Via Model-Based Analysis, Xiaofei Xie, Wenbo Guo, Lei Ma, Wei Le, Jian Wang, Lingjun Zhou, Yang Liu, Xinyu Xing
Research Collection School Of Computing and Information Systems
Deep neural networks are vulnerable to adversarial attacks. Due to their black-box nature, it is rather challenging to interpret and properly repair these incorrect behaviors. This paper focuses on interpreting and repairing the incorrect behaviors of Recurrent Neural Networks (RNNs). We propose a lightweight model-based approach (RNNRepair) to help understand and repair incorrect behaviors of an RNN. Specifically, we build an influence model to characterize the stateful and statistical behaviors of an RNN over all the training data and to perform the influence analysis for the errors. Compared with the existing techniques on influence function, our method can efficiently estimate …
Efficient White-Box Fairness Testing Through Gradient Search, Lingfeng Zhang, Yueling Zhang, Min Zhang
Efficient White-Box Fairness Testing Through Gradient Search, Lingfeng Zhang, Yueling Zhang, Min Zhang
Research Collection School Of Computing and Information Systems
Deep learning (DL) systems are increasingly deployed for autonomous decision-making in a wide range of applications. Apart from the robustness and safety, fairness is also an important property that a well-designed DL system should have. To evaluate and improve individual fairness of a model, systematic test case generation for identifying individual discriminatory instances in the input space is essential. In this paper, we propose a framework EIDIG for efficiently discovering individual fairness violation. Our technique combines a global generation phase for rapidly generating a set of diverse discriminatory seeds with a local generation phase for generating as many individual discriminatory …
Oesense: Employing Occlusion Effect For In-Ear Human Sensing, Dong Ma, Andrea Ferlini, Cecilia Mascolo
Oesense: Employing Occlusion Effect For In-Ear Human Sensing, Dong Ma, Andrea Ferlini, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
Smart earbuds are recognized as a new wearable platform for personal-scale human motion sensing. However, due to the interference from head movement or background noise, commonly-used modalities (e.g. accelerometer and microphone) fail to reliably detect both intense and light motions. To obviate this, we propose OESense, an acoustic-based in-ear system for general human motion sensing. The core idea behind OESense is the joint use of the occlusion effect (i.e., the enhancement of low-frequency components of bone-conducted sounds in an occluded ear canal) and inward-facing microphone, which naturally boosts the sensing signal and suppresses external interference. We prototype OESense as an …
Bias Field Poses A Threat To Dnn-Based X-Ray Recognition, Bingyu Tian, Qing Guo, Felix Juefei-Xu, Wen Le Chan, Yupeng Cheng, Xiaohong Li, Xiaofei Xie, Shengchao Qin
Bias Field Poses A Threat To Dnn-Based X-Ray Recognition, Bingyu Tian, Qing Guo, Felix Juefei-Xu, Wen Le Chan, Yupeng Cheng, Xiaohong Li, Xiaofei Xie, Shengchao Qin
Research Collection School Of Computing and Information Systems
Chest X-ray plays a key role in screening and diagnosis of many lung diseases including the COVID-19. Many works construct deep neural networks (DNNs) for chest X-ray images to realize automated and efficient diagnosis of lung diseases. However, bias field caused by the improper medical image acquisition process widely exists in the chest X-ray images while the robustness of DNNs to the bias field is rarely explored, posing a threat to the X-ray-based automated diagnosis system. In this paper, we study this problem based on the adversarial attack and propose a brand new attack, i.e., adversarial bias field attack where …
Variational Learning From Implicit Bandit Feedback, Quoc Tuan Truong, Hady W. Lauw
Variational Learning From Implicit Bandit Feedback, Quoc Tuan Truong, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Recommendations are prevalent in Web applications (e.g., search ranking, item recommendation, advertisement placement). Learning from bandit feedback is challenging due to the sparsity of feedback limited to system-provided actions. In this work, we focus on batch learning from logs of recommender systems involving both bandit and organic feedbacks. We develop a probabilistic framework with a likelihood function for estimating not only explicit positive observations but also implicit negative observations inferred from the data. Moreover, we introduce a latent variable model for organic-bandit feedbacks to robustly capture user preference distributions. Next, we analyze the behavior of the new likelihood under two …
Page: A Simple And Optimal Probabilistic Gradient Estimator For Nonconvex Optimization, Zhize Li, Hongyan Bao, Xiangliang Zhang, Peter Richtarik
Page: A Simple And Optimal Probabilistic Gradient Estimator For Nonconvex Optimization, Zhize Li, Hongyan Bao, Xiangliang Zhang, Peter Richtarik
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel stochastic gradient estimator---ProbAbilistic Gradient Estimator (PAGE)---for nonconvex optimization. PAGE is easy to implement as it is designed via a small adjustment to vanilla SGD: in each iteration, PAGE uses the vanilla minibatch SGD update with probability $p_t$ or reuses the previous gradient with a small adjustment, at a much lower computational cost, with probability $1-p_t$. We give a simple formula for the optimal choice of $p_t$. Moreover, we prove the first tight lower bound $\Omega(n+\frac{\sqrt{n}}{\epsilon^2})$ for nonconvex finite-sum problems, which also leads to a tight lower bound $\Omega(b+\frac{\sqrt{b}}{\epsilon^2})$ for nonconvex online problems, where …
Unified Conversational Recommendation Policy Learning Via Graph-Based Reinforcement Learning, Yang Deng, Yaliang Li, Fei Sun, Bolin Ding, Wai Lam
Unified Conversational Recommendation Policy Learning Via Graph-Based Reinforcement Learning, Yang Deng, Yaliang Li, Fei Sun, Bolin Ding, Wai Lam
Research Collection School Of Computing and Information Systems
Conversational recommender systems (CRS) enable the traditional recommender systems to explicitly acquire user preferences towards items and attributes through interactive conversations. Reinforcement learning (RL) is widely adopted to learn conversational recommendation policies to decide what attributes to ask, which items to recommend, and when to ask or recommend, at each conversation turn. However, existing methods mainly target at solving one or two of these three decision-making problems in CRS with separated conversation and recommendation components, which restrict the scalability and generality of CRS and fall short of preserving a stable training procedure. In the light of these challenges, we propose …
A Coprocessor-Based Introspection Framework Via Intel Management Engine, Lei Zhou, Fengwei Zhang, Jidong Xiao, Kevin Leach, Westley Weimer, Xuhua Ding, Guojun Wang
A Coprocessor-Based Introspection Framework Via Intel Management Engine, Lei Zhou, Fengwei Zhang, Jidong Xiao, Kevin Leach, Westley Weimer, Xuhua Ding, Guojun Wang
Research Collection School Of Computing and Information Systems
During the past decade, virtualization-based (e.g., virtual machine introspection) and hardware-assisted approaches (e.g., x86 SMM and ARM TrustZone) have been used to defend against low-level malware such as rootkits. However, these approaches either require a large Trusted Computing Base (TCB) or they must share CPU time with the operating system, disrupting normal execution. In this article, we propose an introspection framework called NIGHTHAWK that transparently checks system integrity and monitor the runtime state of target system. NIGHTHAWK leverages the Intel Management Engine (IME), a co-processor that runs in isolation from the main CPU. By using the IME, our approach has …
An Efficient Transformer-Based Model For Vietnamese Punctuation Prediction, Hieu Tran, Cuong V. Dinh, Hong Quang Pham, Binh T. Nguyen
An Efficient Transformer-Based Model For Vietnamese Punctuation Prediction, Hieu Tran, Cuong V. Dinh, Hong Quang Pham, Binh T. Nguyen
Research Collection School Of Computing and Information Systems
In both formal and informal texts, missing punctuation marks make the texts confusing and challenging to read. This paper aims to conduct exhaustive experiments to investigate the benefits of the pre-trained Transformer-based models on two Vietnamese punctuation datasets. The experimental results show our models can achieve encouraging results, and adding Bi-LSTM or/and CRF layers on top of the proposed models can also boost model performance. Finally, our best model can significantly bypass state-of-the-art approaches on both the novel and news datasets for the Vietnamese language. It can gain the corresponding performance up to 21.45%21.45% and 18.27%18.27% in the overall F1-scores.
Marina: Faster Non-Convex Distributed Learning With Compression, Eduard Gorbunov, Konstantin Burlachenko, Zhize Li, Peter Richtarik
Marina: Faster Non-Convex Distributed Learning With Compression, Eduard Gorbunov, Konstantin Burlachenko, Zhize Li, Peter Richtarik
Research Collection School Of Computing and Information Systems
We develop and analyze MARINA: a new communication efficient method for non-convex distributed learning over heterogeneous datasets. MARINA employs a novel communication compression strategy based on the compression of gradient differences that is reminiscent of but different from the strategy employed in the DIANA method of Mishchenko et al. (2019). Unlike virtually all competing distributed first-order methods, including DIANA, ours is based on a carefully designed biased gradient estimator, which is the key to its superior theoretical and practical performance. The communication complexity bounds we prove for MARINA are evidently better than those of all previous first-order methods. Further, we …
Users’ Reception Of Product Recommendations: Analyses Based On Eye Tracking Data, Feiyan Jia, Yani Shi, Choon Ling Sia, Chuan-Hoo Tan, Fiona Fui-Hoon Nah, Keng Siau
Users’ Reception Of Product Recommendations: Analyses Based On Eye Tracking Data, Feiyan Jia, Yani Shi, Choon Ling Sia, Chuan-Hoo Tan, Fiona Fui-Hoon Nah, Keng Siau
Research Collection School Of Computing and Information Systems
Based on eye tracking technology, we study consumers’ overall attention to recommendations appearing at different time settings (i.e., early, mid, and late) and their attention to different information contained in each recommendation, such as recommendation signs, product descriptions, and reviews. By investigating consumers’ eye movement patterns and attention distributions on recommendations, we open the “black box” of why consumers’ reception to recommendations appearing at different time settings varies. The product preference construction literature and mindset theory help to explain why the early recommendations receive the most attention. The need for justification helps to explain why the late recommendations should receive …
Self-Supervised Contrastive Learning For Code Retrieval And Summarization Via Semantic-Preserving Transformations, Duy Quoc Nghi Bui, Yijun Yu, Lingxiao Jiang
Self-Supervised Contrastive Learning For Code Retrieval And Summarization Via Semantic-Preserving Transformations, Duy Quoc Nghi Bui, Yijun Yu, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
We propose Corder, a self-supervised contrastive learning framework for source code model. Corder is designed to alleviate the need of labeled data for code retrieval and code summarization tasks. The pre-trained model of Corder can be used in two ways: (1) it can produce vector representation of code which can be applied to code retrieval tasks that do not have labeled data; (2) it can be used in a fine-tuning process for tasks that might still require label data such as code summarization. The key innovation is that we train the source code model by asking it to recognize similar …
Integrated Framework For Developing Instructional Videos For Foundational Computing Courses, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau
Integrated Framework For Developing Instructional Videos For Foundational Computing Courses, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau
Research Collection School Of Computing and Information Systems
Instructional videos are widely used in higher education due to their effectiveness and flexibility of personalized learning features. Computing courses usually focuses on programming, user interface design, server connectivity, data storage, and architecture, among others. The design of instructional videos varies in not only the course content but also the style of content creation. We propose an integrated framework, Computing Videos Design Framework (CVDF), for designing and developing instructional videos for computing courses. CVDF combines the cognitive skills from Bloom’s taxonomy, video design principles, and course learning outcomes for designing different types of instructional videos. We apply the framework to …
Paying Attention To Video Object Pattern Understanding, Wenguan Wang, Jianbing Shen, Xiankai Lu, Steven C. H. Hoi, Haibin Ling
Paying Attention To Video Object Pattern Understanding, Wenguan Wang, Jianbing Shen, Xiankai Lu, Steven C. H. Hoi, Haibin Ling
Research Collection School Of Computing and Information Systems
This paper conducts a systematic study on the role of visual attention in video object pattern understanding. By elaborately annotating three popular video segmentation datasets (DAVIS) with dynamic eye-tracking data in the unsupervised video object segmentation (UVOS) setting. For the first time, we quantitatively verified the high consistency of visual attention behavior among human observers, and found strong correlation between human attention and explicit primary object judgments during dynamic, task-driven viewing. Such novel observations provide an in-depth insight of the underlying rationale behind video object pattens. Inspired by these findings, we decouple UVOS into two sub-tasks: UVOS-driven Dynamic Visual Attention …
Mmconv: An Environment For Multimodal Conversational Search Across Multiple Domains, Lizi Liao, Le Hong Long, Zheng Zhang, Minlie Huang, Tat-Seng Chua
Mmconv: An Environment For Multimodal Conversational Search Across Multiple Domains, Lizi Liao, Le Hong Long, Zheng Zhang, Minlie Huang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Although conversational search has become a hot topic in both dialogue research and IR community, the real breakthrough has been limited by the scale and quality of datasets available. To address this fundamental obstacle, we introduce the Multimodal Multi-domain Conversational dataset (MMConv), a fully annotated collection of human-to-human role-playing dialogues spanning over multiple domains and tasks. The contribution is two-fold. First, beyond the task-oriented multimodal dialogues among user and agent pairs, dialogues are fully annotated with dialogue belief states and dialogue acts. More importantly, we create a relatively comprehensive environment for conducting multimodal conversational search with real user settings, structured …
Deep Transfer Bug Localization, Xuan Huo, Ferdian Thung, Ming Li, David Lo, Shu-Ting Shi
Deep Transfer Bug Localization, Xuan Huo, Ferdian Thung, Ming Li, David Lo, Shu-Ting Shi
Research Collection School Of Computing and Information Systems
Many projects often receive more bug reports than what they can handle. To help debug and close bug reports, a number of bug localization techniques have been proposed. These techniques analyze a bug report and return a ranked list of potentially buggy source code files. Recent development on bug localization has resulted in the construction of effective supervised approaches that use historical data of manually localized bugs to boost performance. Unfortunately, as highlighted by Zimmermann et al., sufficient bug data is often unavailable for many projects and companies. This raises the need for cross-project bug localization -- the use of …
An Adaptive Large Neighborhood Search For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiawan, Aldy Gunawan
An Adaptive Large Neighborhood Search For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiawan, Aldy Gunawan
Research Collection School Of Computing and Information Systems
This study addresses a variant of the Electric Vehicle Routing Problem with Mixed Fleet, named as the Green Mixed Fleet Vehicle Routing Problem with Realistic Energy Consumption and Partial Recharges. This problem contains three important characteristics — realistic energy consumption, partial recharging policy, and carbon emissions. An adaptive Large Neighborhood Search heuristic is developed for the problem. Experimental results show that the proposed ALNS finds optimal solutions for most small-scale benchmark instances in a significantly faster computational time compared to the performance of CPLEX solver. Moreover, it obtains high quality solutions for all medium- and large-scale instances under a reasonable …
Make It Easy: An Effective End-To-End Entity Alignment Framework, Congcong Ge, Xiaoze Liu, Lu Chen Chen, Baihua Zheng, Yunjun Gao
Make It Easy: An Effective End-To-End Entity Alignment Framework, Congcong Ge, Xiaoze Liu, Lu Chen Chen, Baihua Zheng, Yunjun Gao
Research Collection School Of Computing and Information Systems
Entity alignment (EA) is a prerequisite for enlarging the coverage of a unified knowledge graph. Previous EA approaches either restrain the performance due to inadequate information utilization or need labor-intensive pre-processing to get external or reliable information to perform the EA task. This paper proposes EASY, an effective end-to-end EA framework, which is able to (i) remove the labor-intensive pre-processing by fully discovering the name information provided by the entities themselves; and (ii) jointly fuse the features captured by the names of entities and the structural information of the graph to improve the EA results. Specifically, EASY first introduces NEAP, …
A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method For Efficient Optimization And Generalization, Pan Zhou, Xiao-Tong Yuan, Lin Zhouchen, Steven C. H. Hoi
A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method For Efficient Optimization And Generalization, Pan Zhou, Xiao-Tong Yuan, Lin Zhouchen, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Despite the success of stochastic variance-reduced gradient (SVRG) algorithms in solving large-scale problems, their stochastic gradient complexity often scales linearly with data size and is expensive for huge data. Accordingly, we propose a hybrid stochastic-deterministic minibatch proximal gradient (HSDMPG) algorithm for strongly convex problems with linear prediction structure, e.g. least squares and logistic/softmax regression. HSDMPG enjoys improved computational complexity that is data-size-independent for large-scale problems. It iteratively samples an evolving minibatch of individual losses to estimate the original problem, and can efficiently minimize the sampled subproblems. For strongly convex loss of n components, HSDMPG attains an -optimization-error within O κ …
First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro
First Train Timetabling And Bus Service Bridging In Intermodal Bus-And-Train Transit Networks, Liujiang Kang, Hao Li, Huijun Sun, Jianjun Wu, Zhiguang Cao, Nsabimana Buhigiro
Research Collection School Of Computing and Information Systems
Subway system is the main mode of transportation for city dwellers and is a quite signif-icant backbone to a city's operations. One of the challenges of subway network operation is the scheduling of the first trains each morning and its impact on transfers. To deal with this challenge, some cities (e.g. Beijing) use bus 'bridging' services, temporarily substitut -ing segments of the subway network. The present paper optimally identifies when to start each train and bus bridging service in an intermodal transit network. Starting from a mixed integer nonlinear programming model for the first train timetabling problem, we linearize and …
Reciprocal Transformations For Unsupervised Video Object Segmentation, Sucheng Ren, Wenxi Liu, Yongtuo Liu, Haoxin Chen, Guoqiang Han, Shengfeng He
Reciprocal Transformations For Unsupervised Video Object Segmentation, Sucheng Ren, Wenxi Liu, Yongtuo Liu, Haoxin Chen, Guoqiang Han, Shengfeng He
Research Collection School Of Computing and Information Systems
Unsupervised video object segmentation (UVOS) aims at segmenting the primary objects in videos without any human intervention. Due to the lack of prior knowledge about the primary objects, identifying them from videos is the major challenge of UVOS. Previous methods often regard the moving objects as primary ones and rely on optical flow to capture the motion cues in videos, but the flow information alone is insufficient to distinguish the primary objects from the background objects that move together. This is because, when the noisy motion features are combined with the appearance features, the localization of the primary objects is …
How-To Present News On Social Media: A Causal Analysis Of Editing News Headlines For Boosting User Engagement, Kunwoo Park, Haewoon Kwak, Jisun An, Sanjay Chawla
How-To Present News On Social Media: A Causal Analysis Of Editing News Headlines For Boosting User Engagement, Kunwoo Park, Haewoon Kwak, Jisun An, Sanjay Chawla
Research Collection School Of Computing and Information Systems
To reach a broader audience and optimize traffic toward news articles, media outlets commonly run social media accounts and share their content with a short text summary. Despite its importance of writing a compelling message in sharing articles, the research community does not own a sufficient understanding of what kinds of editing strategies effectively promote audience engagement. In this study, we aim to fill the gap by analyzing media outlets' current practices using a data-driven approach. We first build a parallel corpus of original news articles and their corresponding tweets that eight media outlets shared. Then, we explore how those …
Cache-Efficient Fork-Processing Patterns On Large Graphs, Shengliang Lu, Shixuan Sun, Johns Paul, Yuchen Li, Bingsheng He
Cache-Efficient Fork-Processing Patterns On Large Graphs, Shengliang Lu, Shixuan Sun, Johns Paul, Yuchen Li, Bingsheng He
Research Collection School Of Computing and Information Systems
As large graph processing emerges, we observe a costly fork-processing pattern (FPP) that is common in many graph algorithms. The unique feature of the FPP is that it launches many independent queries from different source vertices on the same graph. For example, an algorithm in analyzing the network community profile can execute Personalized PageRanks that start from tens of thousands of source vertices at the same time. We study the efficiency of handling FPPs in state-of-the-art graph processing systems on multi-core architectures, including Ligra, Gemini, and GraphIt. We find that those systems suffer from severe cache miss penalty because of …