Without probability theory, we define classes of supermartingales, martingales, and semimartingales in idealized financial markets with continuous price paths. This allows us to establish probability-free versions of a number of standard results in martingale theory, including the Dubins-Schwarz theorem, the Girsanov t…
This paper gives yet another definition of game-theoretic probability in the context of continuous-time idealized financial markets. Without making any probabilistic assumptions (but assuming positive and continuous price paths), we obtain a simple expression for the equity premium and derive a version of the capital a…
We provide a Fundamental Theorem of Asset Pricing and a Superhedging Theorem for a model independent discrete time financial market with proportional transaction costs. We consider a probability-free version of the Robust No Arbitrage condition introduced in Schachermayer ['04] and show that this is equivalent to the e…
New models avoid probability in option pricing, matching historical and implied volatilities.
problem Developing option pricing models without probability.
method Statistical analysis of historical volatility and pathwise lift of stock dynamics.
result Option pricing models can be based on pathwise properties of stock dynamics.
We develop the fundamental theorem of asset pricing in a probability-free infinite-dimensional setup. We replace the usual assumption of a prior probability by a certain continuity property in the state variable. Probabilities enter then endogenously as full support martingale measures (instead of equivalent martingale…
This paper gives several simple constructions of the pathwise Ito integral ∫0tφdω for an integrand φ and a price path ω as integrator, with φ and ω satisfying various topological and analytical conditions. The definitions are purely pathwise in that neither φ nor ω are assumed to be paths of stochast…
We provide a mathematical definition of fragility and antifragility as negative or positive sensitivity to a semi-measure of dispersion and volatility (a variant of negative or positive "vega") and examine the link to nonlinear effects. We integrate model error (and biases) into the fragile or antifragile context. Unli…
A new method to break down insurance costs into risk and uncertainty.
problem Understanding and quantifying insurance costs in uncertain environments.
method An axiomatic approach to decompose premium principles into risk and deviation measures.
result Maximal risk and minimal deviation measures can be uniquely identified in decompositions.
Almost twenty years ago, E.R. Fernholz introduced portfolio generating functions which can be used to construct a variety of portfolios, solely in the terms of the individual companies' market weights. I. Karatzas and J. Ruf recently developed another methodology for the functional construction of portfolios, which lea…
Consider an American option that pays G(X^*_t) when exercised at time t, where G is a positive increasing function, X^*_t := \sup_{s\le t}X_s, and X_s is the price of the underlying security at time s. Assuming zero interest rates, we show that the seller of this option can hedge his position by trading in the underlyi…
We develop robust pricing and hedging of a weighted variance swap when market prices for a finite number of co--maturing put options are given. We assume the given prices do not admit arbitrage and deduce no-arbitrage bounds on the weighted variance swap along with super- and sub- replicating strategies which enforce t…
Novel groups exhibit contradictory behaviors with respect to Burnside laws.
problem Understanding probabilistic behaviors of groups under Burnside laws.
method Geometric analysis of relations, information-theoretic coding, combinatorial and probabilistic methods.
result Groups can satisfy Burnside laws with probability 1 for some generating sets and 0 for others.
Develops a new framework for financial price processes without stochastic calculus.
problem Modeling non-stationary and irregularly varying volatility processes in finance.
method Introduces a pathwise approach to solving spatially irregular ODEs, using geometric Brownian motion.
result Establishes the uniqueness of solutions for strictly increasing, spatially irregular ODEs.
Study develops time-continuous models and probabilistic descriptions for agent-based economic market models.
problem Formulating and describing agent-based economic market models in a time-continuous and probabilistic manner.
method Derived time-continuous formulations, discussed impact of time-scaling, proved stability, presented probabilistic descriptions using kinetic theory.
result Time-continuous formulations and probabilistic descriptions for agent-based economic market models.
Hybrid model combines interpretable and black-box models for better transparency and performance.
problem Balancing interpretability and predictive performance in machine learning models.
method Proposes a Hybrid Predictive Model (HPM) integrating an interpretable model with a black-box model, using principled objective functions and customized training algorithms.
result Hybrid models achieve an efficient trade-off between transparency and predictive performance.
Boosts generative models by combining multiple meta-models.
problem Challenges in creating a single generative model that accurately represents complex data.
method Cascades multiple meta-models (like RBM and VAE) to create a stronger generative model.
result Derives a decomposable variational lower bound for training and evaluating the boosted model.
The paper introduces BCART models for aggregate claim amount, improving frequency-severity and joint modeling.
problem Modeling aggregate claim amount with frequency-severity and joint dependencies.
method Developed three types of BCART models: frequency-severity, sequential, and joint models. Used various distributions for claim severity data.
result Weibull distribution outperforms gamma and lognormal for right-skewed, heavy-tailed claim severity data.
The paper uses model-based trees to create interpretable surrogate models for complex machine learning models.
problem Interpreting complex machine learning models.
method Using model-based trees to partition feature space and create interpretable models.
result Model-based trees generate optimal surrogate models that balance interpretability and performance.
Gauge Flow Models use a learnable Gauge Field in Generative Flow Models.
problem Improving generative model performance.
method Integrates a learnable Gauge Field into Flow ODEs.
result Gauge Flow Models outperform traditional Flow Models in Flow Matching experiments.
The study examines how model predictions hold up under model extensions.
problem Model predictions may not be robust under model extensions, limiting their applicability.
method The study uses causal ordering to assess robustness of qualitative model predictions and characterizes model extensions that preserve predictions.
result Conditions and techniques are provided to assess robustness of model predictions under model extensions.
MALC combines interpretable linear models with black-box models for better predictions and transparency.
problem Combining interpretability with black-box models for better predictions.
method Formulates MALC as a convex optimization problem and uses accelerated proximal gradient method for training.
result MALC provides an efficient frontier balancing prediction accuracy and transparency.
Revises Bayesian model averaging for foundation models.
problem Ensemble pre-trained and lightly-finetuned foundation models for improved classification performance.
method Introduces trainable linear classifiers and computationally cheaper model averaging scheme (OMA).
result Ensembled models can better predict on various datasets.
Paper introduces symmetric divergence link models for probability distributions.
problem Symmetric divergence measures for probability distributions.
method Two general classes of link models: one for survival functions and another for cumulative probability distribution functions.
result Advantages of symmetric divergence measures over asymmetric measures for model averaging and feature assessment.
New method to handle credit portfolio model uncertainties.
problem Model risk in credit portfolio models.
method Demonstrates comprehensive yet easy-to-implement approach to uncertainty in model parameters.
result Comprehensive method to deal with model uncertainties.
The paper tests stock return models and uses LSTM to predict stock returns.
problem Validating stock return models and predicting stock returns.
method Used Fama-French three-factor, four-factor, and five-factor models; also used LSTM model.
result Fama-French five-factor model shows better validity for stock returns.
Researchers review challenges in interpreting additive models, especially neural additive models.
problem Challenges in interpreting additive models, particularly neural additive models.
method Review of generalized additive models and discussion of nonidentifiability.
result Challenges in claiming interpretability or suitability for safety-critical applications of additive models.
Proposes a decision-theoretic approach for enhancing model interpretability in Bayesian frameworks.
problem Challenges the traditional approach of restricting model structure for interpretability in Bayesian frameworks.
method Introduces an interpretability utility function and a two-step method involving a reference model and a proxy model.
result Demonstrates that the proposed method generates more accurate models with the same level of interpretability.
Novel hybrid modeling combines ML and physics for real-time diagnosis.
problem Real-time diagnosis of complex systems.
method Combines machine learning and physics-based models to create reduced-order models.
result Generated models are two orders of magnitude simpler, improving efficiency.
CRS model improves ranking data modeling with theoretical guarantees.
problem Lack of rich, multimodal models for ranking data.
method Contextual Repeated Selection (CRS) model for multimodal ranking data.
result CRS model significantly outperforms existing methods in various ranking contexts.
Sigma models linked to Gross-Neveu models via quiver varieties.
problem Understanding the relationship between sigma models and Gross-Neveu models.
method Exploring the mathematical correspondence between sigma models and Gross-Neveu models, including their geometric and trigonometric/elliptic deformations.
result Sigma models are mathematically equivalent to Gross-Neveu models under certain conditions.
Simple models are preferred over complex models, but over-simplistic models could lead to erroneous interpretations. The classical approach is to start with a simple model, whose shortcomings are assessed in residual-based model diagnostics. Eventually, one increases the complexity of this initial overly simple model a…
Matryoshka hides secret models in a carrier model, achieving high capacity and robustness.
problem Stealing functionality of private ML data by hiding models in a carrier model.
method Parameter sharing approach exploiting the learning capacity of the carrier model.
result Hides a 26x larger secret model or 8 secret models in the carrier model.
Eigen-stratified models reduce model size and improve performance.
problem Large model size in Laplacian-regularized stratified models.
method Formulate eigen-stratified models with linear combinations of bottom eigenvectors of the graph Laplacian.
result Significant reduction in model size with eigen-stratified models.
Semi-parametric models improve robot dynamics modeling accuracy.
problem Improving inverse dynamics model accuracy in robotics.
method Comparison of semi-parametric Gaussian process regression and a novel model-based neural network.
result Semi-parametric Gaussian process regression yields the most accurate models.
A novel kernel approach for model selection in simulator-based models.
problem Model selection for simulator-based statistical models with limited prior knowledge.
method Iteratively updates model weights and parameters using Bayes' rule and kernel recursive ABC algorithm.
result Demonstrates effectiveness on dynamical systems in ecology and epidemiology.
This work develops scalable model selection methods with fast update and selection.
problem Efficient model selection for large pools of candidate models.
method Isolated model embedding, which supports asymptotically fast update and selection.
result Standardized Embedder achieves competitive model selection performances.
Seq2Seq models speed up epidemic model predictions.
problem Complex epidemic models are computationally expensive.
method Used deep seq2seq models as surrogates for complex models.
result Surrogates predict scenarios up to several thousand times faster.
Paper proposes BMPO to optimize policies using bidirectional models.
problem Model-based reinforcement learning's reliance on forward model accuracy.
method Develops BMPO using both forward and backward models for policy optimization.
result BMPO outperforms state-of-the-art methods in sample efficiency and asymptotic performance.
Copulas outperform marginal models in multivariate risk forecasting, reducing model risk by narrowing down the set of models.
problem Model risk in multivariate risk forecasting, especially during crises.
method Comprehensive empirical study comparing Copula-GARCH models with fixed marginals, copulas, or neither.
result Model risk is almost entirely due to copula choice, not marginal models.
This paper distills a complex travel mode choice model into simpler, interpretable models.
problem Lack of interpretability in complex machine learning models for travel behavior.
method Model distillation combined with market segmentation.
result Generated interpretable models that closely match the predictions of the original complex model.
BayesBlend blends multiple models' predictions for better insurance loss predictions.
problem Improving insurance loss predictions by combining multiple models.
method Pseudo-Bayesian model averaging, stacking, and hierarchical stacking.
result BayesBlend provides a user-friendly way to blend model predictions and estimate weights.
The paper identifies when larger models improve predictions and proposes a switcher model.
problem Understanding when larger models benefit from added complexity.
method Numerical studies on T5 architecture to analyze predictive uncertainty and model performance.
result Large models improve on examples where small models are uncertain, but not on certain examples.
Aggregates models from different datasets using shared latent structures.
problem Aggregating models from heterogeneous datasets with shared latent structures.
method Bayesian nonparametrics for identifying correspondences among local model parameterizations.
result Framework successfully aggregates various model types across different applications.
Improved diffusion model generation speed with speculative sampling.
problem Generating samples from computationally expensive diffusion models.
method Extending speculative sampling to diffusion models, using fast draft models for candidate token generation.
result Significant speedup in generation, halving the number of function evaluations.
DBNs improve accuracy of biological ODE models with missing data.
problem Uncertainty in biological ODE models with missing data.
method Converted ODE models to DBNs and used Particle Filtering for parameter estimation.
result DBNs can accurately infer model variables with missing data.
PMM uses Bayesian inference to generate data from noisy approximations.
problem Creating flexible generative models for various data types.
method Bayesian inference and conjugate pairs of distributions.
result PMM achieves performance competitive with existing generative models.
The study quantifies model risk in option pricing models, finding recalibration does not reduce risk.
problem Model risk in calibration and recalibration of option pricing models.
method Use relative entropy to quantify model risk, comparing Black-Scholes and Heston models.
result Recalibrating models more frequently shifts risk, not reducing it; more complex models are counterproductive for robustness.
The paper extends statistical inference methods for black-box generative models.
problem Understanding and validating black-box generative models without access to their internal data.
method Develops model-level statistical inference tasks using generative model representations.
result Model-level representations are effective for multiple inference tasks.