Pricing and hedging rainbow options using Bayesian MS-VAR process.
problem Pricing and hedging rainbow options under varying economic conditions.
method Bayesian Markov-Switching Vector Autoregressive (MS-VAR) process to model regime-switching economic variables.
result Model provides a simpler and more economic variable-dependent approach for rainbow options pricing and hedging.
RS-Rainbow learns to interpret Atari agent decisions.
problem Difficult to understand how Atari agents make decisions.
method End-to-end trainable network with attention module.
result Improves model interpretability and performance.
Quantum computer method for pricing rainbow options efficiently.
problem Pricing rainbow options with quantum computers.
method Iterative Quantum Amplitude Estimation and amplitude loading techniques.
result Validation of quantum pricing model on IBM QASM simulator.
Simple object representations improve model-free RL performance.
problem Current reinforcement learning agents lack object recognition.
method Used simple, feature-engineered object representations with the Rainbow model.
result Object representations significantly boost performance on Atari games.
New procedures connect braid charts, triplane diagrams, and braid movies for knotted surfaces.
problem Understanding the braid index and bridge index of knotted surfaces in 4D.
method Introducing rainbow diagrams and new procedures for passing among triplane diagrams, braid movies, and braid charts.
result Inequalities relating braid index and bridge index of 2-knots are obtained.
Characterizes test error in learning with deep, structured feature maps.
problem Characterizing test error in learning with deep, structured feature maps.
method Asymptotic analysis of feature covariance and population covariance.
result Closed-form formula for feature covariance in Gaussian rainbow neural networks.
New rings reveal surprising prime colorings.
problem Determining which primes can color rainbow rings.
method Linear algebra eigenvalues and knot theory colorability.
result Almost all primes admit 0, 1, or infinite colorings.
Paper extends Enami-Ozeki-Yamaguchi's work on planar quadrangulations.
problem Finding the maximum number of colors for proper anti-rainbow colorings on planar quadrangulations.
method Introducing half-monochromatic colorings for plane graphs with even polygonal faces and providing an upper bound in terms of the independence number.
result An upper bound on the maximum number of colors for half-monochromatic colorings is given in terms of the independence number.
This work bridges hyperbolic discounting in RL with exponential discounting.
problem Hyperbolic discounting in reinforcement learning models.
method Implemented a hyperbolic discounting RL agent and demonstrated its effectiveness.
result Hyperbolic discounting can be approximated using familiar RL techniques.
A new RL method improves performance on Atari games without complex techniques.
problem Improving reinforcement learning performance on Atari games.
method Adding scaled log-policy to immediate reward in DQN.
result The modified DQN outperforms Rainbow on Atari games.
SUNRISE improves off-policy RL algorithms by integrating ensemble methods.
problem Stability and exploration issues in off-policy RL algorithms.
method SUNRISE combines ensemble-based weighted Bellman backups and upper-confidence bounds for efficient exploration.
result SUNRISE improves the performance of off-policy RL algorithms across various domains.
DreamerV2 learns Atari game behaviors from a world model, achieving human-level performance.
problem Learning complex behaviors in Atari games from limited data.
method DreamerV2 uses a world model with discrete representations to predict behaviors in a compact latent space.
result Achieves human-level performance on 55 Atari tasks.
Deep RL model optimizes pedestrian evacuation in multi-exit scenarios.
problem Optimizing pedestrian evacuation in multi-exit indoor environments.
method MultiExit-DRL using Deep Reinforcement Learning with DQN and DNN.
result MultiExit-DRL reduces evacuation frames and optimizes exit utilization.
The paper evaluates various bonus-based exploration methods in the ALE and finds limited improvement in performance.
problem Improving exploration in reinforcement learning algorithms, especially in challenging games.
method Empirical evaluation of different reward bonuses on the Arcade Learning Environment.
result Recently developed bonus-based exploration methods do not significantly improve performance in challenging games.
New examples of Legendrian links with infinitely many fillings.
problem Understanding the structure of Legendrian links and their fillings.
method New combinatorial formula for Legendrian contact DGAs and Floer-theoretic techniques.
result Construction of the first families of Legendrian links with infinitely many Lagrangian fillings.
Adaptive synchronization improves deep reinforcement learning performance.
problem Fixed step size synchronization can cause loss of properly learned networks.
method Adaptive synchronization based on recent agent behavior.
result Adaptive synchronization leads to better performance in games.
Imaginative RL uses GANs to simulate real environments, making RL more efficient.
problem Lack of data efficiency and safety constraints in reinforcement learning.
method Generative Adversarial Imaginative Reinforcement Learning (GAIL) algorithm.
result The proposed algorithm more efficiently utilizes real-world experience.
A new method optimizes Fourier pricing for multi-asset options using adaptive quadrature.
problem Efficiently pricing multi-asset options in Lévy models.
method Optimized damping parameters and hierarchical adaptive quadrature.
result Significant speed-up in computational time for up to six dimensions.
Study evaluates Deep PDE solvers for high-dimensional option pricing, identifying key sources of error.
problem Empirical study on error analysis of Deep PDE solvers for high-dimensional option pricing.
method Comparative experiments with Deep BSDE method and other solvers, identifying three main sources of error.
result Deep BSDE method is superior and robust to option specifications, improving with larger batch sizes and fewer time steps.