A new algorithm improves scalability of semi-supervised SVM.
problem Efficiently training semi-supervised SVM with large datasets.
method TSGS3VM: triply stochastic gradient algorithm for S3VM. result TSGS3VM converges to a stationary point and is more scalable. A new deep learning method classifies VM behavior in cloud systems.
problem Scalability issues in monitoring and managing cloud data centers.
method Deep learning classifiers (DeepConv and DeepFFT) for VM behavior identification.
result Our method achieves better performance and is significantly faster.
Proposes a new metric selection for VM-PG with improved convergence.
problem Improves convergence of VM-PG methods for ill-conditioned problems.
method Diagonal Barzilai-Borwein stepsize for adaptive metric selection.
result Improved convergence results for ill-conditioned problems.
Paper introduces IAD for detecting anomalous VMMs in cloud without VMM access.
problem Anomalous VMMs in cloud-based environments without direct access.
method IAD: Indirect Anomalous VMMs Detection algorithm using VM resource utilization data.
result IAD algorithm outperforms other methods with an average F1-score of 83.7%.
Robust VB framework for large datasets with outliers.
problem Handling outliers and contamination in large datasets.
method Divide and conquer approach with geometric median aggregation.
result VM-Posterior distribution preserves contraction properties.
New rule reduces exploration regret to logarithmic, improving bad episode handling.
problem Improving exploration regret in average reward MDPs.
method Replacing Doubling Trick with Vanishing Multiplicative rule in EVI-based algorithms.
result Regret is logarithmic under the new rule, significantly better than linear.
Background: Cardiac MRI derived biventricular mass and function parameters, such as end-systolic volume (ESV), end-diastolic volume (EDV), ejection fraction (EF), stroke volume (SV), and ventricular mass (VM) are clinically well established. Image segmentation can be challenging and time-consuming, due to the complex a…
Paper presents a new port-Hamiltonian model for vehicle manipulators.
problem Complex mechanical systems' energy flow and conservation.
method Derives port-Hamiltonian dynamics from Hamiltonian reduction theory.
result Establishes mathematical equivalence with existing formulations.
This paper aims to decrease the time complexity of multi-output relevance vector regression from O(VM^3) to O(V^3+M^3), where V is the number of output dimensions, M is the number of basis functions, and V<M. The experimental results demonstrate that the proposed method is more competitive than the existing method, wit…
A quantum framework optimizes collateral allocation for derivatives.
problem Legal constraints and operational rules in collateral allocation for derivatives.
method Certified higher-order quantum framework that normalizes margin requirements and builds a bounded neighborhood of actions.
result Quantum framework improves certified sample quality compared to classical methods.
HL algorithms improve resource allocation in cloud environments.
problem Sequential decision-making under uncertainty with exogenous variables.
method HL algorithms leverage exogenous variable samples to infer counterfactual consequences.
result HL algorithms outperform classic methods and reinforcement learning in resource allocation.
A scalable deep learning framework accelerates training of large neural networks for solving 3D Poisson equations.
problem Training large-scale neural networks for solving complex PDEs efficiently.
method Combines multigrid techniques with distributed deep learning to accelerate training.
result Solves 3D Poisson equations up to 512x512x512 resolution efficiently.
Study examines adversarial robustness of ANN variants, revealing differences in black-box settings.
problem Adversarial robustness of alternative neural network architectures.
method Analysis of conventional, stochastic ANNs, and SNNs across three datasets; experiments in white-box and black-box settings.
result Stochastic ANNs are more robust than conventional ANNs in black-box settings, especially with surrogate attacks.
New algorithm for contextual combinatorial bandits with probabilistic arm triggering.
problem Optimizing decisions in dynamic environments with probabilistic arm availability.
method C^2-UCB-T and VAC^2-UCB algorithms with TPM and VM conditions.
result Achieved improved regret bounds for contextual combinatorial bandits.
A fast ML method solves complex combinatorial auction problems.
problem Solving winner determination in multi-unit combinatorial auctions.
method Graph Neural Network (GNN) with half-convolution operations for bid-item graph modeling.
result Approaches optimal performance with negligible revenue loss and low complexity.