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.
Exact relationships found between ATM slope, volatility swap, and zero vanna.
problem Understanding relationships between implied volatilities and swaps.
method Analyzes exact relationships between ATM slope, volatility swap, and zero vanna.
result Exact relationships between ATM slope, volatility swap, and zero vanna.
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.
Bayesian ATM improves stability and efficiency in mobile health interventions.
problem Balancing intervention efficacy with user burden in mobile health interventions.
method Bayesian extension to ATM using Kalman filter-style updates.
result Bayesian ATM achieves comparable or improved scalarized returns with lower variance and more stable policy behavior.
Derives formulae linking SABR model parameters to ATM and option prices.
problem Characterizing SABR model parameters from option prices.
method Analytic formulae linking α, ν, and ρ to ATM price and option prices at strikes. result Characterization of SABR parameters from swap rate probability density function derivatives.
Proposes ATM method to improve domain adaptation.
problem Mitigating distribution divergence between source and target domains.
method Adversarial Tight Match (ATM) method using Maximum Density Divergence (MDD).
result New state-of-the-art performance on domain adaptation benchmarks.
The CGMY model's ATM call-price asymptotics are derived using characteristic function.
problem Deriving short-time asymptotics for the CGMY model's ATM call prices.
method Using the characteristic function, derived short-time asymptotics for the CGMY model's ATM call prices. Extracted higher-order coefficients by dynamic cutoff partitioning.
result Higher-order coefficients are derived for the CGMY model's ATM call prices.
Paper proposes MA-BERT for efficient data-driven ATM models.
problem Long training time and need for large datasets in data-driven ATM models.
method Multi-Agent Bidirectional Encoder Representations from Transformers (MA-BERT) and transfer learning framework.
result MA-BERT saves training time and achieves high performance with little data.
Study short-maturity Asian option pricing in LSV models using large deviations theory.
problem Derive short-maturity asymptotics for Asian option prices in LSV models.
method Large deviations theory and novel expansion method.
result Explicit series expansions for the solution of the variational problem around the ATM point.
Study on short-term behavior of ATM-IV for jump-diffusion model.
problem Analyzing the short-time behavior of ATM-IV for a specific stochastic volatility model.
method Used Malliavin Calculus techniques to derive expressions for ATM-IV level and skew.
result Short-time behavior of ATM-IV level is consistent for all pure-jump Lévy processes.
This paper contains a feasibility study of deep neural networks for the classification of Euro banknotes with respect to requirements of central banks on the ATM and high speed sorting industry. Instead of concentrating on the accuracy for a large number of classes as in the famous ImageNet Challenge we focus thus on c…
The paper examines short-term volatilities in equity indexes using a ranking procedure.
problem Understanding short-term behaviors of implied volatility in equity markets.
method Using a ranking procedure to model equity index dynamics, the paper investigates the short-term volatilities of derivatives written on indexes.
result The models reconcile the long memory of volatilities and power law of ATM skews in equity markets.
Study examines short-term IVS dynamics using a model-independent approach.
problem Understanding the short-term behavior of implied volatility surface (IVS).
method Model-independent, distribution-based approach imposing cumulant conditions on asset log return distribution.
result Derives a quadratic expansion for implied volatility and asymptotic expressions for ATM skew and curvature.
Paper uses deep imitation learning to predict aircraft trajectories accurately.
problem Inefficient and costly Air Traffic Management system limits predictability.
method Generative Adversarial Imitation Learning framework with trajectory clustering and classification.
result Accurate predictions for entire trajectory stages, pre- and tactical.
Using Malliavin Calculus techniques, we derive closed-form expressions for the at-the-money behaviour of the forward implied volatility, its skew and its curvature, in general Markovian stochastic volatility models with continuous paths.
The short-time asymptotic behavior of option prices for a variety of models with jumps has received much attention in recent years. In the present work, a novel second-order approximation for ATM option prices under the CGMY Lévy model is derived, and then extended to a model with an additional independent Brownian com…
A new QHR model extends HR model with a quadratic variance function.
problem Modeling volatility with greater flexibility and stationarity.
method Introducing a quadratic variance function to the HR model, maintaining Markovian property.
result Stationary distribution of the QHR model is Pearson type IV.
In the present work, a novel second-order approximation for ATM option prices is derived for a large class of exponential Lévy models with or without Brownian component. The results hereafter shed new light on the connection between both the volatility of the continuous component and the jump parameters and the behavio…
The ADO-Heston model approximates market implied skew in vanilla options.
problem Reproduce market implied skew in vanilla options using a Markovian approximation.
method Derived characteristic function under risk-neutral and real measures, chose market price of risk, found closed form for log-price CF and implied skew.
result The ADO-Heston model can approximate the vanilla implied skew at small T but not exactly as rough volatility models. Unified model for financial derivatives pricing with stochastic interest rates.
problem Pricing and hedging financial derivatives with stochastic interest rates.
method Volterra Stein-Stein model with correlated Gaussian Volterra processes.
result Explicit formulas for bond and cap/floor pricing, and characteristic function for log-forward index.
Incorporating the side information of text corpus, i.e., authors, time stamps, and emotional tags, into the traditional text mining models has gained significant interests in the area of information retrieval, statistical natural language processing, and machine learning. One branch of these works is the so-called Auth…
DeepSVM learns SVMs without PDE solving, achieving high pricing accuracy.
problem Computational bottleneck in real-time calibration of stochastic volatility models.
method Physics-informed Deep Operator Network (PI-DeepONet) that enforces terminal payoffs and no-arbitrage conditions.
result DeepSVM achieves high pricing accuracy across various market dynamics.
Study leading-order asymptotics for VIX option prices in Bergomi models.
problem Understanding VIX option pricing in Bergomi models.
method Analytical approach to derive leading-order asymptotics for VIX option prices in Bergomi models.
result Closed-form solutions for VIX option prices in Bergomi models are derived.
Develops a diagnostic framework for interest rate model calibration, showing equivalence to Weighted Least Squares and revealing boundary-dominated leverage and local parameter instability.
problem Calibration of stochastic interest rate models
method Diagnostic framework using non-linear regression and analytical tractability of At-The-Money caps
result Reveals boundary-dominated leverage and local parameter instability
Study short-maturity VIX and European option prices with jumps.
problem Analyzing VIX and European options with jumps in short-maturity models.
method Local-stochastic volatility models with compound Poisson jumps, leading-order asymptotics in closed-form.
result Closed-form solutions for VIX and European option prices in short-maturity models.
In Figueroa-López et al. (2013), a second order approximation for at-the-money (ATM) option prices is derived for a large class of exponential Lévy models, with or without a Brownian component. The purpose of this article is twofold. First, we relax the regularity conditions imposed in Figueroa-López et al. (2013) on t…
Event sequence, asynchronously generated with random timestamp, is ubiquitous among applications. The precise and arbitrary timestamp can carry important clues about the underlying dynamics, and has lent the event data fundamentally different from the time-series whereby series is indexed with fixed and equal time inte…
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.
Multi-task/Multi-output learning seeks to exploit correlation among tasks to enhance performance over learning or solving each task independently. In this paper, we investigate this problem in the context of Gaussian Processes (GPs) and propose a new model which learns a mixture of latent processes by decomposing the c…
Study uses sentiment analysis to predict implied volatility surface, improving prediction accuracy.
problem Improving prediction accuracy of implied volatility surface.
method Constructed daily high-frequency sentiment data, used VAR method, deep learning (BERT, LSTM), FFT, EMD for sentiment decomposition.
result High-frequency sentiment correlates with ATM options' implied volatility, low-frequency with DOTM options.
We study the dynamics of the normal implied volatility in a local volatility model, using a small-time expansion in powers of maturity T. At leading order in this expansion, the asymptotics of the normal implied volatility is similar, up to a different definition of the moneyness, to that of the log-normal volatility. …
Paper derives new option pricing formulas and approximations for a local volatility model with discontinuity.
problem Modeling extreme ATM skew in a local volatility model with discontinuity.
method Uses joint distribution of Skew Brownian motion and its functionals to derive option pricing formulas and approximations.
result Derives an approximation of option prices by Black-Scholes prices, simplifying skew behavior.
AutoML explores vs. exploits promising classifiers to improve performance.
problem Maximizing ML pipeline performance within limited time and resource constraints.
method Empirical study comparing exploiting vs. exploring the search space for promising classifiers.
result Exploiting the most promising classifiers does not statistically improve pipeline performance.
New asymptotic formula for option prices with interest rates and dividend yield effects.
problem Deriving option prices with interest rates and dividend yield effects in the local volatility model.
method Developed a new asymptotic limit for short-maturity option prices, including interest rates and dividend yield effects.
result Generalized the Berestycki-Busca-Florent formula to all orders in n for interest rates and dividend yield effects. ContextFlow++ improves generative models by conditioning on mixed-variable contexts.
problem Lack of effective methods for context conditioning in flow-based generative models.
method Proposes ContextFlow++ with additive conditioning and mixed-variable architecture.
result ContextFlow++ achieves higher performance metrics and faster training.
Derives short-term option pricing asymptotics in local-stochastic volatility models.
problem Short-term option pricing in local-stochastic volatility models.
method Large deviations theory and variational methods.
result Explicit series expansions for implied volatility and asymptotic results for European and VIX options.
Vanna-Volga is a popular method for the interpolation/extrapolation of volatility smiles. The technique is widely used in the FX markets context, due to its ability to consistently construct the entire Lognormal smile using only three Lognormal market quotes. However, the derivation of the Vanna-Volga method itself is …
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.
problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.
From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular information and identifying the roles of microscopic elements in network data can help us …
DCNs mimic neuronal networks for improved neural classification.
problem Lack of topological similarity between DNNs and biological neural networks.
method Developed DCNs with topologies inspired by real-world neuronal networks.
result High classification accuracy achieved by DCNs.
Chemical networks outperform spiking neural networks in classification tasks.
problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.
Deep ReLU networks can be simplified to a three-layer model.
problem Understanding the behavior of deep neural networks.
method Constructive proof and algorithm to transform deep networks into shallow ones.
result Deep ReLU networks can be represented by a simpler three-layer structure.
Tackles network structure inference from time series data using GNN.
problem Inferring network structure from incomplete or no information.
method Gumbel Graph Network (GGN) model for network reconstruction and completion.
result GGN can reconstruct up to 100% network structure and infer missing parts with up to 90% accuracy.
This paper explores loss landscapes of sparse neural networks, finding unique characteristics compared to dense networks.
problem Understanding the loss landscape of sparse neural networks, especially one-hidden-layer networks.
method Analyzes sparse networks with dense and sparse final layers, focusing on linear and non-linear models.
result Sparse networks can have no spurious valleys under certain conditions, but spurious valleys and minima can exist for wide sparse networks.
New approach learns latent motifs in networks for mesoscale structure analysis.
problem Understanding large-scale behavior in complex systems through mesoscale structures.
method Network dictionary learning (NDL) combining network sampling and nonnegative matrix factorization.
result Networks can be approximated using a small set of latent motifs.
A challenging problem in complex networks is the network reconstruction problem from data. This work deals with a class of networks denoted as conserved networks, in which a flow associated with every edge and the flows are conserved at all non-source and non-sink nodes. We propose a novel polynomial time algorithm to …
Social network analysis is an important problem in data mining. A fundamental step for analyzing social networks is to encode network data into low-dimensional representations, i.e., network embeddings, so that the network topology structure and other attribute information can be effectively preserved. Network represen…