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

Trend · papers per month

128255383510 · Jun 202019922001200920172026
48 results for resource analysis

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.

Generative profiling improves real-time task timing for varied resource contexts.

problem Inaccurate task timing analysis for complex hardware architectures.
method Nonparametric, conditional multi-marginal Schrödinger Bridge (MSB) formulation for synthesizing context-dependent timing profiles.
result Maximum likelihood accurate execution profiles for unseen resource contexts.

Paper benchmarks Bengali language classification tasks using MConv-LSTM network.

problem Lack of computational resources for NLP tasks in under-resourced languages like Bengali.
method Built three datasets, BengFastText word embeddings, and MConv-LSTM network for hate speech detection, document classification, and sentiment analysis.
result BengFastText yields up to 92.30%, 82.25%, and 90.45% F1-scores in document classification, sentiment analysis, and hate speech detection respectively.

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.

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.

We derive the most probable distribution of resources for a simple society. We find that a probabilistic analysis forbids both too much and too less equity, and selects instead a minimally ordered state. We give the detailed calculations for a special model where the population and resources are fixed, and resources ar…

2002-09-18abs ↗pdf ↗

Cost-benefit analysis often assumes accurate estimates, but this study finds significant inaccuracies.

problem Inaccurate cost and benefit estimates in public investments.
method Largest dataset of public investments, statistical analysis of cost overruns and benefit shortfalls.
result Significant inaccuracies in cost and benefit estimates of public investments.

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.

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.

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.

Study compares LSTM and ANN architectures for forex prediction, finding ANN more efficient.

problem Forex time series prediction efficiency and resource usage.
method Comparison of Long Short-Term Memory (LSTM) and specialized ANN architectures.
result Specialized ANN architecture performs better with fewer resources and faster execution.

This work tackles resource allocation in asynchronous and stochastic systems.

problem Distributed resource allocation in asynchronous and stochastic settings.
method Approximate stochastic primal-dual approach with asynchronous updates.
result The Asynchronous stochastic Primal-Dual (Asyn-PD) algorithm converges to the saddle point solution at a rate of O(1/t)O(1/t).

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.

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.

Nucleosome positioning is an important process required for proper genome packing and its accessibility to execute the genetic program in a cell-specific, timely manner. In the recent years hundreds of papers have been devoted to the bioinformatics, physics and biology of nucleosome positioning. The purpose of this rev…

2015-08-27abs ↗pdf ↗

We propose SPARFA-Trace, a new machine learning-based framework for time-varying learning and content analytics for education applications. We develop a novel message passing-based, blind, approximate Kalman filter for sparse factor analysis (SPARFA), that jointly (i) traces learner concept knowledge over time, (ii) an…

2013-12-19abs ↗pdf ↗

Optimizes CNN architectures by analyzing receptive fields without training.

problem CNNs often have too many layers, making them resource-intensive and less effective.
method Layer-wise analysis of receptive fields to identify unproductive layers.
result Identifies and removes unproductive layers, improving CNN performance and efficiency.

The main purpose of this paper is to formalize the modelling process, analysis and mathematical definition of corruption when entering into a contract between principal agent and producers. The formulation of the problem and the definition of concepts for the general case are considered. For definiteness, all calculati…

2018-04-06abs ↗pdf ↗

This study analyzes quantization in deep learning models using statistical physics methods.

problem The computational resource requirements for large-scale data analysis models.
method Typical case analysis from statistical physics, specifically the replica method.
result Optimal quantization width minimizes error and delays overfitting.

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 ↗

Hybrid QNN-LSTM predicts financial stock market trends using quantum computing.

problem Complex temporal dependencies and market fluctuations in financial time-series forecasting.
method Custom QNN regressor with hybrid optimization strategies.
result Hybrid models integrate quantum computing into financial forecasting workflows.

Investigates upsampling vs. upweighting for balanced training on skewed datasets.

problem Balancing training on heavily imbalanced datasets with scarce data.
method Theoretical and empirical analysis of upsampling and upweighting strategies.
result Upsampling and upweighting diverge under stochastic gradient descent, with upsampling leading to faster convergence but higher overfitting risk.

Post-training quantization saves resources for neural networks.

problem Implementing neural networks in resource-constrained hardware.
method Generalized post-training quantization method (GPFQ) with modifications for sparsity and error analysis.
result Error decays linearly with over-parametrization, showing minor loss of accuracy.

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.

Deep learning benchmarks ECG analysis with strong performance.

problem Lack of appropriate datasets and evaluation procedures for ECG interpretation.
method Benchmarking on PTB-XL and ICBEB2018 datasets using convolutional neural networks.
result Convolutional neural networks, especially resnet- and inception-based architectures, outperform feature-based algorithms.

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.