Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3436)
- Software Engineering (2136)
- Artificial Intelligence and Robotics (1648)
- Information Security (1051)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (916)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (177)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (55)
- Empirical study (54)
- Security (53)
- Optimization (52)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Large Language Models (42)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 241 - 270 of 8458
Full-Text Articles in Computer Sciences
Multi-Task Vehicle Routing Solver Via Mixture Of Specialized Experts Under State-Decomposable Mdp, Yuxin Pan, Zhiguang Cao, Chengyang Gu, Liu Liu, Peilin Zhao, Yize Chen, Fangzhen Lin
Multi-Task Vehicle Routing Solver Via Mixture Of Specialized Experts Under State-Decomposable Mdp, Yuxin Pan, Zhiguang Cao, Chengyang Gu, Liu Liu, Peilin Zhao, Yize Chen, Fangzhen Lin
Research Collection School Of Computing and Information Systems
Existing neural methods for multi-task vehicle routing problems (VRPs) typically learn unified solvers to handle multiple constraints simultaneously. However, they often underutilize the compositional structure of VRP variants, each derivable from a common set of basis VRP variants. This critical oversight causes unified solvers to miss out the potential benefits of basis solvers, each specialized for a basis VRP variant. To overcome this limitation, we propose a framework that enables unified solvers to perceive the shared-component nature across VRP variants by proactively reusing basis solvers, while mitigating the exponential growth of trained neural solvers. Specifically, we introduce a State-Decomposable MDP …
Learning Memory-Enhanced Improvement Heuristics For Flexible Job Shop Scheduling, Jiaqi Wang, Zhiguang Cao, Peng Zhao, Rui Cao, Yubin Xiao, Yuan Jiang, You Zhou
Learning Memory-Enhanced Improvement Heuristics For Flexible Job Shop Scheduling, Jiaqi Wang, Zhiguang Cao, Peng Zhao, Rui Cao, Yubin Xiao, Yuan Jiang, You Zhou
Research Collection School Of Computing and Information Systems
The rise of smart manufacturing under Industry 4.0 introduces mass customization and dynamic production, demanding more advanced and flexible scheduling techniques. The flexible job-shop scheduling problem (FJSP) has attracted significant attention due to its complex constraints and strong alignment with real-world production scenarios. Current deep reinforcement learning (DRL)-based approaches to FJSP predominantly employ constructive methods. While effective, they often fall short of reaching (near-)optimal solutions. In contrast, improvement-based methods iteratively explore the neighborhood of initial solutions and are more effective in approaching optimality. However, the flexible machine allocation in FJSP poses significant challenges to the application of this framework, including …
Mando-Llm: Heterogeneous Graph Transformers With Large Language Models For Smart Contract Vulnerability Detection, Nhat Minh Nguyen, Huu Hoang Nguyen, Long Le Thanh, Zahra Ahmadi, Thanh Nam Doan, Daoyuan Wu, Lingxiao Jiang
Mando-Llm: Heterogeneous Graph Transformers With Large Language Models For Smart Contract Vulnerability Detection, Nhat Minh Nguyen, Huu Hoang Nguyen, Long Le Thanh, Zahra Ahmadi, Thanh Nam Doan, Daoyuan Wu, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Detecting vulnerabilities in smart contracts is vital for the security and reliability of decentralized apps. To facilitate vulnerability detection, contract codes, including bug patterns, are represented as heterogeneous graphs with various nodes and edges, like control-flow and function-call graphs. However, existing graph learning techniques struggle with large, complex graphs. This paper presents MANDO-LLM, a novel framework that combines heterogeneous graph transformers (HGTs) with large language models (LLMs) for detecting vulnerabilities in smart contracts represented as heterogeneous contract graphs built upon control-flow and call graphs. MANDO-LLM uses LLMs to capture code features from control-flow and call data, customizes HGTs to learn …
A Socio-Technical Analysis Of Market Reactions On Meme Coins: Trump’S Presidential Effect, Ping Fan Ke, Yi Meng Lau
A Socio-Technical Analysis Of Market Reactions On Meme Coins: Trump’S Presidential Effect, Ping Fan Ke, Yi Meng Lau
Research Collection School Of Computing and Information Systems
Meme coins are a unique type of cryptocurrency whose value is shaped by internet culture and viral trends. This study introduces a socio-technical research model to examine key factors influencing meme coin dynamics and applies it to analyze market reactions to Donald Trump’s 2024 U.S. presidential election victory and inauguration, focusing on the $TRUMP meme coin and other politics-related meme coins, known as PolitiFi. Using a mixed-methods approach, we analyze publicly available news, social media activity, and marketplace data to investigate the interaction between social engagement and technical infrastructure. Econometric analysis shows that Trump-related events triggered short-term price surges, increased …
Stableguard: Towards Unified Copyright Protection And Tamper Localization In Latent Diffusion Models, Haoxin Yang, Bangzhen Liu, Xuemiao Xu, Cheng Xu, Yuyang Yu, Zikai Huang, Yi Wang, Shengfeng He
Stableguard: Towards Unified Copyright Protection And Tamper Localization In Latent Diffusion Models, Haoxin Yang, Bangzhen Liu, Xuemiao Xu, Cheng Xu, Yuyang Yu, Zikai Huang, Yi Wang, Shengfeng He
Research Collection School Of Computing and Information Systems
The advancement of diffusion models has enhanced the realism of AI-generated content but also raised concerns about misuse, necessitating robust copyright protection and tampering localization. Although recent methods have made progress toward unified solutions, their reliance on post hoc processing introduces considerable application inconvenience and compromises forensic reliability. We propose StableGuard, a novel framework that seamlessly integrates a binary watermark into the diffusion generation process, ensuring copyright protection and tampering localization in Latent Diffusion Models through an end-to-end design. We develop a Multiplexing Watermark VAE (MPW-VAE) by equipping a pretrained Variational Autoencoder (VAE) with a lightweight latent residual-based adapter, enabling …
Iostom: Offline Imitation Learning From Observations Via State Transition Occupancy Matching, Quang Anh Pham, Brahmanage Janaka Chathuranga Thilakarathna, Tien Mai, Akshat Kumar
Iostom: Offline Imitation Learning From Observations Via State Transition Occupancy Matching, Quang Anh Pham, Brahmanage Janaka Chathuranga Thilakarathna, Tien Mai, Akshat Kumar
Research Collection School Of Computing and Information Systems
Offline Learning from Observations (LfO) focuses on enabling agents to imitate expert behavior using datasets that contain only expert state trajectories and separate transition data with suboptimal actions. This setting is both practical and critical in real-world scenarios where direct environment interaction or access to expert action labels is costly, risky, or infeasible. Most existing LfO methods attempt to solve this problem through state or state-action occupancy matching. They typically rely on pretraining a discriminator to differentiate between expert and non-expert states, which could introduce errors and instability—especially when the discriminator is poorly trained. While recent discriminator-free methods have emerged, …
Misodice: Multi-Agent Imitation From Mixed-Quality Demonstrations, The Viet Bui, Tien Mai, Hong Thanh Nguyen
Misodice: Multi-Agent Imitation From Mixed-Quality Demonstrations, The Viet Bui, Tien Mai, Hong Thanh Nguyen
Research Collection School Of Computing and Information Systems
We study offline imitation learning (IL) in cooperative multi-agent settings, where demonstrations have unlabeled mixed quality - containing both expert and suboptimal trajectories. Our proposed solution is structured in two stages: trajectory labeling and multi-agent imitation learning, designed jointly to enable effective learning from heterogeneous, unlabeled data. In the first stage, we combine advances in large language models and preference-based reinforcement learning to construct a progressive labeling pipeline that distinguishes expert-quality trajectories. In the second stage, we introduce MisoDICE, a novel multi-agent IL algorithm that leverages these labels to learn robust policies while addressing the computational complexity of large joint …
Rising From Ashes: Generalized Federated Learning Via Dynamic Parameter Reset, Jiahao Wu, Ming Hu, Yanxin Yang, Xiaofei Xie, Zekai Chen, Chenyu Song, Mingsong Chen
Rising From Ashes: Generalized Federated Learning Via Dynamic Parameter Reset, Jiahao Wu, Ming Hu, Yanxin Yang, Xiaofei Xie, Zekai Chen, Chenyu Song, Mingsong Chen
Research Collection School Of Computing and Information Systems
Although Federated Learning (FL) is promising for privacy-preserving collaborative model training, it suffers from low inference performance due to heterogeneous client data. Due to heterogeneous data across clients, FL training easily learns client-specific overfitting features. Existing FL methods adopt coarsegrained averaging, which can easily cause the global model to get stuck in local optima, leading to poor generalization. Specifically, this paper presents a novel FL framework, FedPhoenix, to address this issue. It stochastically resets partial parameters in each round to destroy some features of the global model, guiding FL training to learn multiple generalized features for inference rather than specific …
A Partition Cover Approach To Tokenization, Jia Peng Lim, Shawn Tan, Davin Choo, Hady Wirawan Lauw
A Partition Cover Approach To Tokenization, Jia Peng Lim, Shawn Tan, Davin Choo, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Tokenization is the process of encoding strings into tokens of a fixed vocabulary size, and is widely utilized in Natural Language Processing applications. The leading tokenization algorithm today is Byte Pair Encoding (BPE), which formulates the tokenization problem as a compression problem and tackles it by performing sequences of merges. In this work, we formulate tokenization as an optimization objective, show that it is NP-hard via a simple reduction from vertex cover, and propose a polynomial-time greedy algorithm GreedTok. Our formulation naturally relaxes to the well-studied weighted maximum coverage problem which has a simple -approximation algorithm GreedWMC. Through empirical evaluations …
Robust Hallucination Detection In Llms Via Adaptive Token Selection, Mengjia Niu, Hamed Haddadi, Guansong Pang
Robust Hallucination Detection In Llms Via Adaptive Token Selection, Mengjia Niu, Hamed Haddadi, Guansong Pang
Research Collection School Of Computing and Information Systems
Hallucinations in large language models (LLMs) pose significant safety concerns that impede their broader deployment. Recent research in hallucination detection has demonstrated that LLMs’ internal representations contain truthfulness hints, which can be harnessed for detector training. However, the performance of these detectors is heavily dependent on the internal representations of predetermined tokens, fluctuating considerably when working on free-form generations with varying lengths and sparse distributions of hallucinated entities. To address this, we propose HaMI, a novel approach that enables robust detection of hallucinations through adaptive selection and learning of critical tokens that are most indicative of hallucinations. We achieve this …
Sempo: Lightweight Foundation Models For Time Series Forecasting, Hui He, Kun Yi, Yuanchi Ma, Qi Zhang, Zhengdong Niu, Guansong Pang
Sempo: Lightweight Foundation Models For Time Series Forecasting, Hui He, Kun Yi, Yuanchi Ma, Qi Zhang, Zhengdong Niu, Guansong Pang
Research Collection School Of Computing and Information Systems
The recent boom of large pre-trained models witnesses remarkable success in developing foundation models (FMs) for time series forecasting. Despite impressive performance across diverse downstream forecasting tasks, existing time series FMs possess massive network architectures and require substantial pre-training on large-scale datasets, which significantly hinders their deployment in resource-constrained environments. In response to this growing tension between versatility and affordability, we propose SEMPO, a novel lightweight foundation model that requires pretraining on relatively small-scale data, yet exhibits strong general time series forecasting. Concretely, SEMPO comprises two key modules: 1) energy-aware SpEctral decomposition module, that substantially improves the utilization of pre-training …
Design Principles For Customer‑Engaging Digital Service Systems: An Action Research Study, Keng Siau, Xiaofeng Chen, Xin Tan
Design Principles For Customer‑Engaging Digital Service Systems: An Action Research Study, Keng Siau, Xiaofeng Chen, Xin Tan
Research Collection School Of Computing and Information Systems
Digital services represent a business approach employed by organizations to operate in the digital environment. However, systematic development guidelines for developing quality digital service systems are lacking in the literature. The authors identified four general challenges for developing and implementing customer-engaging digital service systems (CEDSS). By employing the method of canonical action research in a digital service system project, they derived 10 design principles for developing high-quality CEDSS. They empirically evaluated the design principles in the development project and through follow-up focus group sessions. The design principles provide applicable and actionable guidelines for the development of CEDSS.
A Rate-Dependent Coreset Selector For Continual Learning On Time-Varying Data Distributions, Zilin Luo, Zichen Tian, Yaoyao Liu, Qianru Sun
A Rate-Dependent Coreset Selector For Continual Learning On Time-Varying Data Distributions, Zilin Luo, Zichen Tian, Yaoyao Liu, Qianru Sun
Research Collection School Of Computing and Information Systems
In this paper we review the concept of “phase” defined in Class-Incremental Learning (CIL), i.e., learning new classes while not forgetting old ones. Due to this design, classic CIL algorithms are mostly offline or can handle only intensive data distribution shifts across the phases. However, real-world data streams are often online, usually with uncertain or untraceable changes in their data distributions. To this end, we design the per-step distribution shifts by modeling the class sampling weights using bell-shaped curves. Such a design respects the rise-and-fall nature and presents realistic but underexplored challenges for CIL: 1) The data non-stationarity across steps …
General Test-Time Backdoor Detection In Split Neural Network-Based Vertical Federated Learning, Shunjie Yuan, Xinghua Li, Xuelin Cao, Haiyan Zhang, Robert H. Deng
General Test-Time Backdoor Detection In Split Neural Network-Based Vertical Federated Learning, Shunjie Yuan, Xinghua Li, Xuelin Cao, Haiyan Zhang, Robert H. Deng
Research Collection School Of Computing and Information Systems
As a new distributed machine learning framework, vertical federated learning (VFL) has been widely applied in the industry. However, recent studies have demonstrated that VFL faces serious challenges from backdoor attacks, which significantly hinder its further development. Although a few studies have focused on defending against VFL backdoor attacks, these defenses either do not consider the latest attack methods or show limited effectiveness. Moreover, most existing backdoor defense efforts primarily focus on backdoor attacks in horizontal federated learning (HFL) and centralized learning. Due to the unique architecture of VFL models, these methods cannot be directly applied to backdoor defense in …
Genscore: Agent-Based Short-Answer Question Generation And Scoring In Software Engineering Courses, Nguyen Binh Duong Ta, Lwin Khin Shar
Genscore: Agent-Based Short-Answer Question Generation And Scoring In Software Engineering Courses, Nguyen Binh Duong Ta, Lwin Khin Shar
Research Collection School Of Computing and Information Systems
Short-answer questions are commonly used in educational assessments, as they are often viewed as a more effective way than multiple-choice questions to determine whether students have achieved the intended learning outcomes. However, manually creating appropriate questions targeting different cognitive levels such as those defined by the Bloom’s Taxonomy, and grading text answers from students are not trivial tasks for instructors. Existing work on auto-question generation and scoring in computing education typically targets coding-based questions. However, in software engineering courses, assessments can extend beyond coding to understanding of processes, DevOps methodologies, system design, etc. This work aims to address the dual …
Reliable-Data-Split (Rds): Maximizing Model Potential With Reinforced Selection Strategy, Hoang D. Nguyen, Xuan-Son Vu, Quoc Tuan Truong, Duc-Trong Le
Reliable-Data-Split (Rds): Maximizing Model Potential With Reinforced Selection Strategy, Hoang D. Nguyen, Xuan-Son Vu, Quoc Tuan Truong, Duc-Trong Le
Research Collection School Of Computing and Information Systems
The nexus between data characteristics and parametric models is fundamental for developing effective and reliable artificial intelligence (AI) systems. Mismatches in data properties for model development may lead to deleterious effects on AI model performance in machine learning practice. This paper proposes a Reliable Data Split (RDS) procedure to learn how to select data points that will generalise the target domain adequately by employing prior knowledge of the data generative process. We introduce a reinforced selection strategy using deep reinforcement learning with diverse black box predictors in maximising ensemble rewards as the proxy of model performance potential while maintaining an …
Digital Communications Between Firms And Investors: Impact Of Explanatory Responses On Investor Engagement In Online Financial Q&A, Runyu Wang, Zili Zhang, Keng Siau, Ziqiong Zhang
Digital Communications Between Firms And Investors: Impact Of Explanatory Responses On Investor Engagement In Online Financial Q&A, Runyu Wang, Zili Zhang, Keng Siau, Ziqiong Zhang
Research Collection School Of Computing and Information Systems
The emerging trend of digital communications between firms and investors through online question-and-answer (Q&A) platforms is recognized as a vital strategy for managing investor relations, contributing to enhanced market efficiency and information transparency through increased information exchange. Potential investors can seek responses from firm managers to address their information needs, thereby mitigating market uncertainties. To provide foundational insights, we conduct a survey of investors to assess their awareness, usage, and perceptions of firm-investor Q&A platforms. In the subsequent empirical study, we specifically focus on the substance of managers’ responses, which are primarily aimed at clarifying firm events or information. In …
Contx: Scene Context Prediction Via Context Bank And Layout Perception, Jingxin Liang, Yangyang Xu, Haorui Song, Yuan Lu, Yuhui Deng, Yiyi Long, Yan Huang, Shengxin Liu, Jianbo Jiao, Shengfeng He
Contx: Scene Context Prediction Via Context Bank And Layout Perception, Jingxin Liang, Yangyang Xu, Haorui Song, Yuan Lu, Yuhui Deng, Yiyi Long, Yan Huang, Shengxin Liu, Jianbo Jiao, Shengfeng He
Research Collection School Of Computing and Information Systems
Scene context prediction, which seeks to infer unknown contextual information from isolated object properties, currently faces limitations due to predominant reliance on pixel-wise supervision that overlooks real-world context priors. To address this, we present ContX, a context-prior-driven, coarse-to-fine model. ContX distinctively integrates explicit linguistic-contextual knowledge in two key ways. First, it proposes a linguistic guided context bank, leveraging linguistic-statistical contextual data to guide the rationality of segmentation shapes and foster meaningful inter-class contextual interactions. Second, ContX augments contextual comprehension by correlating layouts with linguistic descriptions, enhancing layout perception through a multi-modal strategy. Comprehensive experiments demonstrate ContX's superiority and versatility, outperforming …
Backdoorllm: A Comprehensive Benchmark For Backdoor Attacks And Defenses On Large Language Models, Yige Li, Hanxun Huang, Yunhan Zhao, Xingjun Ma, Jun Sun
Backdoorllm: A Comprehensive Benchmark For Backdoor Attacks And Defenses On Large Language Models, Yige Li, Hanxun Huang, Yunhan Zhao, Xingjun Ma, Jun Sun
Research Collection School Of Computing and Information Systems
Generative large language models (LLMs) have achieved state-of-the-art results on a wide range of tasks, yet they remain susceptible to backdoor attacks: carefully crafted triggers in the input can manipulate the model to produce adversaryspecified outputs. While prior research has predominantly focused on backdoor risks in vision and classification settings, the vulnerability of LLMs in open-ended text generation remains underexplored. To fill this gap, we introduce BackdoorLLM1 , the first comprehensive benchmark for systematically evaluating backdoor threats in text-generation LLMs. BackdoorLLM provides: (i) a unified repository of benchmarks with a standardized training and evaluation pipeline; (ii) a diverse suite of …
Island-Based Evolutionary Computation With Diverse Surrogates And Adaptive Knowledge Transfer For High-Dimensional Data-Driven Optimization, Xianrong Zhang, Yuejiao Gong, Zhiguang Cao, Jun Zhang
Island-Based Evolutionary Computation With Diverse Surrogates And Adaptive Knowledge Transfer For High-Dimensional Data-Driven Optimization, Xianrong Zhang, Yuejiao Gong, Zhiguang Cao, Jun Zhang
Research Collection School Of Computing and Information Systems
In recent years, there has been a growing interest in data-driven evolutionary algorithms (DDEAs) employing surrogate models to approximate the objective functions with limited data. However, current DDEAs are primarily designed for lower-dimensional problems and their performance drops significantly when applied to large-scale optimization problems (LSOPs). To address the challenge, this paper proposes an offline DDEA named DSKT-DDEA. DSKT-DDEA leverages multiple islands that utilize different data to establish diverse surrogate models, fostering diverse subpopulations and mitigating the risk of premature convergence. In the intra-island optimization phase, a semi-supervised learning method is devised to fine-tune the surrogates. It not only facilitates …
Safe-Sora: Safe Text-To-Video Generation Via Graphical Watermarking, Zihan Su, Xuerui Qiu, Hongbin Xu, Tangyu Jiang, Jun-Hao Zhuang, Chun Yuan, Ming Li, Shengfeng He, Fei Yu
Safe-Sora: Safe Text-To-Video Generation Via Graphical Watermarking, Zihan Su, Xuerui Qiu, Hongbin Xu, Tangyu Jiang, Jun-Hao Zhuang, Chun Yuan, Ming Li, Shengfeng He, Fei Yu
Research Collection School Of Computing and Information Systems
The explosive growth of generative video models has amplified the demand for reliable copyright preservation of AI-generated content. Despite its popularity in image synthesis, invisible generative watermarking remains largely underexplored in video generation. To address this gap, we propose Safe-Sora, the first framework to embed graphical watermarks directly into the video generation process. Motivated by the observation that watermarking performance is closely tied to the visual similarity between the watermark and cover content, we introduce a hierarchical coarse-to-fine adaptive matching mechanism. Specifically, the watermark image is divided into patches, each assigned to the most visually similar video frame, and further …
The Rise Of Parameter Specialization For Knowledge Storage In Large Language Models, Yihuai Hong, Yiran Zhao, Wei Tang, Yang Deng, Yu Rong, Wenxuan Zhang
The Rise Of Parameter Specialization For Knowledge Storage In Large Language Models, Yihuai Hong, Yiran Zhao, Wei Tang, Yang Deng, Yu Rong, Wenxuan Zhang
Research Collection School Of Computing and Information Systems
Over time, a growing wave of large language models from various series has been introduced to the community. Researchers are striving to maximize the performance of language models with constrained parameter sizes. However, from a microscopic perspective, there has been limited research on how to better store knowledge in model parameters, particularly within MLPs, to enable more effective utilization of this knowledge by the model. In this work, we analyze twenty publicly available open-source large language models to investigate the relationship between their strong performance and the way knowledge is stored in their corresponding MLP parameters. Our findings reveal that …
Efskip: A New Error Feedback With Linear Speedup For Compressed Federated Learning With Arbitrary Data Heterogeneity, Hongyan Bao, Pengwen Chen, Ying Sun, Zhize Li
Efskip: A New Error Feedback With Linear Speedup For Compressed Federated Learning With Arbitrary Data Heterogeneity, Hongyan Bao, Pengwen Chen, Ying Sun, Zhize Li
Research Collection School Of Computing and Information Systems
Due to the communication bottleneck in distributed and decentralized federated learning applications, algorithms using compressed communication have attracted significant attention. The Error Feedback (EF) is a widely-studied compression framework for convergence with biased compressors such as top-k sparsification. Although various improvements have been obtained in recent years, the theoretical guarantee for EF-type framework is still limited. Previous works either 1) rely on strong assumptions such as bounded gradient/dissimilarity assumptions, thus can not deal with arbitrary data heterogeneity and also slow the convergence speed, or 2) can not enjoy linear speedup in the number of clients. In this work, we propose …
Generalization Bounds For Rank‑Sparse Neural Networks, Antoine Ledent, Rodrigo Alves, Yunwen Lei
Generalization Bounds For Rank‑Sparse Neural Networks, Antoine Ledent, Rodrigo Alves, Yunwen Lei
Research Collection School Of Computing and Information Systems
It has been recently observed in much of the literature that neural networks exhibit a bottleneck rank property: for larger depths, the activation and weights of neural networks trained with gradient-based methods tend to be of approximately low rank. In fact, the rank of the activations of each layer converges to a fixed value referred to as the “bottleneck rank”, which is the minimum rank required to represent the training data. This perspective is in line with the observation that regularizing linear networks (without activations) with weight decay is equivalent to minimizing the Schatten p quasi norm of the neural …
Accuracy-Enabling Differential Privacy-Preserving Truth Discovery, Man Zhang, Xinghua Li, Yinbin Miao, Bin Luo, Siqi Ma, Robert H. Deng
Accuracy-Enabling Differential Privacy-Preserving Truth Discovery, Man Zhang, Xinghua Li, Yinbin Miao, Bin Luo, Siqi Ma, Robert H. Deng
Research Collection School Of Computing and Information Systems
Perturbation-based privacy-preserving truth discovery requires the Service Provider (SP) to calculate the truthful aggregation result from perturbed data of the Data Sources (DSs), which inevitably damages the aggregation accuracy due to perturbation noise added in the data. Thus, the existing works attempt to relieve the perturbation errors by reducing noise amounts or adjusting aggregation weights of DSs. However, the former sacrifices DSs’ privacy preservation and the latter has the limited accuracy recovery performance. Aiming at it, we propose an accuracy-enabling differential privacy-preserving truth discovery consisting of an independence-guaranteed data perturbation module and a progressive-private noise elimination module. Specifically, in the …
Scalable Graph Indexing Using Gpus For Approximate Nearest Neighbor Search, Zhonggen Li, Xiangyu Ke, Yifan Zhu, Bocheng Yu, Baihua Zheng, Yunjun Gao
Scalable Graph Indexing Using Gpus For Approximate Nearest Neighbor Search, Zhonggen Li, Xiangyu Ke, Yifan Zhu, Bocheng Yu, Baihua Zheng, Yunjun Gao
Research Collection School Of Computing and Information Systems
Approximate nearest neighbor search (ANNS) in high-dimensional vector spaces has a wide range of real-world applications. Numerous methods have been proposed to handle ANNS efficiently, while graph-based indexes have gained prominence due to their high accuracy and efficiency. However, the indexing overhead of graph-based indexes remains substantial. With exponential growth in data volume and increasing demands for dynamic index adjustments, this overhead continues to escalate, posing a critical challenge.In this paper, we introduce Tagore, a fasT library accelerated by GPUs for graph indexing, which has powerful capabilities of constructing refinement-based graph indexes such as NSG and Vamana. We first introduce …
Sketch-Sparsenet: Sparse Convolution Framework For Sketch Recognition, Jingru Yang, Jin Wang, Yang Zhou, Guodong Lu, Yu Sun, Huan Yu, Heming Fang, Zhihui Li, Shengfeng He
Sketch-Sparsenet: Sparse Convolution Framework For Sketch Recognition, Jingru Yang, Jin Wang, Yang Zhou, Guodong Lu, Yu Sun, Huan Yu, Heming Fang, Zhihui Li, Shengfeng He
Research Collection School Of Computing and Information Systems
In free-hand sketch recognition, state-of-the-art methods often struggle to extract spatial features from sketches with sparse distributions, which are characterized by significant blank regions devoid of informative content. To address this challenge, we introduce a novel framework for sketch recognition, termed Sketch-SparseNet. This framework incorporates an advanced convolutional component: the Sketch-Driven Dilated Deformable Block (SD3B). This component excels at extracting spatial features and accurately recognizing free-hand sketches with sparse distributions. The SD3B component innovatively bridges gaps in the blank areas of sketches by establishing spatial relationships among disconnected stroke points through adaptive reshaping of convolution kernels. These kernels are deformable, …
When Deep Learning Meets Information Retrieval-Based Bug Localization: A Survey, Feifei Niu, Chuanyi Li, Kui Liu, Xin Xia, David Lo
When Deep Learning Meets Information Retrieval-Based Bug Localization: A Survey, Feifei Niu, Chuanyi Li, Kui Liu, Xin Xia, David Lo
Research Collection School Of Computing and Information Systems
Bug localization is a crucial aspect of software maintenance, running through the entire software lifecycle. Information retrieval-based bug localization (IRBL) identifies buggy code based on bug reports, expediting the bug resolution process for developers. Recent years have witnessed significant achievements in IRBL, propelled by the widespread adoption of deep learning (DL). To provide a comprehensive overview of the current state of the art and delve into key issues, we conduct a survey encompassing 61 IRBL studies leveraging DL. We summarize best practices in each phase of the IRBL workflow, undertake a meta-analysis of prior studies, and suggest future research directions. …
Seeing Culture: A Benchmark For Visual Reasoning And Grounding, Burak Satar, Zhixin Ma, Patrick Amadeus Irrawan, Wilfried Ariel Mulyawan, Jing Jiang, Ee-Peng Lim, Chong-Wah Ngo
Seeing Culture: A Benchmark For Visual Reasoning And Grounding, Burak Satar, Zhixin Ma, Patrick Amadeus Irrawan, Wilfried Ariel Mulyawan, Jing Jiang, Ee-Peng Lim, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Multimodal vision-language models (VLMs) have made substantial progress in various tasks that require a combined understanding of visual and textual content, particularly in cultural understanding tasks, with the emergence of new cultural datasets. However, these datasets frequently fall short of providing cultural reasoning while underrepresenting many cultures.In this paper, we introduce the Seeing Culture Benchmark (SCB), focusing on cultural reasoning with a novel approach that requires VLMs to reason on culturally rich images in two stages: i) selecting the correct visual option with multiple-choice visual question answering (VQA), and ii) segmenting the relevant cultural artifact as evidence of reasoning. Visual …
Metacan: Improving Generalizability Of Few‑Shot Anomaly Detection With Meta‑Learning, Zhisheng Lv, Jianfeng Zhang, Songlei Jian, Chenlin Huang, Hongguang Zhang, Guansong Pang, Zhong Liu
Metacan: Improving Generalizability Of Few‑Shot Anomaly Detection With Meta‑Learning, Zhisheng Lv, Jianfeng Zhang, Songlei Jian, Chenlin Huang, Hongguang Zhang, Guansong Pang, Zhong Liu
Research Collection School Of Computing and Information Systems
Few-shot Anomaly Detection (AD) for images aims to detect anomalies with few-shot normal samples from the target dataset. It is a crucial task when only few samples can be obtained, and it is challenging since it needs to be generalized to different domains. Existing methods try to enhance the generalizability of AD by incorporating large vision-language models (LVLMs).However, how to transform category semantic information in LVLMs into anomaly information to improve the generalizability of AD remains a challenge facing existing methods.To address the challenge, we propose a few-shot AD method called MetaCAN, a novel category-to-anomaly network trained with AD meta-learning …