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

Trend · papers per month

23466891 · Jun 202019922001200920172026
48 results for resource demands

In urban environments, supply resources have to be constantly matched to the "right" locations (where customer demand is present) so as to improve quality of life. For instance, ambulances have to be matched to base stations regularly so as to reduce response time for emergency incidents in EMS (Emergency Management Sy…

2018-12-03abs ↗pdf ↗

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.

We consider a fundamental dynamic allocation problem motivated by the problem of securities lending\textit{securities lending} in financial markets, the mechanism underlying the short selling of stocks. A lender would like to distribute a finite number of identical copies of some scarce resource to nn clients, each of whom has a priv…

2019-12-12abs ↗pdf ↗

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.

Study optimizes pricing under uncertainty and capacity constraints.

problem Optimizing pricing decisions under demand uncertainty and capacity constraints.
method Analyzes linear demand, stochastic noise, and finite capacity; uses certified demand forecasts and control variates.
result Certified demand forecasts reduce regret from O(T)O(\sqrt{T}) to O(logT)O(\log T) under certain conditions.

A new contrastive learning objective, FlatNCE, fixes resource demands in small-batch training.

problem Resource demands in contrastive learning schemes, especially with small-batch training.
method FlatNCE is a novel contrastive objective that no longer explicitly aims for a discriminative classification goal.
result FlatNCE enables immediate performance boost independent of subject-matter engineering efforts.

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.

Datasets are growing not just in size but in complexity, creating a demand for rich models and quantification of uncertainty. Bayesian methods are an excellent fit for this demand, but scaling Bayesian inference is a challenge. In response to this challenge, there has been considerable recent work based on varying assu…

2016-02-16abs ↗pdf ↗

High volume of data, perceived as either challenge or opportunity. Deep learning architecture demands high volume of data to effectively back propagate and train the weights without bias. At the same time, large volume of data demands higher capacity of the machine where it could be executed seamlessly. Budding data sc…

2018-05-12abs ↗pdf ↗

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.

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 ↗

Taxi demand prediction is an important building block to enabling intelligent transportation systems in a smart city. An accurate prediction model can help the city pre-allocate resources to meet travel demand and to reduce empty taxis on streets which waste energy and worsen the traffic congestion. With the increasing…

2018-02-23abs ↗pdf ↗

We propose a frustrated and disordered many-body model of a stockmarket in which independent adaptive traders can trade a stock subject to the economic law of supply and demand. We show that the typical scaling properties and the correlated volatility arise as a consequence of the collective behavior of agents: With th…

2000-08-31abs ↗pdf ↗

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.

Study develops a smart contract framework for efficient and fair resource allocation.

problem Lack of rigorous economic foundation in decentralized coordination and smart contract implementations.
method Mechanism design framework with provable convergence guarantees for decentralized price adjustment.
result Proves stability and robustness of the proposed mechanism under various perturbations.

Algorithm allocates perishable resources online to minimize envy and inefficiency.

problem Online allocation of perishable resources to minimize envy and inefficiency.
method Algorithm uses predictions of perishing order and desired envy bound to adaptively allocate resources.
result Algorithm achieves optimal envy-efficiency trade-off as derived from strong lower bounds.

We present and evaluate Deep Private-Feature Extractor (DPFE), a deep model which is trained and evaluated based on information theoretic constraints. Using the selective exchange of information between a user's device and a service provider, DPFE enables the user to prevent certain sensitive information from being sha…

2018-02-09abs ↗pdf ↗

Kolmogorov-Arnold Networks enable ultrafast online learning with fixed-point quantization.

problem Efficient online learning for high-frequency systems with strict memory constraints.
method Fixed-point online training on FPGAs exploiting B-spline locality in KANs.
result Kolmogorov-Arnold Networks are more efficient and expressive than MLPs for low-latency tasks.

BoostTransformer uses boosting to improve transformer efficiency and accuracy.

problem Heavy computational resources and hyperparameter tuning in transformer architectures.
method Augments transformers with boosting principles through subgrid token selection and importance-weighted sampling, incorporating a least square boosting objective directly into the pipeline.
result BoostTransformer demonstrates faster convergence and higher accuracy compared to standard transformers.

DQA efficiently quantizes deep neural network activations for resource-constrained devices.

problem Efficiently quantizing deep neural network activations for resource-constrained devices.
method DQA uses simple shifting-based operations and Huffman coding for sub-6-bit quantization.
result DQA achieves significantly better accuracy than direct quantization and state-of-the-art methods.