Automated Market Makers (AMMs) are a central component of decentralized exchanges, yet their equilibrium foundations and microeconomic mechanisms remain incompletely understood. This paper develops a dynamic equilibrium framework for Constant Function Market Makers (CFMMs) that formalizes the strategic interaction between arbitrageurs and liquidity providers (LPs) over time. We make three main contributions. First, we derive and empirically validate an intrinsic buy-sell asymmetry in CFMM price impact. Even in the absence of directional price movements, the geometric structure of constant product AMMs implies systematically different execution costs for buying and selling, a prediction that we confirm using on-chain transaction data. Second, we characterize the optimization problems of arbitrageurs and LPs in closed form, incorporating slippage and fees. In a baseline environment with only informed arbitrageurs, we show that providing liquidity is strictly dominated for LPs: arbitrage-driven price corrections generate negative jump returns that cannot be offset by fees, yielding a degenerate equilibrium with minimal liquidity provision. Third, motivated by empirical evidence, we extend the model to include agent heterogeneity, endogenous gas fees, and time varying volatility. In this extended environment, noise trading, arbitrage races, and execution costs jointly determine LP returns, giving rise to an interior equilibrium in which optimal liquidity provision is non-monotonic in volatility and exhibits a hump-shaped relationship. Overall, this paper builds a dynamic equilibrium model calibrated on extensive data that characterize the complex interaction between informed arbitrageurs, noise traders, and liquidity providers.

We propose Generative Adversarial Regression (GAR), a framework for learning conditional risk scenarios through generators aligned with downstream risk objectives. GAR builds on a regression characterization of conditional risk for elicitable functionals, including quantiles, expectiles, and jointly elicitable pairs. We extend this principle from point prediction to generative modeling by training generators whose policy-induced risk matches that of real data under the same context. To ensure robustness across all policies, GAR adopts a minimax formulation in which an adversarial policy identifies worst-case discrepancies in risk evaluation while the generator adapts to eliminate them. This structure preserves alignment with the risk functional across a broad class of policies rather than a fixed, pre-specified set. We illustrate GAR through a tail-risk instantiation based on jointly elicitable $(\mathrm{VaR}, \mathrm{ES})$ objectives. Experiments on S\&P 500 data show that GAR produces scenarios that better preserve downstream risk than unconditional, econometric, and direct predictive baselines while remaining stable under adversarially selected policies.

We study continuous-time portfolio choice with nonlinear payoffs under smooth ambiguity and Bayesian learning. We develop a general framework for dynamic, non-concave asset allocation that accommodates nonlinear payoffs, broad utility classes, and flexible ambiguity attitudes. Dynamic consistency is obtained by a robust representation that recasts the ambiguity-averse problem as ambiguity-neutral with distorted priors. This structure delivers explicit trading rules by combining nonlinear filtering with the martingale approach and nests standard concave and linear-payoff benchmarks. As a leading application, delegated management with convex incentives illustrates that ambiguity aversion shifts beliefs toward adverse states, limits the range of states that would otherwise trigger more aggressive risk taking, and reduces volatility through lower risky exposure.

This paper addresses stock price movement prediction by leveraging LLM-based news sentiment analysis. Earlier works have largely focused on proposing and assessing sentiment analysis models and stock movement prediction methods, however, separately. Although promising results have been achieved, a clear and in-depth understanding of the benefit of the news sentiment to this task, as well as a comprehensive assessment of different architecture types in this context, is still lacking. Herein, we conduct an evaluation study that compares 3 different LLMs, namely, DeBERTa, RoBERTa and FinBERT, for sentiment-driven stock prediction. Our results suggest that DeBERTa outperforms the other two models with an accuracy of 75% and that an ensemble model that combines the three models can increase the accuracy to about 80%. Also, we see that sentiment news features can benefit (slightly) some stock market prediction models, i.e., LSTM-, PatchTST- and tPatchGNN-based classifiers and PatchTST- and TimesNet-based regression tasks models.

