Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

23466891 · Jun 202019922001200920172026
48 results for radio resource allocation

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.

New RL approach optimizes resource allocation in multiservice networks.

problem Optimizing resource allocation in multiservice wireless systems with QoS constraints.
method Distributed deep reinforcement learning for non-convex optimization.
result Near optimal performance in terms of throughput and outage rate.

Graph neural networks optimize radio resource management policies for wireless networks.

problem Optimizing user selection and power control in wireless networks with fairness constraints.
method Formulated as a Lagrangian dual problem, RRM policies are parameterized by a GNN architecture trained on channel conditions.
result The method achieves superior tradeoff between average and 5th percentile rates, demonstrating fairness.

Optimizes wireless network resource management with state-augmented policies.

problem Optimizing network-wide utility with user performance constraints.
method State-augmented parameterization of RRM policy, using dual variables.
result Superior trade-off between mean, minimum, and 5th percentile rates.

Optimizes data power control in cell-free networks for better spectral efficiency.

problem Maximizing overall spectral efficiency in cell-free networks with multi-objective optimisation.
method Applied scalable multi-objective Bayesian optimisation to solve convergence-time limitations.
result Improved radio resource management in cell-free networks.

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.

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…

2016-07-10abs ↗pdf ↗

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.

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 ildeO(Tmn) ilde{O}(\sqrt{Tmn}) regret, optimal with respect to time horizon TT.

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], demonstrating a phase transition at b=1/2b=1/2.
result Achieved optimal gap-dependent and gap-independent regret bounds for b[0,1]b \in [0,1].

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…

2018-03-28abs ↗pdf ↗

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…

2018-12-03abs ↗pdf ↗

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.

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 ildeO(n+nkT) ilde{O}(n+\sqrt{nkT}) 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_α-approximate sublinear regret with cα1.445c_α \leq 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.

The virtualization of compute and network resources enables an unseen flexibility for deploying network services. A wide spectrum of emerging technologies allows an ever-growing range of orchestration possibilities in cloud-based environments. But in this context it remains challenging to rhyme dynamic cloud configurat…

2019-11-18abs ↗pdf ↗

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).

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…

2018-07-21abs ↗pdf ↗

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.