In federated learning, clients cooperatively train a global model by training local models over their datasets under the coordination of a central server. However, clients may sometimes be unavailable for training due...
详细信息
This paper analyses current best practices for using security mechanisms in extract, transform, and load (ETL) tools. The results of the analysis are visually represented in a form of an optimal security model used in...
详细信息
The continually evolving image segmentation methods in computer vision can further broaden the cognitive abilities of the robot. As humans, we won't judge if the object is moving by accuracy speed estimation but t...
详细信息
Biomedical image analysis has progressed significantly with the integration of artificial intelligence, presenting new opportunities for early diagnosis and treatment of diseases with high mortality rates, such as ski...
详细信息
Diffusion models have recently been shown to be relevant for high-quality speech generation. Most work has been focused on generating spectrograms, and as such, they further require a subsequent model to convert the s...
详细信息
A newly designed small, almost square shaped Ultra Wideband antenna is presented in this paper. Free space simulations provided promising results with a wider bandwidth and high efficiency up to 97.68% within the UWB ...
详细信息
Wilga 2024 Summer Symposium on Photonics Applications and Web engineering was the 52th edition of the research and technical meetings series. Traditionally, the annual series of technical conferences and topical sessi...
详细信息
We develop a technique to design efficiently computable estimators for sparse linear regression in the simultaneous presence of two adversaries: oblivious and adaptive. Consider the model y∗ = X∗β∗ + η where X∗ is a...
We develop a technique to design efficiently computable estimators for sparse linear regression in the simultaneous presence of two adversaries: oblivious and adaptive. Consider the model y∗ = X∗β∗ + η where X∗ is an n × d random design matrix, β∗ ∈ Rd is a k-sparse vector, and the noise η is independent of X∗ and chosen by the oblivious adversary. Apart from the independence of X∗, we only require a small fraction entries of η to have magnitude at most 1. The adaptive adversary is allowed to arbitrarily corrupt an Ε-fraction of the samples (X1∗, y1∗), ..., (Xn∗, yn∗ ). Given the Ε-corrupted samples (X1, y1), ..., (Xn, yn), the goal is to estimate β∗. We assume that the rows of X∗ are iid samples from some d-dimensional distribution D with zero mean and (unknown) covariance matrix Σ with bounded condition number. We design several robust algorithms that outperform the state of the art even in the special case of Gaussian noise η ∼ N(0, 1)n. In particular, we provide a polynomial-time algorithm that with high probability recovers β∗ up to error O(√Ε) as long as n ≥ O∼ (k2/Ε), only assuming some bounds on the third and the fourth moments of D. In addition, prior to this work, even in the special case of Gaussian design D = N(0, Σ) and noise η ∼ N(0, 1), no polynomial time algorithm was known to achieve error o(√Ε) in the sparse setting n 2. We show that under some assumptions on the fourth and the eighth moments of D, there is a polynomial-time algorithm that achieves error o(√Ε) as long as n ≥ O∼ (k4/Ε3). For Gaussian distribution D = N(0, Σ), this algorithm achieves error O(Ε3/4). Moreover, our algorithm achieves error o(√Ε) for all log-concave distributions if Ε ≤ 1/polylog(d). Our algorithms are based on the filtering of the covariates that uses sum-of-squares relaxations, and weighted Huber loss minimization with 1 regularizer. We provide a novel analysis of weighted penalized Huber loss that is suitable for heavy-tailed designs in the presence of two adversaries
In today’s world, Cloud Computing (CC) enables the users to accesscomputing resources and services over cloud without any need to own the infrastructure. Cloud Computing is a concept in which a network of devices, l...
详细信息
In today’s world, Cloud Computing (CC) enables the users to accesscomputing resources and services over cloud without any need to own the infrastructure. Cloud Computing is a concept in which a network of devices, located inremote locations, is integrated to perform operations like data collection, processing, data profiling and data storage. In this context, resource allocation and taskscheduling are important processes which must be managed based on the requirements of a user. In order to allocate the resources effectively, hybrid cloud isemployed since it is a capable solution to process large-scale consumer applications in a pay-by-use manner. Hence, the model is to be designed as a profit-driven framework to reduce cost and make span. With this motivation, the currentresearch work develops a Cost-Effective Optimal Task Scheduling Model(CEOTS). A novel algorithm called Target-based Cost Derivation (TCD) modelis used in the proposed work for hybrid clouds. Moreover, the algorithm workson the basis of multi-intentional task completion process with optimal resourceallocation. The model was successfully simulated to validate its effectivenessbased on factors such as processing time, make span and efficient utilization ofvirtual machines. The results infer that the proposed model outperformed theexisting works and can be relied in future for real-time applications.
This study introduces a methodology enabling automated vehicles to perform lane changes effectively within complex road systems. It emphasizes a hierarchical driver behavior framework that integrates decision-making w...
详细信息
暂无评论