This paper presents an assessment of global economic energy potentials for all major natural energy resources. This work is based on both an extensive literature review and calculations using natural resource assessment data. Economic potentials are presented in the form of cost-supply curves, in terms of energy flows …
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,786 papers · 148 categories
Trend · papers per month
48 results for “natural resources”
Dynamic programming helps manage fisheries affected by random disturbances.
problem Managing fisheries affected by random disturbances.
method Dynamic programming approach to analyze and optimize management strategies.
result Dynamic programming is crucial for fully characterizing optimal harvest strategies.
Unified model for sequence labeling and classification.
problem Efficiently perform multiple sequence labeling tasks.
method Generative framework with shared natural language output space.
result Significant improvements in few-shot and low-resource slot labeling.
Study optimizes natural resource harvesting under model uncertainty using risk measures.
problem Optimal harvesting policy selection for natural resources under model uncertainty.
method Investigated using neoclassical growth model dynamics and convex risk measures, specifically Fréchet risk measures.
result Robust harvesting strategies quantifying operational and marginal risk under model uncertainty.
This paper studies the optimal extraction and taxation of nonrenewable natural resources. It is well known that the market values of the main strategic resources such as oil, natural gas, uranium, copper,..., etc, fluctuate randomly following global and seasonal macroeconomic parameters, these values are modeled using …
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.
This paper studies the problem of optimally extracting nonrenewable natural resource in light of various financial and economic restrictions and constraints. Taking into account the fact that the market values of the main natural resources i.e. oil, natural gas, copper,...,etc, fluctuate randomly following global and s…
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. …
Survey on using large models to train smaller datasets in NLP.
problem Lack of large datasets and computing resources for NLP tasks.
method Analysis of recent transfer learning approaches in NLP.
result Increased demand for transfer learning in NLP due to large models.
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.
This research creates and classifies datasets for Setswana and Sepedi news headlines.
problem Challenges in creating and preparing datasets for low-resourced languages.
method Investigates an approach for data augmentation tailored to low resource languages.
result Improves classification performance on news topic classification task.
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.
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 for SWF-agnostic algorithm SWF-UCB.
Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resourcescs.LG
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.
End-to-end Sanskrit TTS developed with limited data, achieving good quality.
problem Developing natural-sounding speech for Sanskrit with scarce data.
method Fine-tuning Tacotron2 model with WaveGlow and transfer learning.
result Achieved an overall MOS of 3.38 from 37 evaluators.
Offline RL tackles resource-constrained online deployment with improved policy transfer.
problem Training policies with limited online features using a rich offline dataset.
method Introduce a policy transfer algorithm that first trains a teacher agent with full offline features and then transfers knowledge to a student agent with limited online features.
result Consistent improvement in performance over baseline methods on resource-constrained datasets.
We tackle the problem of multi-task learning with copula process. Multivariable prediction in spatial and spatial-temporal processes such as natural resource estimation and pollution monitoring have been typically addressed using techniques based on Gaussian processes and co-Kriging. While the Gaussian prior assumption…
The study enhances financial rule matching using NLP without datasets.
problem Performing semantic matching between financial rules and policies.
method Outperforming pre-trained models with NLP techniques using free resources.
result Improved semantic matching between financial rules and policies.
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.
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.
Range penalization enhances statistical accuracy and resource efficiency in federated learning.
problem Statistical accuracy and resource efficiency in federated learning.
method Range regularization and polar clustering.
result Enhanced statistical accuracy and reduced iteration complexity.
Optimizes resource allocation in a network with random job requests.
problem Minimizing costs while satisfying job requests within a budget.
method Formalizes as a repeated game, proposes an online saddle-point algorithm.
result Upper bounds for regret and constraint violations are derived.
This study uses OPE methods to quickly assess auction policies.
problem Rapid decision-making in dynamic auction environments.
method Off-Policy Evaluation and counterfactual methods.
result Improved policy selection and optimization.
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.
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 -approximate sublinear regret with .
New MBL hidden Born machine learns various tasks.
problem Learning from quantum many-body systems.
method MBL dynamics and hidden units for training.
result Enhanced trainability and stability in learning.
This study compresses BERT to make it suitable for low-capability devices.
problem Large Transformer models are resource-intensive.
method Survey and analysis of model compression techniques for BERT.
result Insights into best practices for compressing large-scale Transformer models.
Meta-learning improves GNN initializations for low-resource drug discovery.
problem Limited labeled data hinders deep learning in drug discovery.
method Model-Agnostic Meta-Learning (MAML) and its variants for graph neural networks initializations.
result Meta-initializations outperform multi-task pre-training baselines on 16 out of 20 tasks and all out-of-distribution tasks.
Attention operators have been widely applied in various fields, including computer vision, natural language processing, and network embedding learning. Attention operators on graph data enables learnable weights when aggregating information from neighboring nodes. However, graph attention operators (GAOs) consume exces…
Paper improves natural language understanding with less data using a new training method.
problem Limited data hinders performance of small models in natural language tasks.
method Generation-Distillation: uses large finetuned models to generate new training data and distill knowledge into smaller models.
result Achieves comparable performance to BERT with 300x fewer parameters and outperforms prior distillation methods.
Concerns about interpretability, computational resources, and principled inductive priors have motivated efforts to engineer sparse neural models for NLP tasks. If sparsity is important for NLP, might well-trained neural models naturally become roughly sparse? Using the Taxi-Euclidean norm to measure sparsity, we find …
Interference among concurrent transmissions in a wireless network is a key factor limiting the system performance. One way to alleviate this problem is to manage the radio resources in order to maximize either the average or the worst-case performance. However, joint consideration of both metrics is often neglected as …
Resource scheduling and coordination is an NP-hard optimization requiring an efficient allocation of agents to a set of tasks with upper- and lower bound temporal and resource constraints. Due to the large-scale and dynamic nature of resource coordination in hospitals and factories, human domain experts manually plan a…
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.
We introduce an agent-based model, in which agents set their prices to maximize profit. At steady state the market self-organizes into three groups: excess producers, consumers and balanced agents, with prices determined by their own resource level and a couple of macroscopic parameters that emerge naturally from the a…
Generative models predict page quality without training, useful for low-resource settings.
problem Detecting low-quality content in web articles.
method Human evaluation and analysis of 500 million web articles.
result Generative models can predict page quality without training, useful for low-resource settings.
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.
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.
This paper tackles non-linear reward optimization in resource allocation problems.
problem Optimizing a non-linear function of long-term average rewards in resource allocation problems.
method Proposes model-based and model-free algorithms to learn optimal policies.
result Model-based algorithm achieves a regret of $\Tilde{O}\left(LKDS\sqrt{\frac{A}{T}}
ight)$ for objectives combined with a concave -Lipschitz function.
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.
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.
Method learns software resource usage from snapshots.
problem Challenges in learning time-varying, correlated resource usage.
method Graph structured Schrödinger bridge problem for nonparametric learning.
result Predicts most-likely resource distributions.
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.
Proposes a new framework for resource-limited recommendation.
problem Resource constraints affect user choices in recommendation tasks.
method Interest-behavior multiplicative network with MRRNNs and resource-limited branch.
result Framework effectively predicts user interactions considering resource limitations.
Mobile V-MoEs scale down ViTs for resource-constrained vision tasks.
problem Scaling down Vision Transformers for resource-constrained applications.
method Sparse Mixture-of-Experts (MoEs) applied to entire images, with a stable training procedure.
result Mobile V-MoEs achieve better performance-efficiency trade-offs than dense ViTs.
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.
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 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.