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

163326488651 · Jun 202019922001200920172026
48 results for predictive power allocation

Optimizes deep reinforcement learning for energy-efficient video streaming.

problem Minimizing energy consumption in video streaming over mobile networks.
method Integrates DDPG algorithm with partially known model to reduce signaling overhead and improve convergence speed.
result Proposed policy converges to optimal policy with improved convergence speed.

Skewness dispersion predicts future stock market returns, especially in months with monetary policy announcements.

problem Predicting future stock market returns using skewness dispersion.
method Cross-sectional analysis of firm-level realized skewness and stock market returns.
result Skewness dispersion is a significant predictor of future stock market returns, robust to various estimation methods.

Research develops a DSS for stock selection and asset allocation using fundamental data.

problem Complex financial markets and limited use of fundamental data analysis.
method Data gathering, cleaning, and modeling of fundamental data; integration with macroeconomic conditions.
result Enhanced predictive model for mid- to long-term stock returns.

The paper explores fairness metrics in automated decision-making and their limitations.

problem Discrimination in automated resource allocation decisions.
method Analysis of fairness metrics and distributive justice principles.
result Prominent fairness metrics fail to address egalitarian and sufficiency concerns in resource allocation.

The paper studies how to allocate human validation in AI-assisted tasks to minimize errors.

problem Heterogeneous reliability of AI-generated signals across tasks, products, and customer segments.
method Tuned prediction-powered inference, upper confidence bounds policy, Neyman square-root rule.
result The proposed policy outperforms uniform and epsilon-greedy allocation, closing most of the gap to the oracle when reliability is heterogeneous.

StratPPI improves prediction-powered inference with stratified sampling.

problem Improving statistical estimates with limited human-labeled data.
method Combining small human-labeled data with large automatic-labeled data, stratifying data for tighter confidence intervals.
result StratPPI provides substantially tighter confidence intervals than unstratified approaches.

Develops deep learning for optimizing 5G radio resource allocation.

problem Optimizing 5G base station radio resources for diverse QoS requirements.
method Cascaded neural network structure with deep transfer learning for non-stationary conditions.
result Cascaded neural networks outperform fully connected neural networks in QoS guarantee.

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.

This work introduces COLA, a strategy to aggregate conformal prediction sets efficiently.

problem Efficiently combining multiple conformity scores to reduce prediction set size.
method Introduces COnfidence-Level Allocation (COLA) to optimally allocate confidence levels across sets.
result COLA achieves smaller prediction sets than state-of-the-art methods while maintaining valid coverage.

Adversaries manipulate wireless power allocation to reduce user rates.

problem Adversaries exploit deep learning for power control to decrease communication rates.
method Adversaries craft perturbations to inputs of a DNN to minimize power allocation.
result Adversarial attacks are highly effective and robust to uncertainties.

We study classification problems where features are corrupted by noise and where the magnitude of the noise in each feature is influenced by the resources allocated to its acquisition. This is the case, for example, when multiple sensors share a common resource (power, bandwidth, attention, etc.). We develop a method f…

2016-07-10abs ↗pdf ↗

Study examines how liquidity constraints impact optimal retirement decisions.

problem Impact of liquidity constraints on optimal retirement decisions.
method Analytical solution using duality method with different liquidity constraints.
result Sensitivity analysis reveals the effect of liquidity constraints on retirement decisions.

Paper proposes integrating wavelet transform, channel attention, and LSTM for better stock price prediction.

problem Inherently difficult stock price prediction due to low signal-to-noise ratio.
method Wavelet transform convolution, channel attention, and LSTM integration.
result Robust performance in post-pandemic market conditions.

AM-PPI uses multiple predictors to reduce label cost in healthcare AI.

problem Reduces label cost in post-deployment monitoring of healthcare AI.
method Combines model predictions with a small labeled sample, routing each instance to a cost-appropriate subset of predictors.
result Produces narrower confidence intervals than single-predictor methods.

TA-CQR predicts regression intervals with exact coverage, splitting miscoverage between endpoints.

problem Predicting regression intervals with exact coverage under reporting constraints.
method TA-CQR uses tail allocation to parameterize the oracle, estimating the allocation by searching quantile cores and applying nonnegative additive split-conformal calibration.
result TA-CQR achieves exact finite-sample marginal coverage under exchangeability, with theoretical guarantees on calibration and length.

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.

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.

The paper evaluates index-based allocation policies using data from randomized control trials.

problem Evaluating index-based allocation policies in resource-scarce scenarios.
method Using data from randomized control trials, the paper introduces an efficient estimator and methods for computing asymptotically correct confidence intervals.
result Valid statistical conclusions can be drawn for index-based allocation policies.

New model allocates features sublinearly, improving model fit and performance.

problem Linear growth of shared features limits model flexibility and performance.
method Developed non-exchangeable feature allocation models with sublinear feature sharing.
result Sublinear feature sharing leads to better model fit and predictive performance.

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.

Power-law portfolios improve diversification by scaling weights sub-linearly.

problem Optimization methods struggle with unstable pair correlations and non-Gaussian risk measures.
method Construct portfolios with penalty proportional to arbitrary order moment of returns, leading to sub-linear weight scaling.
result Infinite order power-law portfolios are perfectly diversified, improving diversification over Kelly portfolios.

The paper optimizes UAV path and power for QoS in cellular networks.

problem Optimizing UAV path and power for QoS in cellular networks.
method Apprenticeship learning via deep inverse reinforcement learning (IRL) combined with Q-learning and DRL.
result The proposed method achieves expert-level performance and maintains performance in unseen situations.

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.

New framework identifies worst-case shifts for predictive resource allocation models.

problem Identifying harmful shifts in predictive models for resource allocation.
method Hierarchical model structure and submodular optimization for worst-case loss.
result Empirical evidence shows divergent worst-case shifts identified by different metrics.

Learning shrinks hard tail, improving inference performance.

problem Improving inference performance in neural networks.
method Latent Instance Difficulty (LID) model analyzing fine-tuning of neural networks.
result Training-dependent inference scaling, with βexteffβ_ ext{eff} growing with sample size before saturating.

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

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.

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.

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.

PPI uses survey sampling methods for inference, bridging ML and statistics.

problem Combining machine learning predictions with small labeled data for valid inference.
method Equivalence of PPI estimators to survey sampling methods.
result PPI estimators are algebraically equivalent to survey sampling methods.