This paper optimizes revenue and resource balance in network revenue management.
problem Maximizing revenue while ensuring fair resource consumption across different suppliers.
method Introduces a regularized revenue objective and a primal-dual UCB algorithm for continuous prices and balancing.
result Achieves a worst-case regret of O ~ ( N 5 / 2 T ) \widetilde O(N^{5/2}\sqrt{T}) O ( N 5/2 T ) for revenue maximization and balancing. Algorithm tackles clustered contextual bandits with resource constraints.
problem Maximizing reward while respecting resource limits in unknown cluster contexts.
method Combines econometrics and bandit constraints techniques for sublinear regret.
result Achieves sublinear regret without needing all arm information.
A dueling bandit problem with resource constraints is solved using EXP3.
problem Maximizing rewards in dueling bandits with resource constraints.
method EXP3 algorithm considering resource consumptions.
result Achieves $ ilde{\mathcal{O}}\left({\frac{OPT^{(b)}}{B}}K^{1/3}T^{2/3}
ight)$ regret.
Paper tackles non-monotonic resource utilization in sequential decision-making.
problem Sequential decision-making under uncertainty with resource constraints.
method Introduces a new MDP policy with constant regret against LP relaxation.
result Develops a learning algorithm with logarithmic regret for unknown outcome distributions.
The paper benchmarks data stream classifiers for human activity recognition on connected devices.
problem Challenges in human activity recognition on connected devices, particularly high memory consumption and low F1 scores.
method Evaluation of five stream classification algorithms on real and synthetic datasets, measuring both performance and resource consumption.
result HT and MF classifiers show superior performance and resilience to concept drift compared to other algorithms.
We consider the linear contextual bandit problem with resource consumption, in addition to reward generation. In each round, the outcome of pulling an arm is a reward as well as a vector of resource consumptions. The expected values of these outcomes depend linearly on the context of that arm. The budget/capacity const…
We introduce the logistic model of consumption growth, which captures a negative feedback loop preventing an unlimited growth of consumption due to finite biophysical resources of our planet. This simple dynamic model allows for derivation of the expression describing the declining long-term tail of a social discount c…
A smart method predicts and optimizes decisions online with resource constraints.
problem Online decision-making with resource constraints.
method Combines prediction and optimization with dual update using mirror descent.
result Regret bounds and convergence rates for general convex feasible regions.
Probability distributions of money, income, and energy consumption per capita are studied for ensembles of economic agents. The principle of entropy maximization for partitioning of a limited resource gives exponential distributions for the investigated variables. A non-equilibrium difference of money temperatures betw…
The paper tackles online resource allocation with uncertain coefficients and chance constraints.
problem Online stochastic resource allocation problem with chance constraints.
method Linearization and primal-dual algorithms with heuristic corrections.
result Optimality gap and constraint violation are on the order of √n.
OL4EL optimizes edge learning on resource-constrained servers.
problem Resource constraints on edge servers hinder effective distributed machine learning.
method Online Learning for EL (OL4EL) framework using budget-limited multi-armed bandit model.
result OL4EL significantly improves learning performance while conserving resources.
We study a general problem of allocating limited resources to heterogeneous customers over time under model uncertainty. Each type of customer can be serviced using different actions, each of which stochastically consumes some combination of resources, and returns different rewards for the resources consumed. We consid…
Federated learning optimizes task and resource allocation in balloon networks.
problem Minimizing energy and time consumption in task computation and transmission.
method SVM-based federated learning algorithm to dynamically adjust user associations, service sequences, and task allocations.
result Reduces the weighted sum of energy and time consumption by up to 16.1%.
In this paper, a novel joint transmit power and resource allocation approach for enabling ultra-reliable low-latency communication (URLLC) in vehicular networks is proposed. The objective is to minimize the network-wide power consumption of vehicular users (VUEs) while ensuring high reliability in terms of probabilisti…
A DRL approach optimizes resource allocation in BFL to reduce latency and energy consumption.
problem Energy and CPU constraints of mobile devices and increased training latency due to blockchain mining.
method Deep Reinforcement Learning (DRL) to derive optimal decisions for MLMO.
result Optimal resource allocation and block generation rate to minimize system latency, energy consumption, and incentive cost.
A new algorithm for resource-aware multi-armed bandits minimizes regret.
problem Optimizing resource usage in a multi-armed bandit problem with censored observations.
method UCB-inspired online learning algorithm with theoretical regret analysis.
result The proposed algorithm outperforms standard multi-armed bandit algorithms in simulations.
TensorOpt finds optimal parallelization strategies for DNN training.
problem Finding efficient parallelization strategies for DNN training.
method TensorOpt uses an algorithm (FT) to search for an optimal set of parallelization strategies considering multiple objectives.
result TensorOpt provides accurate runtime cost estimation and adapts to resource availability.
Real-time semantic segmentation for autonomous vehicles on FPGA reduces latency and power consumption.
problem Efficient real-time semantic segmentation for autonomous vehicles.
method Compressed ENet architecture, FPGA deployment, batch processing, filter reduction, quantization-aware training.
result Reduced latency to 3 ms per image with batch size of ten and 40% resource utilization.
Enhanced tabular benchmarks for energy-efficient neural architecture search.
problem Energy consumption in deep learning models.
method Introducing EC-NAS, an enhanced tabular benchmark with energy consumption data.
result EC-NAS reveals a balance between energy usage and accuracy in neural architecture search.
This research optimizes energy consumption forecasting in Puno using parallel computing and ARIMA models.
problem Improving energy consumption forecasting accuracy and efficiency in Puno.
method Parallel computing and ARIMA models for forecasting energy consumption.
result Notable improvements in computational efficiency and data processing capabilities.
Paper tackles online DR-submodular maximization with stochastic constraints.
problem Maximizing utility while adhering to a cumulative resource constraint in an online setting.
method Proposes OLFW algorithm to solve the problem of online continuous DR-submodular maximization with linear stochastic constraints.
result Obtains sub-linear regret and constraint violation bounds.
Energy savings for DNN inference on resource-constrained devices.
problem Energy efficiency in deep learning inference for constrained devices.
method Efficiently searches through equivalent DNN graphs to find the one with the least execution cost.
result Achieves 24% energy savings with minimal performance impact.
New algorithm for contextual bandits with linear constraints using regression.
problem Contextual bandits with packing and covering constraints.
method Modular Lagrangian approach via regression.
result First vanishing-regret guarantees for CBwLC (or CBwK).
PSQRNN model forecasts electricity consumption in China by integrating neural networks and quantile regression.
problem Electricity forecasting in China due to regional economic, social, and natural conditions.
method PSQRNN combines neural networks and semiparametric quantile regression to model electricity consumption.
result PSQRNN model outperforms traditional methods in forecasting electricity consumption in China.
We consider a contextual version of multi-armed bandit problem with global knapsack constraints. In each round, the outcome of pulling an arm is a scalar reward and a resource consumption vector, both dependent on the context, and the global knapsack constraints require the total consumption for each resource to be bel…
This paper optimizes caching and model multiplexing for large model inference.
problem Resource consumption and latency challenges in large model deployment.
method Jointly optimizing a caching algorithm (GDSF or LEC) and a model multiplexer for large model inference.
result Achieves optimal rates in offline and online settings with up to 50x improvement over baseline.
A model is presented in this work for simulating endogenously the evolution of the marginal costs of production of energy carriers from non-renewable resources, their consumption, depletion pathways and timescales. Such marginal costs can be used to simulate the long term average price formation of energy commodities. …
PePR scores assess DL model performance per resource unit, promoting smaller, more efficient models.
problem Limited access to large-scale resources hinders medical image analysis research.
method Introduced PePR score to measure DL model performance per resource unit.
result Small-scale, specialized models outperform large-scale models in resource-constrained settings.
New framework handles online decisions with replenishable resources, improving both adversarial and stochastic performance.
problem Online decision-making with resource constraints that can be replenished.
method Best-of-both-worlds primal-dual template for online learning problems with replenishment.
result First positive results for adversarial inputs and an instance-independent regret bound for stochastic inputs.
TabNAS improves neural architecture search for tabular datasets by rejecting suboptimal architectures.
problem Finding optimal neural architectures for tabular datasets with resource constraints.
method Develops a reinforcement learning controller motivated by rejection sampling to handle resource constraints.
result TabNAS finds better models that obey resource constraints compared to previous methods.
We study the global probability distribution of energy consumption per capita around the world using data from the U.S. Energy Information Administration (EIA) for 1980-2010. We find that the Lorenz curves have moved up during this time period, and the Gini coefficient G has decreased from 0.66 in 1980 to 0.55 in 2010,…
Pseudo rehearsal uses non-photo-realistic images to save resources without sacrificing performance.
problem Catastrophic forgetting in neural networks when learning new tasks.
method Synthetically generate non-photo-realistic images to rehearse previous tasks.
result Non-photo-realistic images can be used for rehearsal without sacrificing performance and significantly reduce resource consumption.
Efficient neural networks for resource-constrained systems.
problem Reducing resource consumption in machine learning models for embedded systems.
method Quantized neural networks, network pruning, structural efficiency.
result Finding good trade-offs between resource efficiency and prediction quality is challenging.
A new text classification method using separable convolution reduces memory consumption.
problem Manual categorization of documents is inefficient and resource-intensive.
method Introducing a new architecture based on separable convolution for text classification.
result Achieved a drastic reduction in trainable parameters without compromising accuracy.
This paper tackles energy-efficient machine learning on low-power devices.
problem Energy consumption in machine learning due to data communication.
method Dynamic averaging for integer exponential families on low-power processors.
result Achieves comparable model quality with significantly less communication and energy.
Study non-stationary bandits with resource constraints.
problem Maximize reward in a non-stationary environment with resource constraints.
method Propose new non-stationarity measure and use primal-dual analysis.
result Upper and lower bounds for non-stationary BwK problem.
There is an increasing interest in a fast-growing machine learning technique called Federated Learning, in which the model training is distributed over mobile user equipments (UEs), exploiting UEs' local computation and training data. Despite its advantages in data privacy-preserving, Federated Learning (FL) still has …
EERO optimizes resource usage for efficient classification.
problem Managing computational resources in complex machine learning models.
method EERO uses multiple classifiers with a reject option to adaptively shorten processing paths.
result EERO effectively manages budget allocation and enhances accuracy in complex scenarios.
New algorithm reduces online decision-making regret with efficient LP re-solving and parallel first-order method.
problem Worse regret guarantees and high computational cost of LP-based OLP algorithms.
method Combines LP-based and first-order OLP methods, re-solving LP subproblems periodically and using parallel first-order method.
result Achieves O ( log ( T / f ) + f ) \mathscr{O}(\log (T/f) + \sqrt{f}) O ( log ( T / f ) + f ) regret, balancing computational efficiency and superior regret guarantee. Algorithm maximizes rewards with a budget and giving up option.
problem Sequential decision-making with stochastic rewards and resource consumption.
method Upper Confidence Bound (UCB) algorithm for maximizing cumulative reward.
result Logarithmic regret bound with improved dependence on problem parameters.
CICLAD efficiently mines frequent closed itemsets from data streams with minimal memory usage.
problem Mining frequent closed itemsets from data streams is resource-intensive.
method CICLAD is an intersection-based sliding-window FCI miner that optimizes memory usage while maintaining performance.
result CICLAD achieves significantly lower memory footprint compared to existing methods.
Neural Architecture Search aims at automatically finding neural architectures that are competitive with architectures designed by human experts. While recent approaches have achieved state-of-the-art predictive performance for image recognition, they are problematic under resource constraints for two reasons: (1)the ne…
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.
SEFR is a fast, energy-efficient classifier for ultra-low power devices.
problem Running machine learning on battery-powered devices is challenging due to time and energy constraints.
method SEFR is an ultra-low power classifier with linear time complexity for training and testing.
result SEFR is 63 times faster and 70 times more energy efficient than state-of-the-art classifiers.
HATCH learns optimal recommendations with resource constraints.
problem Resource-constrained recommendation systems.
method Hierarchical adaptive contextual bandits with adaptive resource allocation.
result HATCH achieves a regret bound of O ( T ) O(\sqrt{T}) O ( T ) . In this paper, the problem of energy efficient transmission and computation resource allocation for federated learning (FL) over wireless communication networks is investigated. In the considered model, each user exploits limited local computational resources to train a local FL model with its collected data and, then,…
In the coming years, the satellite broadband market will experience significant increases in the service demand, especially for the mobility sector, where demand is burstier. Many of the next generation of satellites will be equipped with numerous degrees of freedom in power and bandwidth allocation capabilities, makin…
Optimal algorithm for maximizing rewards in contextual bandits with resource constraints.
problem Maximizing rewards in contextual bandits with resource constraints.
method Proposed a universal and optimal algorithmic framework for CBwK by reducing it to online regression.
result Established the optimality of the proposed algorithm for various function classes.