New framework values ESOs with multiple exercises and job termination risk.
problem Valuing ESOs with complex exercise patterns and job termination risk.
method Fourier transform, finite differences, and maturity randomization methods.
result Analytic formulae for ESO costs under various conditions.
Employee stock options (ESOs) are American-style call options that can be terminated early due to employment shock. This paper studies an ESO valuation framework that accounts for job termination risk and jumps in the company stock price. Under general Lévy stock price dynamics, we show that a higher job termination ri…
We consider the problem of ESO valuation in continuous time. In particular, we consider models that assume that an appropriate random time serves as a proxy for anything that causes the ESO's holder to exercise the option early, namely, reflects the ESO holder's job termination risk as well as early exercise behaviour.…
Predicts promising hyperparameters early to speed up machine learning.
problem Finding optimal hyperparameters is computationally expensive.
method Predict model performance without completing training, using early data.
result Improves performance of random search approach.
Study optimal portfolio choice with risk control for log-returns.
problem Optimal portfolio choice with risk management in continuous-time markets.
method Characterized optimal terminal wealth using concave envelope, derived analytical expressions for optimal wealth and policy, found efficient frontier.
result Efficient frontier is concave curve connecting minimum-risk to growth-optimal portfolios, not a vertical line.
Investors optimize their portfolios within a Wasserstein ball to match a benchmark's risk profile.
problem Optimizing portfolio performance while maintaining risk proximity to a benchmark.
method Optimal dynamic strategy selection based on minimizing distortion risk measures within a Wasserstein ball.
result An optimal dynamic strategy exists and can be calculated through isotonic projections.
JPLink uses machine learning to match jobs with RIASEC labels.
problem Matching jobs with RIASEC labels requires significant manual effort.
method JPLink uses text content and O*NET knowledge to assign RIASEC labels to jobs.
result JPLink outperforms conventional baselines in matching jobs with RIASEC labels.
Optimizes pension fund strategies considering age-dependent risk preferences.
problem Maximizing utility of future consumption and wealth in DC pension plans.
method Solves optimal consumption and investment policies using Black-Scholes framework and HARA utility functions.
result Only extended model with time-varying preference parameters provides adequate fit for real-life data.
Optimal transport strategy reduces gender bias in job recommendation systems.
problem Mitigating gender biases in AI-driven job recommendation systems.
method Model agnostic optimal transport strategy applied to multi-class neural networks.
result Reduced undesirable algorithmic biases in job recommendation tasks.
Study schedules jobs with unknown holding costs to minimize expected cumulative cost.
problem Minimizing expected cumulative holding costs of jobs with unknown parameters.
method Learning-based cμ rule scheduling with a preemption phase. result Achieves near-optimal performance guarantees with nearly matching regret bounds.
Study on scheduling jobs with unknown types, achieving sublinear excess cost.
problem Optimizing job scheduling with unknown job types and varying durations.
method Design of algorithms for non-preemptive and preemptive scenarios, proving lower bounds.
result Preemptive algorithms can significantly outperform non-preemptive ones when job types have distinct durations.
This paper extends risk parity to continuous-time, solving risk budgeting problems.
problem Achieving robust risk across different assets in continuous-time.
method Characterizing risk contributions and solving risk budgeting problems using continuous-time terminal variance.
result Risk contributions and risk budgets can be represented as predictable processes in continuous-time.
Dynamic reinsurance aims to minimize surplus risk using martingale transport.
problem Minimizing surplus risk in dynamic reinsurance.
method Martingale optimal transport techniques.
result A tractable solution analogous to the Bass martingale is found.
Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.
problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.
Job recommendation has traditionally been treated as a filter-based match or as a recommendation based on the features of jobs and candidates as discrete entities. In this paper, we introduce a methodology where we leverage the progression of job selection by candidates using machine learning. Additionally, our recomme…
Optimizes dynamic investment portfolios with correlated jumps.
problem Maximizing expected terminal wealth in a multivariate Merton model with dependent jumps.
method Approximating CVaR with comonotonic bounds and maximizing expected terminal wealth.
result Improved optimization of dynamic investment portfolios.
New job recommendation system improves job seekers' welfare through field experiments.
problem Current job recommendation systems focus on clicks and applications, not job seekers' welfare.
method Developed a job-search model with two dimensions: utility and success probability. Conducted field experiments to validate model predictions.
result Welfare-optimal job recommendation algorithms outperform existing approaches and perform close to the benchmark.
The paper optimizes tax implementation delays for insurance companies with Lévy risk processes.
problem Maximizing tax payments and minimizing costs for insurance companies.
method Optimization of tax implementation levels for spectrally negative Lévy insurance risk processes.
result Optimal implementation levels for tax payments and capital injections are derived.
Griffin automatically discovers job slowdown causes in cloud platforms without labeled data.
problem Detecting and resolving job slowdowns in cloud-based platforms is labor-intensive and error-prone.
method Griffin uses regression to predict job runtime and interpretable model features to rank potential causes.
result Griffin discovers slowdown causes consistent with expert validation in a fraction of the time.
Paper solves bond option pricing with credit risk using Black-Scholes equations.
problem Pricing options on bonds with credit risk.
method Solution representations of Black-Scholes equations for specific problems.
result Pricing formulae for puttable and callable bonds with credit risk.
AI enhances financial services but humans are irreplaceable for empathy, presence, and ethics.
problem AI's limitations in financial services, especially with small datasets and human judgment.
method EPOCH framework highlighting five irreplaceable human capabilities: Empathy, Presence, Opinion, Creativity, and Hope.
result Humans are essential for trust, innovation, and consumer experience in financial services.
Employing profits data of Japanese companies in 2002 and 2003, we confirm that Pareto's law and the Pareto index are derived from the law of detailed balance and Gibrat's law. The last two laws are observed beyond the region where Pareto's law holds. By classifying companies into job categories, we find that companies …
A framework for eliciting utility functions from investor preferences.
problem Hard elicitation of specific utility functions in portfolio selection.
method Preference-fitting method using probability-wealth pairs and PHARA approximation.
result Fitted utility function converges to the optimal one as more data is used.
The paper compares different risk measures for optimal portfolio strategies.
problem Finding optimal portfolio strategies with various risk measures.
method Applying the Black-Scholes model and Martingale method to solve the static optimization problem.
result Comparison of different risk measures' performances on terminal wealths and optimal strategies.
Separating the short jobs from the long is a known technique to improve scheduling performance. In this paper we describe a method we developed for accurately predicting the runtimes classes of the jobs to enable this separation. Our method uses the fact that the runtimes can be represented as a mixture of overlapping …
Algorithm solves job acceptance problem with random arrivals and values.
problem Decision-making under random job arrivals and values with limited acceptance.
method Proposes Non-Parametric Sequential Allocation (NPSA) algorithm.
result Expected reward converges to optimality as sample size increases.
Paper develops multilingual job classification for ISCO and KZiS.
problem Classifying job advertisements for accurate occupation coding.
method Transformer architecture for hierarchical multi-class classification.
result Hierarchical structure improves prediction accuracy by 1-2 percentage points.
Study shows equivalence of four risk constraints in non-concave optimization problems.
problem Investigating risk constraints in non-concave optimization for financial companies.
method Analytical solutions for four risk constraints (ES, EDS, VaR, AVaR) under non-concave optimization.
result All four risk constraints lead to the same optimal solution, differing from concave optimization.
With the rapid growth of the data volume and the fast increasing of the computational model complexity in the scenario of cloud computing, it becomes an important topic that how to handle users' requests by scheduling computational jobs and assigning the resources in data center. In order to have a better perception of…
Is an option to early terminate a swap at its market value worth zero? At first sight it is, but in presence of counterparty risk it depends on the criteria used to determine such market value. In case of a single uncollateralised swap transaction under ISDA between two defaultable counterparties, the additional unilat…
Optimal reinsurance strategy found to minimize financial risk.
problem Minimizing financial risk in insurance companies through optimal reinsurance.
method Solving the problem via neural networks and a Cramér-Lundberg model.
result Optimal reinsurance strategy found to control terminal wealth and ruin probability.
Unified theory for optimal execution through signal-adaptive quotes in limit order books.
problem Optimal execution in limit order books with signal-dependent factors.
method Develops a unified solution theory for four execution criteria, incorporating signal-dependent drift, price impact, inventory risk, and execution risk.
result Explicit formulas reveal optimal quoting strategies and show signal-dependent drift can significantly affect execution.
In this paper, we study optimal liquidation problems in a randomly-terminated horizon. We consider the liquidation of a large single-asset portfolio with the aim of minimizing a combination of volatility risk and transaction costs arising from permanent and temporary market impact. Three different scenarios are analyze…
In this paper we find tight sufficient conditions for the continuity of the value of the utility maximization problem from terminal wealth with respect to the convergence in distribution of the underlying processes. We also establish a weak convergence result for the terminal wealths of the optimal portfolios. Finally,…
Training machine learning (ML) models on large datasets requires considerable computing power. To speed up training, it is typical to distribute training across several machines, often with specialized hardware like GPUs or TPUs. Managing a distributed training job is complex and requires dealing with resource contenti…
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.
Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems, however, use simple generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each workload is infeasible. In this paper, we show that modern ma…
We discuss the distribution of commuting distances and its relation to income. Using data from Denmark, the UK, and the US, we show that the commuting distance is (i) broadly distributed with a slow decaying tail that can be fitted by a power law with exponent γ≈3 and (ii) an average growing slowly as a power …
In this paper, we propose an offline counterfactual policy estimation framework called Genie to optimize Sponsored Search Marketplace. Genie employs an open box simulation engine with click calibration model to compute the KPI impact of any modification to the system. From the experimental results on Bing traffic, we s…
In this paper the fractional trading ansatz of money management is reconsidered with special attention to chance and risk parts in the goal function of the related optimization problem. By changing the goal function with due regards to other risk measures like current drawdowns, the optimal fraction solutions reflect t…
System automates discovery and classification of training videos for career progression.
problem Difficulties in planning and navigating career paths due to changing job requirements and emerging sectors.
method Extracted educational videos, built a machine learning classifier, and optimized probability thresholds.
result Significant improvements in model performance by incorporating video attributes.
Study on price formation in financial markets with a single default event.
problem Equilibrium price formation in financial markets with a single default risk.
method Characterized optimal strategies using quadratic-growth BSDEs, derived market-clearing condition, and established mean-field BSDE solvability.
result Characterized equilibrium risk premium and its dependence on default risk factors.
Full-batch GD achieves generalization close to any stationary point with fewer assumptions.
problem Generalization and excess risk bounds for smooth losses, including non-Lipschitz and nonconvex cases.
method Path-dependent analysis of GD's generalization error, focusing on optimization error and stability.
result Generalization error is tightly bound in terms of optimization error and iteration count, bypassing common assumptions.
Assuming that agents' preferences satisfy first-order stochastic dominance, we show how the Expected Utility paradigm can rationalize all optimal investment choices: the optimal investment strategy in any behavioral law-invariant (state-independent) setting corresponds to the optimum for an expected utility maximizer w…
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.
Consider an investor trading dynamically to maximize expected utility from terminal wealth. Our aim is to study the dependence between her risk aversion and the distribution of the optimal terminal payoff. Economic intuition suggests that high risk aversion leads to a rather concentrated distribution, whereas lower ris…
DL2 uses deep learning to optimize resource allocation in DL clusters.
problem Efficient resource scheduling for deep learning clusters is challenging.
method DL2 combines supervised learning and reinforcement learning to dynamically allocate resources.
result DL2 reduces average training completion time by 44.1% compared to fairness scheduler.
Inspired by the unsupervised learning or self-organization in the machine learning context, here we attempt to draw `learning curve' for the collective behavior of job-seeking `zero-intelligence' labors in successive job-hunting processes. Our labor market is supposed to be opened especially for university graduates in…