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

8172533 · May 202619922001200920172026
48 results for withdrawal schedule

Upper bound on withdrawal success for geometric Levy alpha-stable wealth process.

problem Estimating the probability of completing a withdrawal schedule.
method Constructing a log-Levy alpha-stable lower bound and applying it to a schedule of withdrawals.
result Necessary conditions on initial investment and parameters for a 95% confidence of completing kk withdrawals.

Maximizes probability of completing investment schedules with optimal portfolio weights.

problem Optimizing probability of completing investment schedules with optimal portfolio weights.
method Computing maximum probability and optimal portfolio weight functions for various rebalancing schedules.
result Noticeable improvements in probability to complete schedules with optimal portfolio weights.

Maximizing withdrawal success in a pooled annuity fund with multiple annuitants.

problem Optimizing withdrawal success in a pooled annuity fund with homogeneous annuitants.
method Maximizing the probability of completing withdrawals until death over portfolio weight functions.
result Increasing the number of annuitants can significantly increase the maximum probability of withdrawal success.

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.

Withdrawal guarantees ensure the periodical deduction of a constant dollar-amount from a fund investment for a fixed number of periods. If the fund depletes before the last withdrawal, the guarantor has to finance the outstanding withdrawals. We derive a robust hedging strategy which leads to closed form solutions for …

2012-02-01abs ↗pdf ↗

This paper presents numerical algorithm and results for pricing a capital protection option offered by many asset managers for investment portfolios to take advantage of market growth and protect savings. Under optimal withdrawal policyholder behaviour the pricing of such a product is an optimal stochastic control prob…

2015-08-04abs ↗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.

Proposes GLWB-LTC for enhanced life care annuities with dynamic withdrawal strategies and stochastic interest rates.

problem Improving life care annuity features and pricing methods.
method Introduces GLWB-LTC with dynamic withdrawal strategies and stochastic interest rates. Solves the stochastic control problem using a robust tree method.
result Optimal withdrawal strategies vary over time with policyholder's health status, highlighting the advantage of flexibility.

Investigates optimal withdrawal strategies in VA contracts with tax and ratchet mechanisms.

problem Optimizing withdrawal strategies and behavior of policyholders in VA contracts with tax and ratchet mechanisms.
method Solving a backward dynamic programming problem to optimize cash flows from VA contracts, considering hybrid products and taxation effects.
result Tax-shielding effect of the cash fund enhances contract attractiveness, ratchet mechanism discourages early surrender, and cash fund discourages active withdrawals.

The paper models ATM cash withdrawal chaos and forecasts using deep learning.

problem Forecasting ATM cash withdrawals in an Indian bank.
method Chaos modeling of ATM cash withdrawal time series, deep learning methods (ARIMA, RF, SVR, MLP, GMDH, GRNN, LSTM, 1D CNN).
result Deep learning models show similar performance to random forest in forecasting ATM cash withdrawals.

Optimizes cash management in ATM networks to reduce costs and increase revenue.

problem Minimizing cash costs while ensuring adequate funds in a network of ATMs.
method Developed a discrete optimal control model using forecasting techniques and control theory.
result The proposed model outperforms classical inventory management models, earning 30% more revenue.

A model explains why 4% is a safe retirement withdrawal rate.

problem Determining a safe withdrawal rate for American retirees.
method Discrete-time model of stochastic returns on assets and their moments.
result The 4% rule emerges from adjusting high expected rates of return for various risks.

Under the optimal withdrawal strategy of a policyholder, the pricing of variable annuities with Guaranteed Minimum Withdrawal Benefit (GMWB) is an optimal stochastic control problem. The surrender feature available in marketed products allows termination of the contract before maturity, making it also an optimal stoppi…

2015-07-31abs ↗pdf ↗

Develops a new method for pricing GMWBs with jumps and stochastic interest rates.