We argue that negative skew and positive mean of the distribution of stock returns are largely due to the broken symmetry of stochastic volatility governing gains and losses. Starting with stochastic differential equations for stock returns and for stochastic volatility we argue that the distribution of stock returns can be effectively split in two -- for gains and losses -- assuming difference in parameters of their respective stochastic volatilities. A modified Jones-Faddy skew t-distribution utilized here allows to reflect this in a single organic distribution which tends to meaningfully capture this asymmetry. We illustrate its application on distribution of daily S&P500 returns, including analysis of its tails.

Algorithmic agents are used in a variety of competitive decision-making settings, including pricing contexts that range from online retail to residential home rental. We study the emergence of algorithmic collusion when competing agents employ multi-armed bandit algorithms and competition is modeled as a repeated Prisoner's Dilemma game. Notably, agents in our setting perform online learning with no prior model of game structure and have no direct knowledge of competitor states or actions, thus they cannot learn strategies that depend on these factors. These context-free bandits nonetheless frequently learn seemingly collusive behavior, a phenomenon we term naive collusion. Our results reveal that whether naive collusion emerges depends starkly on the choice of behavior policy employed by bandit learners. The mechanism underpinning the emergence of collusive outcomes is synchronicity in agent action plays, where synchronicity captures how often agents play the same action. We show that in the long-run, naive algorithmic collusion never emerges when both agents use a broad class of persistently random algorithms, including the epsilon-greedy algorithm without epsilon decay, sometimes emerges when both agents use greedy-in-the-limit algorithms which feature randomness during exploration but are asymptotically deterministic, and always emerges when both agents use deterministic bandit learning algorithms like those in the well-known upper confidence bound (UCB) family. We highlight market and algorithmic conditions under which one can and cannot predict a priori whether collusion will occur. Our findings have several policy implications: preventing pricing algorithms from conditioning their actions on competitor prices may not preclude algorithmic collusion, symmetry in algorithms may increase collusion potential, and the emergence of algorithmic collusion is path dependent.

We study an optimal stopping problem with an unbounded, time-dependent and discontinuous reward function. This problem is motivated by the pricing of a variable annuity contract with guaranteed minimum maturity benefit, under the assumption that the policyholder's surrender behaviour maximizes the risk-neutral value of the contract. We consider a general fee and surrender charge function, and give a condition under which optimal stopping always occurs at maturity. Using an alternative representation for the value function of the optimization problem, we study its analytical properties and the resulting surrender (or exercise) region. In particular, we show that the non-emptiness and the shape of the surrender region are fully characterized by the fee and the surrender charge functions, which provides a powerful tool to understand their interrelation and how it affects early surrenders and the optimal surrender boundary. Under certain conditions on these two functions, we develop three representations for the value function; two are analogous to their American option counterpart, and one is new to the actuarial and American option pricing literature.

We develop a numerical method for the martingale analogue of the Benamou--Brenier optimal transport problem, which seeks a martingale interpolating two prescribed marginals which is closest to the Brownian motion. Recent contributions have established existence of the optimal martingale under finite second moment assumptions on the marginals, but numerical methods exist only in the one-dimensional setting. We introduce an iterative scheme, a martingale analogue of the celebrated Sinkhorn algorithm, and prove that it yields a Bass potential in arbitrary dimension under minimal assumptions. In particular, we show that this holds when the marginals have finite moments of order $p > 1$, thereby extending the known theory beyond the finite-second-moment regime. The proof relies on a strict descent property for the dual value of the martingale Benamou--Brenier problem. While the descent property admits a direct verification in the case of compactly supported marginals, obtaining uniform control on the iterates without assuming compact support is substantially more delicate and constitutes the main technical challenge.

