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

Trend · papers per month

67133200266 · Jun 202019922001200920172026
48 results for weight allocation

Annealed Entropic Allocation improves ranking and selection by mitigating hard switching and improving finite-budget discrimination.

problem Sequential budget allocation in ranking and selection
method Annealed weighted soft-min framework
result Surrogate converges uniformly to the hard minimum, soft-min weights concentrate on active challengers, and target allocation map is continuous.

The paper introduces a portfolio construction method using Black-Litterman model and factors.

problem Developing an efficient portfolio construction method using Black-Litterman model and factors.
method The method involves selecting 20 factors based on global market, asset class, and stock characteristics, applying various weight allocation methods including Black-Litterman model, and incorporating deep learning for dynamic weight updates.
result The model using Black-Litterman and deep learning outperforms other weight allocation schemes.

Deep learning improves portfolio management by optimizing asset weights.

problem Traditional portfolio managers are outperformed by deep learning models in trading.
method Proposes a deep reinforcement learning portfolio manager that allocates weights to assets.
result The proposed portfolio manager outperforms conventional managers in risk-adjusted returns.

Facing the FRTB, banks need to allocate their capital to each business units or risk positions to evaluate the capital efficiency of their strategies. This paper proposes two computationally efficient allocation methods which are weighted according to liquidity horizon. Both methods provide more stable and less negativ…

2018-01-23abs ↗pdf ↗

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.

We discuss investment allocation to multiple alpha streams traded on the same execution platform with internal crossing of trades and point out differences with allocating investment when alpha streams are traded on separate execution platforms with no crossing. First, in the latter case allocation weights are non-nega…

2014-05-19abs ↗pdf ↗

New algorithm optimizes online network resource allocation with long-term constraints.

problem Optimal resource reservation in communication networks with job transfers and budget limits.
method Randomized exponentially weighted method for long-term constraints.
result Upper bound for regret and cumulative constraint violations established.

Diversified risk parity strategies outperform equally-weighted portfolios in various asset universes.

problem Finding optimal portfolio allocations that balance risk and reward.
method Integrates various reward-risk measures and generic allocation rules into diversified risk parity.
result Diversified reward-risk parity strategies exhibit higher average returns, Sharpe ratios, and Calmar ratios compared to equally-weighted risk portfolios.

Improves content allocation in educational platforms with sparse data.

problem Imbalanced content allocation and delayed convergence in adaptive strategies.
method Introduces WAPTS, an algorithm that refines Thompson Sampling for data-sparse environments.
result Demonstrates earlier and more reliable identification of promising treatments.

The paper proposes a machine learning approach for state-dependent asset allocation.

problem Market conditions cause performance deviations from long-term averages.
method Analyzes historical market states and asset returns to directly relate state variables to portfolio weights.
result The proposed approach generates a more efficient portfolio compared to traditional methods.

Optimal strategy found for identifying best arm in bandits with small gap.

problem Best arm identification in two-armed bandits with a fixed budget and small gap.
method Neyman allocation rule augmented with inverse probability weighting.
result Proposed strategy is asymptotically optimal when gap is small.

Develops FGL for better portfolio allocation under common factor influence.

problem Sparsity assumption fails for stock returns driven by common factors.
method Integrates graphical models with factor structure to estimate portfolio weights and risk exposure robust to heavy-tailed distributions.
result FGL-based portfolios outperform equal-weighted and Index portfolios in empirical applications.

The study shows how probability weighting can lead to betting in a risk-averse economy.

problem Understanding how probability weighting affects economic behavior and risk aversion.
method Examining a von Neumann-Morgenstern economy with an RDU agent to model probability weighting effects.
result Probability weighting can lead to endogenous betting in an economy with common beliefs.

RL learns to ignore factors in factor investing portfolios.

problem Combining factor investing and reinforcement learning for optimal portfolio allocation.
method RL agent learns through sequential allocations based on firms' characteristics using Dirichlet distributions.
result RL-based portfolios are very close to equally-weighted allocations, indicating agnostic factor learning.

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.

Best-of-\infty improves LLM performance by efficiently allocating inference-time computation.

problem Achieving optimal performance in test-time LLM ensembling with infinite budget.
method Adaptive generation scheme and weighted ensembles of LLMs, formulated as mixed-integer linear program.
result Optimal ensemble weighting improves performance over individual models.

Paper improves asset allocation using machine learning for regime detection.

problem Improving asset allocation strategies in uncertain economic conditions.
method Machine learning for regime detection, modified k-means algorithm, portfolio optimization.
result Significant portfolio performance improvements over traditional benchmarks.

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 an online approach to portfolio selection. The motivation is within the context of algorithmic trading, which demands fast and recursive updates of portfolio allocations, as new data arrives. In particular, we look at two online algorithms: Robust-Exponentially Weighted Least Squares (R-EWRLS) and a regulari…

