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

77153230306 · Jun 202019922001200920172026
48 results for dynamic allocation

Study dynamic Pareto-optimal allocations in multi-period economies with time-consistent risk measures.

problem Optimal allocation in multi-period pure-exchange economies with stochastic endowments and time-consistent risk measures.
method Introduced dynamic Pareto-optimal allocation processes and derived recursive and comonotone improvement theorems.
result Dynamic Pareto-optimal allocation processes can be constructed recursively and are comonotone.

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.

Optimal dynamic allocation of carbon allowances reduces emissions efficiently.

problem Reducing carbon emissions from firms over time with dynamic allocation and trading.
method Variational approach to solve the Stackelberg game between regulator and firms.
result Optimal policies lead to constant abatement effort and allowance price, outperforming static allocations.

Onflow optimizes portfolio allocation with gradient flows, robust to transaction fees.

problem Optimizing portfolio allocation with transaction costs.
method Gradient flow reinforcement learning method for dynamic asset allocation.
result Onflow outperforms benchmarks in high transaction cost regimes.

Robo-advisors use MPC to create dynamic investment strategies.

problem Static allocation methods limit robo-advisors' effectiveness.
method Combines MPC with Hidden Markov Model and Black-Litterman for dynamic asset allocation.
result MPC-based strategies outperform static approaches in dynamic and risk-budgeting criteria.

Optimizes retirement spending and asset allocation to maximize withdrawals and shortfall.

problem Risk of depleting retirement savings with constant withdrawal rules.
method Dynamic asset allocation to maximize weighted EW and ES.
result Dynamic strategy outperforms constant withdrawal and asset allocation rules.

This study uses HMM and RL to dynamically allocate equities, Treasuries, and gold based on market regimes.

problem Developing a dynamic portfolio allocation strategy for different market conditions.
method Characterizes market regimes using Markov switching models and HMM, then applies RL for allocation decisions.
result RL-based allocation outperforms passive strategies, providing lower drawdowns and higher Sharpe ratios.

Adaptive RL optimizes testing resource allocation for dynamic software environments.

problem Optimizing resource allocation for evolving software testing environments.
method Integrates Q-learning with hybrid reward design for sequential decision-making.
result Consistently outperforms static and optimization-based baselines in simulation studies.

Develops a new method for risk diversification using dynamic risk measures.

problem Dynamic risk diversification in investment portfolios.
method Introduces dynamic risk contributions and a recursive optimization approach for coherent dynamic distortion risk measures.
result Dynamic risk budgeting strategies can be solved using deep learning.

Dynamic risk factor model improves portfolio performance in high dimensions.

problem Dynamic portfolio allocation in high-dimensional financial markets.
method Time-varying sparsity on factor loadings, sequential learning of parameters and volatilities.
result Significant portfolio performance improvements and higher utility gains.

We consider the problem of optimal budget allocation for crowdsourcing problems, allocating users to tasks to maximize our final confidence in the crowdsourced answers. Such an optimized worker assignment method allows us to boost the efficacy of any popular crowdsourcing estimation algorithm. We consider a mutual info…

2017-01-30abs ↗pdf ↗

Blend-ASC improves self-consistency efficiency by dynamically allocating samples, reducing costs.

problem Efficiently applying self-consistency to large datasets is computationally expensive.
method Blend-ASC dynamically allocates samples during inference, improving efficiency.
result Blend-ASC reduces sample usage by 6.8x on average compared to vanilla self-consistency.

Optimal asset allocation strategy outperforms stochastic benchmark.

problem Achieving higher terminal wealth than a stochastic benchmark.
method Data-driven Neural Network optimization framework for dynamic asset allocation.
result Optimal adaptive strategy outperforms benchmark with higher median and right-skewed terminal wealth.

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.

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.

The paper analyzes risk measures and optimal reserve allocation strategies.

problem Risk measures and optimal reserve allocation across multiple lines of business.
method Formalizes expected maximum deficit, introduces implicitly bounded risk measures, and proposes capital allocation approaches.
result Theoretical results on static and dynamic coherence, convexity, and exact optimizations of aggregate minimum reserves.

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.

This paper proposes a new method to optimize portfolio allocation with transaction costs using Wiener chaos expansion.

problem Optimizing portfolio allocation with transaction costs in multi-period settings.
method Wiener chaos expansion approach to represent and solve the optimization problem.
result The proposed method finds an optimal strategy for portfolio allocation with transaction costs.

Optimizes portfolios with constraints and stochastic factors, deriving explicit solutions.

