Optimal portfolio tracking with dynamic capital injection into a ratcheting benchmark.
problem Optimizing a portfolio's performance by dynamically adding capital to a non-decreasing benchmark.
method Formulated as an unconstrained control problem with a running maximum cost, transformed into an auxiliary problem with a nonlinear HJB equation, solved using probabilistic representation and stochastic flow analysis.
result Established the existence of a unique classical solution to the HJB equation, providing feedback optimal portfolio strategies.
This paper solves an optimal dividend payout problem with ratcheting constraints using a novel method.
problem Optimal dividend payout under ratcheting constraints for a Brownian motion surplus process.
method Novel partial differential equation method to solve the Hamilton-Jacobi-Bellman (HJB) equation.
result Existence and uniqueness of solution in stronger functional spaces, strict monotonicity, boundedness, and C∞-smoothness of the free boundary. Optimal dividend payout strategy found for Brownian risk model with ratcheting constraint.
problem Optimal dividend payout from a surplus process governed by Brownian motion with drift under ratcheting constraint.
method Solved a two-dimensional optimal control problem using viscosity solutions of Hamilton-Jacobi-Bellman equations.
result Threshold and curve strategies identified as optimal for different dividend rate sets.
We assume that an agent's rate of consumption is {\it ratcheted}; that is, it forms a non-decreasing process. Given the rate of consumption, we act as financial advisers and find the optimal investment strategy for the agent who wishes to minimize his probability of ruin.
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.
Optimal dividend strategy with ratcheting and capital injection under Cramér-Lundberg model.
problem Optimal dividend payout for an insurance company with ratcheting constraints and capital injections.
method Systematic probabilistic and PDE-based approach to solve HJB equation, constructing strong solution and optimal strategy.
result Existence and uniqueness of strong solution, explicit optimal feedback control strategy.
We address a long-standing open problem in risk theory, namely the optimal strategy to pay out dividends from an insurance surplus process, if the dividend rate can never be decreased. The optimality criterion here is to maximize the expected value of the aggregate discounted dividend payments up to the time of ruin. I…
Optimal dividend strategy with irreversible reinsurance constraints.
problem Maximizing dividends while adhering to ratcheting and irreversible reinsurance constraints.
method Modeling dividend and reinsurance levels as nondecreasing processes, solving Hamilton-Jacobi-Bellman equation.
result Threshold strategy is optimal for maximizing discounted dividends until ruin.
In this article, we propose a new numerical approach to high-dimensional partial differential equations (PDEs) arising in the valuation of exotic derivative securities. The proposed method is extended from Reisinger and Wittum (2007) and uses principal component analysis (PCA) of the underlying process in combination w…
Study uses deep learning for efficient hedging of long-term financial derivatives.
problem Optimizing hedging strategies for long-term financial derivatives with various penalties and stylized facts.
method Deep reinforcement learning applied to neural networks optimizing hedging policies with quadratic and non-quadratic penalties.
result Non-quadratic global hedging policies result in significantly smaller downside risk metrics and significant hedging gains.
We consider a simple stochastic model of a urban rental housing market, in which the interaction of tenants and landlords induces rent fluctuations. We simulate the model numerically and measure the equilibrium rent distribution, which is found to be close to a lognormal law. We also study the influence of the density …
A neural network method estimates entropy production from system trajectories.
problem Estimating entropy production from system trajectories without detailed dynamics.
method Developed a neural estimator (NEEP) for entropy production (EP).
result NEEP rigorously proves to provide stochastic EP by optimizing an objective function.
The LIBOR market model is very popular for pricing interest rate derivatives, but is known to have several pitfalls. In addition, if the model is driven by a jump process, then the complexity of the drift term is growing exponentially fast (as a function of the tenor length). In this work, we consider a Lévy-driven LIB…
We consider the optimal dividend problem under a habit formation constraint that prevents the dividend rate to fall below a certain proportion of its historical maximum, the so-called drawdown constraint. This is an extension of the optimal Duesenberry's ratcheting consumption problem, studied by Dybvig (1995) [Review …
Adaptive batching improves Gaussian process surrogates for noisy level set estimation.
problem Learning the level set of noisy simulator responses.
method Developed four novel adaptive batching schemes for Gaussian process metamodels.
result Adaptive batching brings significant computational speed-ups with minimal loss of modeling fidelity.
New control theory for self-path-dependent problems solves unique constraints.
problem Optimal control with self-path-dependent constraints in stochastic systems.
method Introduces new HJB equations for variational inequalities with historical maximum controls.
result Value functions are viscosity solutions to HJB equations under Lipschitz conditions.
Optimizes gradual reduction of excess carbon emissions to net-zero.
problem Achieving net-zero carbon emissions through gradual reduction of excess emissions.
method Stochastic control approach to identify optimal emission strategy under constraints.
result Identifies the emission strategy that maximizes future profit from excess emissions.
Method infers MJPs from noisy observations without prior training.
problem Inference of MJPs from noisy and sparse observations is challenging.
method Broad probability distribution, synthetic dataset, and neural network model.
result Zero-shot inference of MJPs across different state spaces.
Optimal dividend payout strategies with drawdown constraint identified.
problem Optimal dividend payout strategies under a drawdown constraint.
method Solving a two-dimensional optimal control problem using viscosity solutions and calculus of variations.
result A two-curve strategy is optimal for sufficiently large initial and maximum dividend rates, with a surprising limit result for large maximum dividend rates.
JFR-rg model explains Japan's stable debt despite high interest rates and low growth.
problem Understanding Japan's stable government debt despite high interest rates and low growth.
method Formalizes financial repression channels through JFR-rg model, incorporating financial repression bias and exchange-rate channel.
result Identifies Normalization Trap and Captive Financial System Parameter, showing debt dynamics under financial repression.
YAHPO Gym introduces a new benchmark for evaluating hyperparameter optimization methods.
problem Evaluating and comparing hyperparameter optimization methods on well-curated benchmark suites.
method Surrogate-based benchmark collection of 14 scenarios, each with multi-fidelity and multi-objective hyperparameter optimization problems.
result Surrogate-based benchmarks produce more faithful results than tabular benchmarks.
Study constructs a Japanese financial LLM benchmark.
problem Need for domain-specific benchmarks for LLMs.
method Constructed a benchmark with multiple Japanese and financial domain tasks.
result GPT-4 outperforms other models in the benchmark.
A new sparse benchmark metabench identifies key abilities from large benchmarks.
problem Redundancy and compression in existing benchmarks.
method Data from 5000+ LLMs to identify most informative items, distilling a sparse benchmark.
result Sparse benchmark metabench captures underlying abilities with high accuracy.
Machine learning research depends on objectively interpretable, comparable, and reproducible algorithm benchmarks. We advocate the use of curated, comprehensive suites of machine learning tasks to standardize the setup, execution, and reporting of benchmarks. We enable this through software tools that help to create an…
This article provides a comprehensive study of different ways to make speed benchmarks of gradient boosted decision trees algorithm. We show main problems of several straight forward ways to make benchmarks, explain, why a speed benchmarking is a challenging task and provide a set of reasonable requirements for a bench…
Study optimizes portfolio to minimize relative drawdown duration, penalizing unfavorable performance states.
problem Minimizing relative drawdown duration in portfolio optimization relative to a benchmark.
method Introduces a benchmark-relative drawdown-duration criterion penalizing unfavorable performance states. Uses a one-dimensional Markovian representation and Hamilton-Jacobi-Bellman equation.
result Derives explicit projection-based characterization of the optimal feedback control and identifies geometric settings for unique strong solutions.
Deployment-complete benchmarking assesses if evidence leads to consistent deployment actions.
problem Lack of clear evidence leading to consistent deployment actions.
method Introduces deployment-complete benchmarking to test if benchmark evidence determines deployment actions.
result Benchmark evidence must be complete for a claim to lead to a consistent deployment action.
We give an explicit formulaic algorithm and source code for building long-only benchmark portfolios and then using these benchmarks in long-only market outperformance strategies. The benchmarks (or the corresponding betas) do not involve any principal components, nor do they require iterations. Instead, we use a multif…
Tiny benchmarks reduce LLM evaluation costs by using fewer examples.
problem Expensive evaluation of LLMs with tens of thousands of examples.
method Developed evaluation tools and tiny versions of popular benchmarks.
result Accurately estimate LLM performance with just 100 curated examples.
The past few years have seen a surge of applying Deep Learning (DL) models for a wide array of tasks such as image classification, object detection, machine translation, etc. While DL models provide an opportunity to solve otherwise intractable tasks, their adoption relies on them being optimized to meet latency and re…
Benchmark for DL inference on embedded HWAs, focusing on autonomous driving.
problem Lack of comprehensive benchmarks for DL hardware.
method Developed a benchmark for inference on embedded HWAs, focusing on autonomous driving. Proposed new granularity, benchmark procedures, and performance indicators.
result Identifies mismatches between HWAs and DL models.
The optimization of algorithm (hyper-)parameters is crucial for achieving peak performance across a wide range of domains, ranging from deep neural networks to solvers for hard combinatorial problems. The resulting algorithm configuration (AC) problem has attracted much attention from the machine learning community. Ho…
Optimal benchmark design varies based on costs in financial manipulation.
problem Manipulation of price benchmarks in finance.
method Analyzes empirical pattern and cost structures to determine optimal benchmark design.
result The optimal benchmark depends on the relative sizes of fixed and variable costs.
Generates synthetic data for benchmarking unsupervised outlier detection.
problem Difficulty in benchmarking unsupervised outlier detection due to rare and varied outliers in real data.
method Proposes a generic process to generate synthetic data with insightful characteristics.
result Demonstrates practicality of the generic process through a benchmark with state-of-the-art detection methods.
Paper introduces benchmark-neutral pricing for long-term contracts.
problem High prices of long-term contracts under risk-neutral pricing.
method Uses growth optimal portfolio as numeraire and new pricing measure.
result Identifies minimal possible prices for contingent claims.
In this report, we present a new reinforcement learning (RL) benchmark based on the Sonic the Hedgehog (TM) video game franchise. This benchmark is intended to measure the performance of transfer learning and few-shot learning algorithms in the RL domain. We also present and evaluate some baseline algorithms on the new…
Fidel-TS creates a new benchmark for time series forecasting models.
problem Lack of high-quality benchmarks for time series forecasting models.
method Formalized high-fidelity benchmark principles, including data sourcing integrity, leak-free design, and structural clarity. Created Fidel-TS, a new large-scale benchmark.
result Demonstrated the limitations of prior benchmarks and potential discrepancies in model evaluation.
New framework assesses and benchmarks ML methods for multivariate time series.
problem Benchmarking and explaining performance of machine learning methods.
method Proposes a new framework with systematized performance-explainability characteristics.
result Illustrates application to multivariate time series classifiers.
Study proposes new methods to calculate probabilistic benchmarks in noisy data.
problem Identifying opportunities for improvement in comparable units with noisy data.
method 2-step methodology involving undersampling and relevance vector machine.
result Higher discrimination power achieved with macro-economic environment variables.
We solve the multi-criteria benchmarking problem by formalizing it as a social choice problem and identifying conditions for meaningful rankings.
problem Aggregating multiple metrics into a single ranking for models in benchmarking problems.
method Formalizing multi-criteria benchmarking as a social choice problem and identifying sufficient conditions for meaningful rankings.
result We prove that meaningful multi-criteria benchmarking becomes possible under certain preference conditions (single-peaked, group-separable, distance-restricted).
We study the pricing and hedging of derivatives in incomplete financial markets by considering the local risk-minimization method in the context of the benchmark approach, which will be called benchmarked local risk-minimization. We show that the proposed benchmarked local risk-minimization allows to handle under extre…
The paper shows that benchmark-neutral pricing minimizes option prices.
problem Pricing extreme-maturity European put options on diversified indices.
method Benchmark-neutral pricing applied to a drifted time-transformed squared Bessel process.
result Benchmark-neutral price is the minimal possible price, risk-neutral price is more expensive.
NAS-Bench-Suite simplifies NAS evaluation across diverse tasks.
problem Limited and inconsistent NAS benchmarks hinder research reproducibility.
method Developed a comprehensive, extensible NAS benchmark suite.
result Many NAS conclusions do not generalize across different benchmarks.
Wiki-CS dataset benchmarks Graph Neural Networks using Wikipedia articles.
problem Benchmarking Graph Neural Networks on a new domain with structural differences.
method Derived from Wikipedia, nodes represent Computer Science articles, edges from hyperlinks, 10 classes for different branches, evaluated semi-supervised node classification and link prediction.
result Graph Neural Networks perform well on Wiki-CS, showing structural differences from earlier benchmarks.
In this paper we establish rigorous benchmarks for image classifier robustness. Our first benchmark, ImageNet-C, standardizes and expands the corruption robustness topic, while showing which classifiers are preferable in safety-critical applications. Then we propose a new dataset called ImageNet-P which enables researc…
Benchmark study evaluates 8 clustering methods on 99 UCR time series datasets.
problem Assessing the performance of clustering methods on time series data.
method Examines 8 clustering methods across 3 categories and 3 distance measures on 99 UCR datasets.
result Provides a comprehensive dataset-level assessment of clustering methods.
BAT benchmark for autobidding tasks in RTB auctions.
problem Lack of comprehensive datasets and benchmarks for autobidding.
method Developed a benchmark for two auction formats, implemented robust baselines.
result Provides a framework for developing and refining autobidding algorithms.
We introduce Procgen Benchmark, a suite of 16 procedurally generated game-like environments designed to benchmark both sample efficiency and generalization in reinforcement learning. We believe that the community will benefit from increased access to high quality training environments, and we provide detailed experimen…