Measurement-based Admission Control in Sliced Networks: A Best Arm Identification Approach

• URL: http://arxiv.org/abs/2204.06910v1
• Date: Thu, 14 Apr 2022 12:12:34 GMT
• Title: Measurement-based Admission Control in Sliced Networks: A Best Arm Identification Approach
• Authors: Simon Lindst{\aa}hl, Alexandre Proutiere, Andreas Jonsson
• Abstract summary: In sliced networks, the shared tenancy of slices requires adaptive admission control of data flows. We devise a joint measurement and decision strategy that returns a correct decision with a certain level of confidence.
• Score: 68.8204255655161
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In sliced networks, the shared tenancy of slices requires adaptive admission control of data flows, based on measurements of network resources. In this paper, we investigate the design of measurement-based admission control schemes, deciding whether a new data flow can be admitted and in this case, on which slice. The objective is to devise a joint measurement and decision strategy that returns a correct decision (e.g., the least loaded slice) with a certain level of confidence while minimizing the measurement cost (the number of measurements made before committing to the decision). We study the design of such strategies for several natural admission criteria specifying what a correct decision is. For each of these criteria, using tools from best arm identification in bandits, we first derive an explicit information-theoretical lower bound on the cost of any algorithm returning the correct decision with fixed confidence. We then devise a joint measurement and decision strategy achieving this theoretical limit. We compare empirically the measurement costs of these strategies, and compare them both to the lower bounds as well as a naive measurement scheme. We find that our algorithm significantly outperforms the naive scheme (by a factor $2-8$).

Related papers

• Optimal Baseline Corrections for Off-Policy Contextual Bandits [61.740094604552475]
  We aim to learn decision policies that optimize an unbiased offline estimate of an online reward metric. We propose a single framework built on their equivalence in learning scenarios. Our framework enables us to characterize the variance-optimal unbiased estimator and provide a closed-form solution for it.
  arXiv  Detail & Related papers  (2024-05-09T12:52:22Z)
• Inference of Causal Networks using a Topological Threshold [0.10241134756773226]
  We propose a constraint-based algorithm, which automatically determines causal relevance thresholds. We show that this novel algorithm is generally faster and more accurate than the PC algorithm.
  arXiv  Detail & Related papers  (2024-04-21T21:56:39Z)
• Optimal estimation of pure states with displaced-null measurements [0.0]
  We revisit the problem of estimating an unknown parameter of a pure quantum state. We investigate null-measurement' strategies in which the experimenter aims to measure in a basis that contains a vector close to the true system state.
  arXiv  Detail & Related papers  (2023-10-10T16:46:24Z)
• Active Learning in the Predict-then-Optimize Framework: A Margin-Based Approach [5.371816551086118]
  We develop a learning method that sequentially decides whether to request the "labels" of feature samples from an unlabeled data stream. Our active learning method is the first to be directly informed by the decision error induced by the predicted parameters.
  arXiv  Detail & Related papers  (2023-05-11T05:44:36Z)
• Improved Policy Evaluation for Randomized Trials of Algorithmic Resource Allocation [54.72195809248172]
  We present a new estimator leveraging our proposed novel concept, that involves retrospective reshuffling of participants across experimental arms at the end of an RCT. We prove theoretically that such an estimator is more accurate than common estimators based on sample means.
  arXiv  Detail & Related papers  (2023-02-06T05:17:22Z)
• Quantization for decentralized learning under subspace constraints [61.59416703323886]
  We consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints. We propose and study an adaptive decentralized strategy where the agents employ differential randomized quantizers to compress their estimates. The analysis shows that, under some general conditions on the quantization noise, the strategy is stable both in terms of mean-square error and average bit rate.
  arXiv  Detail & Related papers  (2022-09-16T09:38:38Z)
• Sample Complexity of Nonparametric Off-Policy Evaluation on Low-Dimensional Manifolds using Deep Networks [71.95722100511627]
  We consider the off-policy evaluation problem of reinforcement learning using deep neural networks. We show that, by choosing network size appropriately, one can leverage the low-dimensional manifold structure in the Markov decision process.
  arXiv  Detail & Related papers  (2022-06-06T20:25:20Z)
• Controllable Missingness from Uncontrollable Missingness: Joint Learning Measurement Policy and Imputation [9.826027427965354]
  We mainly focus on retrieving complete data, so called as imputation. We implement some variations of proposed algorithm for two different datasets and various missing rates.
  arXiv  Detail & Related papers  (2022-04-08T06:51:37Z)
• Online Allocation with Two-sided Resource Constraints [44.5635910908944]
  We consider an online allocation problem subject to lower and upper resource constraints, where the requests arrive sequentially. We propose a new algorithm that obtains $1-O(fracepsilonalpha-epsilon)$ -competitive ratio for the offline problems that know the entire requests ahead of time.
  arXiv  Detail & Related papers  (2021-12-28T02:21:06Z)
• CertainNet: Sampling-free Uncertainty Estimation for Object Detection [65.28989536741658]
  Estimating the uncertainty of a neural network plays a fundamental role in safety-critical settings. In this work, we propose a novel sampling-free uncertainty estimation method for object detection. We call it CertainNet, and it is the first to provide separate uncertainties for each output signal: objectness, class, location and size.
  arXiv  Detail & Related papers  (2021-10-04T17:59:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.