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,695 papers · 148 categories

Trend · papers per month

3897781,1661,555 · Jun 202019922001200920172026
48 results for learning resources

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.

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.

Method predicts hardware resource usage by control software with guaranteed linear convergence.

problem Predicting time-varying hardware resource availability in control software.
method Path structured multimarginal Schrödinger bridge (MSBP) for learning stochastic resource usage.
result Guaranteed linear convergence to accurate prediction of hardware resource utilization.

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.

Review of efficient neural networks for TinyML on resource-constrained devices.

problem Resource constraints on ultra-low power MCUs for deep learning models.
method Model compression, quantization, low-rank factorization, model pruning, hardware acceleration, algorithm-architecture co-design.
result Optimized neural network architectures for minimal resource utilization on MCUs.

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.

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~(N5/2T)\widetilde O(N^{5/2}\sqrt{T}) for revenue maximization and balancing.

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.

Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.

problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.

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.

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.

FAVANO improves federated learning for resource-constrained environments.

problem Asynchronous communication in federated learning leads to bias and scalability issues.
method FAVANO is a novel asynchronous federated learning framework for resource-constrained environments.
result FAVANO outperforms existing methods on standard benchmarks.

The study examines how quantum resources enhance the complexity of quantum circuits.

problem Quantum resource enhancement on circuit complexity.
method Utilizing quantum resource theories, the study analyzes statistical complexities of quantum circuits with limited quantum resources.
result Bounds for statistical complexities of quantum circuits are derived and applied to specific cases.

While machine learning is traditionally a resource intensive task, embedded systems, autonomous navigation, and the vision of the Internet of Things fuel the interest in resource-efficient approaches. These approaches aim for a carefully chosen trade-off between performance and resource consumption in terms of computat…

2020-01-07abs ↗pdf ↗

New models improve morpheme segmentation in low-resource languages.

problem Improving morpheme segmentation in low-resource languages.
method Two new models: LSTM pointer-generator and sequence-to-sequence with hard monotonic attention.
result Novel models outperform existing ones by up to 11.4% accuracy in low-resource settings.

New framework guides resource usage to achieve sublinear regret in adversarial settings.

problem Achieving sublinear regret in online decision making with changing reward and cost distributions.
method General primal-dual methods guided by spending plans that ensure balanced resource usage.
result Achieves sublinear regret with respect to spending plans that balance resource usage.

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.

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.

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 ↗

Large multi-tenant production clusters often have to handle a variety of jobs and applications with a variety of complex resource usage characteristics. It is non-trivial and non-optimal to manually create placement rules for scheduling that would decide which applications should co-locate. In this paper, we present De…

2019-07-30abs ↗pdf ↗

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.

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.

FedZKT enables resource-constrained devices to participate in federated learning with heterogeneous models.

problem Inequality in resource allocation hinders participation from resource-constrained devices in federated learning.
method Zero-shot knowledge transfer through a server-assigned distillation process.
result FedZKT effectively transfers knowledge across heterogeneous on-device models without requiring comparable local training efforts.

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.

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.

The paper examines efficient algorithms for linear regression over resource-limited networks.

problem Efficient communication in distributed learning over resource-limited networks.
method Developed algorithms for communication-efficient learning of linear regression tasks.
result The algorithms enable a tradeoff between communication and learning with theoretical performance guarantees.

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.

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.

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.

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.

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.

HL algorithms improve resource allocation in cloud environments.

problem Sequential decision-making under uncertainty with exogenous variables.
method HL algorithms leverage exogenous variable samples to infer counterfactual consequences.
result HL algorithms outperform classic methods and reinforcement learning in resource allocation.