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

Trend · papers per month

2.0%4.0%5.9%7.9% · Apr 202619922001200920172026
48 results for Constrained Aumann-Shapley allocation

Study systemic risk measures and capital allocation rules, showing commonalities.

problem Systemic risk measures and capital allocation in financial systems.
method Developed a general framework to embed axiomatic and injective capital approaches, introduced Aumann-Shapley CAR.
result Aumann-Shapley CAR provides a universal method for capital allocation regardless of risk measurement.

Study on risk contributions of portfolios using lambda quantile risk measures.

problem No known allocation rule for non-positively homogeneous risk measures.
method Defined lambda quantiles on portfolio compositions, derived derivatives, and introduced generalized Euler contributions.
result Explicit formulae for the derivatives of lambda quantiles, showing their homogeneity properties.

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.

Integrates prediction models into portfolio optimization for better asset allocation.

problem Traditional portfolio optimization ignores prediction models, leading to suboptimal decisions.
method Developed a framework that combines regression prediction with mean-variance optimization, providing analytical solutions and neural-network-based optimization for inequality constraints.
result Demonstrated through simulations that integrating prediction models improves portfolio performance.

Although modern portfolio theory has been in existence for over 60 years, fund managers often struggle to get its models to produce reliable portfolio allocations without strongly constraining the decision vector by tight bands of strategic allocation targets. The two main root causes to this problem are inadequate par…

2013-10-12abs ↗pdf ↗

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.

Method controls treatment risk in learning beneficial allocations.

problem Learning beneficial treatment allocations with risk control in precision medicine.
method Proposes a certifiable learning method that controls treatment risk with finite samples in the partially identified setting.
result Illustrates method using both simulated and real data.

Develops a new method for statistical optimal allocation problems.

problem Statistical optimal allocation problems with constraints.
method Functional differentiability approach and Hadamard differentiability of value functions.
result Validates margin assumption for fast convergence rate of plug-in methods.

The paper compares various portfolio construction methods and their impacts on allocation, performance, and stability.

problem Investment portfolio optimization and allocation under different constraints and models.
method Comparison of mean-variance optimization, constrained optimization, Fama French five factor regression, Monte Carlo simulation, and Black-Litterman model.
result Black-Litterman model produces more stable and economically intuitive allocations compared to standard mean-variance optimization.

New algorithm learns optimal resource allocation in wireless systems without models.

problem Learning optimal resource allocation in wireless systems without system models.
method Developed a model-free primal-dual algorithm using smoothed surrogates of constrained problems.
result The algorithm can make the gap between optimal values and dual values arbitrarily small.

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.

A new test improves statistical inference in bandit algorithms without sacrificing adaptiveness.

problem Challenges in statistical inference for adaptive randomised experiments in bandits.
method An allocation probability test for Thompson Sampling without trading-off regret or requiring large sample sizes.
result Improves statistical inference in small samples, showing advantages in mental health experiments.

Bridges uplift modeling and sequential decision-making with online budget allocation.

problem Treatment allocation under budget constraints in digital advertising.
method Budget-Constrained Causal Bandits (BCCB) integrates learning, exploration, and budget pacing.
result Data-efficiency crossover: BCCB operates effectively from the first user, 3-5x lower performance variance.

Paper tackles online task allocation in multi-attribute social sensing.

problem Optimized task allocation in dynamic, multi-attribute social sensing.
method Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme using online reinforcement learning.
result Significantly outperforms state-of-the-art baselines in sensing accuracy and cost.

The study compares different game-theoretic attribution methods and finds that interventional Shapley values yield less consistent results than Aumann-Shapley due to path symmetry.

problem Investigating the influence of path choice on game-theoretic attribution algorithms.
method Comparative analysis of interventional Shapley values and Generalized Integrated Gradients (GIG) methods.
result Interventional Shapley values yield less consistent attributions than Aumann-Shapley due to path symmetry and extended away from the training data manifold.

Optimizes AI learning with limited human feedback budgets.

problem Optimizing allocation of a fixed annotation budget for AI learning.
method Preference-Calibrated Active Learning (PCAL) using semi-parametric inference.
result Proves asymptotic optimality and robustness of the PCAL estimator.

The paper analyzes constrained optimal portfolios in high dimensions using novel statistical learning techniques.

problem Forming optimal portfolios with constraints in high-dimensional asset spaces.
method CROWN method integrating factor models with nodewise regression for estimation in large dimensions.
result Demonstrates estimation consistency and convergence rates for constrained portfolio weights, risk, and Sharpe Ratio.

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.

