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

Trend · papers per month

4385128170 · Jun 202019922001200920172026
48 results for Resource Competition

The study examines how alternative resource adequacy contract designs affect market participants' risk profiles and resource mix.

problem The tension between promoting reliability and competition in liberalized electricity markets.
method Constructs a stochastic equilibrium model of a competitive market with incomplete risk trading and computes investment equilibria under different contracting regimes.
result Alternative contracting regimes can induce different risk profiles and resource mixes, affecting market outcomes.

State-of-the-art image recognition systems use sophisticated Convolutional Neural Networks (CNNs) that are designed and trained to identify numerous object classes. Such networks are fairly resource intensive to compute, prohibiting their deployment on resource-constrained embedded platforms. On one hand, the ability t…

2018-12-16abs ↗pdf ↗

New framework promotes reproducible, domain-agnostic reinforcement learning algorithms.

problem Domain-specific, compute-resource-maximizing, and non-reproducible participant solutions in reinforcement learning competitions.
method Submission retraining, domain randomization, desemantization through domain obfuscation, and compute/environment-sample budget limitation.
result Participant submissions are reproducible, non-specific to the competition environment, and sample/resource efficient.

LLMs can collude in market divisions, maximizing profits.

problem Strategic collusion of LLM agents in multi-commodity markets.
method Examined LLMs in Cournot competition frameworks, analyzing pricing and resource allocation strategies.
result LLMs can monopolize specific commodities without direct human input or explicit collusion commands.

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.

We introduce an irreversible discrete multiplicative process that undergoes Bose-Einstein condensation as a generic model of competition. New players with different abilities successively join the game and compete for limited resources. A player's future gain is proportional to its ability and its current gain. The the…

2003-03-16abs ↗pdf ↗

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…

2018-10-11abs ↗pdf ↗

MineRL Competition reduced reinforcement learning sample needs.

problem Sample inefficiency in reinforcement learning.
method Human demonstrations and imitation learning integrated into reinforcement learning algorithms.
result Top solutions used deep reinforcement learning and imitation learning.

First ABAW 2020 Competition analyzes affective behavior tasks.

problem Automatic analysis of valence-arousal, basic expressions, and action units in real-world scenarios.
method Provided Aff-Wild2 database, described Challenges, evaluation metrics, and top-performing systems.
result Demonstrated the feasibility of automatic affective behavior analysis in real-world settings.

Transformers trained with three normalization changes outperform state-of-the-art on low-resource translation tasks.

problem Improving the training of Transformers, especially on low-resource datasets.
method Three normalization changes: PreNorm, ScaleNorm, and FixNorm.
result Significant improvements in BLEU scores on low-resource translation tasks.

Improves bandits with knapsacks guarantees for partially stochastic workloads.

problem Improves guarantees for Bandits with Knapsacks (BwK) with partially stochastic workloads.
method Defines Approximately Stationary BwK, explores algorithms with smooth competitive ratios transitioning between stochastic and adversarial cases.
result Offers competitive ratios that smoothly transition between the best possible guarantees in stochastic and adversarial cases, especially beneficial when budget is small.

Hierarchical IBP model for Bayesian neural networks in continual learning.

problem Resource allocation in continual learning with dynamic network complexity.
method Indian Buffet process (IBP) and Hierarchical-IBP (H-IBP) priors for structure learning, online variational inference with reparameterization.
result Our model effectively learns the number of weights in each layer, overcoming overfitting and underfitting.

Study shows how competition affects learning in matching markets, proving it's possible to balance stability, fairness, and regret.

problem How competition affects learning in matching markets and the impossibility of simultaneously guaranteeing stability and low optimal regret.
method Modeling a two-sided matching market with bandit learners and adding components of costs and transfers.
result It is possible to simultaneously guarantee stability, low optimal regret, fairness in the distribution of regret, and high social welfare.

The stability analysis of socioeconomic systems has been centered on answering whether small perturbations when a system is in a given quantitative state will push the system permanently to a different quantitative state. However, typically the quantitative state of socioeconomic systems is subject to constant change. …

2014-08-29abs ↗pdf ↗

We show that a simple model of a spatially resolved evolving economic system, which has a steady state under simultaneous updating, shows stable oscillations in price when updated asynchronously. The oscillations arise from a gradual decline of the mean price due to competition among sellers competing for the same reso…

2008-01-25abs ↗pdf ↗

Simplified image clustering achieves competitive results without text-based embeddings.

problem Complexity and resource requirements of state-of-the-art clustering methods.
method SCP: trains a small cluster head using pre-trained vision model features and positive data pairs.
result SCP achieves highly competitive performance on various benchmark datasets.

EEG-TCNet improves MI-BMIs with high accuracy and low resource usage.

problem Improving motor-imagery brain-machine interfaces with high accuracy and low resource usage.
method Proposes EEG-TCNet, a novel TCN for embedded MI-BMIs.
result EEG-TCNet achieves 83.84% classification accuracy on MOABB, outperforming SoA by 0.25.

CLEANN detects and mitigates neural network Trojans without labeled data.

problem Trojans in embedded neural networks that bypass detection during inference.
method Dictionary learning and sparse approximation for identifying Trojan triggers, lightweight algorithm/hardware co-design.
result Efficient real-time execution on resource-constrained platforms, competitive attack resiliency.

Enhash detects concept drift in data streams quickly and efficiently.

problem Detecting abrupt, gradual, virtual, or recurring events in data streams.
method Uses projection hash to insert incoming samples and detects concept drift.
result Enhash has competitive performance and moderate resource requirements compared to existing ensemble learners.

This work proposes a student-teacher network for predicting hospital admission locations.

problem Accurate prediction of hospital admission locations to optimize resource allocation.
method Reinforcement learning approach where a teacher network selects data batches for a student network.
result The approach outperforms state-of-the-art methods on tabular data and image recognition.

Standard economic theory, starting with Adam Smith's invisible hand, holds that those who trade for their own selfish motives of maximizing their private preferences may contribute more to the public wealth than those who claim altruistic motives. Under restrictive conditions, this has been shown to result from a self-…

2005-10-09abs ↗pdf ↗

Develops a cross-lingual hate speech detection model using pre-trained Transformers.

problem Detecting hate speech in low-resource languages.
method Utilizes frozen Transformer language models and AXEL attention-based classification block for zero-shot and few-shot learning.
result Demonstrates highly competitive results on English and Spanish subsets of the HatEval challenge.

Single neural network predicts ImageNet model parameters for faster training.

problem Training diverse ImageNet models requires significant resources and time.
method Trained a neural network to predict ImageNet model parameters and used them for initialization.
result Models initialized with predicted parameters converge faster and achieve competitive performance.

European steel industry shifts to electric arc furnaces, reducing scrap imports and increasing competition.

problem Reducing CO2 emissions in the European steel industry through electric arc furnaces.
method Combining trade data with business intelligence to model the impact of EAF capacity on scrap trade.
result Scrap imports decrease as EAF capacity increases, highlighting the need for a new business ecosystem.

Paper develops security model and pricing for stable digital currency in quantum blockchain network.

problem Securing and pricing stable digital currency in a quantum blockchain network.
method Developed a block-based quantum channel networking technology and a FinTech platform model with dynamic pricing.
result Established a generalized IoB security model using quantum channel networking and QKD.

Transformer models waste resources on long-context tasks.

problem Redundant attention computations in Transformer models for long-context tasks.
method Reformulate sequence modeling as supervised learning, analyze attention sparsity, formulate attention optimization as linear coding problem, propose Dynamic Group Attention.
result DGA reduces computational costs while maintaining performance.