Funds at large portfolio management firms may consist of many portfolio managers (PMs), each managing a portion of the fund and optimizing a distinct objective. Although the PMs determine their trades independently, the trade lists may be netted and executed by the firm. These net trades may be sufficiently large to impact the market prices, so the PMs may realize prices on their trades that are different from the observed midpoint price of the assets before execution. These transaction costs generally reduce the returns of a portfolio over time. We propose a simple protocol, based on methods from distributed convex optimization, by which a firm can communicate estimated transaction costs to its PMs, and the PMs can potentially revise their trades to realize reduced transaction costs. This protocol does not require the PMs to disclose their method of determining trades to the firm or to each other, nor does it require the PMs to communicate their trade lists with each other. As the number of adjustment rounds grows, the trades converge to the ones that are optimal for the firm. As a practical matter we observe that even just a few rounds of adjustment lead to substantial savings for the firm and the PMs.

The role of collateral in derivative pricing has evolved beyond credit risk mitigation, particularly following the global financial crisis, when funding costs and basis spreads became central to valuation practices. This development coincided with the transition from the London Interbank Offered Rate (LIBOR) to risk-free rates (RFRs) and the increasing standardization of collateralised trading. We study the valuation and hedging of a class of differential swaps referencing backward-looking averages of overnight rates, with SOFR swaps appearing as a particular instance. The focus is on the impact of the collateral currency. Extending earlier results Ding et al. [Math. Finance 36 (2026), pp.~180--202], we allow the collateral account to be denominated in a currency different from that of the contractual cash flows and derive explicit pricing and hedging strategies using a futures-based replication approach. We show that the choice of collateral currency can have a non-trivial effect on both valuation and risk management. In particular, foreign-currency collateral can introduce additional risk exposures even when contractual cash flows are entirely denominated in the domestic currency. Numerical study demonstrates that collateral effects can lead to significant valuation adjustments and therefore need to be properly incorporated in modern multi-currency modelling frameworks.

We study an OTC FX market-making problem, built on the Avellaneda-Stoikov tradition, in which a dealer streams size-dependent quotes on a discrete ladder and manages inventory risk over a finite horizon under Poisson arrivals of trade requests. Adverse selection is modelled through latency-driven price moves over a delay window, represented by Gaussian marks whose conditional means can depend on the quoted spread, capturing selective client reaction to stale quotes. The dealer can address latency risk through trade rejection when slippage breaches a tolerance threshold. We treat slippage tolerance as an explicit control jointly optimized with quotes: upon receiving a trade request, the dealer chooses an acceptance/rejection rule, which makes the trade economically akin to an embedded option written on the latency price move. We further introduce rejection feedback through an EMA-based rejection score used as a reputation proxy, so that client intensity is endogenously modulated by past rejections via a multiplicative factor. Using dynamic programming, we derive a Markov control problem with state variables (inventory, rejection-score) and show how rejection decision enters the HJB equation through Hamiltonians that include an expectation over the latency mark and a maximization over both quote and rejection rule parameters. For practical control evaluation, we develop an adiabatic-quadratic approximation: fixing reputation on the inventory-control time scale, expanding Hamiltonians to the second order, and adopting quadratic ansatz in inventory, yielding tractable Riccati-type ODE and closed-form expressions for approximate quotes and slippage thresholds. This approximation provides a fast surrogate for policy design and enables self-consistent calibration of rejection behaviour.

For a covariance matrix coming from a factor model of returns, we investigate the relationship between the long-only global minimum variance portfolio and the asset exposures to the factors. In the case of a 1-factor model, we provide a rigorous and explicit description of the long-only solution in terms of the parameters of the covariance matrix. For $q>1$ factors, we provide a description of the long-only portfolio in geometric terms. The results are illustrated with empirical daily returns of US stocks.

