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

3672107143 · Jun 202019922001200920172026
48 results for memory allocation

New memory allocation scheme improves image generation performance.

problem Improving episodic and semantic memory representation in neural networks.
method Developed a hierarchical latent variable model with differentiable, locally block allocated latent memory.
result Improved conditional likelihood values on various datasets.

This paper tackles federated incremental learning with dynamic memory allocation for improved model performance in non-IID data.

problem Catastrophic forgetting in federated healthcare systems with non-IID data.
method Dynamic memory allocation strategy based on data replay mechanism.
result Significant performance improvements in medical image datasets compared to baseline models.

NPAS trains neural networks with a fixed parameter budget, improving performance and compactness.

problem Training neural networks requires memory, and existing methods struggle with arbitrary parameter budgets.
method NPAS learns to share parameters automatically, covering low and high budgets.
result NPAS and SSNs improve network performance and compactness across various tasks.

An ideal cognitively-inspired memory system would compress and organize incoming items. The Kanerva Machine (Wu et al, 2018) is a Bayesian model that naturally implements online memory compression. However, the organization of the Kanerva Machine is limited by its use of a single Gaussian random matrix for storage. Her…

2020-02-06abs ↗pdf ↗

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.

Hopfield networks outperform deep-learning methods in portfolio optimization.

problem Optimizing portfolios and managing asset allocation efficiently.
method Application of Hopfield networks to portfolio optimization, using combinatorial purged cross-validation.
result Modern Hopfield Networks perform on par or better than deep-learning methods, with faster training times and better stability.

Study capacity constraints in continual learning with a simple model.

problem Understanding optimal resource allocation for agents with limited memory and compute resources.
method Analyzes a capacity-constrained linear-quadratic-Gaussian (LQG) sequential prediction problem and demonstrates optimal capacity allocation strategies.
result Derives a solution to the capacity-constrained LQG sequential prediction problem and shows how to optimally allocate capacity across sub-problems in the steady state.

A new memory system handles non-stationary environments by self-sizing and retaining memories.

problem Non-stationary environments where memories arrive over time and must be distinguished from noise.
method A self-sizing continual associative memory that generalizes Hopfield's network, handling adaptation and novelty.
result The memory system grows to the intrinsic memory demand of the environment and retains memories without forgetting.

Following the recent work on capacity allocation, we formulate the conjecture that the shattering problem in deep neural networks can only be avoided if the capacity propagation through layers has a non-degenerate continuous limit when the number of layers tends to infinity. This allows us to study a number of commonly…

2019-03-11abs ↗pdf ↗

Low precision weights, activations, and gradients have been proposed as a way to improve the computational efficiency and memory footprint of deep neural networks. Recently, low precision networks have even shown to be more robust to adversarial attacks. However, typical implementations of low precision DNNs use unifor…

2018-07-03abs ↗pdf ↗

Optimizes investment model using LSTM for better risk control.

problem Enhancing risk control in multi-factor investment models.
method Combines LSTM with multi-factor investment model for factor selection and weight determination.
result LSTM model outperforms benchmark in risk control metrics.

A lightweight model predicts IT system KPIs from historical data.

problem Predicting future KPIs of interconnected IT systems is hard due to diverse and changing components.
method A weighted heterogeneous ensemble method combining neural network and mean predictor.
result Achieved R2R^2 scores of 0.10 and 0.15 on test data.

FLoE adapts LLMs by selectively deploying LoRA adapters based on layer importance and task requirements.

problem Uniform LoRA deployment across all layers leads to inefficient and redundant parameter allocation.
method FLoE uses Fisher information to dynamically identify task-critical layers and optimizes LoRA ranks.
result FLoE achieves significant efficiency-accuracy trade-offs, especially in resource-constrained environments.

Stochastic variational inference (SVI), the state-of-the-art algorithm for scaling variational inference to large-datasets, is inherently serial. Moreover, it requires the parameters to fit in the memory of a single processor; this is problematic when the number of parameters is in billions. In this paper, we propose e…

2016-05-31abs ↗pdf ↗

Hybrid LSTM-PPO optimizes dynamic portfolios with better performance.

problem Dynamic portfolio optimization under non-stationary market conditions.
method Combines LSTM for forecasting and PPO for adaptive portfolio adjustments.
result Hybrid framework outperforms single-model and equal-weight approaches in various metrics.

