Overlays were introduced by R. H. Fox [6] as a subclass of covering maps. We offer a different view of overlays: it resembles the definition of paracompact spaces via star refinements of open covers. One introduces covering structures for covering maps and p:X→Y is an overlay if it has a covering structure that ha…
Paper proposes tensor-based method for semiconductor manufacturing process control.
problem Challenges of traditional process control methods in high-dimensional image-based overlay errors.
method Builds a high-dimensional process model, proposes tensor-on-vector regression algorithms, designs EWMA controller for tensor data.
result The method reduces overlay errors using limited control recipes and is superior especially when disturbances are not stable.
Portfolio optimisation typically aims to provide an optimal allocation that minimises risk, at a given return target, by diversifying over different investments. However, the potential scope of such risk diversification can be limited if investments are concentrated in only one country, or more specifically one currenc…
A modular cash-overlay rule for allocating between a fixed growth-defensive risky sleeve and interest-bearing cash.
problem Drawdown control
method Continuous cash-overlay filters
result Earnings an 18.83% CAGR versus 16.62% for 100% R
Overlay framework simplifies exotic derivative pricing.
problem Inconsistent pricing models for exotics.
method Combines path reweighting and conic optimisation.
result Practically model-independent price bands for exotics.
Optimal tontine strategy maximizes withdrawals while minimizing shortfall.
problem Maximizing withdrawals from a tontine account with withdrawal constraints.
method Dynamic programming and Fourier methods to solve PIDE, tested with historical data.
result Tontine overlay strategy outperforms constant withdrawal strategies.
Study tests if deep hedging differs from delta hedging in a GARCH market model.
problem Whether deep hedging includes speculative components in a GARCH market.
method Tested in a GARCH-based market model, comparing deep hedging and delta hedging.
result The difference between deep hedging and delta hedging is speculative if risk measure does not prioritize adverse outcomes.
A RL framework for hedging equity index options with realistic costs.
problem Dynamic hedging of equity index option exposures under transaction costs.
method Reinforcement Learning (RL) with a leak-free environment, cost-aware reward function, and stochastic actor-critic agent.
result The RL policy improves risk-adjusted performance compared to no-hedge, momentum, and volatility-targeting baselines.
PASCO speeds up graph clustering for large graphs.
problem Efficiently clustering large graphs with many communities.
method Overlay method combining coarsening and parallel clustering.
result PASCO accelerates clustering with improved efficiency and quality.
Rapid overlay of chemical structures (ROCS) is a standard tool for the calculation of 3D shape and chemical ("color") similarity. ROCS uses unweighted sums to combine many aspects of similarity, yielding parameter-free models for virtual screening. In this report, we decompose the ROCS color force field into "color com…
We give an algorithmic computation for the height of Kauffman's clock lattice obtained from a knot diagram with two adjacent regions starred and without crossing information specified. We show that this lattice is more familiarly the graph of perfect matchings of a bipartite graph obtained from the knot diagram by over…
In the forthcoming ISDA Standard Credit Support Annex (SCSA), the trades denominated in non-G5 currencies as well as those include multiple currencies are expected to be allocated to the USD silo, where the contracts are collateralized by USD cash, or a different currency with an appropriate interest rate overlay to ac…
Data augmentation is a widely used technique in many machine learning tasks, such as image classification, to virtually enlarge the training dataset size and avoid overfitting. Traditional data augmentation techniques for image classification tasks create new samples from the original training data by, for example, fli…
In the market place, diversification reduces risk and provides protection against extreme events by ensuring that one is not overly exposed to individual occurrences. We argue that diversification is best measured by characteristics of the combined portfolio of assets and introduce a measure based on the information en…
We extend and improve the work of Model Agnostic Anchors for explanations on image classification through the use of generative adversarial networks (GANs). Using GANs, we generate samples from a more realistic perturbation distribution, by optimizing under a lower dimensional latent space. This increases the trust in …
Steenrod homotopy theory is a framework for doing algebraic topology on general spaces in terms of algebraic topology of polyhedra; from another viewpoint, it studies the topology of the lim^1 functor (for inverse sequences of groups). This paper is primarily concerned with the case of compacta, in which Steenrod homot…
FinRL-X unifies trading components for AI and rule-based strategies.
problem Inconsistent between research and live deployment in trading platforms.
method Modular architecture integrating data processing, strategy construction, backtesting, and execution.
result Unified protocol supports AI and rule-based trading components without altering execution.
Instrument classification is one of the fields in Music Information Retrieval (MIR) that has attracted a lot of research interest. However, the majority of that is dealing with monophonic music, while efforts on polyphonic material mainly focus on predominant instrument recognition. In this paper, we propose an approac…
All the financial practitioners are working in incomplete markets full of unhedgeable risk-factors. Making the situation worse, they are only equipped with the imperfect information on the relevant processes. In addition to the market risk, fund and insurance managers have to be prepared for sudden and possibly contagi…
Capsule networks improve performance on image classification tasks with fewer parameters.
problem Improving performance of capsule networks with fewer parameters.
method Inverted dot-product attention routing, Layer Normalization, concurrent iterative routing.
result Improves performance on benchmark datasets CIFAR-10 and CIFAR-100, and performs at-par with ResNet-18.
This paper improves compression of large NLP models using doped Kronecker Products.
problem Accuracy loss when compressing large NLP tasks with Kronecker Products.
method Doping Kronecker Products with an overlay matrix to recover accuracy, and a new regularization scheme called co matrix dropout regularization (CMR).
result Compression of a large language model with LSTM layers of size 25 MB by 25x with 1.4% loss in perplexity score.
FST.ai 2.0 improves Taekwondo decision-making with AI, reducing review time and increasing trust.
problem Fair, transparent, and explainable decision-making in Taekwondo.
method Pose-based action recognition, epistemic uncertainty modeling, interactive dashboards.
result 85% reduction in decision review time, 93% referee trust in AI-assisted decisions.
In this paper, we present a two-stage stochastic international portfolio optimisation model to find an optimal allocation for the combination of both assets and currency hedging positions. Our optimisation model allows a "currency overlay", or a deviation of currency exposure from asset exposure, to provide flexibility…
New method computes knot Floer homology for satellite knots.
problem Computing knot Floer homology for satellite knots.
method Using immersed Heegaard diagrams and bordered Floer homology.
result Computation of knot Floer homology for satellite knots streamlined.
The correlation length-scale next to the noise variance are the most used hyperparameters for the Gaussian processes. Typically, stationary covariance functions are used, which are only dependent on the distances between input points and thus invariant to the translations in the input space. The optimization of the hyp…
Optimizes retirement income with MBGs and neural networks for longevity risk.
problem Maximizing lifetime withdrawals while managing longevity risk.
method Neural-network optimization under stochastic mortality.
result International diversification and longevity pooling improve retirement outcomes.
Develops a new neural spike train decoding framework using topological data.
problem Decoding neural spike trains from head direction and grid cells.
method Combines simplicial complex discovery with deep learning to capture higher-order connectivity.
result Demonstrates effectiveness on head direction and trajectory prediction datasets.
Enhances cryptocurrency pair trading with DRL, outperforming classical methods.
problem Rigidity and divergence risks in traditional pair trading strategies in crypto markets.
method Hierarchical pair selection, Fixed Risk, Adaptive Mean execution model, PPO with LSTM.
result DRL outperformed heuristic baseline by a statistically significant margin.
Paper tackles P vs NP problem in portfolio optimization with cardinality constraints and Black-Scholes derivatives.
problem Operationalizing the P vs NP problem in cardinality-constrained portfolio selection.
method Mixed-integer quadratic program with genetic algorithms, Monte Carlo sampling, and greedy screening.
result Cardinality constraint reshapes efficient frontier, highlighting trade-offs between stability and computational cost.
The purpose of this study is to measure the Total Factor Productivity (TFP) growth and determine the share of each of the economic growth sources in the mining sector of Iran. The time period of this study is 1355-1385 of the Solar Hijri calendar (roughly overlaying with the time period of 1976-2006 of the Gregorian ca…
This paper develops a CVaR framework for managing tail risks using puts and trend-following strategies.
problem Managing tail risks, especially crashes and drawdowns, requires different forms of protection.
method Develops a continuous-time CVaR framework that integrates long out-of-the-money put options and systematic trend-following overlays.
result Shows how convex crash protection and drawdown protection can be optimally combined in a mandate.
Proposes a method to derive knowledge graphs from EHR data.
problem Challenges in deriving generalizable knowledge from EHR data.
method Infer conditional dependency structure via a latent graphical block model (LGBM).
result Perfect recovery of block structure demonstrated.
This work bounds classification error in machine learning for low Bayes error conditions.
problem Understanding the error mismatch between Bayes error and model-based classification error.
method Applying classification error bounds to study the relationship with Kullback-Leibler divergence and proposing a linear approximation for low Bayes error conditions.
result A linear approximation of the classification error bound for low Bayes error conditions is proposed.
Paper assesses error estimates of Random Forests classification.
problem Quantitative assessment of Random Forests error estimates.
method Theoretical and empirical investigation of various error estimation methods.
result Random Forests' error estimates are closer to true error rate than average prediction error.
This paper tackles worst-class error rate in classification tasks.
problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.
Study identifies and analyzes three types of errors in learning Fourier operators.
problem Statistical, discretization, and truncation errors in learning Fourier operators.
method Analysis of a Discrete Fourier Transform (DFT) based least squares estimator.
result Established upper and lower bounds on statistical, discretization, and truncation errors.
This paper examines error bounds for deep learning classifiers with noisy labels.
problem Understanding the performance of classifiers trained on noisy data.
method Derives error bounds for excess risk, decomposing it into statistical and approximation errors. Uses independent block construction for statistical dependencies and vector-valued setting for approximation error.
result Established theoretical results for error bounds in deep learning with noisy labels, mitigating the impact of high-dimensional input spaces.
The paper analyzes CycleGAN's error components for unpaired data generation.
problem Analyzing approximation and estimation errors in CycleGAN for unpaired data.
method Decomposes risk into approximation and estimation errors, analyzing each separately and considering their trade-offs.
result Theoretical insights into CycleGAN's performance through error analysis.
Curiosity-Critic improves world model training by focusing on cumulative prediction error.
problem Training world models with intrinsic rewards that consider cumulative prediction error.
method Curiosity-Critic uses a surrogate reward based on the difference between current and asymptotic prediction errors, estimated online by a co-trained critic.
result Curiosity-Critic outperforms other methods in training speed and final world model accuracy.
End-to-end ASR error detection using audio-transcript entailment.
problem Detecting transcription errors in ASR systems to prevent error propagation.
method Proposes a novel end-to-end approach using audio-transcript entailment, with acoustic and linguistic encoders.
result Achieves CER of 26.2% on all transcription errors and 23% on medical errors specifically, improving by 12% and 15.4% respectively over a strong baseline.
The study analyzes and mitigates errors in PC-based causal discovery methods.
problem Errors in PC-based causal discovery methods can lead to incorrect graphs.
method The study introduces coherency scores to detect assumption violations and small sample errors in PC-based methods.
result The coherency scores can detect errors that other methods cannot, bridging between global and local error detection.
The paper bounds the mean absolute error in DNN vector-to-vector regression.
problem Bounding the mean absolute error in deep neural network based vector-to-vector regression.
method Error decomposition techniques in statistical learning theory and non-convex optimization theory were used to derive upper bounds for approximation, estimation, and optimization errors.
result Theoretical upper bounds for mean absolute error in DNN vector-to-vector regression were derived and validated experimentally.
This paper analyzes error in SKI for Gaussian Processes, providing conditions for linear time inference.
problem Lack of rigorous theoretical error analysis for SKI.
method Proved error bounds for SKI Gram matrix, examined error effects, provided practical guidelines.
result Identified two dimensionality regimes for SKI's scalability-accuracy trade-offs.
New truthful calibration errors improve model ranking in multiclass prediction.
problem Non-truthful calibration errors can mislead model comparisons.
method Introduced perfectly truthful calibration errors for multiclass predictions.
result Truthful calibration errors preserve decision-theoretic dominance and stabilize model rankings.
Study loop corrections in random feature models affecting training and test errors.
problem Analyzing loop corrections in random feature models to understand training and test errors.
method Statistical physics and effective field theory approach to study loop corrections.
result Derived loop corrections to training error, test error, and generalization gap.
New bounds on machine learning model generalization error moments.
problem Understanding the performance of machine learning models.
method Information-theoretic bounds on the moments of the generalization error of learning algorithms.
result Proposed bounds on generalization error moments and their high-probability bounds.
We show how to compute the Bayes error-rate for speaker verifiers.
problem How many errors does a speaker verifier make in a hundred trials?
method We compute the Bayes error-rate using calibrated likelihood ratios and user-supplied prior probabilities.
result The Bayes error-rate is upper bounded by the minimum of EER, P, and 1-P.
This work presents a technique for statistically modeling errors introduced by reduced-order models. The method employs Gaussian-process regression to construct a mapping from a small number of computationally inexpensive `error indicators' to a distribution over the true error. The variance of this distribution can be…