The paper develops methods for time-varying constrained online convex optimization.

problem Time-varying loss and constraint functions in online convex optimization.
method Model-based augmented Lagrangian methods (MALM) for time-varying and delayed feedback.
result Sublinear regret and constraint violation for both time-varying and delayed feedback scenarios.

Solves online resource allocation problems with budget constraints.

problem Maximizing revenue for e-commerce platforms under budget constraints.
method Integrated online optimization and learning algorithm for non-stationary Poisson processes.
result Effective and efficient solutions for constrained resource allocation problems.

Solves VaR-constrained portfolio optimization in markets with stochastic volatility.

problem Optimizing portfolio in markets with stochastic volatility under VaR constraints.
method Dynamic programming approach to Heston's stochastic volatility model.
result Optimal investment strategy linked to unconstrained problem via a vega-neutral derivative.

In urban environments, supply resources have to be constantly matched to the "right" locations (where customer demand is present) so as to improve quality of life. For instance, ambulances have to be matched to base stations regularly so as to reduce response time for emergency incidents in EMS (Emergency Management Sy…

2018-12-03abs ↗pdf ↗

AI agents manage portfolios, improving on human oversight.

problem Improving strategic asset allocation for institutional investors.
method 50 specialized agents produce capital market assumptions, construct portfolios, critique, and vote on each other's output.
result Meta-agent compares forecasts with realized returns and improves agent performance.

Study wSAA for contextual decisions, improving uncertainty quantification under computational constraints.

problem Uncertainty quantification limitations in wSAA for contextual stochastic optimization.
method Establish central limit theorems and asymptotic-normality-based confidence intervals for optimal costs.
result Over-optimizing can mitigate misspecification and preserve asymptotic normality, albeit at a slower convergence rate.

The paper studies risk-sharing allocations for risk-seeking agents using a common distortion risk measure.

problem Characterizing Pareto-optimal risk-sharing allocations for risk-seeking agents.
method Modeling preferences with a common distortion risk measure and analyzing three settings: risk-averse, risk-seeking, and inverse S-shaped distortion.
result Pareto-optimal allocations for risk-seeking agents are counter-monotonic, not comonotonic.

Novel ML approach optimizes large portfolios without covariance matrix issues.

problem Static and dynamic portfolio optimization for many assets.
method Machine learning for constrained optimization, avoiding covariance matrix computation.
result Significant excess returns in U.S. and China equity markets.

New RL approach optimizes resource allocation in multiservice networks.

problem Optimizing resource allocation in multiservice wireless systems with QoS constraints.
method Distributed deep reinforcement learning for non-convex optimization.
result Near optimal performance in terms of throughput and outage rate.

Enhances multi-project scheduling with multiple priority rules.

problem Resource allocation in multi-project scheduling with limited time and resources.
method Simulation-based approach using composite priority rules.
result Increased probability of finding schedules with shortest duration.

Supervisory signals can help topic models discover low-dimensional data representations that are more interpretable for clinical tasks. We propose a framework for training supervised latent Dirichlet allocation that balances two goals: faithful generative explanations of high-dimensional data and accurate prediction of…

2017-12-01abs ↗pdf ↗

Algorithm improves resource allocation for food outreach to homeless.

problem Resource-constrained outreach for homeless individuals and food rescue.
method Thompson sampling with Markov chain recovery (via Stein variational gradient descent) for partially-observed episodic restless bandits.
result Significantly outperforms baselines in both organizations' problems.

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.

OpFlow predicts robust OD flows by learning choice potentials conditioned on spatial exposures.

problem Deep models trained on raw counts are vulnerable to distribution shift.
method OpFlow learns row-centered choice potentials and reconstructs flows by combining them with a calibrated origin scale.
result OpFlow improves robustness under environment shifts, as shown by controlled synthetic shifts and a real-world experiment.

Estimates expected information gain using density approximations and dimension reduction.

problem Estimating expected information gain in nonlinear and non-Gaussian settings.
method Flexible transport-based schemes for EIG estimation, optimal sample allocation, and gradient-based upper bounds on mutual information.
result Optimal sample allocation and dimension reduction schemes improve EIG estimation accuracy and convergence rate.

Study proposes adaptive RL for dynamic portfolio optimization.

problem Traditional portfolio optimization models fail to adapt to regime shifts.
method Regime-aware reinforcement learning framework with hybrid observations and constrained reward functions.
result Transformer PPO achieves highest risk-adjusted returns, while LSTM variants offer a good balance.