Recent work on Bayesian optimization has shown its effectiveness in global optimization of difficult black-box objective functions. Many real-world optimization problems of interest also have constraints which are unknown a priori. In this paper, we study Bayesian optimization for constrained problems in the general ca…

2014-03-22abs ↗pdf ↗

The paper optimizes DIA purchase policies using lifecycle models and asset allocation.

problem Determining the optimal allocation to Deferred Income Annuities (DIAs).
method Employed a lifecycle model with utility of consumption and bequest, formalized optimization process, analyzed results, and extended model to include asset allocation.
result Optimal DIA allocation varies based on refundability, asset allocation, and perceived longevity.

Study optimizes resource allocation in noisy systems for better control.

problem Limited attention in stochastic systems with multiplicative noise.
method Analytical and numerical methods for optimal attention allocation.
result Effective resource allocation enhances noise estimation and control decisions.

The paper proposes an asset allocation strategy using the Sortino ratio for better performance.

problem Traditional asset allocation methods like the Sharpe ratio do not penalize negative returns adequately.
method The Sortino ratio is used to maximize asset allocation, penalizing only negative return variances.
result The Sortino ratio-based strategy outperforms traditional methods like the Kelly criterion.

This paper tackles post-trade allocation inefficiencies and presents a uniform return allocation method.

problem Return divergence among accounts after trade allocation.
method Systematic treatment of trade allocation risk, presenting a uniform return allocation method.
result Uniform allocation of returns irrespective of the number of accounts and trade sizes.

This paper examines allocation mechanisms in markets with transfer costs, showing how these costs affect economic efficiency.

problem Transfer costs in decentralized exchange markets reduce economic efficiency.
method An axiomatic study of allocation mechanisms in the presence of transfer costs, providing robust and conditional mean allocation mechanisms.
result Robust and conditional mean allocation mechanisms are identified, relating to risk sharing in agent pools.

The aims of this study are twofold. First, we consider an optimal risk allocation problem with non-convex preferences. By establishing an infimal representation for distortion risk measures, we give some necessary and sufficient conditions for the existence of optimal and asymptotic optimal allocations. We will show th…

2015-03-15abs ↗pdf ↗

Reliable uncertainty estimation for time series prediction is critical in many fields, including physics, biology, and manufacturing. At Uber, probabilistic time series forecasting is used for robust prediction of number of trips during special events, driver incentive allocation, as well as real-time anomaly detection…

2017-09-06abs ↗pdf ↗

New method allocates capital based on tail central moments for financial risk assessment.

problem Inability of CTE-based capital allocation to reflect tail behavior of losses.
method Developed TCM-based capital allocation for normal mean-variance mixture distributions.
result TCM-based method captures tail risk contributions not detected by CTE.

Implicit models can match or exceed explicit models with more test-time compute.

problem Understanding the expressive power and scaling of implicit models.
method Nonparametric analysis of expressive power, mathematical characterization of implicit operators, and test-time scaling experiments.
result Implicit models can progressively express more complex mappings through iteration, matching a richer function class with test-time compute.

The paper explores capital allocation using Euler formula with VaR and ES, revealing non-monotonicity and providing estimation methods.

problem Non-monotonicity in VaR-based capital allocation and the need for consistent risk measures.
method Use of Euler formula, Value-at-Risk (VaR), Expected shortfall (ES), simulation, and Markov chain Monte Carlo.
result Capital allocation with VaR is not monotonous, and consistent risk measures are crucial.

Capital allocation principles are used in various contexts in which a risk capital or a cost of an aggregate position has to be allocated among its constituent parts. We study capital allocation principles in a performance measurement framework. We introduce the notation of suitability of allocations for performance me…

2013-01-23abs ↗pdf ↗

The financial crisis showed the importance of measuring, allocating and regulating systemic risk. Recently, the systemic risk measures that can be decomposed into an aggregation function and a scalar measure of risk, received a lot of attention. In this framework, capital allocations are added after aggregation and can…

2016-07-12abs ↗pdf ↗

The paper analyzes insurance pricing and capital allocation in imperfect markets.

problem Analyzing insurance pricing and capital allocation in imperfect markets.
method Non-additive distortion pricing functional and principle of equal priority of payments in default.
result Derives the natural allocation of premium and margin with properties that merit the name.

We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuous-valued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem to adversarial sce…

2010-03-11abs ↗pdf ↗