problem Pricing guaranteed minimum withdrawal benefits (GMWBs) with jumps and stochastic interest rates.
method Combines semi-Lagrangian method with Fourier pricing and Green's function.
result Mathematically demonstrates convergence to the viscosity solution of the HJB-QVI.

This paper proposes a method to select project schedules with the lowest risk.

problem Selecting schedules that meet project deadlines while minimizing risk.
method Integrating aleatory uncertainty into project scheduling to quantify and compare risks.
result Proposes a method to select schedules with the lowest risk.

ScheduleFree+ improves large language model training without schedules or learning rates.

problem Scaling up Schedule-Free Learning to large language models.
method Learning-rate-free and schedule-free method for training large language models.
result ScheduleFree+ outperforms SOTA schedules by 31% at 1000 tokens per parameter.

The paper optimizes interpolation schedules in generative models to improve sampling accuracy.

problem Improving sampling accuracy in generative models with fewer resources.
method Minimizing the averaged squared Lipschitzness of the drift field, using transfer formulas.
result Designed schedules yield more accurate fine-scale statistics at fixed integrator budget.

New method converts and optimizes sampling schedules for generative models.

problem Optimizing sampling schedules for generative models like flows and diffusions.
method Unified framework for stochastic interpolants, including point mass schedules.
result Demonstrated efficient generation of images with fewer steps.

This paper proposes a system-agnostic policy for dynamic scheduling.

problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.

The paper presents a multi-power law for predicting loss curves across different learning rate schedules.

problem Understanding and optimizing the relationship between model performance and hyperparameters, especially learning rates.
method Proposes a multi-power law that combines power laws based on the sum of learning rates and additional laws for loss reduction due to decay.
result The multi-power law accurately predicts loss curves for unseen learning rate schedules and finds a schedule that outperforms cosine learning rate.

More and more companies have deployed machine learning (ML) clusters, where deep learning (DL) models are trained for providing various AI-driven services. Efficient resource scheduling is essential for maximal utilization of expensive DL clusters. Existing cluster schedulers either are agnostic to ML workload characte…

2019-09-13abs ↗pdf ↗

Optimal learning rate schedules for SGD in changing data distributions.

problem Minimizing regret in online learning with changing data distributions.
method Characterized optimal schedules for linear regression, proposed schedules for general convex and non-convex losses, and defined a notion of regret for non-convex losses.
result Upper and lower bounds for regret with constants for convex losses, and an upper bound on total expected regret for non-convex losses.

A large collection of financial contracts offering guaranteed minimum benefits are often posed as control problems, in which at any point in the solution domain, a control is able to take any one of an uncountable number of values from the admissible set. Often, such contracts specify that the holder exert control at a…

2015-02-19abs ↗pdf ↗

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.

Learning-rate schedules for large models match optimization theory closely, leading to better training.

problem Improving training of large models with optimal learning rates.
method Used a bound from non-smooth convex optimization theory to match learning-rate schedules with practical benefits.
result Extending the learning-rate schedule with optimal learning-rate and transferring it across schedules improves model training.

The study introduces anytime learning schedules for large language models without fixed horizons.

problem Training large language models without knowing the total training horizon.
method Theoretical analysis and weight averaging to create anytime learning schedules.
result Theoretical and empirical evidence shows that weight averaging with simple step sizes can achieve comparable final loss to well-tuned cosine schedules.

Annealed importance sampling (AIS) is a common algorithm to estimate partition functions of useful stochastic models. One important problem for obtaining accurate AIS estimates is the selection of an annealing schedule. Conventionally, an annealing schedule is often determined heuristically or is simply set as a linear…

2015-02-18abs ↗pdf ↗

This work uses reinforcement learning to optimize task scheduling and execution in a dynamic multi-agent warehouse environment.

problem Optimizing task scheduling and execution in a dynamic multi-agent warehouse environment with limited observability.
method Deep reinforcement learning to solve both high-level scheduling and low-level multi-agent execution problems.
result Demonstrates the effectiveness of reinforcement learning in optimizing task scheduling and execution in a dynamic multi-agent environment.