Volatility Skew and Smile of Interest Rate products (Swaption and Caplet) are represented by SABR (Stochastic Alpha Beta Rho model). So, the Interest Rate derivatives model for pricing the callable exotic swaps should be comparable to the SABR volatility surface. In the interest rate derivatives models, Libor Market Model (LMM) (in a post-Libor world, Forward Market Model (FMM)) is one of the most popular models used in the market. So, there are many attempts to develop LMMs that are comparable to the SABR surface. It is called SABR/LMM. There are many references for SABR/LMM, but most of them only treat SABR/LMM, which is not flexible enough to be used practically in global banks. The purpose of this paper is to provide a comprehensive definition of SABR/LMM and a complete description of how it is to be implemented.

Large language models (LLMs) have enabled agent-based systems that aim to automate scientific research workflows. Most existing approaches focus on fully autonomous discovery, where AI systems generate research ideas, conduct analyses, and produce manuscripts with minimal human involvement. However, empirical research in economics and the social sciences poses additional constraints: research questions must be grounded in available datasets, identification strategies require careful design, and human judgment remains essential for evaluating economic significance. We introduce HLER (Human-in-the-Loop Economic Research), a multi-agent architecture that supports empirical research automation while preserving critical human oversight. The system orchestrates specialized agents for data auditing, data profiling, hypothesis generation, econometric analysis, manuscript drafting, and automated review. A key design principle is dataset-aware hypothesis generation, where candidate research questions are constrained by dataset structure, variable availability, and distributional diagnostics, reducing infeasible or hallucinated hypotheses. HLER further implements a two-loop architecture: a question quality loop that screens and selects feasible hypotheses, and a research revision loop where automated review triggers re-analysis and manuscript revision. Human decision gates are embedded at key stages, allowing researchers to guide the automated pipeline. Experiments on three empirical datasets show that dataset-aware hypothesis generation produces feasible research questions in 87% of cases (versus 41% under unconstrained generation), while complete empirical manuscripts can be produced at an average API cost of $0.8-$1.5 per run. These results suggest that Human-AI collaborative pipelines may provide a practical path toward scalable empirical research.

This article extends the analysis of Atkinson, Foley, and Ganz in "Beyond the Spoiler Effect: Can Ranked-Choice Voting Solve the Problem of Political Polarization?". Their work uses a one-dimensional spatial model based on survey data from the Cooperative Election Survey (CES) to examine how instant-runoff voting (IRV) and Condorcet methods promote candidate moderation. Their model assumes an idealized electoral environment in which all voters possess complete information regarding candidates' ideological positions, all voters provide complete preference rankings, etc. Under these assumptions, their results indicate that Condorcet methods tend to yield winners who are substantially more moderate than those produced by IRV. We construct new models based on CES data which take into account more realistic voter behavior, such as the presence of partial ballots. Our general finding is that under more realistic models the differences between Condorcet methods and IRV largely disappear, implying that in real-world settings the moderating effect of Condorcet methods may not be nearly as strong as what is suggested by more theoretical models.

In this work, we propose to apply a new model fusion and learning paradigm, known as Combinatorial Fusion Analysis (CFA), to the field of Bitcoin price prediction. Price prediction of financial product has always been a big topic in finance, as the successful prediction of the price can yield significant profit. Every machine learning model has its own strength and weakness, which hinders progress toward robustness. CFA has been used to enhance models by leveraging rank-score characteristic (RSC) function and cognitive diversity in the combination of a moderate set of diverse and relatively well-performed models. Our method utilizes both score and rank combinations as well as other weighted combination techniques. Key metrics such as RMSE and MAPE are used to evaluate our methodology performance. Our proposal presents a notable MAPE performance of 0.19\%. The proposed method greatly improves upon individual model performance, as well as outperforms other Bitcoin price prediction models.

