Conformal prediction is a powerful tool for uncertainty quantification, but its application to time-series data is constrained by the violation of the exchangeability assumption. Current solutions for time-series pred...
ISBN:
(纸本)9798331314385
Conformal prediction is a powerful tool for uncertainty quantification, but its application to time-series data is constrained by the violation of the exchangeability assumption. Current solutions for time-series prediction typically operate in the output space and rely on manually selected weights to address distribution drift, leading to overly conservative predictions. To enable dynamic weight learning in the semantically rich latent space, we introduce a novel approach called Conformalized Time Series with Semantic Features (CT-SSF). CT-SSF utilizes the inductive bias in deep representation learning to dynamically adjust weights, prioritizing semantic features relevant to the current prediction. Theoretically, we show that CT-SSF surpasses previous methods defined in the output space. Experiments on synthetic and benchmark datasets demonstrate that CT-SSF significantly outperforms existing state-of-the-art (SOTA) conformal prediction techniques in terms of prediction efficiency while maintaining a valid coverage guarantee.
In this article, we share the details of Dickinson College’s journey to establish a data analytics major. Designed to provide students with the technical proficiency required to become a data scientist, Dickinson’s ...
We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a 2-factor consisting of two chordless cycles, and non-hamiltonian cycle permutation...
详细信息
Poverty is considered a serious global issue that must be immediately eradicated by Sustainable Development Goals (SDGs) 1, namely ending poverty anywhere and in any form. As a developing country, poverty is a complex...
详细信息
Bayesian networks are a powerful class of graphical decision models used to represent causal relationships among ***,the reliability and integrity of learned Bayesian network models are highly dependent on the quality...
详细信息
Bayesian networks are a powerful class of graphical decision models used to represent causal relationships among ***,the reliability and integrity of learned Bayesian network models are highly dependent on the quality of incoming data *** of the primary challenges with Bayesian networks is their vulnerability to adversarial data poisoning attacks,wherein malicious data is injected into the training dataset to negatively influence the Bayesian network models and impair their *** this research paper,we propose an efficient framework for detecting data poisoning attacks against Bayesian network structure learning *** framework utilizes latent variables to quantify the amount of belief between every two nodes in each causal model over *** use our innovative methodology to tackle an important issue with data poisoning assaults in the context of Bayesian *** regard to four different forms of data poisoning attacks,we specifically aim to strengthen the security and dependability of Bayesian network structure learning techniques,such as the PC *** doing this,we explore the complexity of this area and offer workablemethods for identifying and reducing these sneaky ***,our research investigates one particular use case,the“Visit to Asia Network.”The practical consequences of using uncertainty as a way to spot cases of data poisoning are explored in this inquiry,which is of utmost *** results demonstrate the promising efficacy of latent variables in detecting and mitigating the threat of data poisoning ***,our proposed latent-based framework proves to be sensitive in detecting malicious data poisoning attacks in the context of stream data.
Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplor...
详细信息
Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplored. The recent work Unified GNN Sparsification (UGS) studies lottery ticket learning for GNNs, aiming to find a subset of model parameters and graph structures that can best maintain the GNN performance. However, it is tailed for the transductive setting, failing to generalize to unseen graphs, which are common in inductive tasks like graph classification. In this work, we propose a simple and effective learning paradigm, Inductive Co-Pruning of GNNs (ICPG), to endow graph lottery tickets with inductive pruning capacity. To prune the input graphs, we design a predictive model to generate importance scores for each edge based on the input. To prune the model parameters, it views the weight’s magnitude as their importance scores. Then we design an iterative co-pruning strategy to trim the graph edges and GNN weights based on their importance scores. Although it might be strikingly simple, ICPG surpasses the existing pruning method and can be universally applicable in both inductive and transductive learning settings. On 10 graph-classification and two node-classification benchmarks, ICPG achieves the same performance level with 14.26%–43.12% sparsity for graphs and 48.80%–91.41% sparsity for the GNN model.
In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow *** cloud data centers,fog computing takes more time to run workflow ***,it is essenti...
详细信息
In recent decades,fog computing has played a vital role in executing parallel computational tasks,specifically,scientific workflow *** cloud data centers,fog computing takes more time to run workflow ***,it is essential to develop effective models for Virtual Machine(VM)allocation and task scheduling in fog computing *** task scheduling,VM migration,and allocation,altogether optimize the use of computational resources across different fog *** process ensures that the tasks are executed with minimal energy consumption,which reduces the chances of resource *** this manuscript,the proposed framework comprises two phases:(i)effective task scheduling using a fractional selectivity approach and(ii)VM allocation by proposing an algorithm by the name of Fitness Sharing Chaotic Particle Swarm Optimization(FSCPSO).The proposed FSCPSO algorithm integrates the concepts of chaos theory and fitness sharing that effectively balance both global exploration and local *** balance enables the use of a wide range of solutions that leads to minimal total cost and makespan,in comparison to other traditional optimization *** FSCPSO algorithm’s performance is analyzed using six evaluation measures namely,Load Balancing Level(LBL),Average Resource Utilization(ARU),total cost,makespan,energy consumption,and response *** relation to the conventional optimization algorithms,the FSCPSO algorithm achieves a higher LBL of 39.12%,ARU of 58.15%,a minimal total cost of 1175,and a makespan of 85.87 ms,particularly when evaluated for 50 tasks.
作者：
Vo, LietDepartment of Mathematics
Statistics and Computer Science The University of Illinois at Chicago ChicagoIL60607 United States
In this paper, we propose a new approach for the time-discretization of the incompressible stochastic Stokes equations with multiplicative noise. Our new strategy is based on the classical Milstein method from stochas...
详细信息
Recent studies have highlighted the issue of Pretrained Language Models (PLMs) inadvertently propagating social stigmas and stereotypes, a critical concern given their widespread use. This is particularly problematic ...
详细信息
Traditional backdoor attacks insert a trigger patch in the training images and associate the trigger with the targeted class label. Backdoor attacks are one of the rapidly evolving types of attack which can have a sig...
详细信息
暂无评论