Optimal resource allocation in censored semi-bandits with unknown thresholds.
problem Sequential resource allocation with unknown thresholds and hidden parameters.
method Established equivalence to MP-MAB and Combinatorial Semi-Bandits, derived optimal algorithms.
result Validated performance of proposed algorithms on synthetic data.
Study resource allocation strategies in sequential decisions with unknown rewards.
problem Sequential resource allocation with unknown rewards.
method Design combinatorial multi-armed bandit algorithms for discrete or continuous budgets.
result Prove algorithms achieve logarithmic cumulative regret under semi-bandit feedback.
Paper tackles pandemic resource allocation challenges.
problem Shortages of medical resources during pandemics.
method Risk management approach, focusing on spatio-temporal competitions.
result New strategies for optimal stockpiling and allocation balancing resource competition.
Study optimizes resource allocation in noisy systems for better control.
problem Limited attention in stochastic systems with multiplicative noise.
method Analytical and numerical methods for optimal attention allocation.
result Effective resource allocation enhances noise estimation and control decisions.
New loss function reduces outage probability in ML-assisted resource allocation.
problem Minimizing outage probability in ML-assisted resource allocation systems.
method Developed a novel loss function and trained an ML model to address the outage probability challenge.
result Exact and asymptotic expressions for the system's outage probability were established.
Resource allocation improved using machine learning from terminal positions.
problem Optimizing resource allocation in next-gen wireless systems with fast-changing channel conditions.
method Supervised machine learning using position information of mobile terminals.
result Coordinates-based resource allocation performs similarly to traditional CSI-based methods.
We study classification problems where features are corrupted by noise and where the magnitude of the noise in each feature is influenced by the resources allocated to its acquisition. This is the case, for example, when multiple sensors share a common resource (power, bandwidth, attention, etc.). We develop a method f…
Unified formula for arbitrary liquidity operations in weighted AMMs
problem Decentralized resource allocation in intelligent transportation systems
method Weighted invariant adapted from Balancer-type AMMs
result Unified formula for four resource allocation operations
This paper proposes a decentralized reinforcement learning method for multi-agent resource allocation.
problem Allocating heterogeneous resources among multiple agents in a decentralized manner.
method Liquid-Graph-Time Clustering-IPPO, integrating dynamic cluster consensus.
result LGTC-IPPO achieves more stable rewards, better coordination, and robust performance.
Generative profiling improves real-time task timing for varied resource contexts.
problem Inaccurate task timing analysis for complex hardware architectures.
method Nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation for synthesizing context-dependent timing profiles.
result Maximum likelihood accurate execution profiles for unseen resource contexts.
Driven by the tremendous technological advancement of personal devices and the prevalence of wireless mobile network accesses, the world has witnessed an explosion in crowdsourced live streaming. Ensuring a better viewers quality of experience (QoE) is the key to maximize the audiences number and increase streaming pro…
Optimizes resource allocation for virtualized network functions based on performance profiles.
problem Mapping SLA performance requirements to dynamic virtualized infrastructure resources.
method Profile-based resource allocation using VNF performance datasets and machine learning models.
result A method to predict and recommend optimal resource allocation for network services.
Optimal online learning for joint pricing and resource allocation.
problem Maximizing net profit in dynamic pricing and resource allocation with stochastic demand.
method Developed an efficient algorithm using a Lower-Confidence Bound (LCB) meta-strategy over multiple OCO agents.
result Achieved i l d e O ( T m n ) ilde{O}(\sqrt{Tmn}) i l d e O ( T mn ) regret, optimal with respect to time horizon T T T . The paper tackles resource allocation for arms with unknown and random rewards, achieving optimal regret bounds.
problem Allocating resources on arms with unknown and random rewards.
method Developed two algorithms with optimal regret bounds for b ∈ [ 0 , 1 ] b \in [0,1] b ∈ [ 0 , 1 ] , demonstrating a phase transition at b = 1 / 2 b=1/2 b = 1/2 . result Achieved optimal gap-dependent and gap-independent regret bounds for b ∈ [ 0 , 1 ] b \in [0,1] b ∈ [ 0 , 1 ] . Meta-DRL improves resource allocation in O-RAN networks.
problem Dynamic resource allocation in O-RAN networks.
method Meta Deep Reinforcement Learning (Meta-DRL) inspired by MAML.
result 19.8% improvement in network management performance.
The paper evaluates index-based allocation policies using data from randomized control trials.
problem Evaluating index-based allocation policies in resource-scarce scenarios.
method Using data from randomized control trials, the paper introduces an efficient estimator and methods for computing asymptotically correct confidence intervals.
result Valid statistical conclusions can be drawn for index-based allocation policies.
ATA optimizes task allocation in distributed machine learning.
problem Greedy task allocation leads to inefficiencies in distributed machine learning.
method Adaptive Task Allocation (ATA) adapts to unknown computation time distributions.
result ATA identifies optimal task allocation without prior knowledge of computation times.
We study a sequential resource allocation problem between a fixed number of arms. On each iteration the algorithm distributes a resource among the arms in order to maximize the expected success rate. Allocating more of the resource to a given arm increases the probability that it succeeds, yet with a cut-off. We follow…
RL optimizes resource allocation in MG by balancing experience and exploration.
problem Optimal resource allocation in competitive scenarios.
method Introduced RL to MG, allowing dynamic strategy adjustment based on experience and expected rewards.
result Achieves optimal resource coordination by balancing exploitation and exploration.
In urban environments, supply resources have to be constantly matched to the "right" locations (where customer demand is present) so as to improve quality of life. For instance, ambulances have to be matched to base stations regularly so as to reduce response time for emergency incidents in EMS (Emergency Management Sy…
Existing approaches to resource allocation for nowadays stochastic networks are challenged to meet fast convergence and tolerable delay requirements. The present paper leverages online learning advances to facilitate stochastic resource allocation tasks. By recognizing the central role of Lagrange multipliers, the unde…
Improved resource allocation method reduces procurement costs.
problem Online resource allocation with procurement costs.
method Primal-dual algorithm with surrogate function optimization.
result Enhanced competitive ratio through design methods.
Federated Learning over wireless networks tackles resource allocation challenges.
problem Heterogeneity in UE data and resources in Federated Learning.
method Proposed FL algorithm for heterogeneous data, convergence rate analysis, and resource allocation optimization.
result The proposed algorithm outperforms vanilla FedAvg in convergence rate and accuracy.
PASHA optimizes model tuning for large datasets with limited resources.
problem Expensive HPO and NAS for large datasets.
method Dynamic resource allocation approach.
result Significantly reduces computational resources while maintaining performance.
Study develops a smart contract framework for efficient and fair resource allocation.
problem Lack of rigorous economic foundation in decentralized coordination and smart contract implementations.
method Mechanism design framework with provable convergence guarantees for decentralized price adjustment.
result Proves stability and robustness of the proposed mechanism under various perturbations.
New estimator improves policy evaluation in resource allocation RCTs.
problem Difficulty in evaluating policies optimizing limited resource allocation through RCTs.
method Proposes a novel estimator involving retrospective reshuffling of participants across experimental arms.
result The new estimator provides more accurate policy evaluations than common methods.
Some agent-based models for growth and allocation of resources are described. The first class considered consists of conservative models, where the number of agents and the size of resources are constant during time evolution. The second class is made up of multiplicative noise models and some of their extensions to co…
Develops deep learning for optimizing 5G radio resource allocation.
problem Optimizing 5G base station radio resources for diverse QoS requirements.
method Cascaded neural network structure with deep transfer learning for non-stationary conditions.
result Cascaded neural networks outperform fully connected neural networks in QoS guarantee.
Framework for online resource allocation using social welfare functions.
problem Optimal allocation of resources over time steps in a population.
method Confidence sequence framework for SWF-based online learning and inference, valid for any monotonic, concave, and Lipschitz-continuous SWF.
result Achieves near-optimal regret of i l d e O ( n + n k T ) ilde{O}(n+\sqrt{nkT}) i l d e O ( n + nk T ) for SWF-agnostic algorithm SWF-UCB. Paper proposes OPF policy for fair resource allocation with sublinear regret.
problem Fair resource allocation in an online setting against an unrestricted adversary.
method Online Proportional Fair (OPF) policy achieving approximate sublinear regret.
result OPF policy achieves c α c_α c α -approximate sublinear regret with c α ≤ 1.445 c_α \leq 1.445 c α ≤ 1.445 . Designs for allocating resources to prioritize needy applicants while estimating treatment effects.
problem Resource allocation under uncertainty with prioritized queues.
method Priority-queue randomization for treatment assignment and estimation of treatment effects.
result Identification of causal effects under different arrival and treatment assignment scenarios.
New algorithm tackles resource allocation in multi-armed bandits to balance speed and throughput.
problem Balancing speed and throughput in stochastic multi-armed bandits with limited resources.
method Proposes an algorithm that trades off between information accumulation and throughput.
result Upper bounds the time taken to find the best arm with a given target success probability.
Algorithm allocates perishable resources online to minimize envy and inefficiency.
problem Online allocation of perishable resources to minimize envy and inefficiency.
method Algorithm uses predictions of perishing order and desired envy bound to adaptively allocate resources.
result Algorithm achieves optimal envy-efficiency trade-off as derived from strong lower bounds.
This work tackles resource allocation in asynchronous and stochastic systems.
problem Distributed resource allocation in asynchronous and stochastic settings.
method Approximate stochastic primal-dual approach with asynchronous updates.
result The Asynchronous stochastic Primal-Dual (Asyn-PD) algorithm converges to the saddle point solution at a rate of O ( 1 / t ) O(1/t) O ( 1/ t ) . This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constr…
Study efficient resource allocation for detecting extreme values.
problem Efficiently allocate limited resources to detect extreme values in various fields.
method Proposes ExtremeHunter algorithm for sequential resource allocation under limited feedback.
result Demonstrates ExtremeHunter outperforms oracle policy in detecting extreme values.
This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.
An active learning approach reduces AoI violation in vehicular networks.
problem Dynamic nature of vehicular networks makes resource allocation challenging.
method Gaussian process regression (GPR) for online decentralized active learning.
result Significant improvement in AoI violation probability with at least 50% reduction.
Uber optimizes marketplace levers using machine learning to improve resource allocation efficiency.
problem Optimizing budget allocation for drivers and riders to maximize business value.
method End-to-end machine learning and optimization procedure using feature store, model training, and ADMM.
result Substantially improved Uber's resource allocation efficiency through high-dimensional optimization.
Adaptive RL optimizes testing resource allocation for dynamic software environments.
problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.
DSA efficiently allocates sparsity across layers for budgeted pruning.
problem Efficiently distributing resources (sparsity) across layers in pruning under resource constraints.
method DSA uses differentiable pruning to find continuous layer-wise pruning ratios via gradient-based optimization.
result DSA achieves superior performance and significantly reduces the time cost of pruning.
This paper tackles resource allocation in the Lightning Network using DRL.
problem Complex combinatorial problem of node selection and resource allocation in the Lightning Network.
method Attention-based Deep Reinforcement Learning framework.
result Improved resource allocation leads to better performance and decentralization in the LN.
New algorithm optimizes online network resource allocation with long-term constraints.
problem Optimal resource reservation in communication networks with job transfers and budget limits.
method Randomized exponentially weighted method for long-term constraints.
result Upper bound for regret and cumulative constraint violations established.
New method optimizes resource allocation for uncertain tasks.
problem Optimal resource allocation for uncertain tasks with limited capacity.
method Formulated as an assignment problem, optimized using learning to rank with net discounted cumulative gain.
result Achieves higher expected profit and precision compared to classification methods.
New algorithm learns optimal resource allocation in wireless systems without models.
problem Learning optimal resource allocation in wireless systems without system models.
method Developed a model-free primal-dual algorithm using smoothed surrogates of constrained problems.
result The algorithm can make the gap between optimal values and dual values arbitrarily small.
Study allocates resources to strategic agents while balancing cost and incentives.
problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves i l d e O ( T ) ilde{\mathcal{O}}(\sqrt{T}) i l d e O ( T ) social welfare regret, satisfies all cost constraints, and ensures incentive alignment. We show that, in a resource allocation problem, the ex ante aggregate utility of players with cumulative-prospect-theoretic preferences can be increased over deterministic allocations by implementing lotteries. We formulate an optimization problem, called the system problem, to find the optimal lottery allocation. The …
In industrial environments, an increasing amount of wireless devices are used, which utilize license-free bands. As a consequence of these mutual interferences of wireless systems might decrease the state of coexistence. Therefore, a central coexistence management system is needed, which allocates conflict-free resourc…