In this paper we consider how we can include index options in enhanced indexation. We present the concept of an \enquote{option strategy} which enables us to treat options as an artificial asset. An option strategy for a known set of options is a specified set of rules which detail how these options are to be traded (i.e.~bought, rolled over, sold) depending upon market conditions. We consider option strategies in the context of enhanced indexation, but we discuss how they have much wider applicability in terms of portfolio optimisation. We use an enhanced indexation approach based on second-order stochastic dominance. We consider index options for the S\&P~500, using a dataset of daily stock prices over the period 2017-2025 that has been manually adjusted to account for survivorship bias. This dataset is made publicly available for use by future researchers. Our computational results indicate that introducing option strategies in an enhanced indexation setting offers clear benefits in terms of improved out-of-sample performance. This applies whether we use equities or an exchange-traded fund as part of the enhanced indexation portfolio.

Models for spin systems, known from statistical physics, are applied analogously in econometrics in the form of agent-based models. The models discussed in the econophysics literature all use the state variable $T$, which, in physics, represents the temperature of a system. However, there is little evidence on how temperature can be measured in econophysics, so that the models can be applied. Only in idealized capital market applications has the relationship between temperature and volatility been demonstrated, allowing temperature to be determined through volatility measurements. The question remains how this can be achieved in agent systems beyond capital market applications. This paper focuses precisely on this question. It examines an agent system with two decision options in a news environment, establishes the measurement equation, and outlines the basic concept of temperature measurement. The procedure is illustrated using an example. In an application with competing subsystems, an interesting strategy for influencing the average opinion in the competing subsystem is presented.

We introduce a canonical way of performing the joint lift of a Brownian motion $W$ and a low-regularity adapted stochastic rough path $\mathbf{X}$, extending [Diehl, Oberhauser and Riedel (2015). A Lévy area between Brownian motion and rough paths with applications to robust nonlinear filtering and rough partial differential equations]. Applying this construction to the case where $\mathbf{X}$ is the canonical lift of a one-dimensional fractional Brownian motion (possibly correlated with $W$) completes the partial rough path of [Fukasawa and Takano (2024). A partial rough path space for rough volatility]. We use this to model rough volatility with the versatile toolkit of rough differential equations (RDEs), namely by taking the price and volatility processes to be the solution to a single RDE. We argue that our framework is already interesting when $W$ and $X$ are independent, as correlation between the price and volatility can be introduced in the dynamics. The lead-lag scheme of [Flint, Hambly, and Lyons (2016). Discretely sampled signals and the rough Hoff process] is extended to our fractional setting as an approximation theory for the rough path in the correlated case. Continuity of the solution map transforms this into a numerical scheme for RDEs. We numerically test this framework and use it to calibrate a simple new rough volatility model to market data.

