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

Trend · papers per month

83165248330 · Jun 202019922001200920172026
48 results for stochastic allocation

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 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.

Develops a framework to analyze financial structures.

problem Difficulty in systematic analysis, comparison, and verification of financial structures.
method Formalizes financial structures as structured allocation systems with explicit allocation operators.
result Specifies inputs, structural requirements, and feasibility restrictions for financial structures.

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).

Investors face constraints in Heston's model; optimal allocation differs from naive capped strategy.

problem Optimizing portfolio allocation with convex constraints in Heston's stochastic volatility model.
method Applied duality methods to derive a closed-form solution.
result The optimal constrained portfolio allocation differs from the naive capped portfolio, leading to different wealth outcomes.

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.

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 ↗

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.

The Shapley value theory is used for risk allocation in non-orthogonal risk factors.

problem Risk allocation among non-orthogonal risk factors in financial portfolios.
method Using Shapley value from cooperative game theory to allocate risk contributions.
result Explicit formulas and numerical algorithms for calculating risk allocations are derived.

Mechanism designs for unknown agent values in stochastic bandit settings.

problem Designing truthful mechanisms for maximizing social welfare in settings with unknown agent values and stochastic feedback.
method Developed a VCG-like mechanism with regret bounds for multi-round allocations, balancing agent and seller welfare.
result Achieved an $Ω(T^{ rac{2}{3}})$ lower bound for the maximum of welfare, agent utilities, and mechanism utility after TT rounds.

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.

This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constr…

2018-07-21abs ↗pdf ↗

This paper explains CART random forests using stochastic control theory.

problem Understanding the inner workings of CART random forests.
method Developed a stochastic-control perspective on CART random forests, interpreting feature subsampling as a random feasible action set and the split rule as a policy.
result Established that the CART policy is locally stabilizing but globally suboptimal for the forest objective.

Under a Bayesian framework, we formulate the fully sequential sampling and selection decision in statistical ranking and selection as a stochastic control problem, and derive the associated Bellman equation. Using value function approximation, we derive an approximately optimal allocation policy. We show that this poli…

2017-10-07abs ↗pdf ↗

The aim of this paper is to compare two asset allocation methods for a pension scheme during the decumulation phase in the simplified portfolio selection between a risky asset following a geometric Brownian motion and a riskless asset. The two asset allocation criteria are the ruin probability of the insurance company …

2010-01-12abs ↗pdf ↗

Algorithm allocates budgets to tasks with semi-bandit feedback, achieving near-optimal regret bounds.

problem Stochastic budget allocation with censored semi-bandit feedback.
method Optimism-based algorithm operating under censored semi-bandit feedback.
result Regret scales polylogarithmically with horizon T in diminishing-returns regimes.

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.

The paper tackles online resource allocation with uncertain coefficients and chance constraints.

problem Online stochastic resource allocation problem with chance constraints.
method Linearization and primal-dual algorithms with heuristic corrections.
result Optimality gap and constraint violation are on the order of √n.

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 ↗

This paper proposes a new clustering method based on Stochastic Dominance for asset allocation.

problem Traditional clustering methods fail to capture risk dominance relationships among assets.
method Integrates Stochastic Dominance theory with machine learning algorithms to construct a Stochastic Dominance Coefficient Matrix and modify clustering algorithms.
result The proposed method effectively facilitates customized asset allocation for investors.

The paper extends game theory using Hodge theory on graphs.

problem Generalizing Shapley's value allocation formula for cooperative games on graphs.
method Connecting stochastic path integrals to Hodge-theoretic Poisson's equations on graphs.
result The value allocation operator is the solution to Poisson's equation in combinatorial Hodge theory.

New algorithm tackles resource allocation in multi-armed bandits to balance speed and throughput.

problem Balancing speed and throughput in stochastic multi-armed bandits with limited resources.
method Proposes an algorithm that trades off between information accumulation and throughput.
result Upper bounds the time taken to find the best arm with a given target success probability.

We consider the classical problem of sequential resource allocation where a decision maker must repeatedly divide a budget between several resources, each with diminishing returns. This can be recast as a specific stochastic optimization problem where the objective is to maximize the cumulative reward, or equivalently …

2019-02-12abs ↗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 ↗

We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental LDA can process massive document collections, does not require to set a learning …

2015-07-17abs ↗pdf ↗

Overprocuring reserves can improve network efficiency by using excess reserves for congestion management.

problem Optimizing energy and reserve allocation between zones to minimize costs and ensure deliverability.
method Developed allocation models for co-allocating traded energy and reserve products, considering both deterministic and stochastic flows.
result Excess reserve supplies can be used for congestion management, leading to additional network benefits.

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.

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.

The paper tackles resource allocation for arms with unknown and random rewards, achieving optimal regret bounds.

problem Allocating resources on arms with unknown and random rewards.
method Developed two algorithms with optimal regret bounds for b[0,1]b \in [0,1], demonstrating a phase transition at b=1/2b=1/2.
result Achieved optimal gap-dependent and gap-independent regret bounds for b[0,1]b \in [0,1].

Optimal withdrawal strategy for DC pension plans maximizes total withdrawals while managing risk.

problem Maximizing withdrawals from DC pension plans while managing risk.
method Optimal stochastic control approach with constraints on withdrawal and asset allocation.
result Optimal strategy yields higher average withdrawals with minimal increase in risk.

New algorithm tackles unknown utility network resource allocation.

problem Maximizing network utility with unknown agent utilities.
method Modeling as a bandit problem, proposing algorithms for resource allocation.
result Proposed algorithms are optimal when all agents have the same utility.

Unified framework for optimizing portfolios with distributions over weights, returns, and parameters.

problem Traditional portfolio optimization treats expected returns, covariances, and allocations as fixed. Modern practice replaces at least one with a distribution.
method Unified framework using Gamma_theta(dw,dr) coupling to organize Bayesian, robust, chance-constrained, stochastic-allocation, and distributional reinforcement-learning methods.
result Synthetic and structural contributions, including a portfolio specialization of Wasserstein-CVaR duality and a static no-randomization theorem.

We present a hybrid algorithm for Bayesian topic models that combines the efficiency of sparse Gibbs sampling with the scalability of online stochastic inference. We used our algorithm to analyze a corpus of 1.2 million books (33 billion words) with thousands of topics. Our approach reduces the bias of variational infe…

2012-06-27abs ↗pdf ↗

A neural network approach solves optimal decumulation problems for pension plans.

problem Optimal asset allocation and withdrawal strategies for DC pension holders.
method Data-driven neural network optimization with customized activation functions.
result The neural network approach learns near-optimal solutions comparable to HJB PDE methods.

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.