2010-05-17abs ↗pdf ↗

Scheduling and power allocation improve federated learning efficiency in NOMA networks.

problem Efficiently scheduling and allocating power for federated learning in bandwidth-limited wireless networks.
method Proposed a scheduling policy and power allocation scheme using NOMA to maximize data rate and convergence speed.
result Simulation results show improved federated learning accuracy in NOMA networks.

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.

This paper proposes a continuous timing strategy for growth vs. defensive style allocation.

problem Dynamic allocation of growth and defensive ETF baskets using macro-market timing signals.
method Continuous smooth score combining multiple factors, mapped to G/D weights, smoothed with EWMA.
result Continuous style timing strategy outperforms static benchmarks in risk-adjusted returns.

A new asset allocation model uses Markov states from clustered efficient frontier coefficients.

problem Characterizing market regimes using efficient frontiers for better asset allocation.
method Hierarchical clustering of monthly efficient frontier coefficients to define states, then a Markov process on these states for portfolio optimization.
result The model significantly outperforms benchmark portfolios empirically.

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

The paper proposes a new portfolio allocation method combining RMT and machine learning.

problem Optimal allocation instability in high-dimensional portfolios.
method Combines Random Matrix Theory covariance estimators with Nested Clustered Optimization.
result The modified NCO algorithm achieves stable allocations without risky short positions.

The paper introduces new portfolio rules beyond mean-variance, addressing asymmetry and uncertainty.

problem Optimizing portfolios with asymmetric returns and uncertainty in expected returns.
method Derives allocation rules for asymmetric Laplace distributed returns and random normal expected returns. Addresses singular covariance matrices and uncertainty in returns.
result Optimal worst-case scenario solution provides a convex alternative to risk parity, improving portfolio stability.

In these notes we discuss investment allocation to multiple alpha streams traded on the same execution platform, including when trades are crossed internally resulting in turnover reduction. We discuss approaches to alpha weight optimization where one maximizes P&L subject to bounds on volatility (or Sharpe ratio). The…

2014-06-05abs ↗pdf ↗

The paper optimizes stock portfolios with constraints based on performance attribution.

problem Optimizing stock portfolios with performance attribution constraints.
method Minimizes expected tail loss, constrains asset allocation and selection effect, tests on Dow Jones stocks.
result Imposing constraints on asset allocation and selection effect improves portfolio performance.

We give an explicit algorithm and source code for combining alpha streams via bounded regression. In practical applications typically there is insufficient history to compute a sample covariance matrix (SCM) for a large number of alphas. To compute alpha allocation weights, one then resorts to (weighted) regression ove…

2015-01-22abs ↗pdf ↗

The paper identifies a mesoscopic market structure and uses it to improve portfolio optimization.

problem The optimal mean-variance allocation differs from the heuristic equally-weighted portfolio.
method Clustering techniques from Random Matrix Theory (RMT) to study mesoscopic market structure.
result A new wealth allocation scheme that attaches equal importance to stocks in the same community improves portfolio reliability.

We characterize the class of exchangeable feature allocations assigning probability Vn,kl=1kWmlUnmlV_{n,k}\prod_{l=1}^{k}W_{m_{l}}U_{n-m_{l}} to a feature allocation of nn individuals, displaying kk features with counts (m1,,mk)(m_{1},\ldots,m_{k}) for these features. Each element of this class is parametrized by a countable matrix VV

2016-07-07abs ↗pdf ↗

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.

Federated learning optimizes task and resource allocation in balloon networks.

problem Minimizing energy and time consumption in task computation and transmission.
method SVM-based federated learning algorithm to dynamically adjust user associations, service sequences, and task allocations.
result Reduces the weighted sum of energy and time consumption by up to 16.1%.

Optimizes budgeted evaluations of LLMs by allocating queries to judges efficiently.

problem Evaluating LLMs with heterogeneous judges and varying costs and reliability.
method Formalizes and analyzes budgeted heteroskedastic multi-judge estimation, proposing EST-IVWE for practical implementation.
result EST-IVWE matches the oracle IVWE rate up to lower-order terms in the budget and is instance-optimal.

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.

DeepAries optimizes rebalancing intervals and asset allocations for better portfolio performance.

problem Fixed rebalancing intervals lead to unnecessary transactions and poor risk-adjusted returns.
method Adaptive deep reinforcement learning with Transformer state encoder and PPO.
result DeepAries outperforms traditional strategies in risk-adjusted returns, transaction costs, and drawdowns.

The paper introduces a new class of multivariate mixtures for actuarial applications.

problem Developing a new class of multivariate mixtures for actuarial calculations.
method Proposed a class of multivariate matrix-exponential affine mixtures with matrix-exponential marginals.
result Explicit calculations of actuarial quantities are possible due to the proposed class's properties.