problem Optimizing expected utility in an incomplete market with stochastic factors and convex constraints.
method Fundamental duality results and HJB PDE, derived condition for exponential affine solutions.
result Explicit expressions for optimal allocations and Riccati ODE solutions in specific markets.

The article uses dynamic factor allocation to improve portfolio performance by integrating regime-switching signals.

problem Improving portfolio performance through dynamic factor allocation.
method The authors apply the sparse jump model (SJM) to identify bull and bear market regimes for individual factors, then fine-tune hyperparameters using a hypothetical single-factor long-short strategy. These regime inferences are incorporated into the Black-Litterman framework to dynamically adjust allocations among indices.
result The constructed multi-factor portfolio significantly improves the information ratio (IR) relative to the market, raising it from 0.05 to approximately 0.4.

This research improves forecasting and testing of risk contributions using Expected Shortfall.

problem Improving risk allocation and testing methods for regulatory standards.
method Developed a comprehensive framework for backtesting and forecasting Expected Shortfall contributions.
result Proposed a novel semiparametric model for forecasting dynamic Expected Shortfall contributions.

Framework uses RL with dynamic embedding to outperform benchmarks in volatile markets.

problem Challenges in high-dimensional, non-stationary, and noisy market information.
method Dynamic embedding of market information using generative autoencoders and online meta-learning in a reinforcement learning framework.
result Framework outperforms common portfolio benchmarks and PTO approach during market stress.

This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.

problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.

Study dynamic asset allocation in incomplete markets using game theory and nonlocal BSDEs.

problem Dynamic mean-variance asset allocation in general incomplete markets with non-exponential discounting.
method Game-theoretic approach, decomposition into myopic and hedging strategies, nonlocal BSDEs, fixed-point theorem.
result Well-posedness of solutions to BSDEs, existence of equilibrium control policy.

Study allocates resources to strategic agents while balancing cost and incentives.

problem Dynamic allocation of reusable resources to strategic agents with private valuations under long-term cost constraints.
method Incentive-aware framework combining epoch-based lazy updates and randomized exploration rounds.
result Achieves ildeO(T) ilde{\mathcal{O}}(\sqrt{T}) social welfare regret, satisfies all cost constraints, and ensures incentive alignment.

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.

The paper analyzes how wealth affects investment strategies in incomplete markets.

problem Investment strategies in markets with incomplete information.
method Developed a five-component decomposition for optimal portfolio choice, solved explicitly for HARA utility and nonrandom interest rate, and used a stochastic volatility model for US equity data.
result Demonstrated the impacts of wealth-dependent utilities on optimal portfolio allocation, including cycle-dependence and hysteresis effect.

Batch Thompson Sampling reduces exploration-exploitation trade-off in online decision making.

problem Balancing exploration and exploitation in online decision making.
method Introducing a batch Thompson Sampling framework for stochastic multi-arm bandit and linear contextual bandit problems.
result Achieves asymptotic regret bound with O(logT)O(\log T) batch queries, significantly reducing interactions.

Paper uses DRL to optimize portfolios, balancing risk and return.

problem Optimizing portfolios under market uncertainty and risk constraints.
method Integrates Sharpe ratio-based reward with risk control mechanisms, uses PPO for adaptive asset allocation.
result DRL agent stabilizes volatility but sacrifices risk-adjusted returns.

Adaptive AI delegation framework for dynamic decision authority allocation.

problem Dynamic allocation of decision authority to AI-generated recommendations under evolving evidence quality and uncertainty.
method Formulated as a Governance-Aware POMDP, using Bayesian inference for informational state estimation and sequential optimization for authority allocation.
result Sequential Bayesian governance provides the strongest general-purpose policy across AI-quality regimes, adapting to evolving evidence.

Sequential processing biases asset allocation in artificial stock markets.

problem Systematic bias in asset allocation due to sequential processing of order books.
method Examined the impact of sequential versus parallel clearing mechanisms on multi-asset price dynamics.
result Sequential processing introduces a significant bias affecting the allocation of traders' capital.

We introduce a generic solver for dynamic portfolio allocation problems when the market exhibits return predictability, price impact and partial observability. We assume that the price modeling can be encoded into a linear state-space and we demonstrate how the problem then falls into the LQG framework. We derive the o…

2016-11-03abs ↗pdf ↗

Optimizes trade execution with reinforcement learning for limit orders.

problem Maximizing revenue in a limit order book with market and limit orders.
method Formulated as a dynamic allocation task, uses multivariate logistic-normal distributions for efficient training.
result Outperforms traditional strategies in simulated environments.