CDS options allow investors to express a view on spread volatility and obtain a wider range of payoffs than are possible with vanilla CDS. We give a detailed exposition of different types of single-name CDS option, including options with upfront protection payment, recovery options and recovery swaps, and also presents a new formula for the index option. The emphasis is on using the Black-76 formula where possible and ensuring consistency within asset classes. In the framework shown here the `armageddon event' does not require special attention.

We develop a stochastic macro-financial model in continuous time by integrating two specifications of the Keen economic framework with a financial market driven by a jump-diffusion process. The economic block of the model combines monetary debt-deflation mechanisms with Ponzi-type financial destabilization and is influenced by the financial market through a stochastic interest rate that depends on asset price returns. The financial market block of the model consists of an asset with jump--diffusion price process with endogenous, state-dependent jump intensities driven by speculative credit flows. The model formalizes a feedback loop linking credit expansion, crash risk, perceived return dynamics, and bank lending spreads. Under suitable parameter restrictions, we establish global existence and non-explosion of the coupled system. Numerical experiments illustrate how variations in credit sensitivity and jump parameters generate regimes ranging from stable growth to recurrent boom--bust cycles. The framework provides a tractable setting for analyzing endogenous financial fragility within a mathematically well-posed macro--financial system.

Credit risk scoring must support high-stakes lending decisions where data distributions change over time, probability estimates must be reliable, and group-level fairness is required. While modern machine learning models improve default prediction accuracy, they often produce poorly calibrated scores under distribution shift and may create unfair outcomes when trained without explicit constraints. This paper proposes Calibrated Credit Intelligence (CCI), a deployment-oriented framework that combines (i) a Bayesian neural risk scorer to capture epistemic uncertainty and reduce overconfident errors, (ii) a fairnessconstrained gradient boosting model to control group disparities while preserving strong tabular performance, and (iii) a shiftaware fusion strategy followed by post-hoc probability calibration to stabilize decision thresholds in later time periods. We evaluate CCI on the Home Credit Credit Risk Model Stability benchmark using a time-consistent split to reflect real-world drift. Compared with strong baselines (LightGBM, XGBoost, CatBoost, TabNet, and a standalone Bayesian neural model), CCI achieves the best overall trade-off between discrimination, calibration, stability, and fairness. In particular, CCI reaches an AUC-ROC of 0.912 and an AUC-PR of 0.438, improves operational performance with Recall@1%FPR = 0.509, and reduces calibration error (Brier score 0.087, ECE 0.015). Under temporal shift, CCI shows a smaller AUC-PR drop from early to late periods (0.017), and it lowers group disparities (demographic parity gap 0.046, equal opportunity gap 0.037) compared to unconstrained boosting. These results indicate that CCI produces risk scores that are accurate, reliable, and more equitable under realistic deployment conditions.

The deployment of autonomous AI agents in derivatives markets has widened a practical gap between static model calibration and realized hedging outcomes. We introduce two reinforcement learning frameworks, a novel Replication Learning of Option Pricing (RLOP) approach and an adaptive extension of Q-learner in Black-Scholes (QLBS), that prioritize shortfall probability and align learning objectives with downside sensitive hedging. Using listed SPY and XOP options, we evaluate models using realized path delta hedging outcome distributions, shortfall probability, and tail risk measures such as Expected Shortfall. Empirically, RLOP reduces shortfall frequency in most slices and shows the clearest tail-risk improvements in stress, while implied volatility fit often favors parametric models yet poorly predicts after-cost hedging performance. This friction-aware RL framework supports a practical approach to autonomous derivatives risk management as AI-augmented trading systems scale.

Parametric portfolio policies may experience estimation risk. I develop a generalized Bayesian framework that updates priors, delivering a posterior distribution over characteristic tilts and out-of-sample returns that is the unique belief-updating rule consistent with the investor's utility function, requiring no model for the return generating process. The Gibbs posterior is the closest distribution to the prior in Kullback-Leibler divergence subject to utility maximization. The posterior's scaling parameter $λ$ controls the weight placed on data relative to the prior. I develop a KNEEDLE algorithm to select optimal $λ^*$ in-sample by trading off posterior precision against numerical fragility, eliminating the need for out-of-sample validation. I apply this to U.S. equities (1955-2024), and confirm characteristic-based gains concentrate pre-2000. I find that $λ^*$ varies meaningfully with risk aversion and depends on higher-order moments.

Concentrated liquidity provision in decentralized exchanges presents a fundamental Impulse Control problem. Liquidity Providers (LPs) face a non-trivial trade-off between maximizing fee accrual through tight price-range concentration and minimizing the friction costs of rebalancing, including gas fees and swap slippage. Existing methods typically employ heuristic or threshold strategies that fail to account for market dynamics. This paper formulates liquidity management as an optimal control problem and derives the corresponding Hamilton-Jacobi-Bellman quasi-variational inequality (HJB-QVI). We present an approximate solution RAmmStein, a Deep Reinforcement Learning method that incorporates the mean-reversion speed (theta) of an Ornstein-Uhlenbeck process among other features as input to the model. We demonstrate that the agent learns to separate the state space into regions of action and inaction. We further extend the framework with RAmmStein-Width, which jointly optimizes rebalancing timing and position width via a 6-action DDQN. We evaluate the framework using high-frequency 1Hz Coinbase trade data comprising over 6.8M trades on a realistic environment (10M TVL, 1% default width). Experimental results show that RAmmStein achieves a net ROI of 1.60%, the highest among all realistic (non-omniscient) strategies, while greedy strategies lose up to -8.4% to gas costs. Notably, the agent reduces rebalancing frequency by 85% compared to greedy rebalancing. RAmmStein-Width discovers extreme parsimony on its own, executing only 9 rebalances and $40 in gas, and degrades more slowly than all active strategies at elevated gas costs. Our results demonstrate that regime-aware laziness can significantly improve capital efficiency by preserving the returns that would otherwise be eroded by the operational costs.

We extend the restrictiveness measure of Fudenberg, Gao & Liang (2026) to functional and structural econometric settings using Gaussian process priors. We find that models evaluated over continuum domains appear more restrictive than when evaluated over finite sets of observations. We also extend the restrictiveness framework to structural models with endogeneity, instrumental variables, multiple equilibria, and nonparametric nuisance components. We explain why the choice of discrepancy function is a substantive modeling decision, and why the Rademacher complexity and GMM criterion functions are unsuitable as discrepancies. We further show that restrictiveness equals the normalized limit of the noise-free average-case learning curve. In applications to preferences under risk, and multinomial choice under exogenous and endogenous settings, we find that the same models exhibit uniformly higher restrictiveness when evaluated over continuum domains than based on their predictions on finite sets, and that moment restrictions from endogeneity substantially increase restrictiveness and alter model rankings.

We develop a non-standard analysis framework for coherent risk measures and their finite-sample analogues, coherent risk estimators, building on recent work of Aichele, Cialenco, Jelito, and Pitera. Coherent risk measures on $L^\infty$ are realised as standard parts of internal support functionals on Loeb probability spaces, and coherent risk estimators arise as finite-grid restrictions. Our main results are: (i) a hyperfinite robust representation theorem that yields, as finite shadows, the robust representation results for coherent risk estimators; (ii) a discrete Kusuoka representation for law-invariant coherent risk estimators as suprema of mixtures of discrete expected shortfalls on $\{k/n:k=1,\ldots,n\}$; (iii) uniform almost sure consistency (with an explicit rate) for canonical spectral plug-in estimators over Lipschitz spectral classes; (iv) a Kusuoka-type plug-in consistency theorem under tightness and uniform estimation assumptions; (v) bootstrap validity for spectral plug-in estimators via an NSA reformulation of the functional delta method (under standard smoothness assumptions on $F_X$); and (vi) asymptotic normality obtained through a hyperfinite central limit theorem. The hyperfinite viewpoint provides a transparent probability-to-statistics dictionary: applying a risk measure to a law corresponds to evaluating an internal functional on a hyperfinite empirical measure and taking the standard part. We include a standardd self-contained introduction to the required non-standard tools.

In this paper, we present a data-driven ensemble approach for option price prediction whose derivation is based on the no-arbitrage theory of option pricing. Using the theoretical treatment, we derive a common representation space for achieving domain adaptation. The success of an implementation of this idea is shown using some real data. Then we report several experimental results for critically examining the performance of the derived pricing models.

We introduce an ensemble learning method based on Gaussian Process Regression (GPR) for predicting conditional expected stock returns given stock-level and macro-economic information. Our ensemble learning approach significantly reduces the computational complexity inherent in GPR inference and lends itself to general online learning tasks. We conduct an empirical analysis on a large cross-section of US stocks from 1962 to 2016. We find that our method dominates existing machine learning models statistically and economically in terms of out-of-sample $R$-squared and Sharpe ratio of prediction-sorted portfolios. Exploiting the Bayesian nature of GPR, we introduce the mean-variance optimal portfolio with respect to the prediction uncertainty distribution of the expected stock returns. It appeals to an uncertainty averse investor and significantly dominates the equal- and value-weighted prediction-sorted portfolios, which outperform the S&P 500.