Resource-efficient oblique trees reduce neural signal classification costs.
problem Implementing efficient neural signal classifiers on resource-constrained devices.
method Integrating model compression, probabilistic routing, and cost-aware learning.
result Significant reduction in model size and feature extraction cost compared to state-of-the-art models.
New strategies reduce FL's impact on client resources, enabling larger models and more users.
problem Communication bottleneck in Federated Learning on heterogeneous edge networks.
method Lossy compression and Federated Dropout to reduce client-to-server communication and local computation.
result Up to 14x reduction in server-to-client communication, 1.7x reduction in local computation, and 28x reduction in upload communication.
Deep RL methods improve resource allocation in uncertain environments.
problem Optimizing resource allocation in dynamic, uncertain environments.
method Developed three DDPG-based approaches to handle constraints and combinatorial action spaces.
result Demonstrated improved performance over existing methods on real and semi-real data.
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.
Study on revenue management with limited switches, achieving strong performance and reduced switch counts.
problem Resource-constrained dynamic pricing with limited switching constraints.
method Developed algorithms for blind network revenue management and bandits with knapsacks, achieving optimal regret rates.
result Optimal regret rates are fully characterized by a piecewise-constant function of the switching budget and resource constraints.
Quantum Signal Processing reduces derivative pricing quantum resource requirements.
problem Efficiently pricing financial derivatives on quantum computers.
method Quantum Signal Processing (QSP) to encode payoffs directly into quantum amplitudes.
result Significantly reduces quantum resources (T-gates and qubits) for practical derivative contracts.
MDLdroid improves mobile deep learning for personal sensing with faster training.
problem Continuous local changes and resource constraints in personal mobile sensing affect global model performance.
method ChainSGD-reduce approach to reduce overhead and balance resources.
result 2x to 3.5x faster training on off-the-shelf mobile devices compared to single-device training.
This paper optimizes AI inference on edge devices with reduced communication and computation costs.
problem Efficiently performing AI inference on resource-constrained edge devices with reduced communication and computation costs.
method A three-step framework for effective inference: model split point selection, communication-aware model compression, and task-oriented encoding of intermediate features.
result Our proposed framework achieves a better trade-off and significantly reduces inference latency compared to baseline methods.
DeepPlace learns to place applications in clusters using RL.
problem Manual placement rules for scheduling are non-trivial and suboptimal.
method Uses Deep Reinforcement Learning to learn optimal placement rules.
result Reduces resource competition and optimizes cluster utilization.
Reduces deep learning training data for faster testing.
problem Resource-intensive deep learning training with full data sets.
method Evaluated different training set reduction methods.
result Training set reduction is useful in resource-constrained environments.
Paper presents runtime-throttleable neural networks for resource-constrained devices.
problem Resource constraints in edge computing platforms.
method Runtime-throttleable neural networks using block-level gating.
result Smooth performance throttling with minimal accuracy loss.
A new DNN structure reduces complexity for wireless tasks.
problem Reducing complexity in training deep neural networks for wireless tasks.
method Proposes a DNN with special structure using permutation invariant a priori information.
result The proposed DNN structure reduces training complexity and model parameters.
Optimal design portfolios improve energy efficiency and reduce risk in uncertain reservoirs.
problem Uncertain reservoir conditions lead to unstable gas recovery and low resource efficiency.
method Developed optimal portfolios of well designs based on reservoir conditions and probabilities.
result Remarkable reduction in variation and substantial increase in energy efficiency achieved.
Study evaluates feature selection methods for emotion recognition in resource-constrained settings.
problem Reducing memory and computational requirements for emotion recognition in low-resource settings.
method Evaluation of three feature selection methods: ILFS, ReliefF, Fisher, and AFS.
result Smaller feature sets can achieve similar or better accuracy, reducing resource usage.
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.
Paper introduces REED for noncoherent OTA-FL, reducing latency without phase alignment.
problem Noncoherent OTA-FL requires signed model updates without phase alignment.
method Introduces REED for continuous signed aggregation using resource-element energy difference.
result Exact variance laws for REED and chip-diverse extension in Rayleigh fading.
Paper develops deep neural networks for wireless tasks with reduced complexity.
problem Reducing training complexity for deep neural networks in wireless systems.
method Develops permutation invariant DNNs (PINNs) leveraging wireless task properties.
result Demonstrates dramatic reduction in training complexity for PINNs.
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. This paper optimizes resource allocation for crowdsourced live streaming to improve viewer experience and reduce costs.
problem Improving viewer quality of experience (QoE) in crowdsourced live streaming.
method A prediction-driven resource allocation framework using machine learning to predict viewer numbers and proactively allocate resources.
result Maximizes viewer QoE and minimizes resource allocation costs through precise resource provisioning.
Paper presents a new method to train deep neural networks with reduced memory access.
problem High computational and storage complexity of deep neural networks.
method Boolean logic minimization to remove memory access and reduce resource usage.
result Significantly lower latency and two orders of magnitude fewer computing resources.
Boosting classifiers improve accuracy with noisy inputs.
problem Noisy communication or computation degrades boosting classifier accuracy.
method Optimize resource allocation for base classifiers based on importance metrics.
result Optimized noisy boosting classifiers are more robust than bagging.
EigenDamage reduces neural network size and FLOPs with structured pruning in the Kronecker-Factored Eigenbasis.
problem Reducing neural network size and FLOPs while maintaining accuracy for resource-constrained devices.
method Kronecker-Factored Eigenbasis reparameterization and Hessian-based structured pruning.
result Empirically validated improvements in model size and FLOPs with negligible accuracy loss.
Compact neural network for ECG classification reduces resource needs.
problem Current reliance on deep learning for ECG analysis requires extensive resources and large datasets.
method Simple ANN architecture with advanced feature engineering.
result Achieved 97.36% accuracy in classifying 4 types of arrhythmias.
A new RNN architecture reduces model size and improves performance.
problem Overparameterization and resource limitations in RNNs.
method Jointly encodes weight matrices using tensor-train factorization.
result Reduces model size by several orders of magnitude without sacrificing performance.
Researchers successfully implemented quantum autoencoders using quantum adders in a cloud quantum computer.
problem Reducing resource usage in quantum computations.
method Experimental implementation of quantum autoencoders using approximate quantum adders in a cloud quantum computer.
result Experimental fidelities are in good agreement with theoretical predictions, proving the feasibility of quantum autoencoders via quantum adders.
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.
Efficient ML for real-world systems tackles resource constraints and uncertainty.
problem Resource constraints and uncertainty in machine learning.
method Resource-efficient techniques for model size reduction, compression, and reduced precision. Probabilistic graphical models for robustness.
result Robust and efficient machine learning for real-world systems.
Quantum advantage in derivative pricing requires 8k qubits and 54M T-depth.
problem Quantum advantage in pricing derivatives.
method Re-parameterization method combining pre-trained variational circuits and fault-tolerant quantum computing.
result Benchmark use cases require 8k logical qubits and a T-depth of 54 million.
OpTorch optimizes deep learning for resource-limited environments.
problem Resource constraints in deep learning training.
method Optimized deep learning pipelines in training time and memory.
result Achieved similar accuracy to existing libraries with reduced memory usage.
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.
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.
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.
Prunes neural networks at initialization to save resources, achieving high accuracy.
problem Efficiently reducing resource requirements for neural networks at both training and test time.
method Gradient Signal Preservation (GraSP) to prune networks at initialization.
result Pruning 80% of VGG-16 weights on ImageNet with only a 1.6% drop in accuracy.
New graph attention operators improve performance and reduce computational costs.
problem Excessive computational resources in graph attention operators.
method Proposed hGAO and cGAO using hard and channel-wise attention mechanisms.
result Improved performance and computational savings with new operators.
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.
CNN improves medium-range temperature forecasts with limited resources.
problem Limited computational resources for high-resolution temperature forecasts.
method CNN post-processing with ensemble NWP models for bias correction and spatial downscaling.
result High-resolution (5-km) surface temperature forecasts with lead times up to 5.5 days.
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.
AgileNet improves few-shot learning for resource-constrained devices.
problem Efficient few-shot learning on resource-constrained devices.
method Lightweight dictionary-based few-shot learning approach.
result AgileNet achieves superior accuracy compared to prior arts.
Framework identifies comorbidities for frequent ED and inpatient visits.
problem Reducing resource usage and costs in frequent patients.
method Developed MSAR algorithm to identify comorbidities.
result MSAR identifies conditions most associated with reoccurring ED and inpatient visits.
Automated tool reduces FPGA inference latency to 5 μs for deep neural networks.
problem Deploying ultra low-latency, low-power deep neural networks on FPGAs.
method Extending hls4ml library, using model compression techniques like pruning and quantization-aware training.
result Achieved inference latency of 5 μs with 97% resource reduction.
Improved distributed learning with reduced communication costs.
problem Efficient communication in resource-constrained environments for distributed learning.
method Proposed a cost-effective partial communication protocol.
result Communication cost is reduced to O ( log T ) O(\log T) O ( log T ) , improving significantly on full communication. 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.
NASIB adapts NAS to varying computation resources efficiently.
problem Constrained computation resources in enterprise environments.
method Adapts exploration vs. exploitation trade-off and uses Superkernels.
result Searches over a larger space with similar accuracy in less time.
Paper proposes GAN-DDQN for efficient resource allocation in network slicing.
problem Efficient resource allocation in network slicing with varying service demands.
method Leverage deep reinforcement learning with GAN-DDQN to minimize SSR and SE discrepancies.
result Proposed GAN-DDQN and Dueling GAN-DDQN algorithms improve resource allocation efficiency.
Automatically balances blockchain network resources to boost market efficiency.
problem Extractable value leakage and execution frictions in blockchain networks.
method Systematically uses idle network resources for arbitrage, incentivizing transactions.
result Reduces network inventory risk while enhancing price formation and liquidity.
EENA efficiently searches neural architectures with minimal resources.
problem Lack of direction and high computational cost in neural architecture search.
method EENA uses guided evolution with mutation and crossover operations.
result EENA designs highly effective neural architectures with minimal resources.
The paper proposes an online algorithm for network resource allocation with reduced costs.
problem Optimizing resource allocation and job transfers in a network of servers.
method Randomized online algorithm based on the exponentially weighted method.
result The algorithm achieves sub-linear regret, indicating improved efficiency over time.
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.